/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/safe008_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:49:05,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:49:05,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:49:05,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:49:05,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:49:05,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:49:05,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:49:05,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:49:05,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:49:05,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:49:05,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:49:05,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:49:05,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:49:05,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:49:05,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:49:05,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:49:05,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:49:05,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:49:05,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:49:05,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:49:05,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:49:05,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:49:05,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:49:05,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:49:05,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:49:05,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:49:05,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:49:05,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:49:05,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:49:05,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:49:05,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:49:05,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:49:05,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:49:05,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:49:05,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:49:05,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:49:05,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:49:05,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:49:05,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:49:05,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:49:05,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:49:05,701 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:49:05,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:49:05,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:49:05,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:49:05,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:49:05,728 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:49:05,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:49:05,728 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:49:05,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:49:05,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:49:05,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:49:05,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:49:05,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:49:05,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:49:05,729 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:49:05,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:49:05,729 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:49:05,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:49:05,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:49:05,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:49:05,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:49:05,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:49:05,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:49:05,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:49:05,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:49:05,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:49:05,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:49:05,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:49:05,731 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:49:05,731 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:49:05,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:49:05,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:49:05,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:49:05,979 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:49:05,980 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:49:05,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.opt.i [2022-12-13 00:49:06,974 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:49:07,237 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:49:07,238 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.opt.i [2022-12-13 00:49:07,258 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f51c180/b59031a41b774b0d90de923272355fd8/FLAGaddf3d55c [2022-12-13 00:49:07,274 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81f51c180/b59031a41b774b0d90de923272355fd8 [2022-12-13 00:49:07,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:49:07,277 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:49:07,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:49:07,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:49:07,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:49:07,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:49:07" (1/1) ... [2022-12-13 00:49:07,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b622aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07, skipping insertion in model container [2022-12-13 00:49:07,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:49:07" (1/1) ... [2022-12-13 00:49:07,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:49:07,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:49:07,476 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/safe008_power.opt.i[951,964] [2022-12-13 00:49:07,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:49:07,677 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:49:07,685 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/safe008_power.opt.i[951,964] [2022-12-13 00:49:07,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:07,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:07,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:49:07,743 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:49:07,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07 WrapperNode [2022-12-13 00:49:07,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:49:07,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:49:07,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:49:07,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:49:07,750 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:49:07" (1/1) ... [2022-12-13 00:49:07,769 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:49:07" (1/1) ... [2022-12-13 00:49:07,790 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-12-13 00:49:07,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:49:07,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:49:07,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:49:07,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:49:07,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07" (1/1) ... [2022-12-13 00:49:07,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07" (1/1) ... [2022-12-13 00:49:07,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07" (1/1) ... [2022-12-13 00:49:07,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07" (1/1) ... [2022-12-13 00:49:07,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07" (1/1) ... [2022-12-13 00:49:07,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07" (1/1) ... [2022-12-13 00:49:07,841 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07" (1/1) ... [2022-12-13 00:49:07,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07" (1/1) ... [2022-12-13 00:49:07,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:49:07,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:49:07,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:49:07,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:49:07,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07" (1/1) ... [2022-12-13 00:49:07,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:49:07,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:49:07,885 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:49:07,899 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:49:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:49:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:49:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:49:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:49:07,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:49:07,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:49:07,931 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:49:07,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:49:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:49:07,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:49:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:49:07,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:49:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:49:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:49:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:49:07,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:49:07,934 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:49:08,070 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:49:08,071 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:49:08,423 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:49:08,731 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:49:08,731 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:49:08,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:49:08 BoogieIcfgContainer [2022-12-13 00:49:08,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:49:08,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:49:08,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:49:08,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:49:08,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:49:07" (1/3) ... [2022-12-13 00:49:08,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219870eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:49:08, skipping insertion in model container [2022-12-13 00:49:08,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:07" (2/3) ... [2022-12-13 00:49:08,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219870eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:49:08, skipping insertion in model container [2022-12-13 00:49:08,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:49:08" (3/3) ... [2022-12-13 00:49:08,741 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.opt.i [2022-12-13 00:49:08,754 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:49:08,755 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:49:08,755 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:49:08,813 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:49:08,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 00:49:08,900 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 00:49:08,901 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:08,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:49:08,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 00:49:08,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-13 00:49:08,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:08,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 00:49:08,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-13 00:49:08,981 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 00:49:08,981 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:08,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:49:08,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 00:49:08,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-13 00:49:18,369 INFO L241 LiptonReduction]: Total number of compositions: 106 [2022-12-13 00:49:18,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:49:18,385 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;@635ee445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:49:18,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:49:18,389 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 00:49:18,389 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:18,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:18,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 00:49:18,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:18,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:18,393 INFO L85 PathProgramCache]: Analyzing trace with hash 26631147, now seen corresponding path program 1 times [2022-12-13 00:49:18,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:18,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429253280] [2022-12-13 00:49:18,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:18,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:18,768 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:49:18,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:18,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429253280] [2022-12-13 00:49:18,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429253280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:18,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:18,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:49:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429350637] [2022-12-13 00:49:18,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:18,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:49:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:18,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:49:18,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:49:18,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-13 00:49:18,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:49:18,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:18,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-13 00:49:18,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:20,622 INFO L130 PetriNetUnfolder]: 9665/14502 cut-off events. [2022-12-13 00:49:20,622 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-13 00:49:20,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28363 conditions, 14502 events. 9665/14502 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 101444 event pairs, 2765 based on Foata normal form. 0/8714 useless extension candidates. Maximal degree in co-relation 28352. Up to 9645 conditions per place. [2022-12-13 00:49:20,656 INFO L137 encePairwiseOnDemand]: 61/65 looper letters, 35 selfloop transitions, 2 changer transitions 61/108 dead transitions. [2022-12-13 00:49:20,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 425 flow [2022-12-13 00:49:20,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:49:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:49:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2022-12-13 00:49:20,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6820512820512821 [2022-12-13 00:49:20,665 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 139 flow. Second operand 3 states and 133 transitions. [2022-12-13 00:49:20,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 425 flow [2022-12-13 00:49:20,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 420 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:49:20,670 INFO L231 Difference]: Finished difference. Result has 72 places, 32 transitions, 74 flow [2022-12-13 00:49:20,671 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=72, PETRI_TRANSITIONS=32} [2022-12-13 00:49:20,673 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2022-12-13 00:49:20,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:20,674 INFO L89 Accepts]: Start accepts. Operand has 72 places, 32 transitions, 74 flow [2022-12-13 00:49:20,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:20,675 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:20,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 32 transitions, 74 flow [2022-12-13 00:49:20,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 00:49:20,680 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 00:49:20,680 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:20,681 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 8. Compared 84 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:49:20,682 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 00:49:20,682 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 00:49:20,806 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:20,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 00:49:20,807 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 00:49:20,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:49:20,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:20,808 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:20,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:49:20,808 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:20,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2117202685, now seen corresponding path program 1 times [2022-12-13 00:49:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:20,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83995240] [2022-12-13 00:49:20,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:20,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:21,029 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:49:21,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:21,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83995240] [2022-12-13 00:49:21,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83995240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:21,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:21,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:49:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162934862] [2022-12-13 00:49:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:21,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:49:21,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:21,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:49:21,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:49:21,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:49:21,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:21,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:21,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:49:21,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:21,364 INFO L130 PetriNetUnfolder]: 1340/2206 cut-off events. [2022-12-13 00:49:21,364 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-13 00:49:21,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4374 conditions, 2206 events. 1340/2206 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11765 event pairs, 316 based on Foata normal form. 30/1879 useless extension candidates. Maximal degree in co-relation 4364. Up to 1595 conditions per place. [2022-12-13 00:49:21,375 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 31 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-12-13 00:49:21,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 164 flow [2022-12-13 00:49:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:49:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:49:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 00:49:21,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:49:21,377 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 3 states and 64 transitions. [2022-12-13 00:49:21,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 164 flow [2022-12-13 00:49:21,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:49:21,378 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 78 flow [2022-12-13 00:49:21,379 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 00:49:21,379 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -33 predicate places. [2022-12-13 00:49:21,379 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:21,379 INFO L89 Accepts]: Start accepts. Operand has 42 places, 32 transitions, 78 flow [2022-12-13 00:49:21,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:21,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:21,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 78 flow [2022-12-13 00:49:21,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 78 flow [2022-12-13 00:49:21,384 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 00:49:21,384 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:21,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 83 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:49:21,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 78 flow [2022-12-13 00:49:21,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 00:49:21,440 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:21,442 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 00:49:21,442 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 78 flow [2022-12-13 00:49:21,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:21,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:21,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:21,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:49:21,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:21,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:21,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1208774148, now seen corresponding path program 1 times [2022-12-13 00:49:21,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:21,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764627546] [2022-12-13 00:49:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:21,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:21,570 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:49:21,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764627546] [2022-12-13 00:49:21,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764627546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:21,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:21,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:49:21,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783923001] [2022-12-13 00:49:21,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:21,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:49:21,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:21,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:49:21,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:49:21,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 00:49:21,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:21,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:21,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 00:49:21,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:21,935 INFO L130 PetriNetUnfolder]: 2083/3413 cut-off events. [2022-12-13 00:49:21,935 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2022-12-13 00:49:21,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6908 conditions, 3413 events. 2083/3413 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 19796 event pairs, 439 based on Foata normal form. 144/2975 useless extension candidates. Maximal degree in co-relation 6897. Up to 1257 conditions per place. [2022-12-13 00:49:21,947 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 39 selfloop transitions, 3 changer transitions 7/58 dead transitions. [2022-12-13 00:49:21,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 233 flow [2022-12-13 00:49:21,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:49:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:49:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 00:49:21,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2022-12-13 00:49:21,948 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 78 flow. Second operand 4 states and 87 transitions. [2022-12-13 00:49:21,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 233 flow [2022-12-13 00:49:21,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 227 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:49:21,950 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 88 flow [2022-12-13 00:49:21,950 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-12-13 00:49:21,951 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -30 predicate places. [2022-12-13 00:49:21,951 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:21,951 INFO L89 Accepts]: Start accepts. Operand has 45 places, 32 transitions, 88 flow [2022-12-13 00:49:21,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:21,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:21,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 88 flow [2022-12-13 00:49:21,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 32 transitions, 88 flow [2022-12-13 00:49:21,956 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 00:49:21,956 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:49:21,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 32 events. 0/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 79 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:49:21,957 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 88 flow [2022-12-13 00:49:21,957 INFO L226 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-13 00:49:23,044 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:49:23,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1094 [2022-12-13 00:49:23,045 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 86 flow [2022-12-13 00:49:23,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:23,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:23,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:23,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:49:23,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1746338319, now seen corresponding path program 1 times [2022-12-13 00:49:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:23,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257214460] [2022-12-13 00:49:23,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:23,190 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:49:23,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:23,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257214460] [2022-12-13 00:49:23,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257214460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:23,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:23,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:49:23,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430206986] [2022-12-13 00:49:23,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:23,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:49:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:23,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:49:23,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:49:23,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 00:49:23,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 86 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:49:23,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:23,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 00:49:23,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:23,391 INFO L130 PetriNetUnfolder]: 1311/2072 cut-off events. [2022-12-13 00:49:23,392 INFO L131 PetriNetUnfolder]: For 866/866 co-relation queries the response was YES. [2022-12-13 00:49:23,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4727 conditions, 2072 events. 1311/2072 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10026 event pairs, 397 based on Foata normal form. 4/1724 useless extension candidates. Maximal degree in co-relation 4714. Up to 1878 conditions per place. [2022-12-13 00:49:23,403 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 33 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-13 00:49:23,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 196 flow [2022-12-13 00:49:23,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:49:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:49:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-13 00:49:23,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6559139784946236 [2022-12-13 00:49:23,404 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 86 flow. Second operand 3 states and 61 transitions. [2022-12-13 00:49:23,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 196 flow [2022-12-13 00:49:23,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 179 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 00:49:23,407 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 93 flow [2022-12-13 00:49:23,407 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-13 00:49:23,408 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -32 predicate places. [2022-12-13 00:49:23,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:23,408 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 93 flow [2022-12-13 00:49:23,408 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:23,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:23,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 93 flow [2022-12-13 00:49:23,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 93 flow [2022-12-13 00:49:23,414 INFO L130 PetriNetUnfolder]: 3/45 cut-off events. [2022-12-13 00:49:23,415 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:49:23,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 45 events. 3/45 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 122 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 63. Up to 10 conditions per place. [2022-12-13 00:49:23,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 93 flow [2022-12-13 00:49:23,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-13 00:49:23,512 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:49:23,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 00:49:23,518 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 95 flow [2022-12-13 00:49:23,518 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:49:23,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:23,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:23,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:49:23,519 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:23,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1700220832, now seen corresponding path program 1 times [2022-12-13 00:49:23,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:23,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108352206] [2022-12-13 00:49:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:23,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:24,876 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:49:24,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:24,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108352206] [2022-12-13 00:49:24,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108352206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:24,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:24,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:49:24,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003107055] [2022-12-13 00:49:24,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:24,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:49:24,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:24,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:49:24,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:49:24,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 00:49:24,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 95 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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:49:24,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:24,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 00:49:24,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:25,267 INFO L130 PetriNetUnfolder]: 1310/2093 cut-off events. [2022-12-13 00:49:25,268 INFO L131 PetriNetUnfolder]: For 485/485 co-relation queries the response was YES. [2022-12-13 00:49:25,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4640 conditions, 2093 events. 1310/2093 cut-off events. For 485/485 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10325 event pairs, 596 based on Foata normal form. 5/1746 useless extension candidates. Maximal degree in co-relation 4628. Up to 1799 conditions per place. [2022-12-13 00:49:25,279 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 43 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2022-12-13 00:49:25,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 281 flow [2022-12-13 00:49:25,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:49:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:49:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 00:49:25,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.60625 [2022-12-13 00:49:25,281 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 95 flow. Second operand 5 states and 97 transitions. [2022-12-13 00:49:25,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 281 flow [2022-12-13 00:49:25,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:49:25,283 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 152 flow [2022-12-13 00:49:25,283 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2022-12-13 00:49:25,283 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -26 predicate places. [2022-12-13 00:49:25,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:25,284 INFO L89 Accepts]: Start accepts. Operand has 49 places, 41 transitions, 152 flow [2022-12-13 00:49:25,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:25,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:25,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 41 transitions, 152 flow [2022-12-13 00:49:25,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 152 flow [2022-12-13 00:49:25,306 INFO L130 PetriNetUnfolder]: 24/131 cut-off events. [2022-12-13 00:49:25,306 INFO L131 PetriNetUnfolder]: For 80/91 co-relation queries the response was YES. [2022-12-13 00:49:25,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 131 events. 24/131 cut-off events. For 80/91 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 658 event pairs, 5 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 250. Up to 30 conditions per place. [2022-12-13 00:49:25,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 152 flow [2022-12-13 00:49:25,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 632 [2022-12-13 00:49:28,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [675] L829-->L836: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd3~0_43 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse3 (= (mod v_~x$r_buff1_thd3~0_37 256) 0)) (.cse2 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse11 (not (= 0 (mod v_~x$w_buff0_used~0_210 256)))) (.cse9 (not .cse8))) (let ((.cse0 (and .cse11 .cse9)) (.cse4 (not .cse2)) (.cse1 (select |v_#memory_int_178| |v_~#x~0.base_122|)) (.cse6 (not .cse3)) (.cse10 (not .cse7))) (and (= v_~x$r_buff0_thd3~0_42 (ite .cse0 0 v_~x$r_buff0_thd3~0_43)) (let ((.cse5 (= |v_P2_#t~mem25_32| |v_P2Thread1of1ForFork1_#t~mem25_1|))) (or (and (or (and (= (select .cse1 |v_~#x~0.offset_122|) |v_P2_#t~mem25_32|) (= |v_P2_#t~ite26_29| |v_P2_#t~mem25_32|) (or .cse2 .cse3)) (and .cse4 (= |v_P2_#t~ite26_29| v_~x$w_buff1~0_75) .cse5 .cse6)) (= |v_P2_#t~ite26_29| |v_P2_#t~ite27_23|) (or .cse7 .cse8)) (and .cse9 .cse5 .cse10 (= |v_P2_#t~ite26_29| |v_P2Thread1of1ForFork1_#t~ite26_1|) (= |v_P2_#t~ite27_23| v_~x$w_buff0~0_84)))) (= (ite (or .cse0 (and .cse4 .cse6)) 0 v_~x$w_buff1_used~0_188) v_~x$w_buff1_used~0_187) (= |v_#memory_int_177| (store |v_#memory_int_178| |v_~#x~0.base_122| (store .cse1 |v_~#x~0.offset_122| |v_P2_#t~ite27_23|))) (= v_~x$r_buff1_thd3~0_36 (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_187 256))) .cse6) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_42 256) 0)))) 0 v_~x$r_buff1_thd3~0_37)) (= v_~x$w_buff0_used~0_210 (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_211)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_84, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_122|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_1|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_178|, ~#x~0.base=|v_~#x~0.base_122|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_84, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_122|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_177|, ~#x~0.base=|v_~#x~0.base_122|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_42, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210} AuxVars[|v_P2_#t~mem25_32|, |v_P2_#t~ite26_29|, |v_P2_#t~ite27_23|] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P2Thread1of1ForFork1_#t~mem25, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-13 00:49:28,606 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [668] L809-->L816: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd2~0_100 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_203 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd2~0_94 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse6 (not .cse8)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_202 256) 0)))) (let ((.cse0 (and .cse6 .cse11)) (.cse1 (select |v_#memory_int_166| |v_~#x~0.base_116|)) (.cse2 (not .cse9)) (.cse3 (not .cse10)) (.cse5 (not .cse7))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_100) v_~x$r_buff0_thd2~0_99) (= (store |v_#memory_int_166| |v_~#x~0.base_116| (store .cse1 |v_~#x~0.offset_116| |v_P1_#t~ite24_25|)) |v_#memory_int_165|) (= (ite (or .cse0 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_180) v_~x$w_buff1_used~0_179) (let ((.cse4 (= |v_P1Thread1of1ForFork0_#t~mem22_1| |v_P1_#t~mem22_36|))) (or (and .cse4 (= |v_P1_#t~ite23_31| |v_P1Thread1of1ForFork0_#t~ite23_1|) (= |v_P1_#t~ite24_25| v_~x$w_buff0~0_82) .cse5 .cse6) (and (= |v_P1_#t~ite23_31| |v_P1_#t~ite24_25|) (or .cse7 .cse8) (or (and (= |v_P1_#t~ite23_31| |v_P1_#t~mem22_36|) (or .cse9 .cse10) (= |v_P1_#t~mem22_36| (select .cse1 |v_~#x~0.offset_116|))) (and .cse2 .cse4 .cse3 (= |v_P1_#t~ite23_31| v_~x$w_buff1~0_69)))))) (= v_~x$r_buff1_thd2~0_93 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_179 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_99 256) 0)) .cse11)) 0 v_~x$r_buff1_thd2~0_94)) (= (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_203) v_~x$w_buff0_used~0_202))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_82, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_1|, ~#x~0.offset=|v_~#x~0.offset_116|, ~x$w_buff1~0=v_~x$w_buff1~0_69, #memory_int=|v_#memory_int_166|, ~#x~0.base=|v_~#x~0.base_116|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_82, ~#x~0.offset=|v_~#x~0.offset_116|, ~x$w_buff1~0=v_~x$w_buff1~0_69, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_165|, ~#x~0.base=|v_~#x~0.base_116|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_179, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_202} AuxVars[|v_P1_#t~ite24_25|, |v_P1_#t~ite23_31|, |v_P1_#t~mem22_36|] AssignedVars[P1Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-13 00:49:29,269 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:49:29,270 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3986 [2022-12-13 00:49:29,270 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 159 flow [2022-12-13 00:49:29,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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:49:29,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:29,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:29,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:49:29,270 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1182776132, now seen corresponding path program 1 times [2022-12-13 00:49:29,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:29,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148918659] [2022-12-13 00:49:29,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:29,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:29,410 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:49:29,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:29,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148918659] [2022-12-13 00:49:29,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148918659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:29,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:29,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:49:29,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846309895] [2022-12-13 00:49:29,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:29,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:49:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:29,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:49:29,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:49:29,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2022-12-13 00:49:29,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 159 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:49:29,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:29,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2022-12-13 00:49:29,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:29,718 INFO L130 PetriNetUnfolder]: 1828/2930 cut-off events. [2022-12-13 00:49:29,719 INFO L131 PetriNetUnfolder]: For 2242/2242 co-relation queries the response was YES. [2022-12-13 00:49:29,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7347 conditions, 2930 events. 1828/2930 cut-off events. For 2242/2242 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15720 event pairs, 754 based on Foata normal form. 94/2447 useless extension candidates. Maximal degree in co-relation 7331. Up to 1682 conditions per place. [2022-12-13 00:49:29,733 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 42 selfloop transitions, 3 changer transitions 3/56 dead transitions. [2022-12-13 00:49:29,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 317 flow [2022-12-13 00:49:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:49:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:49:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-13 00:49:29,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-13 00:49:29,734 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 159 flow. Second operand 3 states and 69 transitions. [2022-12-13 00:49:29,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 317 flow [2022-12-13 00:49:29,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 303 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 00:49:29,737 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 162 flow [2022-12-13 00:49:29,737 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2022-12-13 00:49:29,738 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -24 predicate places. [2022-12-13 00:49:29,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:29,739 INFO L89 Accepts]: Start accepts. Operand has 51 places, 40 transitions, 162 flow [2022-12-13 00:49:29,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:29,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:29,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 162 flow [2022-12-13 00:49:29,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 162 flow [2022-12-13 00:49:29,757 INFO L130 PetriNetUnfolder]: 24/151 cut-off events. [2022-12-13 00:49:29,757 INFO L131 PetriNetUnfolder]: For 133/150 co-relation queries the response was YES. [2022-12-13 00:49:29,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 151 events. 24/151 cut-off events. For 133/150 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 855 event pairs, 6 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 304. Up to 38 conditions per place. [2022-12-13 00:49:29,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 162 flow [2022-12-13 00:49:29,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 604 [2022-12-13 00:49:29,794 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:29,795 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 00:49:29,795 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 162 flow [2022-12-13 00:49:29,795 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:49:29,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:29,795 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:29,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:49:29,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:29,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash -336240100, now seen corresponding path program 1 times [2022-12-13 00:49:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:29,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191699042] [2022-12-13 00:49:29,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:29,958 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:49:29,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:29,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191699042] [2022-12-13 00:49:29,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191699042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:29,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:29,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:49:29,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777625546] [2022-12-13 00:49:29,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:29,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:49:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:29,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:49:29,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:49:29,960 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2022-12-13 00:49:29,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:29,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:29,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2022-12-13 00:49:29,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:30,345 INFO L130 PetriNetUnfolder]: 2541/3982 cut-off events. [2022-12-13 00:49:30,345 INFO L131 PetriNetUnfolder]: For 3298/3322 co-relation queries the response was YES. [2022-12-13 00:49:30,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10193 conditions, 3982 events. 2541/3982 cut-off events. For 3298/3322 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 21846 event pairs, 765 based on Foata normal form. 41/2722 useless extension candidates. Maximal degree in co-relation 10175. Up to 3778 conditions per place. [2022-12-13 00:49:30,367 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 46 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2022-12-13 00:49:30,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 349 flow [2022-12-13 00:49:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:49:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:49:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 00:49:30,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-13 00:49:30,369 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 162 flow. Second operand 3 states and 70 transitions. [2022-12-13 00:49:30,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 349 flow [2022-12-13 00:49:30,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 333 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 00:49:30,377 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 218 flow [2022-12-13 00:49:30,378 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2022-12-13 00:49:30,378 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -23 predicate places. [2022-12-13 00:49:30,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:30,378 INFO L89 Accepts]: Start accepts. Operand has 52 places, 49 transitions, 218 flow [2022-12-13 00:49:30,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:30,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:30,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 49 transitions, 218 flow [2022-12-13 00:49:30,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 49 transitions, 218 flow [2022-12-13 00:49:30,455 INFO L130 PetriNetUnfolder]: 685/1446 cut-off events. [2022-12-13 00:49:30,456 INFO L131 PetriNetUnfolder]: For 558/600 co-relation queries the response was YES. [2022-12-13 00:49:30,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 1446 events. 685/1446 cut-off events. For 558/600 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 11159 event pairs, 305 based on Foata normal form. 0/753 useless extension candidates. Maximal degree in co-relation 3143. Up to 1123 conditions per place. [2022-12-13 00:49:30,465 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 49 transitions, 218 flow [2022-12-13 00:49:30,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-13 00:49:30,478 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:30,479 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 00:49:30,479 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 218 flow [2022-12-13 00:49:30,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:30,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:30,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:30,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:49:30,479 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:30,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:30,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1886773619, now seen corresponding path program 1 times [2022-12-13 00:49:30,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:30,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446260332] [2022-12-13 00:49:30,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:30,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:30,614 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:49:30,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:30,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446260332] [2022-12-13 00:49:30,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446260332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:30,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:30,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:49:30,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40474271] [2022-12-13 00:49:30,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:30,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:49:30,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:30,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:49:30,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:49:30,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2022-12-13 00:49:30,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:49:30,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:30,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2022-12-13 00:49:30,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:30,900 INFO L130 PetriNetUnfolder]: 1320/2359 cut-off events. [2022-12-13 00:49:30,900 INFO L131 PetriNetUnfolder]: For 1429/1438 co-relation queries the response was YES. [2022-12-13 00:49:30,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7384 conditions, 2359 events. 1320/2359 cut-off events. For 1429/1438 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 13980 event pairs, 180 based on Foata normal form. 132/1742 useless extension candidates. Maximal degree in co-relation 7365. Up to 1747 conditions per place. [2022-12-13 00:49:30,909 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 54 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2022-12-13 00:49:30,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 483 flow [2022-12-13 00:49:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:49:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:49:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-13 00:49:30,911 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2022-12-13 00:49:30,911 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 218 flow. Second operand 4 states and 93 transitions. [2022-12-13 00:49:30,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 483 flow [2022-12-13 00:49:30,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:49:30,916 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 320 flow [2022-12-13 00:49:30,916 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=320, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2022-12-13 00:49:30,917 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -20 predicate places. [2022-12-13 00:49:30,918 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:30,918 INFO L89 Accepts]: Start accepts. Operand has 55 places, 58 transitions, 320 flow [2022-12-13 00:49:30,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:30,918 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:30,918 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 58 transitions, 320 flow [2022-12-13 00:49:30,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 320 flow [2022-12-13 00:49:30,983 INFO L130 PetriNetUnfolder]: 412/1071 cut-off events. [2022-12-13 00:49:30,983 INFO L131 PetriNetUnfolder]: For 630/723 co-relation queries the response was YES. [2022-12-13 00:49:30,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3233 conditions, 1071 events. 412/1071 cut-off events. For 630/723 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 8593 event pairs, 65 based on Foata normal form. 7/644 useless extension candidates. Maximal degree in co-relation 3215. Up to 751 conditions per place. [2022-12-13 00:49:30,990 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 58 transitions, 320 flow [2022-12-13 00:49:30,990 INFO L226 LiptonReduction]: Number of co-enabled transitions 668 [2022-12-13 00:49:30,993 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:30,994 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 00:49:30,995 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 58 transitions, 320 flow [2022-12-13 00:49:30,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:49:30,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:30,995 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:30,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:49:30,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:30,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1073680469, now seen corresponding path program 1 times [2022-12-13 00:49:30,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:30,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681256056] [2022-12-13 00:49:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:30,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:32,461 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:49:32,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:32,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681256056] [2022-12-13 00:49:32,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681256056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:32,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:32,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:49:32,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034680504] [2022-12-13 00:49:32,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:32,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:49:32,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:32,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:49:32,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:49:32,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2022-12-13 00:49:32,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 58 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:49:32,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:32,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2022-12-13 00:49:32,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:32,911 INFO L130 PetriNetUnfolder]: 1206/2275 cut-off events. [2022-12-13 00:49:32,911 INFO L131 PetriNetUnfolder]: For 2360/2612 co-relation queries the response was YES. [2022-12-13 00:49:32,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8289 conditions, 2275 events. 1206/2275 cut-off events. For 2360/2612 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 14653 event pairs, 316 based on Foata normal form. 99/1966 useless extension candidates. Maximal degree in co-relation 8268. Up to 1561 conditions per place. [2022-12-13 00:49:32,922 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 68 selfloop transitions, 11 changer transitions 0/94 dead transitions. [2022-12-13 00:49:32,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 94 transitions, 662 flow [2022-12-13 00:49:32,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:49:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:49:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 00:49:32,923 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-13 00:49:32,924 INFO L175 Difference]: Start difference. First operand has 55 places, 58 transitions, 320 flow. Second operand 5 states and 104 transitions. [2022-12-13 00:49:32,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 94 transitions, 662 flow [2022-12-13 00:49:32,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 94 transitions, 592 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 00:49:32,929 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 335 flow [2022-12-13 00:49:32,929 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2022-12-13 00:49:32,930 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -16 predicate places. [2022-12-13 00:49:32,930 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:32,930 INFO L89 Accepts]: Start accepts. Operand has 59 places, 61 transitions, 335 flow [2022-12-13 00:49:32,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:32,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:32,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 61 transitions, 335 flow [2022-12-13 00:49:32,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 61 transitions, 335 flow [2022-12-13 00:49:33,019 INFO L130 PetriNetUnfolder]: 622/1378 cut-off events. [2022-12-13 00:49:33,020 INFO L131 PetriNetUnfolder]: For 1601/1943 co-relation queries the response was YES. [2022-12-13 00:49:33,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 1378 events. 622/1378 cut-off events. For 1601/1943 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 10191 event pairs, 59 based on Foata normal form. 11/774 useless extension candidates. Maximal degree in co-relation 3867. Up to 946 conditions per place. [2022-12-13 00:49:33,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 61 transitions, 335 flow [2022-12-13 00:49:33,030 INFO L226 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-13 00:49:33,059 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:33,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 00:49:33,060 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 335 flow [2022-12-13 00:49:33,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:49:33,060 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:33,060 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:49:33,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:49:33,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash 450013763, now seen corresponding path program 1 times [2022-12-13 00:49:33,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:33,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666230128] [2022-12-13 00:49:33,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:33,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:33,221 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:49:33,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:33,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666230128] [2022-12-13 00:49:33,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666230128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:33,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:33,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:49:33,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885350048] [2022-12-13 00:49:33,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:33,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:49:33,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:33,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:49:33,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:49:33,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2022-12-13 00:49:33,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 335 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:49:33,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:33,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2022-12-13 00:49:33,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:33,450 INFO L130 PetriNetUnfolder]: 789/1484 cut-off events. [2022-12-13 00:49:33,450 INFO L131 PetriNetUnfolder]: For 1981/1981 co-relation queries the response was YES. [2022-12-13 00:49:33,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5467 conditions, 1484 events. 789/1484 cut-off events. For 1981/1981 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8354 event pairs, 43 based on Foata normal form. 162/1139 useless extension candidates. Maximal degree in co-relation 5444. Up to 577 conditions per place. [2022-12-13 00:49:33,456 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 38 selfloop transitions, 28 changer transitions 17/86 dead transitions. [2022-12-13 00:49:33,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 624 flow [2022-12-13 00:49:33,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:49:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:49:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-13 00:49:33,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-13 00:49:33,458 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 335 flow. Second operand 5 states and 99 transitions. [2022-12-13 00:49:33,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 624 flow [2022-12-13 00:49:33,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 573 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-13 00:49:33,463 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 346 flow [2022-12-13 00:49:33,463 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2022-12-13 00:49:33,464 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -16 predicate places. [2022-12-13 00:49:33,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:33,464 INFO L89 Accepts]: Start accepts. Operand has 59 places, 53 transitions, 346 flow [2022-12-13 00:49:33,466 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:33,466 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:33,466 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 346 flow [2022-12-13 00:49:33,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 53 transitions, 346 flow [2022-12-13 00:49:33,492 INFO L130 PetriNetUnfolder]: 214/453 cut-off events. [2022-12-13 00:49:33,492 INFO L131 PetriNetUnfolder]: For 227/261 co-relation queries the response was YES. [2022-12-13 00:49:33,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 453 events. 214/453 cut-off events. For 227/261 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 2290 event pairs, 1 based on Foata normal form. 2/216 useless extension candidates. Maximal degree in co-relation 1641. Up to 334 conditions per place. [2022-12-13 00:49:33,495 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 53 transitions, 346 flow [2022-12-13 00:49:33,495 INFO L226 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-13 00:49:35,967 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [856] $Ultimate##0-->L829: Formula: (and (= v_~y~0_57 v_~__unbuffered_p2_EAX~0_140) (= v_P2Thread1of1ForFork1_~arg.offset_17 |v_P2Thread1of1ForFork1_#in~arg.offset_17|) (= v_~z~0_150 1) (= v_P2Thread1of1ForFork1_~arg.base_17 |v_P2Thread1of1ForFork1_#in~arg.base_17|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~y~0=v_~y~0_57} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_17, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_140, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~z~0=v_~z~0_150, ~y~0=v_~y~0_57} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] and [863] $Ultimate##0-->L816: Formula: (let ((.cse4 (= (mod v_~x$r_buff0_thd2~0_320 256) 0))) (let ((.cse1 (not .cse4)) (.cse5 (not (= (mod v_~x$w_buff0_used~0_764 256) 0)))) (let ((.cse0 (and .cse1 .cse5)) (.cse3 (select |v_#memory_int_736| |v_~#x~0.base_358|)) (.cse2 (= (mod v_~x$w_buff0_used~0_765 256) 0))) (and (= v_~z~0_166 2) (= v_~x$r_buff0_thd1~0_342 v_~x$r_buff1_thd1~0_262) (= (ite .cse0 0 v_~x$r_buff0_thd2~0_320) v_~x$r_buff0_thd2~0_319) (= v_~x$r_buff0_thd0~0_234 v_~x$r_buff1_thd0~0_248) (= (ite (or .cse0 (and .cse1 (not .cse2))) 0 v_~x$w_buff0_used~0_765) v_~x$w_buff1_used~0_679) (= (ite .cse1 0 1) v_~x$w_buff0_used~0_764) (or (and (= |v_P1_#t~ite23_72| |v_P1_#t~mem22_77|) (= (select .cse3 |v_~#x~0.offset_358|) |v_P1_#t~mem22_77|) .cse4 (= |v_P1_#t~ite23_72| |v_P1_#t~ite24_66|)) (and .cse1 (= |v_P1_#t~ite23_72| |v_P1Thread1of1ForFork0_#t~ite23_70|) (= |v_P1Thread1of1ForFork0_#t~mem22_70| |v_P1_#t~mem22_77|) (= |v_P1_#t~ite24_66| v_~x$w_buff0~0_454))) (= (store |v_#memory_int_736| |v_~#x~0.base_358| (store .cse3 |v_~#x~0.offset_358| |v_P1_#t~ite24_66|)) |v_#memory_int_735|) (= v_~x$w_buff0~0_455 v_~x$w_buff1~0_391) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_83| 0)) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_17| |v_P0Thread1of1ForFork2_~arg#1.offset_17|) (= v_~x$w_buff0~0_454 1) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_17| |v_P0Thread1of1ForFork2_~arg#1.base_17|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_83| (ite .cse2 1 0)) (= v_~x$r_buff1_thd2~0_330 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_679 256) 0)) .cse1) (and .cse5 (not (= (mod v_~x$r_buff0_thd2~0_319 256) 0)))) 0 v_~x$r_buff0_thd2~0_320)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_83| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_83|) (= v_~x$r_buff0_thd1~0_341 1) (= v_~x$r_buff0_thd3~0_168 v_~x$r_buff1_thd3~0_173))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_455, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_70|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_342, ~#x~0.offset=|v_~#x~0.offset_358|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_17|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_168, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_70|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_17|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_320, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_765, #memory_int=|v_#memory_int_736|, ~#x~0.base=|v_~#x~0.base_358|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_454, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_341, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_37|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_83|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_173, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_262, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_168, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_17|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_17|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_83|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_234, ~#x~0.offset=|v_~#x~0.offset_358|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_17|, ~x$w_buff1~0=v_~x$w_buff1~0_391, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_330, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_679, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_319, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_248, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_764, #memory_int=|v_#memory_int_735|, ~#x~0.base=|v_~#x~0.base_358|, ~z~0=v_~z~0_166} AuxVars[|v_P1_#t~ite24_66|, |v_P1_#t~ite23_72|, |v_P1_#t~mem22_77|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd1~0, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int, ~z~0] [2022-12-13 00:49:36,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [856] $Ultimate##0-->L829: Formula: (and (= v_~y~0_57 v_~__unbuffered_p2_EAX~0_140) (= v_P2Thread1of1ForFork1_~arg.offset_17 |v_P2Thread1of1ForFork1_#in~arg.offset_17|) (= v_~z~0_150 1) (= v_P2Thread1of1ForFork1_~arg.base_17 |v_P2Thread1of1ForFork1_#in~arg.base_17|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~y~0=v_~y~0_57} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_17, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_140, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~z~0=v_~z~0_150, ~y~0=v_~y~0_57} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] and [864] $Ultimate##0-->L780: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff0_thd1~0_346 256) 0))) (.cse2 (= (mod v_~x$w_buff0_used~0_769 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_768 256) 0)))) (and (= v_~x$w_buff0_used~0_768 0) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_19| |v_P0Thread1of1ForFork2_~arg#1.base_19|) (= v_~x$r_buff0_thd3~0_170 v_~x$r_buff1_thd3~0_175) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_85| 0)) (= v_~x$w_buff1_used~0_681 (ite (or .cse0 (and .cse1 (not .cse2))) 0 v_~x$w_buff0_used~0_769)) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_345 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_681 256) 0)))) 0 v_~x$r_buff0_thd1~0_346) v_~x$r_buff1_thd1~0_264) (= v_~x$w_buff0~0_458 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_85| (ite .cse2 1 0)) (= v_~x$w_buff0~0_459 v_~x$w_buff1~0_393) (= (ite .cse0 0 1) v_~x$r_buff0_thd1~0_345) (= (store |v_#memory_int_740| |v_~#x~0.base_360| (store (select |v_#memory_int_740| |v_~#x~0.base_360|) |v_~#x~0.offset_360| v_~x$w_buff0~0_458)) |v_#memory_int_739|) (= v_~z~0_168 2) (= v_~x$r_buff0_thd0~0_236 v_~x$r_buff1_thd0~0_250) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_19| |v_P0Thread1of1ForFork2_~arg#1.offset_19|) (= v_~x$r_buff0_thd2~0_323 v_~x$r_buff1_thd2~0_332) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_85| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_85|))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_459, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_236, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_346, ~#x~0.offset=|v_~#x~0.offset_360|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_19|, #memory_int=|v_#memory_int_740|, ~#x~0.base=|v_~#x~0.base_360|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_170, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_19|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_769} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_345, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_85|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_175, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_133|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_170, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_19|, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_133|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_19|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_85|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_236, ~#x~0.offset=|v_~#x~0.offset_360|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_19|, ~x$w_buff1~0=v_~x$w_buff1~0_393, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_681, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_332, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_250, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_768, #memory_int=|v_#memory_int_739|, ~#x~0.base=|v_~#x~0.base_360|, ~z~0=v_~z~0_168, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_69|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int, ~z~0, P0Thread1of1ForFork2_#t~ite5#1] [2022-12-13 00:49:36,378 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [856] $Ultimate##0-->L829: Formula: (and (= v_~y~0_57 v_~__unbuffered_p2_EAX~0_140) (= v_P2Thread1of1ForFork1_~arg.offset_17 |v_P2Thread1of1ForFork1_#in~arg.offset_17|) (= v_~z~0_150 1) (= v_P2Thread1of1ForFork1_~arg.base_17 |v_P2Thread1of1ForFork1_#in~arg.base_17|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~y~0=v_~y~0_57} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_17, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_140, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~z~0=v_~z~0_150, ~y~0=v_~y~0_57} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] and [865] $Ultimate##0-->L836: Formula: (let ((.cse4 (= (mod v_~x$r_buff0_thd3~0_173 256) 0))) (let ((.cse1 (not .cse4)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_772 256) 0)))) (let ((.cse3 (select |v_#memory_int_744| |v_~#x~0.base_362|)) (.cse2 (= 0 (mod v_~x$w_buff0_used~0_773 256))) (.cse5 (and .cse1 .cse0))) (and (= |v_P0Thread1of1ForFork2_#in~arg#1.base_21| |v_P0Thread1of1ForFork2_~arg#1.base_21|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_87| 0)) (= v_~x$w_buff0~0_463 v_~x$w_buff1~0_395) (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd3~0_172 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_683 256) 0)))) 0 v_~x$r_buff0_thd3~0_173) v_~x$r_buff1_thd3~0_177) (= v_~z~0_170 2) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_87| (ite .cse2 1 0)) (or (and (= |v_P2_#t~ite26_56| |v_P2_#t~ite27_50|) (= (select .cse3 |v_~#x~0.offset_362|) |v_P2_#t~mem25_59|) .cse4 (= |v_P2_#t~ite26_56| |v_P2_#t~mem25_59|)) (and (= |v_P2_#t~ite26_56| |v_P2Thread1of1ForFork1_#t~ite26_50|) (= |v_P2_#t~ite27_50| v_~x$w_buff0~0_462) .cse1 (= |v_P2Thread1of1ForFork1_#t~mem25_50| |v_P2_#t~mem25_59|))) (= v_~x$r_buff0_thd0~0_238 v_~x$r_buff1_thd0~0_252) (= v_~x$r_buff0_thd2~0_325 v_~x$r_buff1_thd2~0_334) (= v_~x$w_buff0_used~0_772 (ite .cse1 0 1)) (= (store |v_#memory_int_744| |v_~#x~0.base_362| (store .cse3 |v_~#x~0.offset_362| |v_P2_#t~ite27_50|)) |v_#memory_int_743|) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_173) v_~x$r_buff0_thd3~0_172) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_87| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_87|) (= (ite (or (and .cse1 (not .cse2)) .cse5) 0 v_~x$w_buff0_used~0_773) v_~x$w_buff1_used~0_683) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_21| |v_P0Thread1of1ForFork2_~arg#1.offset_21|) (= v_~x$r_buff0_thd1~0_349 1) (= v_~x$r_buff0_thd1~0_350 v_~x$r_buff1_thd1~0_266) (= v_~x$w_buff0~0_462 1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_463, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_238, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_350, ~#x~0.offset=|v_~#x~0.offset_362|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_50|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_173, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_325, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_773, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_50|, #memory_int=|v_#memory_int_744|, ~#x~0.base=|v_~#x~0.base_362|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_462, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_349, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_177, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_87|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_266, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_172, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_21|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_21|, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_27|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_87|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_238, ~#x~0.offset=|v_~#x~0.offset_362|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_21|, ~x$w_buff1~0=v_~x$w_buff1~0_395, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_683, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_334, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_325, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_252, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_772, #memory_int=|v_#memory_int_743|, ~#x~0.base=|v_~#x~0.base_362|, ~z~0=v_~z~0_170} AuxVars[|v_P2_#t~ite26_56|, |v_P2_#t~ite27_50|, |v_P2_#t~mem25_59|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_#t~mem25, ~x$w_buff1~0, ~x$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int, ~z~0] [2022-12-13 00:49:36,645 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [855] $Ultimate##0-->L809: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_240 256) 0)) (.cse2 (= (mod v_~x$w_buff0_used~0_596 256) 0)) (.cse25 (mod v_~x$w_buff0_used~0_597 256)) (.cse26 (mod v_~weak$$choice0~0_101 256))) (let ((.cse20 (= .cse26 0)) (.cse22 (= .cse25 0)) (.cse19 (= (mod v_~x$w_buff1_used~0_534 256) 0)) (.cse8 (= (mod v_~weak$$choice2~0_92 256) 0)) (.cse23 (select |v_#memory_int_588| |v_~#x~0.base_292|)) (.cse4 (not .cse2)) (.cse16 (not .cse6))) (let ((.cse3 (and .cse4 .cse16)) (.cse0 (select .cse23 |v_~#x~0.offset_292|)) (.cse7 (not (= (mod v_~x$w_buff1_used~0_533 256) 0))) (.cse1 (not .cse8)) (.cse5 (= (mod v_~x$r_buff1_thd2~0_249 256) 0)) (.cse9 (not .cse19)) (.cse10 (not .cse22)) (.cse18 (not .cse20)) (.cse21 (= (mod v_~weak$$choice1~0_222 256) 0))) (and (= v_~x$w_buff0~0_347 v_~x$w_buff0~0_346) (= |v_P1Thread1of1ForFork0_#t~nondet7_50| v_~weak$$choice2~0_92) (= v_~x$w_buff1~0_306 v_~x$w_buff1~0_305) (= v_~x$flush_delayed~0_78 0) (= .cse0 v_~x$mem_tmp~0_60) (= |v_P1Thread1of1ForFork0_#in~arg.offset_23| v_P1Thread1of1ForFork0_~arg.offset_23) (= v_~x$r_buff0_thd2~0_239 (ite .cse1 v_~x$r_buff0_thd2~0_240 (ite .cse2 v_~x$r_buff0_thd2~0_240 (ite .cse3 0 (ite (and .cse4 .cse5 .cse6 .cse7) v_~x$r_buff0_thd2~0_240 0))))) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_164 |v_~#x~0.offset_292|) (or (and (= v_~__unbuffered_p1_EAX~0_303 |v_P1_#t~mem20_56|) (= |v_P1_#t~ite21_53| |v_P1_#t~mem20_56|) .cse8) (and (= |v_P1Thread1of1ForFork0_#t~mem20_50| |v_P1_#t~mem20_56|) (= |v_P1_#t~ite21_53| v_~x$mem_tmp~0_60) .cse1)) (= v_~x$w_buff1_used~0_533 (ite .cse1 v_~x$w_buff1_used~0_534 (ite .cse2 v_~x$w_buff1_used~0_534 (ite .cse3 0 (ite (and .cse4 .cse5 .cse6 .cse9) v_~weak$$choice0~0_101 0))))) (= |v_P1Thread1of1ForFork0_#t~nondet6_50| v_~weak$$choice0~0_101) (let ((.cse11 (= |v_P1_#t~ite12_77| |v_P1Thread1of1ForFork0_#t~ite12_50|)) (.cse12 (= |v_P1Thread1of1ForFork0_#t~mem13_50| |v_P1_#t~mem13_96|)) (.cse13 (= |v_P1_#t~ite14_95| |v_P1Thread1of1ForFork0_#t~ite14_50|)) (.cse14 (= |v_P1_#t~ite15_85| |v_P1Thread1of1ForFork0_#t~ite15_50|)) (.cse15 (= |v_P1Thread1of1ForFork0_#t~mem11_50| |v_P1_#t~mem11_82|)) (.cse17 (= |v_P1_#t~ite16_75| |v_P1Thread1of1ForFork0_#t~ite16_50|))) (or (and (= |v_P1Thread1of1ForFork0_#t~mem10_50| |v_P1_#t~mem10_58|) .cse10 (or (and .cse11 .cse12 .cse13 .cse14 (= |v_P1_#t~ite17_65| v_~x$w_buff0~0_347) .cse15 .cse16 .cse17) (and (or (and .cse11 (or (and .cse12 .cse13 (= |v_P1_#t~ite15_85| (ite .cse18 v_~x$w_buff1~0_306 v_~x$w_buff0~0_347)) .cse9) (and .cse19 (= |v_P1_#t~ite14_95| |v_P1_#t~ite15_85|) (or (and .cse18 .cse12 (= |v_P1_#t~ite14_95| v_~x$w_buff0~0_347)) (and .cse20 (= |v_P1_#t~ite14_95| |v_P1_#t~mem13_96|) (= .cse0 |v_P1_#t~mem13_96|))))) (= |v_P1_#t~ite15_85| |v_P1_#t~ite16_75|) (or .cse19 (not .cse5)) .cse15) (and .cse5 .cse12 .cse13 (or (and .cse20 (= |v_P1_#t~ite12_77| (ite (not .cse21) v_~x$w_buff0~0_347 v_~x$w_buff1~0_306)) .cse15) (and .cse18 (= |v_P1_#t~ite12_77| |v_P1_#t~mem11_82|) (= .cse0 |v_P1_#t~mem11_82|))) (= |v_P1_#t~ite12_77| |v_P1_#t~ite16_75|) .cse9 .cse14)) .cse6 (= |v_P1_#t~ite17_65| |v_P1_#t~ite16_75|))) (= |v_P1_#t~ite17_65| v_~__unbuffered_p1_EAX~0_303)) (and (= v_~__unbuffered_p1_EAX~0_303 |v_P1_#t~mem10_58|) .cse11 (= .cse0 |v_P1_#t~mem10_58|) .cse12 .cse22 (= |v_P1_#t~ite17_65| |v_P1Thread1of1ForFork0_#t~ite17_49|) .cse13 .cse14 .cse15 .cse17))) (= v_P1Thread1of1ForFork0_~arg.base_23 |v_P1Thread1of1ForFork0_#in~arg.base_23|) (= (store |v_#memory_int_588| |v_~#x~0.base_292| (store .cse23 |v_~#x~0.offset_292| |v_P1_#t~ite21_53|)) |v_#memory_int_587|) (= v_~x$r_buff1_thd2~0_248 (ite .cse1 v_~x$r_buff1_thd2~0_249 (ite .cse2 v_~x$r_buff1_thd2~0_249 (let ((.cse24 (= (mod v_~x$r_buff0_thd2~0_239 256) 0))) (ite (and .cse4 (not .cse24)) 0 (ite (and .cse4 .cse5 .cse7 .cse24) (ite .cse18 v_~x$r_buff1_thd2~0_249 0) 0)))))) (= v_~__unbuffered_p1_EAX$read_delayed~0_165 1) (= v_~y~0_43 1) (= v_~weak$$choice1~0_222 |v_P1Thread1of1ForFork0_#t~nondet9_50|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_164 |v_~#x~0.base_292|) (= v_~x$w_buff0_used~0_596 (ite (= (ite .cse1 .cse25 (ite .cse22 .cse25 (ite (and .cse10 .cse16) 0 (ite (and .cse5 .cse6 .cse9 .cse10) (ite (or .cse18 .cse21) 1 0) .cse26)))) 0) 0 1)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_347, P1Thread1of1ForFork0_#t~mem10=|v_P1Thread1of1ForFork0_#t~mem10_50|, P1Thread1of1ForFork0_#t~mem11=|v_P1Thread1of1ForFork0_#t~mem11_50|, P1Thread1of1ForFork0_#t~mem20=|v_P1Thread1of1ForFork0_#t~mem20_50|, P1Thread1of1ForFork0_#t~nondet7=|v_P1Thread1of1ForFork0_#t~nondet7_50|, ~#x~0.offset=|v_~#x~0.offset_292|, P1Thread1of1ForFork0_#t~nondet6=|v_P1Thread1of1ForFork0_#t~nondet6_50|, ~x$w_buff1~0=v_~x$w_buff1~0_306, P1Thread1of1ForFork0_#t~mem13=|v_P1Thread1of1ForFork0_#t~mem13_50|, P1Thread1of1ForFork0_#t~ite12=|v_P1Thread1of1ForFork0_#t~ite12_50|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_249, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_534, P1Thread1of1ForFork0_#t~nondet9=|v_P1Thread1of1ForFork0_#t~nondet9_50|, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_50|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_240, P1Thread1of1ForFork0_#t~ite16=|v_P1Thread1of1ForFork0_#t~ite16_50|, P1Thread1of1ForFork0_#t~ite15=|v_P1Thread1of1ForFork0_#t~ite15_50|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_597, P1Thread1of1ForFork0_#t~ite17=|v_P1Thread1of1ForFork0_#t~ite17_49|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, #memory_int=|v_#memory_int_588|, ~#x~0.base=|v_~#x~0.base_292|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_346, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_165, ~x$mem_tmp~0=v_~x$mem_tmp~0_60, ~weak$$choice1~0=v_~weak$$choice1~0_222, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_303, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_27|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_164, P1Thread1of1ForFork0_#t~mem8=|v_P1Thread1of1ForFork0_#t~mem8_27|, ~y~0=v_~y~0_43, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_23, ~#x~0.offset=|v_~#x~0.offset_292|, ~x$w_buff1~0=v_~x$w_buff1~0_305, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_164, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_248, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_533, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_239, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_596, ~weak$$choice0~0=v_~weak$$choice0~0_101, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_23, #memory_int=|v_#memory_int_587|, ~#x~0.base=|v_~#x~0.base_292|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|, P1Thread1of1ForFork0_#t~mem19=|v_P1Thread1of1ForFork0_#t~mem19_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} AuxVars[|v_P1_#t~mem13_96|, |v_P1_#t~mem11_82|, |v_P1_#t~ite21_53|, |v_P1_#t~ite12_77|, |v_P1_#t~mem10_58|, |v_P1_#t~mem20_56|, |v_P1_#t~ite14_95|, |v_P1_#t~ite15_85|, |v_P1_#t~ite16_75|, |v_P1_#t~ite17_65|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem20, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$mem_tmp~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_#t~ite21, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork0_#t~mem8, ~y~0, P1Thread1of1ForFork0_#t~mem10, P1Thread1of1ForFork0_#t~mem11, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0_#t~nondet7, P1Thread1of1ForFork0_#t~nondet6, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~mem13, P1Thread1of1ForFork0_#t~ite12, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~nondet9, P1Thread1of1ForFork0_#t~ite14, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite16, P1Thread1of1ForFork0_#t~ite15, P1Thread1of1ForFork0_#t~ite18, ~x$w_buff0_used~0, P1Thread1of1ForFork0_#t~ite17, ~weak$$choice0~0, P1Thread1of1ForFork0_~arg.offset, #memory_int, P1Thread1of1ForFork0_#t~mem19, ~weak$$choice2~0] and [867] $Ultimate##0-->L816: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd2~0_328 256) 0))) (let ((.cse0 (not .cse5)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_780 256) 0)))) (let ((.cse1 (select |v_#memory_int_752| |v_~#x~0.base_366|)) (.cse2 (and .cse0 .cse4)) (.cse3 (= (mod v_~x$w_buff0_used~0_781 256) 0))) (and (= v_P2Thread1of1ForFork1_~arg.base_19 |v_P2Thread1of1ForFork1_#in~arg.base_19|) (= (ite .cse0 0 1) v_~x$w_buff0_used~0_780) (= v_~z~0_174 2) (= v_~x$r_buff0_thd3~0_176 v_~x$r_buff1_thd3~0_179) (= v_~x$r_buff0_thd0~0_244 v_~x$r_buff1_thd0~0_258) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_89| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_89|) (= v_~x$r_buff0_thd1~0_353 1) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_89| 0)) (= v_~x$w_buff0~0_468 1) (= (store |v_#memory_int_752| |v_~#x~0.base_366| (store .cse1 |v_~#x~0.offset_366| |v_P1_#t~ite24_68|)) |v_#memory_int_751|) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_328) v_~x$r_buff0_thd2~0_327) (= v_~x$r_buff0_thd1~0_354 v_~x$r_buff1_thd1~0_268) (= v_~x$w_buff0~0_469 v_~x$w_buff1~0_399) (= v_P2Thread1of1ForFork1_~arg.offset_19 |v_P2Thread1of1ForFork1_#in~arg.offset_19|) (= (ite .cse3 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_89|) (= (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_689 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_327 256) 0)) .cse4)) 0 v_~x$r_buff0_thd2~0_328) v_~x$r_buff1_thd2~0_336) (or (and .cse5 (= |v_P1_#t~ite23_74| |v_P1_#t~mem22_79|) (= (select .cse1 |v_~#x~0.offset_366|) |v_P1_#t~mem22_79|) (= |v_P1_#t~ite23_74| |v_P1_#t~ite24_68|)) (and (= |v_P1_#t~ite24_68| v_~x$w_buff0~0_468) .cse0 (= |v_P1_#t~ite23_74| |v_P1Thread1of1ForFork0_#t~ite23_74|) (= |v_P1Thread1of1ForFork0_#t~mem22_74| |v_P1_#t~mem22_79|))) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_23| |v_P0Thread1of1ForFork2_~arg#1.base_23|) (= (ite (or .cse2 (and .cse0 (not .cse3))) 0 v_~x$w_buff0_used~0_781) v_~x$w_buff1_used~0_689) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_23| |v_P0Thread1of1ForFork2_~arg#1.offset_23|) (= v_~y~0_61 v_~__unbuffered_p2_EAX~0_156))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_469, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_74|, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_244, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, ~#x~0.offset=|v_~#x~0.offset_366|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_23|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_176, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_23|, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_74|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_328, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_781, #memory_int=|v_#memory_int_752|, ~#x~0.base=|v_~#x~0.base_366|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~y~0=v_~y~0_61} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_468, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_353, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_39|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_89|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_179, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_268, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_176, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_23|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_23|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_89|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_156, ~y~0=v_~y~0_61, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_244, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_19, ~#x~0.offset=|v_~#x~0.offset_366|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_23|, ~x$w_buff1~0=v_~x$w_buff1~0_399, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_336, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_689, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_327, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_258, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_23|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_780, #memory_int=|v_#memory_int_751|, ~#x~0.base=|v_~#x~0.base_366|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~z~0=v_~z~0_174} AuxVars[|v_P1_#t~ite23_74|, |v_P1_#t~ite24_68|, |v_P1_#t~mem22_79|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_~arg.offset, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-13 00:49:39,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [855] $Ultimate##0-->L809: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_240 256) 0)) (.cse2 (= (mod v_~x$w_buff0_used~0_596 256) 0)) (.cse25 (mod v_~x$w_buff0_used~0_597 256)) (.cse26 (mod v_~weak$$choice0~0_101 256))) (let ((.cse20 (= .cse26 0)) (.cse22 (= .cse25 0)) (.cse19 (= (mod v_~x$w_buff1_used~0_534 256) 0)) (.cse8 (= (mod v_~weak$$choice2~0_92 256) 0)) (.cse23 (select |v_#memory_int_588| |v_~#x~0.base_292|)) (.cse4 (not .cse2)) (.cse16 (not .cse6))) (let ((.cse3 (and .cse4 .cse16)) (.cse0 (select .cse23 |v_~#x~0.offset_292|)) (.cse7 (not (= (mod v_~x$w_buff1_used~0_533 256) 0))) (.cse1 (not .cse8)) (.cse5 (= (mod v_~x$r_buff1_thd2~0_249 256) 0)) (.cse9 (not .cse19)) (.cse10 (not .cse22)) (.cse18 (not .cse20)) (.cse21 (= (mod v_~weak$$choice1~0_222 256) 0))) (and (= v_~x$w_buff0~0_347 v_~x$w_buff0~0_346) (= |v_P1Thread1of1ForFork0_#t~nondet7_50| v_~weak$$choice2~0_92) (= v_~x$w_buff1~0_306 v_~x$w_buff1~0_305) (= v_~x$flush_delayed~0_78 0) (= .cse0 v_~x$mem_tmp~0_60) (= |v_P1Thread1of1ForFork0_#in~arg.offset_23| v_P1Thread1of1ForFork0_~arg.offset_23) (= v_~x$r_buff0_thd2~0_239 (ite .cse1 v_~x$r_buff0_thd2~0_240 (ite .cse2 v_~x$r_buff0_thd2~0_240 (ite .cse3 0 (ite (and .cse4 .cse5 .cse6 .cse7) v_~x$r_buff0_thd2~0_240 0))))) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_164 |v_~#x~0.offset_292|) (or (and (= v_~__unbuffered_p1_EAX~0_303 |v_P1_#t~mem20_56|) (= |v_P1_#t~ite21_53| |v_P1_#t~mem20_56|) .cse8) (and (= |v_P1Thread1of1ForFork0_#t~mem20_50| |v_P1_#t~mem20_56|) (= |v_P1_#t~ite21_53| v_~x$mem_tmp~0_60) .cse1)) (= v_~x$w_buff1_used~0_533 (ite .cse1 v_~x$w_buff1_used~0_534 (ite .cse2 v_~x$w_buff1_used~0_534 (ite .cse3 0 (ite (and .cse4 .cse5 .cse6 .cse9) v_~weak$$choice0~0_101 0))))) (= |v_P1Thread1of1ForFork0_#t~nondet6_50| v_~weak$$choice0~0_101) (let ((.cse11 (= |v_P1_#t~ite12_77| |v_P1Thread1of1ForFork0_#t~ite12_50|)) (.cse12 (= |v_P1Thread1of1ForFork0_#t~mem13_50| |v_P1_#t~mem13_96|)) (.cse13 (= |v_P1_#t~ite14_95| |v_P1Thread1of1ForFork0_#t~ite14_50|)) (.cse14 (= |v_P1_#t~ite15_85| |v_P1Thread1of1ForFork0_#t~ite15_50|)) (.cse15 (= |v_P1Thread1of1ForFork0_#t~mem11_50| |v_P1_#t~mem11_82|)) (.cse17 (= |v_P1_#t~ite16_75| |v_P1Thread1of1ForFork0_#t~ite16_50|))) (or (and (= |v_P1Thread1of1ForFork0_#t~mem10_50| |v_P1_#t~mem10_58|) .cse10 (or (and .cse11 .cse12 .cse13 .cse14 (= |v_P1_#t~ite17_65| v_~x$w_buff0~0_347) .cse15 .cse16 .cse17) (and (or (and .cse11 (or (and .cse12 .cse13 (= |v_P1_#t~ite15_85| (ite .cse18 v_~x$w_buff1~0_306 v_~x$w_buff0~0_347)) .cse9) (and .cse19 (= |v_P1_#t~ite14_95| |v_P1_#t~ite15_85|) (or (and .cse18 .cse12 (= |v_P1_#t~ite14_95| v_~x$w_buff0~0_347)) (and .cse20 (= |v_P1_#t~ite14_95| |v_P1_#t~mem13_96|) (= .cse0 |v_P1_#t~mem13_96|))))) (= |v_P1_#t~ite15_85| |v_P1_#t~ite16_75|) (or .cse19 (not .cse5)) .cse15) (and .cse5 .cse12 .cse13 (or (and .cse20 (= |v_P1_#t~ite12_77| (ite (not .cse21) v_~x$w_buff0~0_347 v_~x$w_buff1~0_306)) .cse15) (and .cse18 (= |v_P1_#t~ite12_77| |v_P1_#t~mem11_82|) (= .cse0 |v_P1_#t~mem11_82|))) (= |v_P1_#t~ite12_77| |v_P1_#t~ite16_75|) .cse9 .cse14)) .cse6 (= |v_P1_#t~ite17_65| |v_P1_#t~ite16_75|))) (= |v_P1_#t~ite17_65| v_~__unbuffered_p1_EAX~0_303)) (and (= v_~__unbuffered_p1_EAX~0_303 |v_P1_#t~mem10_58|) .cse11 (= .cse0 |v_P1_#t~mem10_58|) .cse12 .cse22 (= |v_P1_#t~ite17_65| |v_P1Thread1of1ForFork0_#t~ite17_49|) .cse13 .cse14 .cse15 .cse17))) (= v_P1Thread1of1ForFork0_~arg.base_23 |v_P1Thread1of1ForFork0_#in~arg.base_23|) (= (store |v_#memory_int_588| |v_~#x~0.base_292| (store .cse23 |v_~#x~0.offset_292| |v_P1_#t~ite21_53|)) |v_#memory_int_587|) (= v_~x$r_buff1_thd2~0_248 (ite .cse1 v_~x$r_buff1_thd2~0_249 (ite .cse2 v_~x$r_buff1_thd2~0_249 (let ((.cse24 (= (mod v_~x$r_buff0_thd2~0_239 256) 0))) (ite (and .cse4 (not .cse24)) 0 (ite (and .cse4 .cse5 .cse7 .cse24) (ite .cse18 v_~x$r_buff1_thd2~0_249 0) 0)))))) (= v_~__unbuffered_p1_EAX$read_delayed~0_165 1) (= v_~y~0_43 1) (= v_~weak$$choice1~0_222 |v_P1Thread1of1ForFork0_#t~nondet9_50|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_164 |v_~#x~0.base_292|) (= v_~x$w_buff0_used~0_596 (ite (= (ite .cse1 .cse25 (ite .cse22 .cse25 (ite (and .cse10 .cse16) 0 (ite (and .cse5 .cse6 .cse9 .cse10) (ite (or .cse18 .cse21) 1 0) .cse26)))) 0) 0 1)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_347, P1Thread1of1ForFork0_#t~mem10=|v_P1Thread1of1ForFork0_#t~mem10_50|, P1Thread1of1ForFork0_#t~mem11=|v_P1Thread1of1ForFork0_#t~mem11_50|, P1Thread1of1ForFork0_#t~mem20=|v_P1Thread1of1ForFork0_#t~mem20_50|, P1Thread1of1ForFork0_#t~nondet7=|v_P1Thread1of1ForFork0_#t~nondet7_50|, ~#x~0.offset=|v_~#x~0.offset_292|, P1Thread1of1ForFork0_#t~nondet6=|v_P1Thread1of1ForFork0_#t~nondet6_50|, ~x$w_buff1~0=v_~x$w_buff1~0_306, P1Thread1of1ForFork0_#t~mem13=|v_P1Thread1of1ForFork0_#t~mem13_50|, P1Thread1of1ForFork0_#t~ite12=|v_P1Thread1of1ForFork0_#t~ite12_50|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_249, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_534, P1Thread1of1ForFork0_#t~nondet9=|v_P1Thread1of1ForFork0_#t~nondet9_50|, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_50|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_240, P1Thread1of1ForFork0_#t~ite16=|v_P1Thread1of1ForFork0_#t~ite16_50|, P1Thread1of1ForFork0_#t~ite15=|v_P1Thread1of1ForFork0_#t~ite15_50|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_597, P1Thread1of1ForFork0_#t~ite17=|v_P1Thread1of1ForFork0_#t~ite17_49|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, #memory_int=|v_#memory_int_588|, ~#x~0.base=|v_~#x~0.base_292|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_346, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_165, ~x$mem_tmp~0=v_~x$mem_tmp~0_60, ~weak$$choice1~0=v_~weak$$choice1~0_222, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_303, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_27|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_164, P1Thread1of1ForFork0_#t~mem8=|v_P1Thread1of1ForFork0_#t~mem8_27|, ~y~0=v_~y~0_43, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_23, ~#x~0.offset=|v_~#x~0.offset_292|, ~x$w_buff1~0=v_~x$w_buff1~0_305, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_164, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_248, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_533, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_239, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_596, ~weak$$choice0~0=v_~weak$$choice0~0_101, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_23, #memory_int=|v_#memory_int_587|, ~#x~0.base=|v_~#x~0.base_292|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|, P1Thread1of1ForFork0_#t~mem19=|v_P1Thread1of1ForFork0_#t~mem19_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} AuxVars[|v_P1_#t~mem13_96|, |v_P1_#t~mem11_82|, |v_P1_#t~ite21_53|, |v_P1_#t~ite12_77|, |v_P1_#t~mem10_58|, |v_P1_#t~mem20_56|, |v_P1_#t~ite14_95|, |v_P1_#t~ite15_85|, |v_P1_#t~ite16_75|, |v_P1_#t~ite17_65|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem20, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$mem_tmp~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_#t~ite21, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork0_#t~mem8, ~y~0, P1Thread1of1ForFork0_#t~mem10, P1Thread1of1ForFork0_#t~mem11, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0_#t~nondet7, P1Thread1of1ForFork0_#t~nondet6, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~mem13, P1Thread1of1ForFork0_#t~ite12, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~nondet9, P1Thread1of1ForFork0_#t~ite14, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite16, P1Thread1of1ForFork0_#t~ite15, P1Thread1of1ForFork0_#t~ite18, ~x$w_buff0_used~0, P1Thread1of1ForFork0_#t~ite17, ~weak$$choice0~0, P1Thread1of1ForFork0_~arg.offset, #memory_int, P1Thread1of1ForFork0_#t~mem19, ~weak$$choice2~0] and [868] $Ultimate##0-->L780: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff0_thd1~0_358 256) 0))) (.cse0 (= (mod v_~x$w_buff0_used~0_785 256) 0)) (.cse2 (not (= (mod v_~x$w_buff0_used~0_784 256) 0)))) (and (= v_~x$r_buff0_thd3~0_178 v_~x$r_buff1_thd3~0_181) (= v_~x$r_buff0_thd2~0_331 v_~x$r_buff1_thd2~0_338) (= (ite .cse0 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_91|) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_25| |v_P0Thread1of1ForFork2_~arg#1.base_25|) (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y~0_63 v_~__unbuffered_p2_EAX~0_158) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_91| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_91|) (= v_~x$w_buff0~0_473 v_~x$w_buff1~0_401) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_25| |v_P0Thread1of1ForFork2_~arg#1.offset_25|) (= v_~x$w_buff0~0_472 1) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|) (= (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_691 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_357 256) 0)) .cse2)) 0 v_~x$r_buff0_thd1~0_358) v_~x$r_buff1_thd1~0_270) (= v_~x$w_buff1_used~0_691 (ite (or .cse2 (and .cse1 (not .cse0))) 0 v_~x$w_buff0_used~0_785)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_91| 0)) (= (store |v_#memory_int_756| |v_~#x~0.base_368| (store (select |v_#memory_int_756| |v_~#x~0.base_368|) |v_~#x~0.offset_368| v_~x$w_buff0~0_472)) |v_#memory_int_755|) (= v_~x$r_buff0_thd1~0_357 (ite .cse2 0 1)) (= v_~z~0_178 2) (= v_~x$w_buff0_used~0_784 0) (= v_~x$r_buff0_thd0~0_246 v_~x$r_buff1_thd0~0_260))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_473, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_246, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_358, ~#x~0.offset=|v_~#x~0.offset_368|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_25|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_178, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_25|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_331, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_785, #memory_int=|v_#memory_int_756|, ~#x~0.base=|v_~#x~0.base_368|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_63} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_472, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_357, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_91|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_181, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_270, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_135|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_178, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_25|, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_135|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_25|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_91|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_158, ~y~0=v_~y~0_63, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_246, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, ~#x~0.offset=|v_~#x~0.offset_368|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_25|, ~x$w_buff1~0=v_~x$w_buff1~0_401, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_691, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_338, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_331, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_260, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_784, #memory_int=|v_#memory_int_755|, ~#x~0.base=|v_~#x~0.base_368|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_178, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_71|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_~arg.offset, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p2_EAX~0, ~z~0, P0Thread1of1ForFork2_#t~ite5#1] [2022-12-13 00:49:40,820 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [855] $Ultimate##0-->L809: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_240 256) 0)) (.cse2 (= (mod v_~x$w_buff0_used~0_596 256) 0)) (.cse25 (mod v_~x$w_buff0_used~0_597 256)) (.cse26 (mod v_~weak$$choice0~0_101 256))) (let ((.cse20 (= .cse26 0)) (.cse22 (= .cse25 0)) (.cse19 (= (mod v_~x$w_buff1_used~0_534 256) 0)) (.cse8 (= (mod v_~weak$$choice2~0_92 256) 0)) (.cse23 (select |v_#memory_int_588| |v_~#x~0.base_292|)) (.cse4 (not .cse2)) (.cse16 (not .cse6))) (let ((.cse3 (and .cse4 .cse16)) (.cse0 (select .cse23 |v_~#x~0.offset_292|)) (.cse7 (not (= (mod v_~x$w_buff1_used~0_533 256) 0))) (.cse1 (not .cse8)) (.cse5 (= (mod v_~x$r_buff1_thd2~0_249 256) 0)) (.cse9 (not .cse19)) (.cse10 (not .cse22)) (.cse18 (not .cse20)) (.cse21 (= (mod v_~weak$$choice1~0_222 256) 0))) (and (= v_~x$w_buff0~0_347 v_~x$w_buff0~0_346) (= |v_P1Thread1of1ForFork0_#t~nondet7_50| v_~weak$$choice2~0_92) (= v_~x$w_buff1~0_306 v_~x$w_buff1~0_305) (= v_~x$flush_delayed~0_78 0) (= .cse0 v_~x$mem_tmp~0_60) (= |v_P1Thread1of1ForFork0_#in~arg.offset_23| v_P1Thread1of1ForFork0_~arg.offset_23) (= v_~x$r_buff0_thd2~0_239 (ite .cse1 v_~x$r_buff0_thd2~0_240 (ite .cse2 v_~x$r_buff0_thd2~0_240 (ite .cse3 0 (ite (and .cse4 .cse5 .cse6 .cse7) v_~x$r_buff0_thd2~0_240 0))))) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_164 |v_~#x~0.offset_292|) (or (and (= v_~__unbuffered_p1_EAX~0_303 |v_P1_#t~mem20_56|) (= |v_P1_#t~ite21_53| |v_P1_#t~mem20_56|) .cse8) (and (= |v_P1Thread1of1ForFork0_#t~mem20_50| |v_P1_#t~mem20_56|) (= |v_P1_#t~ite21_53| v_~x$mem_tmp~0_60) .cse1)) (= v_~x$w_buff1_used~0_533 (ite .cse1 v_~x$w_buff1_used~0_534 (ite .cse2 v_~x$w_buff1_used~0_534 (ite .cse3 0 (ite (and .cse4 .cse5 .cse6 .cse9) v_~weak$$choice0~0_101 0))))) (= |v_P1Thread1of1ForFork0_#t~nondet6_50| v_~weak$$choice0~0_101) (let ((.cse11 (= |v_P1_#t~ite12_77| |v_P1Thread1of1ForFork0_#t~ite12_50|)) (.cse12 (= |v_P1Thread1of1ForFork0_#t~mem13_50| |v_P1_#t~mem13_96|)) (.cse13 (= |v_P1_#t~ite14_95| |v_P1Thread1of1ForFork0_#t~ite14_50|)) (.cse14 (= |v_P1_#t~ite15_85| |v_P1Thread1of1ForFork0_#t~ite15_50|)) (.cse15 (= |v_P1Thread1of1ForFork0_#t~mem11_50| |v_P1_#t~mem11_82|)) (.cse17 (= |v_P1_#t~ite16_75| |v_P1Thread1of1ForFork0_#t~ite16_50|))) (or (and (= |v_P1Thread1of1ForFork0_#t~mem10_50| |v_P1_#t~mem10_58|) .cse10 (or (and .cse11 .cse12 .cse13 .cse14 (= |v_P1_#t~ite17_65| v_~x$w_buff0~0_347) .cse15 .cse16 .cse17) (and (or (and .cse11 (or (and .cse12 .cse13 (= |v_P1_#t~ite15_85| (ite .cse18 v_~x$w_buff1~0_306 v_~x$w_buff0~0_347)) .cse9) (and .cse19 (= |v_P1_#t~ite14_95| |v_P1_#t~ite15_85|) (or (and .cse18 .cse12 (= |v_P1_#t~ite14_95| v_~x$w_buff0~0_347)) (and .cse20 (= |v_P1_#t~ite14_95| |v_P1_#t~mem13_96|) (= .cse0 |v_P1_#t~mem13_96|))))) (= |v_P1_#t~ite15_85| |v_P1_#t~ite16_75|) (or .cse19 (not .cse5)) .cse15) (and .cse5 .cse12 .cse13 (or (and .cse20 (= |v_P1_#t~ite12_77| (ite (not .cse21) v_~x$w_buff0~0_347 v_~x$w_buff1~0_306)) .cse15) (and .cse18 (= |v_P1_#t~ite12_77| |v_P1_#t~mem11_82|) (= .cse0 |v_P1_#t~mem11_82|))) (= |v_P1_#t~ite12_77| |v_P1_#t~ite16_75|) .cse9 .cse14)) .cse6 (= |v_P1_#t~ite17_65| |v_P1_#t~ite16_75|))) (= |v_P1_#t~ite17_65| v_~__unbuffered_p1_EAX~0_303)) (and (= v_~__unbuffered_p1_EAX~0_303 |v_P1_#t~mem10_58|) .cse11 (= .cse0 |v_P1_#t~mem10_58|) .cse12 .cse22 (= |v_P1_#t~ite17_65| |v_P1Thread1of1ForFork0_#t~ite17_49|) .cse13 .cse14 .cse15 .cse17))) (= v_P1Thread1of1ForFork0_~arg.base_23 |v_P1Thread1of1ForFork0_#in~arg.base_23|) (= (store |v_#memory_int_588| |v_~#x~0.base_292| (store .cse23 |v_~#x~0.offset_292| |v_P1_#t~ite21_53|)) |v_#memory_int_587|) (= v_~x$r_buff1_thd2~0_248 (ite .cse1 v_~x$r_buff1_thd2~0_249 (ite .cse2 v_~x$r_buff1_thd2~0_249 (let ((.cse24 (= (mod v_~x$r_buff0_thd2~0_239 256) 0))) (ite (and .cse4 (not .cse24)) 0 (ite (and .cse4 .cse5 .cse7 .cse24) (ite .cse18 v_~x$r_buff1_thd2~0_249 0) 0)))))) (= v_~__unbuffered_p1_EAX$read_delayed~0_165 1) (= v_~y~0_43 1) (= v_~weak$$choice1~0_222 |v_P1Thread1of1ForFork0_#t~nondet9_50|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_164 |v_~#x~0.base_292|) (= v_~x$w_buff0_used~0_596 (ite (= (ite .cse1 .cse25 (ite .cse22 .cse25 (ite (and .cse10 .cse16) 0 (ite (and .cse5 .cse6 .cse9 .cse10) (ite (or .cse18 .cse21) 1 0) .cse26)))) 0) 0 1)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_347, P1Thread1of1ForFork0_#t~mem10=|v_P1Thread1of1ForFork0_#t~mem10_50|, P1Thread1of1ForFork0_#t~mem11=|v_P1Thread1of1ForFork0_#t~mem11_50|, P1Thread1of1ForFork0_#t~mem20=|v_P1Thread1of1ForFork0_#t~mem20_50|, P1Thread1of1ForFork0_#t~nondet7=|v_P1Thread1of1ForFork0_#t~nondet7_50|, ~#x~0.offset=|v_~#x~0.offset_292|, P1Thread1of1ForFork0_#t~nondet6=|v_P1Thread1of1ForFork0_#t~nondet6_50|, ~x$w_buff1~0=v_~x$w_buff1~0_306, P1Thread1of1ForFork0_#t~mem13=|v_P1Thread1of1ForFork0_#t~mem13_50|, P1Thread1of1ForFork0_#t~ite12=|v_P1Thread1of1ForFork0_#t~ite12_50|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_249, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_534, P1Thread1of1ForFork0_#t~nondet9=|v_P1Thread1of1ForFork0_#t~nondet9_50|, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_50|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_240, P1Thread1of1ForFork0_#t~ite16=|v_P1Thread1of1ForFork0_#t~ite16_50|, P1Thread1of1ForFork0_#t~ite15=|v_P1Thread1of1ForFork0_#t~ite15_50|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_597, P1Thread1of1ForFork0_#t~ite17=|v_P1Thread1of1ForFork0_#t~ite17_49|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, #memory_int=|v_#memory_int_588|, ~#x~0.base=|v_~#x~0.base_292|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_346, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_165, ~x$mem_tmp~0=v_~x$mem_tmp~0_60, ~weak$$choice1~0=v_~weak$$choice1~0_222, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_303, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_27|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_164, P1Thread1of1ForFork0_#t~mem8=|v_P1Thread1of1ForFork0_#t~mem8_27|, ~y~0=v_~y~0_43, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_23, ~#x~0.offset=|v_~#x~0.offset_292|, ~x$w_buff1~0=v_~x$w_buff1~0_305, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_164, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_248, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_533, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_239, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_596, ~weak$$choice0~0=v_~weak$$choice0~0_101, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_23, #memory_int=|v_#memory_int_587|, ~#x~0.base=|v_~#x~0.base_292|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|, P1Thread1of1ForFork0_#t~mem19=|v_P1Thread1of1ForFork0_#t~mem19_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} AuxVars[|v_P1_#t~mem13_96|, |v_P1_#t~mem11_82|, |v_P1_#t~ite21_53|, |v_P1_#t~ite12_77|, |v_P1_#t~mem10_58|, |v_P1_#t~mem20_56|, |v_P1_#t~ite14_95|, |v_P1_#t~ite15_85|, |v_P1_#t~ite16_75|, |v_P1_#t~ite17_65|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem20, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$mem_tmp~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_#t~ite21, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork0_#t~mem8, ~y~0, P1Thread1of1ForFork0_#t~mem10, P1Thread1of1ForFork0_#t~mem11, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0_#t~nondet7, P1Thread1of1ForFork0_#t~nondet6, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~mem13, P1Thread1of1ForFork0_#t~ite12, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~nondet9, P1Thread1of1ForFork0_#t~ite14, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite16, P1Thread1of1ForFork0_#t~ite15, P1Thread1of1ForFork0_#t~ite18, ~x$w_buff0_used~0, P1Thread1of1ForFork0_#t~ite17, ~weak$$choice0~0, P1Thread1of1ForFork0_~arg.offset, #memory_int, P1Thread1of1ForFork0_#t~mem19, ~weak$$choice2~0] and [869] $Ultimate##0-->L836: Formula: (let ((.cse1 (= (mod v_~x$r_buff0_thd3~0_181 256) 0))) (let ((.cse0 (not .cse1)) (.cse5 (not (= (mod v_~x$w_buff0_used~0_788 256) 0)))) (let ((.cse2 (select |v_#memory_int_760| |v_~#x~0.base_370|)) (.cse3 (= (mod v_~x$w_buff0_used~0_789 256) 0)) (.cse4 (and .cse0 .cse5))) (and (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_27| |v_P0Thread1of1ForFork2_~arg#1.offset_27|) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_27| |v_P0Thread1of1ForFork2_~arg#1.base_27|) (or (and (= |v_P2Thread1of1ForFork1_#t~mem25_54| |v_P2_#t~mem25_61|) (= |v_P2_#t~ite27_52| v_~x$w_buff0~0_476) .cse0 (= |v_P2_#t~ite26_58| |v_P2Thread1of1ForFork1_#t~ite26_54|)) (and .cse1 (= |v_P2_#t~ite26_58| |v_P2_#t~mem25_61|) (= |v_P2_#t~mem25_61| (select .cse2 |v_~#x~0.offset_370|)) (= |v_P2_#t~ite26_58| |v_P2_#t~ite27_52|))) (= v_~y~0_65 v_~__unbuffered_p2_EAX~0_160) (= v_~x$w_buff0~0_476 1) (= v_~x$r_buff0_thd0~0_248 v_~x$r_buff1_thd0~0_262) (= v_~x$r_buff0_thd1~0_361 1) (= v_~x$r_buff0_thd1~0_362 v_~x$r_buff1_thd1~0_272) (= v_~x$w_buff0~0_477 v_~x$w_buff1~0_403) (= v_~z~0_182 2) (= (store |v_#memory_int_760| |v_~#x~0.base_370| (store .cse2 |v_~#x~0.offset_370| |v_P2_#t~ite27_52|)) |v_#memory_int_759|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_93| (ite .cse3 1 0)) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_~x$r_buff0_thd2~0_333 v_~x$r_buff1_thd2~0_340) (= (ite (or (and (not .cse3) .cse0) .cse4) 0 v_~x$w_buff0_used~0_789) v_~x$w_buff1_used~0_693) (= v_~x$w_buff0_used~0_788 (ite .cse0 0 1)) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_181) v_~x$r_buff0_thd3~0_180) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_93| 0)) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|) (= v_~x$r_buff1_thd3~0_183 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_693 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_180 256) 0)) .cse5)) 0 v_~x$r_buff0_thd3~0_181)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_93| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_93|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_477, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_248, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ~#x~0.offset=|v_~#x~0.offset_370|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_27|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_54|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_181, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_27|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_333, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_789, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_54|, #memory_int=|v_#memory_int_760|, ~#x~0.base=|v_~#x~0.base_370|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_65} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_476, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_361, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_183, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_93|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_272, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_180, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_27|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_27|, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_29|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_93|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_160, ~y~0=v_~y~0_65, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_248, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, ~#x~0.offset=|v_~#x~0.offset_370|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_27|, ~x$w_buff1~0=v_~x$w_buff1~0_403, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_693, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_340, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_333, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_262, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_788, #memory_int=|v_#memory_int_759|, ~#x~0.base=|v_~#x~0.base_370|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_182} AuxVars[|v_P2_#t~ite27_52|, |v_P2_#t~mem25_61|, |v_P2_#t~ite26_58|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~mem25, ~x$w_buff1~0, ~x$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-13 00:49:43,323 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:49:43,323 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9859 [2022-12-13 00:49:43,323 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 364 flow [2022-12-13 00:49:43,323 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:49:43,323 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:43,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:43,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:49:43,324 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:43,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1086362019, now seen corresponding path program 1 times [2022-12-13 00:49:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:43,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391130034] [2022-12-13 00:49:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:49:43,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:49:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:49:43,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:49:43,456 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:49:43,457 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:49:43,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:49:43,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:49:43,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:49:43,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:49:43,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:49:43,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:49:43,459 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:43,462 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:49:43,463 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:49:43,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:49:43 BasicIcfg [2022-12-13 00:49:43,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:49:43,548 INFO L158 Benchmark]: Toolchain (without parser) took 36271.41ms. Allocated memory was 206.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 180.6MB in the beginning and 854.9MB in the end (delta: -674.3MB). Peak memory consumption was 326.5MB. Max. memory is 8.0GB. [2022-12-13 00:49:43,549 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 206.6MB. Free memory was 183.0MB in the beginning and 182.9MB in the end (delta: 129.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:49:43,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.45ms. Allocated memory is still 206.6MB. Free memory was 180.0MB in the beginning and 152.7MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 00:49:43,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 206.6MB. Free memory was 152.7MB in the beginning and 150.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:49:43,549 INFO L158 Benchmark]: Boogie Preprocessor took 54.20ms. Allocated memory is still 206.6MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:49:43,549 INFO L158 Benchmark]: RCFGBuilder took 888.01ms. Allocated memory was 206.6MB in the beginning and 267.4MB in the end (delta: 60.8MB). Free memory was 147.5MB in the beginning and 228.7MB in the end (delta: -81.1MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. [2022-12-13 00:49:43,550 INFO L158 Benchmark]: TraceAbstraction took 34811.66ms. Allocated memory was 267.4MB in the beginning and 1.2GB in the end (delta: 939.5MB). Free memory was 227.6MB in the beginning and 854.9MB in the end (delta: -627.3MB). Peak memory consumption was 312.8MB. Max. memory is 8.0GB. [2022-12-13 00:49:43,551 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 206.6MB. Free memory was 183.0MB in the beginning and 182.9MB in the end (delta: 129.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.45ms. Allocated memory is still 206.6MB. Free memory was 180.0MB in the beginning and 152.7MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 206.6MB. Free memory was 152.7MB in the beginning and 150.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.20ms. Allocated memory is still 206.6MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 888.01ms. Allocated memory was 206.6MB in the beginning and 267.4MB in the end (delta: 60.8MB). Free memory was 147.5MB in the beginning and 228.7MB in the end (delta: -81.1MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. * TraceAbstraction took 34811.66ms. Allocated memory was 267.4MB in the beginning and 1.2GB in the end (delta: 939.5MB). Free memory was 227.6MB in the beginning and 854.9MB in the end (delta: -627.3MB). Peak memory consumption was 312.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 132 PlacesBefore, 75 PlacesAfterwards, 124 TransitionsBefore, 65 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 42 ConcurrentYvCompositions, 5 ChoiceCompositions, 106 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3562, independent: 3381, independent conditional: 3381, independent unconditional: 0, dependent: 181, dependent conditional: 181, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3562, independent: 3381, independent conditional: 0, independent unconditional: 3381, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3562, independent: 3381, independent conditional: 0, independent unconditional: 3381, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3562, independent: 3381, independent conditional: 0, independent unconditional: 3381, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1805, independent: 1745, independent conditional: 0, independent unconditional: 1745, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1805, independent: 1720, independent conditional: 0, independent unconditional: 1720, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 85, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 494, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 467, dependent conditional: 0, dependent unconditional: 467, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3562, independent: 1636, independent conditional: 0, independent unconditional: 1636, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1805, unknown conditional: 0, unknown unconditional: 1805] , Statistics on independence cache: Total cache size (in pairs): 3808, Positive cache size: 3748, Positive conditional cache size: 0, Positive unconditional cache size: 3748, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, 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, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 227, independent: 193, independent conditional: 193, 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: 227, independent: 193, independent conditional: 16, independent unconditional: 177, dependent: 34, dependent conditional: 13, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 227, independent: 193, independent conditional: 16, independent unconditional: 177, dependent: 34, dependent conditional: 13, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 227, independent: 193, independent conditional: 16, independent unconditional: 177, dependent: 34, dependent conditional: 13, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 201, independent: 177, independent conditional: 16, independent unconditional: 161, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 201, independent: 159, independent conditional: 0, independent unconditional: 159, 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: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 120, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 86, dependent conditional: 53, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 227, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 201, unknown conditional: 24, unknown unconditional: 177] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 177, Positive conditional cache size: 16, Positive unconditional cache size: 161, Negative cache size: 24, Negative conditional cache size: 8, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 218, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 218, independent: 186, independent conditional: 7, independent unconditional: 179, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 218, independent: 186, independent conditional: 0, independent unconditional: 186, 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: 218, independent: 186, independent conditional: 0, independent unconditional: 186, 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: 23, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 218, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 192, Positive conditional cache size: 16, Positive unconditional cache size: 176, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 45 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 341, independent: 282, independent conditional: 282, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 341, independent: 282, independent conditional: 26, independent unconditional: 256, dependent: 59, dependent conditional: 16, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 341, independent: 282, independent conditional: 0, independent unconditional: 282, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 341, independent: 282, independent conditional: 0, independent unconditional: 282, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 111, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 341, independent: 280, independent conditional: 0, independent unconditional: 280, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 204, Positive conditional cache size: 16, Positive unconditional cache size: 188, Negative cache size: 38, Negative conditional cache size: 8, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 369, independent: 317, independent conditional: 317, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 369, independent: 317, independent conditional: 37, independent unconditional: 280, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 369, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 369, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 246, Positive conditional cache size: 16, Positive unconditional cache size: 230, Negative cache size: 43, Negative conditional cache size: 8, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 49 PlacesBefore, 48 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 69, independent conditional: 55, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 69, independent conditional: 44, independent unconditional: 25, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 69, independent conditional: 44, independent unconditional: 25, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 18, 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: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, independent: 49, independent conditional: 26, independent unconditional: 23, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 20, unknown conditional: 18, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 292, Positive conditional cache size: 35, Positive unconditional cache size: 257, Negative cache size: 43, Negative conditional cache size: 8, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 14, 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: 18, independent: 14, independent conditional: 8, independent unconditional: 6, 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: 18, independent: 14, independent conditional: 5, independent unconditional: 9, 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: 18, independent: 14, independent conditional: 5, independent unconditional: 9, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 338, Positive cache size: 293, Positive conditional cache size: 35, Positive unconditional cache size: 258, Negative cache size: 45, Negative conditional cache size: 8, Negative unconditional cache size: 37, 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, 52 PlacesBefore, 52 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 293, Positive conditional cache size: 35, Positive unconditional cache size: 258, Negative cache size: 46, Negative conditional cache size: 8, Negative unconditional cache size: 38, 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, 58 TransitionsBefore, 58 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 296, Positive conditional cache size: 35, Positive unconditional cache size: 261, Negative cache size: 46, Negative conditional cache size: 8, Negative unconditional cache size: 38, 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, 59 PlacesBefore, 59 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 296, Positive conditional cache size: 35, Positive unconditional cache size: 261, Negative cache size: 47, Negative conditional cache size: 8, Negative unconditional cache size: 39, 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: 9.8s, 56 PlacesBefore, 54 PlacesAfterwards, 53 TransitionsBefore, 51 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 94, independent conditional: 94, 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: 94, independent: 94, independent conditional: 94, 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: 94, independent: 94, independent conditional: 76, independent unconditional: 18, 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: 94, independent: 94, independent conditional: 76, independent unconditional: 18, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, independent: 89, independent conditional: 72, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 341, Positive conditional cache size: 39, Positive unconditional cache size: 302, Negative cache size: 47, Negative conditional cache size: 8, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L753] 0 int z = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1964; [L854] FCALL, FORK 0 pthread_create(&t1964, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1964, ((void *)0), P0, ((void *)0))=-1, t1964={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t1965; [L856] FCALL, FORK 0 pthread_create(&t1965, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1965, ((void *)0), P1, ((void *)0))=0, t1964={7:0}, t1965={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t1966; [L858] FCALL, FORK 0 pthread_create(&t1966, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1966, ((void *)0), P2, ((void *)0))=1, t1964={7:0}, t1965={8:0}, t1966={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 [L808] 2 y = 1 [L825] 2 __unbuffered_p2_EAX = y [L828] 2 z = 1 [L760] 2 z = 2 [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 1 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd1 = (_Bool)1 [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 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) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 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 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 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) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 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 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 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 [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 856]: 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: 858]: 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, 154 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: 34.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 790 IncrementalHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 3 mSDtfsCounter, 790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=10, InterpolantAutomatonStates: 38, 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.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 1350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:49:43,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...