/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:58:28,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:58:28,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:58:28,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:58:28,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:58:28,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:58:28,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:58:28,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:58:28,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:58:28,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:58:28,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:58:28,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:58:28,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:58:28,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:58:28,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:58:28,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:58:28,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:58:28,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:58:28,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:58:28,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:58:28,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:58:28,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:58:28,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:58:28,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:58:28,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:58:28,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:58:28,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:58:28,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:58:28,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:58:28,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:58:28,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:58:28,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:58:28,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:58:28,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:58:28,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:58:28,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:58:28,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:58:28,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:58:28,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:58:28,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:58:28,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:58:28,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:58:28,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:58:28,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:58:28,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:58:28,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:58:28,728 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:58:28,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:58:28,729 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:58:28,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:58:28,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:58:28,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:58:28,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:58:28,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:58:28,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:58:28,731 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:58:28,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:58:28,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:58:28,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:58:28,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:58:28,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:58:28,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:58:28,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:58:28,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:58:28,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:58:28,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:58:28,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:58:28,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:58:28,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:58:28,733 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:58:28,733 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 11:58:29,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:58:29,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:58:29,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:58:29,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:58:29,062 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:58:29,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2022-12-13 11:58:30,176 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:58:30,425 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:58:30,426 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2022-12-13 11:58:30,452 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0e9eb18/1ba69356e201416cb4e1ed214d03956d/FLAG1ada43ed3 [2022-12-13 11:58:30,467 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0e9eb18/1ba69356e201416cb4e1ed214d03956d [2022-12-13 11:58:30,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:58:30,470 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:58:30,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:58:30,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:58:30,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:58:30,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:58:30" (1/1) ... [2022-12-13 11:58:30,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@146270a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:30, skipping insertion in model container [2022-12-13 11:58:30,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:58:30" (1/1) ... [2022-12-13 11:58:30,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:58:30,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:58:30,664 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/safe000_rmo.i[988,1001] [2022-12-13 11:58:30,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:58:30,933 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:58:30,945 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/safe000_rmo.i[988,1001] [2022-12-13 11:58:30,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:30,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:30,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:31,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:31,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:31,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:31,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:31,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:58:31,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:58:31,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:58:31,066 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:58:31,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31 WrapperNode [2022-12-13 11:58:31,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:58:31,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:58:31,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:58:31,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:58:31,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (1/1) ... [2022-12-13 11:58:31,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (1/1) ... [2022-12-13 11:58:31,146 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-12-13 11:58:31,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:58:31,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:58:31,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:58:31,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:58:31,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (1/1) ... [2022-12-13 11:58:31,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (1/1) ... [2022-12-13 11:58:31,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (1/1) ... [2022-12-13 11:58:31,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (1/1) ... [2022-12-13 11:58:31,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (1/1) ... [2022-12-13 11:58:31,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (1/1) ... [2022-12-13 11:58:31,191 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (1/1) ... [2022-12-13 11:58:31,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (1/1) ... [2022-12-13 11:58:31,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:58:31,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:58:31,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:58:31,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:58:31,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (1/1) ... [2022-12-13 11:58:31,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:58:31,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:58:31,256 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 11:58:31,278 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 11:58:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:58:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:58:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:58:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:58:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:58:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:58:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:58:31,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:58:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:58:31,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:58:31,296 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:58:31,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:58:31,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:58:31,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:58:31,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:58:31,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:58:31,298 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 11:58:31,460 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:58:31,461 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:58:31,946 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:58:32,282 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:58:32,283 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:58:32,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:58:32 BoogieIcfgContainer [2022-12-13 11:58:32,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:58:32,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:58:32,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:58:32,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:58:32,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:58:30" (1/3) ... [2022-12-13 11:58:32,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3893880e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:58:32, skipping insertion in model container [2022-12-13 11:58:32,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:58:31" (2/3) ... [2022-12-13 11:58:32,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3893880e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:58:32, skipping insertion in model container [2022-12-13 11:58:32,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:58:32" (3/3) ... [2022-12-13 11:58:32,293 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2022-12-13 11:58:32,309 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:58:32,309 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 11:58:32,309 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:58:32,373 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:58:32,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 11:58:32,475 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 11:58:32,476 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:32,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 11:58:32,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 11:58:32,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-13 11:58:32,489 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:32,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 11:58:32,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-13 11:58:32,566 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-13 11:58:32,566 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:32,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 11:58:32,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 11:58:32,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-13 11:58:41,944 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-13 11:58:41,966 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:58:41,972 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;@d482008, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:58:41,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 11:58:41,978 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 11:58:41,978 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:41,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:41,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:41,980 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:41,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:41,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1030704551, now seen corresponding path program 1 times [2022-12-13 11:58:41,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:41,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585888310] [2022-12-13 11:58:41,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:42,211 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 11:58:42,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:42,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585888310] [2022-12-13 11:58:42,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585888310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:42,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:42,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:42,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103057540] [2022-12-13 11:58:42,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:42,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 11:58:42,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:42,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 11:58:42,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:58:42,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 11:58:42,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:42,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:42,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 11:58:42,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:42,554 INFO L130 PetriNetUnfolder]: 909/1443 cut-off events. [2022-12-13 11:58:42,554 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 11:58:42,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2856 conditions, 1443 events. 909/1443 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7299 event pairs, 909 based on Foata normal form. 0/1146 useless extension candidates. Maximal degree in co-relation 2845. Up to 1359 conditions per place. [2022-12-13 11:58:42,568 INFO L137 encePairwiseOnDemand]: 29/30 looper letters, 20 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2022-12-13 11:58:42,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 107 flow [2022-12-13 11:58:42,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 11:58:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 11:58:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2022-12-13 11:58:42,578 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 11:58:42,580 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 39 transitions. [2022-12-13 11:58:42,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 107 flow [2022-12-13 11:58:42,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:58:42,584 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2022-12-13 11:58:42,585 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 11:58:42,589 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-13 11:58:42,589 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:42,590 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 64 flow [2022-12-13 11:58:42,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:42,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:42,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 64 flow [2022-12-13 11:58:42,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 64 flow [2022-12-13 11:58:42,609 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 11:58:42,609 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:42,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 64 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 11:58:42,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 64 flow [2022-12-13 11:58:42,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-13 11:58:42,813 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:42,815 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-13 11:58:42,815 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 64 flow [2022-12-13 11:58:42,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:42,816 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:42,816 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:42,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:58:42,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1630361540, now seen corresponding path program 1 times [2022-12-13 11:58:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:42,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609670489] [2022-12-13 11:58:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:43,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 11:58:43,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:43,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609670489] [2022-12-13 11:58:43,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609670489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:43,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:43,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444563222] [2022-12-13 11:58:43,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:43,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:43,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:43,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:43,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 11:58:43,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 11:58:43,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:43,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 11:58:43,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:43,550 INFO L130 PetriNetUnfolder]: 858/1428 cut-off events. [2022-12-13 11:58:43,551 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:43,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2767 conditions, 1428 events. 858/1428 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7537 event pairs, 302 based on Foata normal form. 20/1172 useless extension candidates. Maximal degree in co-relation 2759. Up to 1125 conditions per place. [2022-12-13 11:58:43,561 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 29 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-12-13 11:58:43,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 150 flow [2022-12-13 11:58:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 11:58:43,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2022-12-13 11:58:43,563 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 64 flow. Second operand 3 states and 59 transitions. [2022-12-13 11:58:43,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 150 flow [2022-12-13 11:58:43,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 150 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:58:43,565 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 72 flow [2022-12-13 11:58:43,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-13 11:58:43,566 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2022-12-13 11:58:43,566 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:43,566 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 72 flow [2022-12-13 11:58:43,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:43,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:43,567 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 72 flow [2022-12-13 11:58:43,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 72 flow [2022-12-13 11:58:43,578 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 11:58:43,579 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:58:43,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:58:43,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 72 flow [2022-12-13 11:58:43,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 11:58:43,582 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:43,584 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 11:58:43,584 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 72 flow [2022-12-13 11:58:43,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 11:58:43,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:43,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:43,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:58:43,585 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:43,587 INFO L85 PathProgramCache]: Analyzing trace with hash 998400372, now seen corresponding path program 1 times [2022-12-13 11:58:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:43,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529051128] [2022-12-13 11:58:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:43,849 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 11:58:43,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:43,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529051128] [2022-12-13 11:58:43,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529051128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:43,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:43,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:58:43,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480609288] [2022-12-13 11:58:43,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:43,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:58:43,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:43,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:58:43,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:58:43,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 11:58:43,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 72 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 11:58:43,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:43,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 11:58:43,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:44,109 INFO L130 PetriNetUnfolder]: 818/1380 cut-off events. [2022-12-13 11:58:44,109 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2022-12-13 11:58:44,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2866 conditions, 1380 events. 818/1380 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7444 event pairs, 190 based on Foata normal form. 16/1128 useless extension candidates. Maximal degree in co-relation 2855. Up to 981 conditions per place. [2022-12-13 11:58:44,117 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 27 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2022-12-13 11:58:44,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 151 flow [2022-12-13 11:58:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 11:58:44,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 11:58:44,119 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 72 flow. Second operand 3 states and 57 transitions. [2022-12-13 11:58:44,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 151 flow [2022-12-13 11:58:44,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:44,120 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 76 flow [2022-12-13 11:58:44,121 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2022-12-13 11:58:44,121 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2022-12-13 11:58:44,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:44,122 INFO L89 Accepts]: Start accepts. Operand has 40 places, 29 transitions, 76 flow [2022-12-13 11:58:44,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:44,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:44,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 76 flow [2022-12-13 11:58:44,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 76 flow [2022-12-13 11:58:44,128 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 11:58:44,128 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 11:58:44,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 29 events. 0/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:58:44,129 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 76 flow [2022-12-13 11:58:44,129 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 11:58:44,130 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:44,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 11:58:44,131 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 76 flow [2022-12-13 11:58:44,131 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 11:58:44,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:44,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:44,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:58:44,132 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:44,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash -370134241, now seen corresponding path program 1 times [2022-12-13 11:58:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:44,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796901002] [2022-12-13 11:58:44,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:44,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:44,364 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 11:58:44,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:44,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796901002] [2022-12-13 11:58:44,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796901002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:44,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:44,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:58:44,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985594444] [2022-12-13 11:58:44,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:44,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:58:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:44,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:58:44,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:58:44,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 11:58:44,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:44,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:44,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 11:58:44,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:44,782 INFO L130 PetriNetUnfolder]: 1341/2247 cut-off events. [2022-12-13 11:58:44,782 INFO L131 PetriNetUnfolder]: For 449/449 co-relation queries the response was YES. [2022-12-13 11:58:44,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4771 conditions, 2247 events. 1341/2247 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13210 event pairs, 330 based on Foata normal form. 80/1877 useless extension candidates. Maximal degree in co-relation 4759. Up to 781 conditions per place. [2022-12-13 11:58:44,792 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 38 selfloop transitions, 3 changer transitions 7/56 dead transitions. [2022-12-13 11:58:44,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 239 flow [2022-12-13 11:58:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:58:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:58:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-13 11:58:44,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2022-12-13 11:58:44,794 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 76 flow. Second operand 4 states and 82 transitions. [2022-12-13 11:58:44,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 239 flow [2022-12-13 11:58:44,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:44,797 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 86 flow [2022-12-13 11:58:44,797 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2022-12-13 11:58:44,799 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2022-12-13 11:58:44,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:44,799 INFO L89 Accepts]: Start accepts. Operand has 43 places, 29 transitions, 86 flow [2022-12-13 11:58:44,801 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:44,801 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:44,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 29 transitions, 86 flow [2022-12-13 11:58:44,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 29 transitions, 86 flow [2022-12-13 11:58:44,808 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 11:58:44,808 INFO L131 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2022-12-13 11:58:44,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 29 events. 0/29 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 69 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:58:44,808 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 29 transitions, 86 flow [2022-12-13 11:58:44,808 INFO L226 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-13 11:58:45,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:58:45,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 626 [2022-12-13 11:58:45,425 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 84 flow [2022-12-13 11:58:45,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:45,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:45,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:45,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:58:45,426 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:45,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:45,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1544025516, now seen corresponding path program 1 times [2022-12-13 11:58:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:45,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379243118] [2022-12-13 11:58:45,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:45,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:46,966 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 11:58:46,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:46,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379243118] [2022-12-13 11:58:46,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379243118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:46,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:46,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:58:46,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837995289] [2022-12-13 11:58:46,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:46,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:58:46,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:46,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:58:46,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:58:46,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 11:58:46,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 84 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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 11:58:46,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:46,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 11:58:46,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:47,226 INFO L130 PetriNetUnfolder]: 900/1454 cut-off events. [2022-12-13 11:58:47,226 INFO L131 PetriNetUnfolder]: For 861/861 co-relation queries the response was YES. [2022-12-13 11:58:47,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1454 events. 900/1454 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6524 event pairs, 288 based on Foata normal form. 3/1164 useless extension candidates. Maximal degree in co-relation 3426. Up to 1219 conditions per place. [2022-12-13 11:58:47,235 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 30 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2022-12-13 11:58:47,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 183 flow [2022-12-13 11:58:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:58:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:58:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 11:58:47,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-13 11:58:47,237 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 84 flow. Second operand 3 states and 52 transitions. [2022-12-13 11:58:47,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 183 flow [2022-12-13 11:58:47,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 166 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 11:58:47,240 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 91 flow [2022-12-13 11:58:47,240 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-13 11:58:47,241 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2022-12-13 11:58:47,241 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:47,241 INFO L89 Accepts]: Start accepts. Operand has 41 places, 30 transitions, 91 flow [2022-12-13 11:58:47,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:47,241 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:47,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 91 flow [2022-12-13 11:58:47,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 91 flow [2022-12-13 11:58:47,249 INFO L130 PetriNetUnfolder]: 3/42 cut-off events. [2022-12-13 11:58:47,250 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 11:58:47,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 42 events. 3/42 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 104 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 64. Up to 10 conditions per place. [2022-12-13 11:58:47,250 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 91 flow [2022-12-13 11:58:47,250 INFO L226 LiptonReduction]: Number of co-enabled transitions 398 [2022-12-13 11:58:47,352 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:58:47,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 11:58:47,353 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 93 flow [2022-12-13 11:58:47,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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 11:58:47,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:47,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:47,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:58:47,354 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:47,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1489507242, now seen corresponding path program 1 times [2022-12-13 11:58:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:47,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655549468] [2022-12-13 11:58:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:48,093 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 11:58:48,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:48,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655549468] [2022-12-13 11:58:48,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655549468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:48,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:48,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:58:48,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714340255] [2022-12-13 11:58:48,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:48,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:58:48,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:48,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:58:48,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:58:48,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2022-12-13 11:58:48,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 93 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 11:58:48,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:48,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2022-12-13 11:58:48,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:48,501 INFO L130 PetriNetUnfolder]: 1403/2265 cut-off events. [2022-12-13 11:58:48,502 INFO L131 PetriNetUnfolder]: For 950/950 co-relation queries the response was YES. [2022-12-13 11:58:48,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5151 conditions, 2265 events. 1403/2265 cut-off events. For 950/950 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11714 event pairs, 302 based on Foata normal form. 72/1858 useless extension candidates. Maximal degree in co-relation 5138. Up to 1002 conditions per place. [2022-12-13 11:58:48,511 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 39 selfloop transitions, 4 changer transitions 19/67 dead transitions. [2022-12-13 11:58:48,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 323 flow [2022-12-13 11:58:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:58:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:58:48,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 11:58:48,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-13 11:58:48,513 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 93 flow. Second operand 5 states and 90 transitions. [2022-12-13 11:58:48,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 323 flow [2022-12-13 11:58:48,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:58:48,515 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 124 flow [2022-12-13 11:58:48,515 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2022-12-13 11:58:48,516 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2022-12-13 11:58:48,516 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:48,516 INFO L89 Accepts]: Start accepts. Operand has 47 places, 31 transitions, 124 flow [2022-12-13 11:58:48,517 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:48,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:48,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 31 transitions, 124 flow [2022-12-13 11:58:48,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 31 transitions, 124 flow [2022-12-13 11:58:48,526 INFO L130 PetriNetUnfolder]: 4/49 cut-off events. [2022-12-13 11:58:48,527 INFO L131 PetriNetUnfolder]: For 38/40 co-relation queries the response was YES. [2022-12-13 11:58:48,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 49 events. 4/49 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 143 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 95. Up to 12 conditions per place. [2022-12-13 11:58:48,527 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 31 transitions, 124 flow [2022-12-13 11:58:48,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 11:58:48,550 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:48,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 11:58:48,551 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 124 flow [2022-12-13 11:58:48,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 11:58:48,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:48,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:48,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:58:48,552 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1487215722, now seen corresponding path program 2 times [2022-12-13 11:58:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:48,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16565552] [2022-12-13 11:58:48,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:48,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:49,992 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 11:58:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:49,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16565552] [2022-12-13 11:58:49,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16565552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:49,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:49,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:58:49,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108720258] [2022-12-13 11:58:49,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:49,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:58:49,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:49,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:58:49,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:58:49,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2022-12-13 11:58:49,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 124 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:49,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:49,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2022-12-13 11:58:49,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:50,535 INFO L130 PetriNetUnfolder]: 1049/1739 cut-off events. [2022-12-13 11:58:50,535 INFO L131 PetriNetUnfolder]: For 1806/1806 co-relation queries the response was YES. [2022-12-13 11:58:50,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4574 conditions, 1739 events. 1049/1739 cut-off events. For 1806/1806 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8569 event pairs, 236 based on Foata normal form. 39/1386 useless extension candidates. Maximal degree in co-relation 4557. Up to 733 conditions per place. [2022-12-13 11:58:50,546 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 62 selfloop transitions, 16 changer transitions 0/83 dead transitions. [2022-12-13 11:58:50,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 83 transitions, 431 flow [2022-12-13 11:58:50,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:58:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:58:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-12-13 11:58:50,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2022-12-13 11:58:50,548 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 124 flow. Second operand 7 states and 114 transitions. [2022-12-13 11:58:50,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 83 transitions, 431 flow [2022-12-13 11:58:50,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 410 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:50,552 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 241 flow [2022-12-13 11:58:50,553 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2022-12-13 11:58:50,553 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2022-12-13 11:58:50,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:50,554 INFO L89 Accepts]: Start accepts. Operand has 52 places, 44 transitions, 241 flow [2022-12-13 11:58:50,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:50,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:50,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 44 transitions, 241 flow [2022-12-13 11:58:50,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 241 flow [2022-12-13 11:58:50,578 INFO L130 PetriNetUnfolder]: 23/128 cut-off events. [2022-12-13 11:58:50,578 INFO L131 PetriNetUnfolder]: For 152/153 co-relation queries the response was YES. [2022-12-13 11:58:50,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 128 events. 23/128 cut-off events. For 152/153 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 643 event pairs, 5 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 305. Up to 27 conditions per place. [2022-12-13 11:58:50,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 44 transitions, 241 flow [2022-12-13 11:58:50,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-13 11:58:50,749 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:58:50,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-13 11:58:50,750 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 243 flow [2022-12-13 11:58:50,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:50,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:50,750 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:50,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:58:50,751 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:50,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:50,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1742491442, now seen corresponding path program 3 times [2022-12-13 11:58:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:50,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581023643] [2022-12-13 11:58:50,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:51,580 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 11:58:51,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:51,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581023643] [2022-12-13 11:58:51,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581023643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:51,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:51,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:58:51,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646211802] [2022-12-13 11:58:51,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:51,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:58:51,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:51,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:58:51,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:58:51,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-13 11:58:51,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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 11:58:51,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:51,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-13 11:58:51,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:51,888 INFO L130 PetriNetUnfolder]: 1052/1743 cut-off events. [2022-12-13 11:58:51,888 INFO L131 PetriNetUnfolder]: For 2970/2970 co-relation queries the response was YES. [2022-12-13 11:58:51,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5276 conditions, 1743 events. 1052/1743 cut-off events. For 2970/2970 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8591 event pairs, 754 based on Foata normal form. 15/1363 useless extension candidates. Maximal degree in co-relation 5256. Up to 1490 conditions per place. [2022-12-13 11:58:51,900 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 39 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2022-12-13 11:58:51,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 403 flow [2022-12-13 11:58:51,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:58:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:58:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 11:58:51,902 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49137931034482757 [2022-12-13 11:58:51,902 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 243 flow. Second operand 4 states and 57 transitions. [2022-12-13 11:58:51,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 403 flow [2022-12-13 11:58:51,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 377 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:51,910 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 293 flow [2022-12-13 11:58:51,910 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2022-12-13 11:58:51,910 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2022-12-13 11:58:51,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:51,911 INFO L89 Accepts]: Start accepts. Operand has 54 places, 48 transitions, 293 flow [2022-12-13 11:58:51,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:51,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:51,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 293 flow [2022-12-13 11:58:51,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 293 flow [2022-12-13 11:58:51,932 INFO L130 PetriNetUnfolder]: 27/133 cut-off events. [2022-12-13 11:58:51,932 INFO L131 PetriNetUnfolder]: For 178/181 co-relation queries the response was YES. [2022-12-13 11:58:51,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 133 events. 27/133 cut-off events. For 178/181 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 618 event pairs, 2 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 358. Up to 39 conditions per place. [2022-12-13 11:58:51,934 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 293 flow [2022-12-13 11:58:51,934 INFO L226 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-13 11:58:51,992 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:58:51,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-13 11:58:51,993 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 293 flow [2022-12-13 11:58:51,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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 11:58:51,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:58:51,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:51,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:58:51,993 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:58:51,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 311341194, now seen corresponding path program 4 times [2022-12-13 11:58:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:51,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535864730] [2022-12-13 11:58:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:53,266 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 11:58:53,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:53,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535864730] [2022-12-13 11:58:53,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535864730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:58:53,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:58:53,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:58:53,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720252693] [2022-12-13 11:58:53,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:58:53,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:58:53,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:53,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:58:53,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:58:53,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-13 11:58:53,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 293 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:58:53,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:58:53,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-13 11:58:53,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:58:53,769 INFO L130 PetriNetUnfolder]: 1067/1798 cut-off events. [2022-12-13 11:58:53,770 INFO L131 PetriNetUnfolder]: For 3313/3313 co-relation queries the response was YES. [2022-12-13 11:58:53,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5476 conditions, 1798 events. 1067/1798 cut-off events. For 3313/3313 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9209 event pairs, 179 based on Foata normal form. 48/1424 useless extension candidates. Maximal degree in co-relation 5455. Up to 544 conditions per place. [2022-12-13 11:58:53,784 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 63 selfloop transitions, 17 changer transitions 10/95 dead transitions. [2022-12-13 11:58:53,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 641 flow [2022-12-13 11:58:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:58:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:58:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-12-13 11:58:53,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.541871921182266 [2022-12-13 11:58:53,786 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 293 flow. Second operand 7 states and 110 transitions. [2022-12-13 11:58:53,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 641 flow [2022-12-13 11:58:53,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 622 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:58:53,793 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 363 flow [2022-12-13 11:58:53,793 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2022-12-13 11:58:53,794 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 20 predicate places. [2022-12-13 11:58:53,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:58:53,794 INFO L89 Accepts]: Start accepts. Operand has 59 places, 53 transitions, 363 flow [2022-12-13 11:58:53,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:58:53,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:58:53,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 363 flow [2022-12-13 11:58:53,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 363 flow [2022-12-13 11:58:53,818 INFO L130 PetriNetUnfolder]: 28/121 cut-off events. [2022-12-13 11:58:53,818 INFO L131 PetriNetUnfolder]: For 260/261 co-relation queries the response was YES. [2022-12-13 11:58:53,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 121 events. 28/121 cut-off events. For 260/261 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 511 event pairs, 2 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 383. Up to 39 conditions per place. [2022-12-13 11:58:53,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 53 transitions, 363 flow [2022-12-13 11:58:53,820 INFO L226 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-13 11:58:54,118 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [655] L825-->L827: Formula: (= |v_#memory_int_25| (store |v_#memory_int_26| |v_~#y~0.base_19| (store (select |v_#memory_int_26| |v_~#y~0.base_19|) |v_~#y~0.offset_19| 2))) InVars {#memory_int=|v_#memory_int_26|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} OutVars{#memory_int=|v_#memory_int_25|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} AuxVars[] AssignedVars[#memory_int] and [746] L868-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~y$w_buff1_used~0_363 256) 0)) (.cse3 (= (mod v_~y$r_buff1_thd0~0_141 256) 0)) (.cse19 (= (mod v_~y$w_buff0_used~0_362 256) 0)) (.cse18 (= (mod v_~y$r_buff0_thd0~0_158 256) 0))) (let ((.cse17 (= (mod v_~weak$$choice2~0_156 256) 0)) (.cse7 (select |v_#memory_int_467| |v_~#y~0.base_266|)) (.cse8 (not .cse18)) (.cse11 (not .cse19)) (.cse5 (and .cse3 .cse18)) (.cse6 (and .cse18 .cse9))) (let ((.cse12 (or .cse5 .cse6 .cse19)) (.cse10 (and .cse8 .cse11)) (.cse13 (select .cse7 |v_~#y~0.offset_266|)) (.cse0 (not .cse17)) (.cse1 (= (mod v_~y$w_buff1_used~0_362 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_361 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= |v_ULTIMATE.start_main_#t~nondet39#1_49| v_~weak$$choice1~0_43) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= |v_ULTIMATE.start_main_#t~ite38#1_63| 2) (= v_~__unbuffered_p2_EAX~0_50 1) (= 2 v_~__unbuffered_p0_EAX~0_71) (= v_~__unbuffered_p1_EAX~0_34 1))) 1 0) 0) 0 1)) (= v_~y$r_buff1_thd0~0_140 (ite .cse0 v_~y$r_buff1_thd0~0_141 (ite (let ((.cse2 (= 0 (mod v_~y$r_buff0_thd0~0_157 256)))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~y$r_buff1_thd0~0_141 0))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|) (= v_~y$w_buff1_used~0_362 (ite .cse0 v_~y$w_buff1_used~0_363 (ite (or .cse5 .cse6 .cse4) v_~y$w_buff1_used~0_363 0))) (= (store |v_#memory_int_467| |v_~#y~0.base_266| (store .cse7 |v_~#y~0.offset_266| |v_ULTIMATE.start_main_#t~ite45#1_45|)) |v_#memory_int_466|) (or (and (= |v_ULTIMATE.start_main_#t~mem37#1_75| |v_ULTIMATE.start_main_#t~mem37#1_73|) (or .cse8 (not .cse3)) (or (not .cse9) .cse8) (= |v_ULTIMATE.start_main_#t~ite38#1_63| (ite .cse10 v_~y$w_buff0~0_191 v_~y$w_buff1~0_207)) .cse11) (and .cse12 (= |v_ULTIMATE.start_main_#t~mem37#1_73| .cse13) (= |v_ULTIMATE.start_main_#t~ite38#1_63| |v_ULTIMATE.start_main_#t~mem37#1_73|))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= v_~weak$$choice2~0_156 |v_ULTIMATE.start_main_#t~nondet35#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_49| v_~weak$$choice0~0_65) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~mem40#1_67| |v_ULTIMATE.start_main_#t~mem40#1_65|)) (.cse14 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_63 256) 0))) (or (and (not .cse14) (let ((.cse15 (= 0 (mod v_~weak$$choice1~0_43 256)))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_62| |v_ULTIMATE.start_main_#t~mem40#1_65|) (= |v_ULTIMATE.start_main_#t~mem40#1_65| (select (select (store |v_#memory_int_467| |v_~#y~0.base_266| (store .cse7 |v_~#y~0.offset_266| |v_ULTIMATE.start_main_#t~ite38#1_63|)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_64) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_64)) (not .cse15)) (and (= |v_ULTIMATE.start_main_#t~ite41#1_62| v_~__unbuffered_p0_EAX~0_72) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite41#1_62| v_~__unbuffered_p0_EAX~0_71)) (and (= |v_ULTIMATE.start_main_#t~ite41#1_62| |v_ULTIMATE.start_main_#t~ite41#1_64|) (= v_~__unbuffered_p0_EAX~0_72 v_~__unbuffered_p0_EAX~0_71) .cse16 .cse14))) (= v_~y$w_buff0_used~0_361 (ite .cse0 v_~y$w_buff0_used~0_362 (ite .cse12 v_~y$w_buff0_used~0_362 (ite .cse10 0 v_~y$w_buff0_used~0_362)))) (= v_~y$mem_tmp~0_94 .cse13) (= v_~y$flush_delayed~0_134 0) (= v_~y$w_buff1~0_207 v_~y$w_buff1~0_206) (= v_~y$w_buff0~0_191 v_~y$w_buff0~0_190) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_45| |v_ULTIMATE.start_main_#t~mem44#1_51|) (= |v_ULTIMATE.start_main_#t~ite38#1_63| |v_ULTIMATE.start_main_#t~mem44#1_51|) .cse17) (and .cse0 (= |v_ULTIMATE.start_main_#t~mem44#1_53| |v_ULTIMATE.start_main_#t~mem44#1_51|) (= |v_ULTIMATE.start_main_#t~ite45#1_45| v_~y$mem_tmp~0_94))) (= v_~y$r_buff0_thd0~0_157 (ite .cse0 v_~y$r_buff0_thd0~0_158 (ite (or .cse5 (and .cse18 .cse1) .cse4) v_~y$r_buff0_thd0~0_158 (ite (and (not .cse4) .cse8) 0 v_~y$r_buff0_thd0~0_158)))))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_49|, ~#y~0.offset=|v_~#y~0.offset_266|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_362, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_67|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_49|, ~#y~0.base=|v_~#y~0.base_266|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_64, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_64|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_207, ~y$w_buff0~0=v_~y$w_buff0~0_191, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_53|, #memory_int=|v_#memory_int_467|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_64, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_63, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_141, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_75|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_363} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~#y~0.offset=|v_~#y~0.offset_266|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_361, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_44|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~#y~0.base=|v_~#y~0.base_266|, ~y$mem_tmp~0=v_~y$mem_tmp~0_94, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~weak$$choice1~0=v_~weak$$choice1~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_190, ~y$flush_delayed~0=v_~y$flush_delayed~0_134, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_63, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_36|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_35|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_64, ~weak$$choice0~0=v_~weak$$choice0~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1~0=v_~y$w_buff1~0_206, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_157, #memory_int=|v_#memory_int_466|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_64, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_62|, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_362} AuxVars[|v_ULTIMATE.start_main_#t~mem44#1_51|, |v_ULTIMATE.start_main_#t~ite41#1_62|, |v_ULTIMATE.start_main_#t~mem40#1_65|, |v_ULTIMATE.start_main_#t~mem37#1_73|, |v_ULTIMATE.start_main_#t~ite45#1_45|, |v_ULTIMATE.start_main_#t~ite38#1_63|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet35#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ULTIMATE.start_main_#t~mem36#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0] [2022-12-13 11:58:55,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [655] L825-->L827: Formula: (= |v_#memory_int_25| (store |v_#memory_int_26| |v_~#y~0.base_19| (store (select |v_#memory_int_26| |v_~#y~0.base_19|) |v_~#y~0.offset_19| 2))) InVars {#memory_int=|v_#memory_int_26|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} OutVars{#memory_int=|v_#memory_int_25|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} AuxVars[] AssignedVars[#memory_int] and [746] L868-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~y$w_buff1_used~0_363 256) 0)) (.cse3 (= (mod v_~y$r_buff1_thd0~0_141 256) 0)) (.cse19 (= (mod v_~y$w_buff0_used~0_362 256) 0)) (.cse18 (= (mod v_~y$r_buff0_thd0~0_158 256) 0))) (let ((.cse17 (= (mod v_~weak$$choice2~0_156 256) 0)) (.cse7 (select |v_#memory_int_467| |v_~#y~0.base_266|)) (.cse8 (not .cse18)) (.cse11 (not .cse19)) (.cse5 (and .cse3 .cse18)) (.cse6 (and .cse18 .cse9))) (let ((.cse12 (or .cse5 .cse6 .cse19)) (.cse10 (and .cse8 .cse11)) (.cse13 (select .cse7 |v_~#y~0.offset_266|)) (.cse0 (not .cse17)) (.cse1 (= (mod v_~y$w_buff1_used~0_362 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_361 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= |v_ULTIMATE.start_main_#t~nondet39#1_49| v_~weak$$choice1~0_43) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= |v_ULTIMATE.start_main_#t~ite38#1_63| 2) (= v_~__unbuffered_p2_EAX~0_50 1) (= 2 v_~__unbuffered_p0_EAX~0_71) (= v_~__unbuffered_p1_EAX~0_34 1))) 1 0) 0) 0 1)) (= v_~y$r_buff1_thd0~0_140 (ite .cse0 v_~y$r_buff1_thd0~0_141 (ite (let ((.cse2 (= 0 (mod v_~y$r_buff0_thd0~0_157 256)))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~y$r_buff1_thd0~0_141 0))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|) (= v_~y$w_buff1_used~0_362 (ite .cse0 v_~y$w_buff1_used~0_363 (ite (or .cse5 .cse6 .cse4) v_~y$w_buff1_used~0_363 0))) (= (store |v_#memory_int_467| |v_~#y~0.base_266| (store .cse7 |v_~#y~0.offset_266| |v_ULTIMATE.start_main_#t~ite45#1_45|)) |v_#memory_int_466|) (or (and (= |v_ULTIMATE.start_main_#t~mem37#1_75| |v_ULTIMATE.start_main_#t~mem37#1_73|) (or .cse8 (not .cse3)) (or (not .cse9) .cse8) (= |v_ULTIMATE.start_main_#t~ite38#1_63| (ite .cse10 v_~y$w_buff0~0_191 v_~y$w_buff1~0_207)) .cse11) (and .cse12 (= |v_ULTIMATE.start_main_#t~mem37#1_73| .cse13) (= |v_ULTIMATE.start_main_#t~ite38#1_63| |v_ULTIMATE.start_main_#t~mem37#1_73|))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= v_~weak$$choice2~0_156 |v_ULTIMATE.start_main_#t~nondet35#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_49| v_~weak$$choice0~0_65) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~mem40#1_67| |v_ULTIMATE.start_main_#t~mem40#1_65|)) (.cse14 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_63 256) 0))) (or (and (not .cse14) (let ((.cse15 (= 0 (mod v_~weak$$choice1~0_43 256)))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_62| |v_ULTIMATE.start_main_#t~mem40#1_65|) (= |v_ULTIMATE.start_main_#t~mem40#1_65| (select (select (store |v_#memory_int_467| |v_~#y~0.base_266| (store .cse7 |v_~#y~0.offset_266| |v_ULTIMATE.start_main_#t~ite38#1_63|)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_64) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_64)) (not .cse15)) (and (= |v_ULTIMATE.start_main_#t~ite41#1_62| v_~__unbuffered_p0_EAX~0_72) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite41#1_62| v_~__unbuffered_p0_EAX~0_71)) (and (= |v_ULTIMATE.start_main_#t~ite41#1_62| |v_ULTIMATE.start_main_#t~ite41#1_64|) (= v_~__unbuffered_p0_EAX~0_72 v_~__unbuffered_p0_EAX~0_71) .cse16 .cse14))) (= v_~y$w_buff0_used~0_361 (ite .cse0 v_~y$w_buff0_used~0_362 (ite .cse12 v_~y$w_buff0_used~0_362 (ite .cse10 0 v_~y$w_buff0_used~0_362)))) (= v_~y$mem_tmp~0_94 .cse13) (= v_~y$flush_delayed~0_134 0) (= v_~y$w_buff1~0_207 v_~y$w_buff1~0_206) (= v_~y$w_buff0~0_191 v_~y$w_buff0~0_190) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_45| |v_ULTIMATE.start_main_#t~mem44#1_51|) (= |v_ULTIMATE.start_main_#t~ite38#1_63| |v_ULTIMATE.start_main_#t~mem44#1_51|) .cse17) (and .cse0 (= |v_ULTIMATE.start_main_#t~mem44#1_53| |v_ULTIMATE.start_main_#t~mem44#1_51|) (= |v_ULTIMATE.start_main_#t~ite45#1_45| v_~y$mem_tmp~0_94))) (= v_~y$r_buff0_thd0~0_157 (ite .cse0 v_~y$r_buff0_thd0~0_158 (ite (or .cse5 (and .cse18 .cse1) .cse4) v_~y$r_buff0_thd0~0_158 (ite (and (not .cse4) .cse8) 0 v_~y$r_buff0_thd0~0_158)))))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_49|, ~#y~0.offset=|v_~#y~0.offset_266|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_362, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_67|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_49|, ~#y~0.base=|v_~#y~0.base_266|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_64, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_64|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_207, ~y$w_buff0~0=v_~y$w_buff0~0_191, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_53|, #memory_int=|v_#memory_int_467|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_64, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_63, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_141, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_75|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_363} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~#y~0.offset=|v_~#y~0.offset_266|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_361, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_44|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~#y~0.base=|v_~#y~0.base_266|, ~y$mem_tmp~0=v_~y$mem_tmp~0_94, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~weak$$choice1~0=v_~weak$$choice1~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_190, ~y$flush_delayed~0=v_~y$flush_delayed~0_134, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_63, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_36|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_35|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_64, ~weak$$choice0~0=v_~weak$$choice0~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1~0=v_~y$w_buff1~0_206, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_157, #memory_int=|v_#memory_int_466|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_64, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_62|, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_362} AuxVars[|v_ULTIMATE.start_main_#t~mem44#1_51|, |v_ULTIMATE.start_main_#t~ite41#1_62|, |v_ULTIMATE.start_main_#t~mem40#1_65|, |v_ULTIMATE.start_main_#t~mem37#1_73|, |v_ULTIMATE.start_main_#t~ite45#1_45|, |v_ULTIMATE.start_main_#t~ite38#1_63|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet35#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ULTIMATE.start_main_#t~mem36#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0] [2022-12-13 11:58:57,638 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [746] L868-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~y$w_buff1_used~0_363 256) 0)) (.cse3 (= (mod v_~y$r_buff1_thd0~0_141 256) 0)) (.cse19 (= (mod v_~y$w_buff0_used~0_362 256) 0)) (.cse18 (= (mod v_~y$r_buff0_thd0~0_158 256) 0))) (let ((.cse17 (= (mod v_~weak$$choice2~0_156 256) 0)) (.cse7 (select |v_#memory_int_467| |v_~#y~0.base_266|)) (.cse8 (not .cse18)) (.cse11 (not .cse19)) (.cse5 (and .cse3 .cse18)) (.cse6 (and .cse18 .cse9))) (let ((.cse12 (or .cse5 .cse6 .cse19)) (.cse10 (and .cse8 .cse11)) (.cse13 (select .cse7 |v_~#y~0.offset_266|)) (.cse0 (not .cse17)) (.cse1 (= (mod v_~y$w_buff1_used~0_362 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_361 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= |v_ULTIMATE.start_main_#t~nondet39#1_49| v_~weak$$choice1~0_43) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= |v_ULTIMATE.start_main_#t~ite38#1_63| 2) (= v_~__unbuffered_p2_EAX~0_50 1) (= 2 v_~__unbuffered_p0_EAX~0_71) (= v_~__unbuffered_p1_EAX~0_34 1))) 1 0) 0) 0 1)) (= v_~y$r_buff1_thd0~0_140 (ite .cse0 v_~y$r_buff1_thd0~0_141 (ite (let ((.cse2 (= 0 (mod v_~y$r_buff0_thd0~0_157 256)))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~y$r_buff1_thd0~0_141 0))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|) (= v_~y$w_buff1_used~0_362 (ite .cse0 v_~y$w_buff1_used~0_363 (ite (or .cse5 .cse6 .cse4) v_~y$w_buff1_used~0_363 0))) (= (store |v_#memory_int_467| |v_~#y~0.base_266| (store .cse7 |v_~#y~0.offset_266| |v_ULTIMATE.start_main_#t~ite45#1_45|)) |v_#memory_int_466|) (or (and (= |v_ULTIMATE.start_main_#t~mem37#1_75| |v_ULTIMATE.start_main_#t~mem37#1_73|) (or .cse8 (not .cse3)) (or (not .cse9) .cse8) (= |v_ULTIMATE.start_main_#t~ite38#1_63| (ite .cse10 v_~y$w_buff0~0_191 v_~y$w_buff1~0_207)) .cse11) (and .cse12 (= |v_ULTIMATE.start_main_#t~mem37#1_73| .cse13) (= |v_ULTIMATE.start_main_#t~ite38#1_63| |v_ULTIMATE.start_main_#t~mem37#1_73|))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= v_~weak$$choice2~0_156 |v_ULTIMATE.start_main_#t~nondet35#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_49| v_~weak$$choice0~0_65) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~mem40#1_67| |v_ULTIMATE.start_main_#t~mem40#1_65|)) (.cse14 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_63 256) 0))) (or (and (not .cse14) (let ((.cse15 (= 0 (mod v_~weak$$choice1~0_43 256)))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_62| |v_ULTIMATE.start_main_#t~mem40#1_65|) (= |v_ULTIMATE.start_main_#t~mem40#1_65| (select (select (store |v_#memory_int_467| |v_~#y~0.base_266| (store .cse7 |v_~#y~0.offset_266| |v_ULTIMATE.start_main_#t~ite38#1_63|)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_64) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_64)) (not .cse15)) (and (= |v_ULTIMATE.start_main_#t~ite41#1_62| v_~__unbuffered_p0_EAX~0_72) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite41#1_62| v_~__unbuffered_p0_EAX~0_71)) (and (= |v_ULTIMATE.start_main_#t~ite41#1_62| |v_ULTIMATE.start_main_#t~ite41#1_64|) (= v_~__unbuffered_p0_EAX~0_72 v_~__unbuffered_p0_EAX~0_71) .cse16 .cse14))) (= v_~y$w_buff0_used~0_361 (ite .cse0 v_~y$w_buff0_used~0_362 (ite .cse12 v_~y$w_buff0_used~0_362 (ite .cse10 0 v_~y$w_buff0_used~0_362)))) (= v_~y$mem_tmp~0_94 .cse13) (= v_~y$flush_delayed~0_134 0) (= v_~y$w_buff1~0_207 v_~y$w_buff1~0_206) (= v_~y$w_buff0~0_191 v_~y$w_buff0~0_190) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_45| |v_ULTIMATE.start_main_#t~mem44#1_51|) (= |v_ULTIMATE.start_main_#t~ite38#1_63| |v_ULTIMATE.start_main_#t~mem44#1_51|) .cse17) (and .cse0 (= |v_ULTIMATE.start_main_#t~mem44#1_53| |v_ULTIMATE.start_main_#t~mem44#1_51|) (= |v_ULTIMATE.start_main_#t~ite45#1_45| v_~y$mem_tmp~0_94))) (= v_~y$r_buff0_thd0~0_157 (ite .cse0 v_~y$r_buff0_thd0~0_158 (ite (or .cse5 (and .cse18 .cse1) .cse4) v_~y$r_buff0_thd0~0_158 (ite (and (not .cse4) .cse8) 0 v_~y$r_buff0_thd0~0_158)))))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_49|, ~#y~0.offset=|v_~#y~0.offset_266|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_362, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_67|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_49|, ~#y~0.base=|v_~#y~0.base_266|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_64, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_64|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_207, ~y$w_buff0~0=v_~y$w_buff0~0_191, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_53|, #memory_int=|v_#memory_int_467|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_64, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_63, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_141, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_75|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_363} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~#y~0.offset=|v_~#y~0.offset_266|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_361, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_44|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~#y~0.base=|v_~#y~0.base_266|, ~y$mem_tmp~0=v_~y$mem_tmp~0_94, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~weak$$choice1~0=v_~weak$$choice1~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_190, ~y$flush_delayed~0=v_~y$flush_delayed~0_134, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_63, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_36|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_35|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_64, ~weak$$choice0~0=v_~weak$$choice0~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1~0=v_~y$w_buff1~0_206, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_157, #memory_int=|v_#memory_int_466|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_64, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_62|, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_362} AuxVars[|v_ULTIMATE.start_main_#t~mem44#1_51|, |v_ULTIMATE.start_main_#t~ite41#1_62|, |v_ULTIMATE.start_main_#t~mem40#1_65|, |v_ULTIMATE.start_main_#t~mem37#1_73|, |v_ULTIMATE.start_main_#t~ite45#1_45|, |v_ULTIMATE.start_main_#t~ite38#1_63|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet35#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ULTIMATE.start_main_#t~mem36#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0] and [649] L794-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_32 256) 0))) (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_251 256) 0))) (.cse2 (not .cse10)) (.cse9 (= (mod v_~y$w_buff1_used~0_253 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd2~0_30 256) 0)) (.cse11 (= (mod v_~y$w_buff0_used~0_252 256) 0))) (let ((.cse3 (not .cse11)) (.cse5 (select |v_#memory_int_299| |v_~#y~0.base_206|)) (.cse0 (not .cse8)) (.cse7 (not .cse9)) (.cse4 (and .cse1 .cse2))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_252 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_31 256) 0)) .cse1)) 0 v_~y$r_buff1_thd2~0_30) v_~y$r_buff1_thd2~0_29) (= v_~y$w_buff0_used~0_251 (ite (and .cse2 .cse3) 0 v_~y$w_buff0_used~0_252)) (= v_~y$r_buff0_thd2~0_31 (ite .cse4 0 v_~y$r_buff0_thd2~0_32)) (= (store |v_#memory_int_299| |v_~#y~0.base_206| (store .cse5 |v_~#y~0.offset_206| |v_P1_#t~ite13_27|)) |v_#memory_int_298|) (let ((.cse6 (= |v_P1Thread1of1ForFork2_#t~mem11_1| |v_P1_#t~mem11_30|))) (or (and (= |v_P1Thread1of1ForFork2_#t~ite12_1| |v_P1_#t~ite12_27|) (= |v_P1_#t~ite13_27| v_~y$w_buff0~0_116) .cse6 .cse2 .cse3) (and (= |v_P1_#t~ite12_27| |v_P1_#t~ite13_27|) (or (and .cse0 (= v_~y$w_buff1~0_132 |v_P1_#t~ite12_27|) .cse6 .cse7) (and (= |v_P1_#t~ite12_27| |v_P1_#t~mem11_30|) (= (select .cse5 |v_~#y~0.offset_206|) |v_P1_#t~mem11_30|) (or .cse8 .cse9))) (or .cse10 .cse11)))) (= (ite (or (and .cse0 .cse7) .cse4) 0 v_~y$w_buff1_used~0_253) v_~y$w_buff1_used~0_252))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_30, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_252, ~y$w_buff1~0=v_~y$w_buff1~0_132, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_32, P1Thread1of1ForFork2_#t~mem11=|v_P1Thread1of1ForFork2_#t~mem11_1|, #memory_int=|v_#memory_int_299|, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, ~#y~0.base=|v_~#y~0.base_206|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_253} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_251, ~y$w_buff1~0=v_~y$w_buff1~0_132, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_31, #memory_int=|v_#memory_int_298|, ~#y~0.base=|v_~#y~0.base_206|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_252} AuxVars[|v_P1_#t~mem11_30|, |v_P1_#t~ite12_27|, |v_P1_#t~ite13_27|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~mem11, #memory_int, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite13, ~y$w_buff1_used~0] [2022-12-13 11:58:59,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] L825-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~y$w_buff0_used~0_696 256) 0)) (.cse11 (= (mod v_~y$r_buff1_thd0~0_304 256) 0)) (.cse13 (= (mod v_~y$w_buff1_used~0_702 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd0~0_314 256) 0))) (let ((.cse3 (= (mod v_~weak$$choice2~0_246 256) 0)) (.cse17 (and .cse13 .cse8)) (.cse5 (and .cse8 .cse11)) (.cse12 (not .cse18)) (.cse9 (not .cse8))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_701 256) 0)) (.cse2 (and .cse12 .cse9)) (.cse1 (or .cse17 .cse5 .cse18)) (.cse4 (select |v_#memory_int_888| |v_~#y~0.base_425|)) (.cse0 (not .cse3)) (.cse6 (= (mod v_~y$w_buff0_used~0_695 256) 0))) (and (= v_~y$w_buff0_used~0_695 (ite .cse0 v_~y$w_buff0_used~0_696 (ite .cse1 v_~y$w_buff0_used~0_696 (ite .cse2 0 v_~y$w_buff0_used~0_696)))) (= |v_ULTIMATE.start_main_#t~nondet39#1_99| v_~weak$$choice1~0_75) (= |v_ULTIMATE.start_main_#t~nondet35#1_103| v_~weak$$choice2~0_246) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_104| |v_ULTIMATE.start_main_#t~mem44#1_128|) .cse3 (= |v_ULTIMATE.start_main_#t~ite38#1_122| |v_ULTIMATE.start_main_#t~mem44#1_128|)) (and (= |v_ULTIMATE.start_main_#t~mem44#1_128| |v_ULTIMATE.start_main_#t~mem44#1_130|) .cse0 (= |v_ULTIMATE.start_main_#t~ite45#1_104| v_~y$mem_tmp~0_182))) (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29|) (= v_~main$tmp_guard1~0_62 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_83 1) (= |v_ULTIMATE.start_main_#t~ite38#1_122| 2) (= 2 v_~__unbuffered_p0_EAX~0_174) (= v_~__unbuffered_p2_EAX~0_94 1))) 1 0) 0) 0 1)) (= v_~y$mem_tmp~0_182 2) (= (store |v_#memory_int_888| |v_~#y~0.base_425| (store .cse4 |v_~#y~0.offset_425| |v_ULTIMATE.start_main_#t~ite45#1_104|)) |v_#memory_int_886|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0) (= (ite .cse0 v_~y$r_buff0_thd0~0_314 (ite (or .cse5 .cse6 (and .cse7 .cse8)) v_~y$r_buff0_thd0~0_314 (ite (and (not .cse6) .cse9) 0 v_~y$r_buff0_thd0~0_314))) v_~y$r_buff0_thd0~0_313) (= v_~y$r_buff1_thd0~0_303 (ite .cse0 v_~y$r_buff1_thd0~0_304 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd0~0_313 256) 0))) (or .cse6 (and .cse7 .cse10) (and .cse10 .cse11))) v_~y$r_buff1_thd0~0_304 0))) (= v_~y$w_buff1~0_419 v_~y$w_buff1~0_420) (or (and .cse12 (or .cse9 (not .cse13)) (= |v_ULTIMATE.start_main_#t~mem37#1_152| |v_ULTIMATE.start_main_#t~mem37#1_150|) (= |v_ULTIMATE.start_main_#t~ite38#1_122| (ite .cse2 v_~y$w_buff0~0_411 v_~y$w_buff1~0_420)) (or .cse9 (not .cse11))) (and .cse1 (= |v_ULTIMATE.start_main_#t~ite38#1_122| |v_ULTIMATE.start_main_#t~mem37#1_150|))) (= |v_ULTIMATE.start_main_#t~nondet34#1_99| v_~weak$$choice0~0_155) (let ((.cse15 (= |v_ULTIMATE.start_main_#t~mem40#1_144| |v_ULTIMATE.start_main_#t~mem40#1_142|)) (.cse16 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_140 256) 0))) (or (and (let ((.cse14 (= (mod v_~weak$$choice1~0_75 256) 0))) (or (and .cse14 (= |v_ULTIMATE.start_main_#t~ite41#1_139| v_~__unbuffered_p0_EAX~0_175) .cse15) (and (= |v_ULTIMATE.start_main_#t~ite41#1_139| |v_ULTIMATE.start_main_#t~mem40#1_142|) (= |v_ULTIMATE.start_main_#t~mem40#1_142| (select (select (store |v_#memory_int_888| |v_~#y~0.base_425| (store .cse4 |v_~#y~0.offset_425| |v_ULTIMATE.start_main_#t~ite38#1_122|)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_141) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_141)) (not .cse14)))) (= |v_ULTIMATE.start_main_#t~ite41#1_139| v_~__unbuffered_p0_EAX~0_174) (not .cse16)) (and (= v_~__unbuffered_p0_EAX~0_175 v_~__unbuffered_p0_EAX~0_174) (= |v_ULTIMATE.start_main_#t~ite41#1_139| |v_ULTIMATE.start_main_#t~ite41#1_141|) .cse15 .cse16))) (= (ite .cse0 v_~y$w_buff1_used~0_702 (ite (or .cse17 .cse5 .cse6) v_~y$w_buff1_used~0_702 0)) v_~y$w_buff1_used~0_701) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= v_~y$w_buff0~0_411 v_~y$w_buff0~0_410) (= v_~y$flush_delayed~0_222 0))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_99|, ~#y~0.offset=|v_~#y~0.offset_425|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_696, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_144|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_99|, ~#y~0.base=|v_~#y~0.base_425|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_141, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_130|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_175, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_141|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_420, ~y$w_buff0~0=v_~y$w_buff0~0_411, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_314, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_103|, #memory_int=|v_#memory_int_888|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_141, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_152|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_702} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ~#y~0.offset=|v_~#y~0.offset_425|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_695, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_103|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_65|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~#y~0.base=|v_~#y~0.base_425|, ~y$mem_tmp~0=v_~y$mem_tmp~0_182, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_174, ~weak$$choice1~0=v_~weak$$choice1~0_75, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_410, ~y$flush_delayed~0=v_~y$flush_delayed~0_222, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_68|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_67|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_141, ~weak$$choice0~0=v_~weak$$choice0~0_155, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29|, ~y$w_buff1~0=v_~y$w_buff1~0_419, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_313, #memory_int=|v_#memory_int_886|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_141, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_121|, ~weak$$choice2~0=v_~weak$$choice2~0_246, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_303, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_701} AuxVars[|v_ULTIMATE.start_main_#t~mem40#1_142|, |v_ULTIMATE.start_main_#t~mem37#1_150|, |v_ULTIMATE.start_main_#t~ite45#1_104|, |v_ULTIMATE.start_main_#t~ite38#1_122|, |v_ULTIMATE.start_main_#t~ite41#1_139|, |v_ULTIMATE.start_main_#t~mem44#1_128|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet35#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ULTIMATE.start_main_#t~mem36#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0] and [649] L794-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_32 256) 0))) (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_251 256) 0))) (.cse2 (not .cse10)) (.cse9 (= (mod v_~y$w_buff1_used~0_253 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd2~0_30 256) 0)) (.cse11 (= (mod v_~y$w_buff0_used~0_252 256) 0))) (let ((.cse3 (not .cse11)) (.cse5 (select |v_#memory_int_299| |v_~#y~0.base_206|)) (.cse0 (not .cse8)) (.cse7 (not .cse9)) (.cse4 (and .cse1 .cse2))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_252 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_31 256) 0)) .cse1)) 0 v_~y$r_buff1_thd2~0_30) v_~y$r_buff1_thd2~0_29) (= v_~y$w_buff0_used~0_251 (ite (and .cse2 .cse3) 0 v_~y$w_buff0_used~0_252)) (= v_~y$r_buff0_thd2~0_31 (ite .cse4 0 v_~y$r_buff0_thd2~0_32)) (= (store |v_#memory_int_299| |v_~#y~0.base_206| (store .cse5 |v_~#y~0.offset_206| |v_P1_#t~ite13_27|)) |v_#memory_int_298|) (let ((.cse6 (= |v_P1Thread1of1ForFork2_#t~mem11_1| |v_P1_#t~mem11_30|))) (or (and (= |v_P1Thread1of1ForFork2_#t~ite12_1| |v_P1_#t~ite12_27|) (= |v_P1_#t~ite13_27| v_~y$w_buff0~0_116) .cse6 .cse2 .cse3) (and (= |v_P1_#t~ite12_27| |v_P1_#t~ite13_27|) (or (and .cse0 (= v_~y$w_buff1~0_132 |v_P1_#t~ite12_27|) .cse6 .cse7) (and (= |v_P1_#t~ite12_27| |v_P1_#t~mem11_30|) (= (select .cse5 |v_~#y~0.offset_206|) |v_P1_#t~mem11_30|) (or .cse8 .cse9))) (or .cse10 .cse11)))) (= (ite (or (and .cse0 .cse7) .cse4) 0 v_~y$w_buff1_used~0_253) v_~y$w_buff1_used~0_252))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_30, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_252, ~y$w_buff1~0=v_~y$w_buff1~0_132, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_32, P1Thread1of1ForFork2_#t~mem11=|v_P1Thread1of1ForFork2_#t~mem11_1|, #memory_int=|v_#memory_int_299|, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, ~#y~0.base=|v_~#y~0.base_206|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_253} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_251, ~y$w_buff1~0=v_~y$w_buff1~0_132, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_31, #memory_int=|v_#memory_int_298|, ~#y~0.base=|v_~#y~0.base_206|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_252} AuxVars[|v_P1_#t~mem11_30|, |v_P1_#t~ite12_27|, |v_P1_#t~ite13_27|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~mem11, #memory_int, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite13, ~y$w_buff1_used~0] [2022-12-13 11:59:01,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [767] L825-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~y$w_buff1_used~0_706 256) 0)) (.cse2 (= (mod v_~y$r_buff1_thd0~0_308 256) 0)) (.cse18 (= (mod v_~y$w_buff0_used~0_700 256) 0)) (.cse16 (= (mod v_~y$r_buff0_thd0~0_318 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_248 256) 0)) (.cse10 (not .cse16)) (.cse9 (not .cse18)) (.cse15 (and .cse2 .cse16)) (.cse17 (and .cse11 .cse16))) (let ((.cse7 (or .cse18 .cse15 .cse17)) (.cse8 (and .cse10 .cse9)) (.cse6 (select |v_#memory_int_894| |v_~#y~0.base_427|)) (.cse4 (= (mod v_~y$w_buff1_used~0_705 256) 0)) (.cse1 (not .cse0)) (.cse5 (= (mod v_~y$w_buff0_used~0_699 256) 0))) (and (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite45#1_108| |v_ULTIMATE.start_main_#t~mem44#1_134|) (= |v_ULTIMATE.start_main_#t~ite38#1_126| |v_ULTIMATE.start_main_#t~mem44#1_134|)) (and (= |v_ULTIMATE.start_main_#t~mem44#1_136| |v_ULTIMATE.start_main_#t~mem44#1_134|) (= |v_ULTIMATE.start_main_#t~ite45#1_108| v_~y$mem_tmp~0_184) .cse1)) (= v_~y$flush_delayed~0_224 0) (= v_~y$w_buff1~0_424 v_~y$w_buff1~0_423) (= (ite .cse1 v_~y$r_buff1_thd0~0_308 (ite (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_317 256) 0))) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) v_~y$r_buff1_thd0~0_308 0)) v_~y$r_buff1_thd0~0_307) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= |v_#memory_int_892| (store |v_#memory_int_894| |v_~#y~0.base_427| (store .cse6 |v_~#y~0.offset_427| |v_ULTIMATE.start_main_#t~ite45#1_108|))) (= (ite .cse1 v_~y$w_buff0_used~0_700 (ite .cse7 v_~y$w_buff0_used~0_700 (ite .cse8 0 v_~y$w_buff0_used~0_700))) v_~y$w_buff0_used~0_699) (or (and .cse7 (= |v_ULTIMATE.start_main_#t~ite38#1_126| |v_ULTIMATE.start_main_#t~mem37#1_156|)) (and .cse9 (or .cse10 (not .cse2)) (= |v_ULTIMATE.start_main_#t~mem37#1_158| |v_ULTIMATE.start_main_#t~mem37#1_156|) (= |v_ULTIMATE.start_main_#t~ite38#1_126| (ite .cse8 v_~y$w_buff0~0_415 v_~y$w_buff1~0_424)) (or .cse10 (not .cse11)))) (= v_~weak$$choice0~0_157 |v_ULTIMATE.start_main_#t~nondet34#1_103|) (= |v_ULTIMATE.start_main_#t~nondet35#1_107| v_~weak$$choice2~0_248) (let ((.cse14 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_142 256) 0)) (.cse12 (= |v_ULTIMATE.start_main_#t~mem40#1_148| |v_ULTIMATE.start_main_#t~mem40#1_150|))) (or (and (let ((.cse13 (= (mod v_~weak$$choice1~0_77 256) 0))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41#1_145| v_~__unbuffered_p0_EAX~0_179) .cse13) (and (= (select (select (store |v_#memory_int_894| |v_~#y~0.base_427| (store .cse6 |v_~#y~0.offset_427| |v_ULTIMATE.start_main_#t~ite38#1_126|)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143) |v_ULTIMATE.start_main_#t~mem40#1_148|) (= |v_ULTIMATE.start_main_#t~ite41#1_145| |v_ULTIMATE.start_main_#t~mem40#1_148|) (not .cse13)))) (not .cse14) (= |v_ULTIMATE.start_main_#t~ite41#1_145| v_~__unbuffered_p0_EAX~0_178)) (and (= v_~__unbuffered_p0_EAX~0_179 v_~__unbuffered_p0_EAX~0_178) .cse14 .cse12 (= |v_ULTIMATE.start_main_#t~ite41#1_147| |v_ULTIMATE.start_main_#t~ite41#1_145|)))) (= v_~y$r_buff0_thd0~0_317 (ite .cse1 v_~y$r_buff0_thd0~0_318 (ite (or .cse15 (and .cse4 .cse16) .cse5) v_~y$r_buff0_thd0~0_318 (ite (and .cse10 (not .cse5)) 0 v_~y$r_buff0_thd0~0_318)))) (= v_~weak$$choice1~0_77 |v_ULTIMATE.start_main_#t~nondet39#1_103|) (= v_~y$mem_tmp~0_184 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= v_~y$w_buff0~0_415 v_~y$w_buff0~0_414) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| (mod v_~main$tmp_guard1~0_64 256)) (= (ite .cse1 v_~y$w_buff1_used~0_706 (ite (or .cse15 .cse17 .cse5) v_~y$w_buff1_used~0_706 0)) v_~y$w_buff1_used~0_705) (= v_~main$tmp_guard1~0_64 (ite (= (ite (not (and (= |v_ULTIMATE.start_main_#t~ite38#1_126| 2) (= v_~__unbuffered_p2_EAX~0_96 1) (= v_~__unbuffered_p1_EAX~0_85 1) (= 2 v_~__unbuffered_p0_EAX~0_178))) 1 0) 0) 0 1)))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_103|, ~#y~0.offset=|v_~#y~0.offset_427|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_700, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_150|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_103|, ~#y~0.base=|v_~#y~0.base_427|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_136|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_179, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_147|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_85, ~y$w_buff1~0=v_~y$w_buff1~0_424, ~y$w_buff0~0=v_~y$w_buff0~0_415, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_318, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_107|, #memory_int=|v_#memory_int_894|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_142, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_308, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_158|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_706} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ~#y~0.offset=|v_~#y~0.offset_427|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_699, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_107|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_67|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ~#y~0.base=|v_~#y~0.base_427|, ~y$mem_tmp~0=v_~y$mem_tmp~0_184, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~weak$$choice1~0=v_~weak$$choice1~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_414, ~y$flush_delayed~0=v_~y$flush_delayed~0_224, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_142, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_70|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_69|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_157, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|, ~y$w_buff1~0=v_~y$w_buff1~0_423, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_317, #memory_int=|v_#memory_int_892|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_125|, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_705} AuxVars[|v_ULTIMATE.start_main_#t~mem44#1_134|, |v_ULTIMATE.start_main_#t~ite45#1_108|, |v_ULTIMATE.start_main_#t~ite38#1_126|, |v_ULTIMATE.start_main_#t~mem37#1_156|, |v_ULTIMATE.start_main_#t~ite41#1_145|, |v_ULTIMATE.start_main_#t~mem40#1_148|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet35#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ULTIMATE.start_main_#t~mem36#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0] and [649] L794-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_32 256) 0))) (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_251 256) 0))) (.cse2 (not .cse10)) (.cse9 (= (mod v_~y$w_buff1_used~0_253 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd2~0_30 256) 0)) (.cse11 (= (mod v_~y$w_buff0_used~0_252 256) 0))) (let ((.cse3 (not .cse11)) (.cse5 (select |v_#memory_int_299| |v_~#y~0.base_206|)) (.cse0 (not .cse8)) (.cse7 (not .cse9)) (.cse4 (and .cse1 .cse2))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_252 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_31 256) 0)) .cse1)) 0 v_~y$r_buff1_thd2~0_30) v_~y$r_buff1_thd2~0_29) (= v_~y$w_buff0_used~0_251 (ite (and .cse2 .cse3) 0 v_~y$w_buff0_used~0_252)) (= v_~y$r_buff0_thd2~0_31 (ite .cse4 0 v_~y$r_buff0_thd2~0_32)) (= (store |v_#memory_int_299| |v_~#y~0.base_206| (store .cse5 |v_~#y~0.offset_206| |v_P1_#t~ite13_27|)) |v_#memory_int_298|) (let ((.cse6 (= |v_P1Thread1of1ForFork2_#t~mem11_1| |v_P1_#t~mem11_30|))) (or (and (= |v_P1Thread1of1ForFork2_#t~ite12_1| |v_P1_#t~ite12_27|) (= |v_P1_#t~ite13_27| v_~y$w_buff0~0_116) .cse6 .cse2 .cse3) (and (= |v_P1_#t~ite12_27| |v_P1_#t~ite13_27|) (or (and .cse0 (= v_~y$w_buff1~0_132 |v_P1_#t~ite12_27|) .cse6 .cse7) (and (= |v_P1_#t~ite12_27| |v_P1_#t~mem11_30|) (= (select .cse5 |v_~#y~0.offset_206|) |v_P1_#t~mem11_30|) (or .cse8 .cse9))) (or .cse10 .cse11)))) (= (ite (or (and .cse0 .cse7) .cse4) 0 v_~y$w_buff1_used~0_253) v_~y$w_buff1_used~0_252))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_30, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_252, ~y$w_buff1~0=v_~y$w_buff1~0_132, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_32, P1Thread1of1ForFork2_#t~mem11=|v_P1Thread1of1ForFork2_#t~mem11_1|, #memory_int=|v_#memory_int_299|, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, ~#y~0.base=|v_~#y~0.base_206|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_253} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_251, ~y$w_buff1~0=v_~y$w_buff1~0_132, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_31, #memory_int=|v_#memory_int_298|, ~#y~0.base=|v_~#y~0.base_206|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_252} AuxVars[|v_P1_#t~mem11_30|, |v_P1_#t~ite12_27|, |v_P1_#t~ite13_27|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~mem11, #memory_int, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite13, ~y$w_buff1_used~0] [2022-12-13 11:59:03,408 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:59:03,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9615 [2022-12-13 11:59:03,409 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 427 flow [2022-12-13 11:59:03,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:03,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:03,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:03,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:59:03,409 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:59:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1290600541, now seen corresponding path program 1 times [2022-12-13 11:59:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:03,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743317705] [2022-12-13 11:59:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:03,596 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 11:59:03,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:03,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743317705] [2022-12-13 11:59:03,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743317705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:03,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:03,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:59:03,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996384974] [2022-12-13 11:59:03,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:03,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:59:03,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:03,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:59:03,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:59:03,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-13 11:59:03,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:03,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:59:03,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-13 11:59:03,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:59:04,022 INFO L130 PetriNetUnfolder]: 1494/2411 cut-off events. [2022-12-13 11:59:04,022 INFO L131 PetriNetUnfolder]: For 4724/4741 co-relation queries the response was YES. [2022-12-13 11:59:04,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7441 conditions, 2411 events. 1494/2411 cut-off events. For 4724/4741 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12843 event pairs, 504 based on Foata normal form. 199/1693 useless extension candidates. Maximal degree in co-relation 7419. Up to 1918 conditions per place. [2022-12-13 11:59:04,046 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 74 selfloop transitions, 17 changer transitions 20/117 dead transitions. [2022-12-13 11:59:04,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 117 transitions, 988 flow [2022-12-13 11:59:04,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:59:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:59:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-13 11:59:04,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 11:59:04,048 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 427 flow. Second operand 5 states and 99 transitions. [2022-12-13 11:59:04,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 117 transitions, 988 flow [2022-12-13 11:59:04,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 117 transitions, 897 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-12-13 11:59:04,055 INFO L231 Difference]: Finished difference. Result has 58 places, 65 transitions, 459 flow [2022-12-13 11:59:04,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=459, PETRI_PLACES=58, PETRI_TRANSITIONS=65} [2022-12-13 11:59:04,057 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2022-12-13 11:59:04,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:59:04,057 INFO L89 Accepts]: Start accepts. Operand has 58 places, 65 transitions, 459 flow [2022-12-13 11:59:04,058 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:59:04,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:59:04,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 65 transitions, 459 flow [2022-12-13 11:59:04,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 65 transitions, 459 flow [2022-12-13 11:59:04,200 INFO L130 PetriNetUnfolder]: 730/1311 cut-off events. [2022-12-13 11:59:04,200 INFO L131 PetriNetUnfolder]: For 1349/2575 co-relation queries the response was YES. [2022-12-13 11:59:04,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4308 conditions, 1311 events. 730/1311 cut-off events. For 1349/2575 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 8406 event pairs, 304 based on Foata normal form. 2/651 useless extension candidates. Maximal degree in co-relation 4291. Up to 961 conditions per place. [2022-12-13 11:59:04,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 65 transitions, 459 flow [2022-12-13 11:59:04,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-13 11:59:04,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [769] L825-->L802: Formula: (let ((.cse5 (= 0 (mod v_~y$r_buff1_thd0~0_316 256))) (.cse17 (= (mod v_~y$w_buff1_used~0_717 256) 0)) (.cse29 (= (mod v_~y$w_buff0_used~0_711 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd0~0_326 256) 0))) (let ((.cse10 (not .cse9)) (.cse18 (not .cse29)) (.cse28 (and .cse9 .cse17)) (.cse8 (and .cse9 .cse5)) (.cse27 (= (mod v_~weak$$choice2~0_252 256) 0))) (let ((.cse3 (not .cse27)) (.cse16 (or .cse29 .cse28 .cse8)) (.cse19 (and .cse10 .cse18))) (let ((.cse2 (ite .cse3 v_~y$w_buff0_used~0_711 (ite .cse16 v_~y$w_buff0_used~0_711 (ite .cse19 0 v_~y$w_buff0_used~0_711))))) (let ((.cse7 (= (mod .cse2 256) 0))) (let ((.cse25 (ite .cse3 v_~y$w_buff1_used~0_717 (ite (or .cse28 .cse8 .cse7) v_~y$w_buff1_used~0_717 0))) (.cse12 (= (mod v_~y$r_buff0_thd2~0_126 256) 0))) (let ((.cse15 (= (mod v_~y$r_buff1_thd2~0_120 256) 0)) (.cse1 (not .cse12)) (.cse26 (not (= (mod v_~y$w_buff0_used~0_709 256) 0))) (.cse6 (= (mod .cse25 256) 0))) (let ((.cse0 (not .cse7)) (.cse13 (not .cse6)) (.cse24 (and .cse1 .cse26)) (.cse14 (not .cse15)) (.cse23 (select |v_#memory_int_906| |v_~#y~0.base_431|))) (and (= |v_ULTIMATE.start_main_#t~nondet35#1_115| v_~weak$$choice2~0_252) (= (ite (= (ite (not (and (= |v_ULTIMATE.start_main_#t~ite38#1_134| 2) (= 2 v_~__unbuffered_p0_EAX~0_186) (= v_~__unbuffered_p1_EAX~0_89 1) (= v_~__unbuffered_p2_EAX~0_100 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= v_~y$w_buff0_used~0_709 (ite (and .cse0 .cse1) 0 .cse2)) (= v_~y$w_buff1~0_432 v_~y$w_buff1~0_431) (= v_~y$flush_delayed~0_228 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (= v_~weak$$choice0~0_161 |v_ULTIMATE.start_main_#t~nondet34#1_111|) (= v_~y$r_buff1_thd0~0_315 (ite .cse3 v_~y$r_buff1_thd0~0_316 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd0~0_325 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse7)) v_~y$r_buff1_thd0~0_316 0))) (= v_~y$r_buff0_thd0~0_325 (ite .cse3 v_~y$r_buff0_thd0~0_326 (ite (or .cse8 .cse7 (and .cse9 .cse6)) v_~y$r_buff0_thd0~0_326 (ite (and .cse10 .cse0) 0 v_~y$r_buff0_thd0~0_326)))) (= v_~weak$$choice1~0_81 |v_ULTIMATE.start_main_#t~nondet39#1_111|) (= v_~y$w_buff0~0_423 v_~y$w_buff0~0_422) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|) (let ((.cse11 (= |v_P1Thread1of1ForFork2_#t~mem11_78| |v_P1_#t~mem11_68|))) (or (and (= |v_P1_#t~ite12_65| |v_P1Thread1of1ForFork2_#t~ite12_78|) .cse11 .cse0 (= |v_P1_#t~ite13_65| v_~y$w_buff0~0_422) .cse1) (and (or .cse12 .cse7) (= |v_P1_#t~ite12_65| |v_P1_#t~ite13_65|) (or (and (= v_~y$w_buff1~0_431 |v_P1_#t~ite12_65|) .cse11 .cse13 .cse14) (and (or .cse6 .cse15) (= |v_P1_#t~ite12_65| |v_P1_#t~mem11_68|) (= |v_ULTIMATE.start_main_#t~ite45#1_116| |v_P1_#t~mem11_68|)))))) (or (and .cse16 (= |v_ULTIMATE.start_main_#t~ite38#1_134| |v_ULTIMATE.start_main_#t~mem37#1_168|)) (and (= |v_ULTIMATE.start_main_#t~mem37#1_168| |v_ULTIMATE.start_main_#t~mem37#1_170|) (or .cse10 (not .cse17)) .cse18 (= |v_ULTIMATE.start_main_#t~ite38#1_134| (ite .cse19 v_~y$w_buff0~0_423 v_~y$w_buff1~0_432)) (or (not .cse5) .cse10))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem40#1_162| |v_ULTIMATE.start_main_#t~mem40#1_160|)) (.cse21 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_146 256) 0))) (or (and (= v_~__unbuffered_p0_EAX~0_187 v_~__unbuffered_p0_EAX~0_186) .cse20 .cse21 (= |v_ULTIMATE.start_main_#t~ite41#1_159| |v_ULTIMATE.start_main_#t~ite41#1_157|)) (and (let ((.cse22 (= (mod v_~weak$$choice1~0_81 256) 0))) (or (and (not .cse22) (= |v_ULTIMATE.start_main_#t~ite41#1_157| |v_ULTIMATE.start_main_#t~mem40#1_160|) (= (select (select (store |v_#memory_int_906| |v_~#y~0.base_431| (store .cse23 |v_~#y~0.offset_431| |v_ULTIMATE.start_main_#t~ite38#1_134|)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_147) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_147) |v_ULTIMATE.start_main_#t~mem40#1_160|)) (and .cse22 (= |v_ULTIMATE.start_main_#t~ite41#1_157| v_~__unbuffered_p0_EAX~0_187) .cse20))) (not .cse21) (= |v_ULTIMATE.start_main_#t~ite41#1_157| v_~__unbuffered_p0_EAX~0_186)))) (= v_~y$w_buff1_used~0_715 (ite (or (and .cse13 .cse14) .cse24) 0 .cse25)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~y$r_buff0_thd2~0_125 (ite .cse24 0 v_~y$r_buff0_thd2~0_126)) (= (ite (or (and .cse14 (not (= 0 (mod v_~y$w_buff1_used~0_715 256)))) (and (not (= (mod v_~y$r_buff0_thd2~0_125 256) 0)) .cse26)) 0 v_~y$r_buff1_thd2~0_120) v_~y$r_buff1_thd2~0_119) (or (and (= |v_ULTIMATE.start_main_#t~ite38#1_134| |v_ULTIMATE.start_main_#t~mem44#1_146|) .cse27 (= |v_ULTIMATE.start_main_#t~ite45#1_116| |v_ULTIMATE.start_main_#t~mem44#1_146|)) (and (= |v_ULTIMATE.start_main_#t~ite45#1_116| v_~y$mem_tmp~0_188) (= |v_ULTIMATE.start_main_#t~mem44#1_146| |v_ULTIMATE.start_main_#t~mem44#1_148|) .cse3)) (= v_~y$mem_tmp~0_188 2) (= (store |v_#memory_int_906| |v_~#y~0.base_431| (store .cse23 |v_~#y~0.offset_431| |v_P1_#t~ite13_65|)) |v_#memory_int_904|)))))))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_111|, ~#y~0.offset=|v_~#y~0.offset_431|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_711, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_111|, ~#y~0.base=|v_~#y~0.base_431|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_148|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_187, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_159|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_423, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_115|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_100, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_146, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_162|, P1Thread1of1ForFork2_#t~mem11=|v_P1Thread1of1ForFork2_#t~mem11_78|, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_78|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_147, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_432, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_326, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, #memory_int=|v_#memory_int_906|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_316, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_170|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_717} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ~#y~0.offset=|v_~#y~0.offset_431|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_709, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_115|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_71|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ~#y~0.base=|v_~#y~0.base_431|, ~y$mem_tmp~0=v_~y$mem_tmp~0_188, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_186, ~weak$$choice1~0=v_~weak$$choice1~0_81, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_422, ~y$flush_delayed~0=v_~y$flush_delayed~0_228, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_100, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_146, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_74|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_41|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_73|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_147, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, ~weak$$choice0~0=v_~weak$$choice0~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_431, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_325, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, #memory_int=|v_#memory_int_904|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_147, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_133|, ~weak$$choice2~0=v_~weak$$choice2~0_252, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_315, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_715} AuxVars[|v_P1_#t~ite12_65|, |v_P1_#t~ite13_65|, |v_ULTIMATE.start_main_#t~mem44#1_146|, |v_ULTIMATE.start_main_#t~ite38#1_134|, |v_ULTIMATE.start_main_#t~ite45#1_116|, |v_ULTIMATE.start_main_#t~mem40#1_160|, |v_P1_#t~mem11_68|, |v_ULTIMATE.start_main_#t~ite41#1_157|, |v_ULTIMATE.start_main_#t~mem37#1_168|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet35#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, P1Thread1of1ForFork2_#t~mem11, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite13, ULTIMATE.start_main_#t~mem36#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0] and [656] L827-->L835: Formula: (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_72 256) 0))) (let ((.cse11 (= (mod v_~y$r_buff1_thd3~0_73 256) 0)) (.cse10 (= (mod v_~y$w_buff1_used~0_219 256) 0)) (.cse8 (= (mod v_~y$w_buff0_used~0_218 256) 0)) (.cse2 (not .cse9)) (.cse1 (not (= (mod v_~y$w_buff0_used~0_217 256) 0)))) (let ((.cse6 (and .cse2 .cse1)) (.cse3 (not .cse8)) (.cse5 (not .cse10)) (.cse0 (not .cse11)) (.cse4 (select |v_#memory_int_265| |v_~#y~0.base_186|))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_218 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_71 256) 0)))) 0 v_~y$r_buff1_thd3~0_73) v_~y$r_buff1_thd3~0_72) (= v_~y$w_buff0_used~0_217 (ite (and .cse2 .cse3) 0 v_~y$w_buff0_used~0_218)) (= (store |v_#memory_int_265| |v_~#y~0.base_186| (store .cse4 |v_~#y~0.offset_186| |v_P2_#t~ite24_25|)) |v_#memory_int_264|) (= v_~y$w_buff1_used~0_218 (ite (or (and .cse5 .cse0) .cse6) 0 v_~y$w_buff1_used~0_219)) (= v_~y$r_buff0_thd3~0_71 (ite .cse6 0 v_~y$r_buff0_thd3~0_72)) (let ((.cse7 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and .cse7 (= |v_P2_#t~ite23_29| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_90) .cse2 .cse3) (and (or .cse8 .cse9) (or (and .cse7 .cse5 (= v_~y$w_buff1~0_102 |v_P2_#t~ite23_29|) .cse0) (and (or .cse10 .cse11) (= |v_P2_#t~ite23_29| |v_P2_#t~mem22_30|) (= |v_P2_#t~mem22_30| (select .cse4 |v_~#y~0.offset_186|)))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_29|)))))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_73, ~#y~0.offset=|v_~#y~0.offset_186|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_102, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_72, ~y$w_buff0~0=v_~y$w_buff0~0_90, #memory_int=|v_#memory_int_265|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_186|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_219} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_72, ~#y~0.offset=|v_~#y~0.offset_186|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_102, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_71, ~y$w_buff0~0=v_~y$w_buff0~0_90, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_264|, ~#y~0.base=|v_~#y~0.base_186|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_218} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~mem22_30|, |v_P2_#t~ite23_29|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-13 11:59:08,150 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] L825-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~y$w_buff0_used~0_696 256) 0)) (.cse11 (= (mod v_~y$r_buff1_thd0~0_304 256) 0)) (.cse13 (= (mod v_~y$w_buff1_used~0_702 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd0~0_314 256) 0))) (let ((.cse3 (= (mod v_~weak$$choice2~0_246 256) 0)) (.cse17 (and .cse13 .cse8)) (.cse5 (and .cse8 .cse11)) (.cse12 (not .cse18)) (.cse9 (not .cse8))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_701 256) 0)) (.cse2 (and .cse12 .cse9)) (.cse1 (or .cse17 .cse5 .cse18)) (.cse4 (select |v_#memory_int_888| |v_~#y~0.base_425|)) (.cse0 (not .cse3)) (.cse6 (= (mod v_~y$w_buff0_used~0_695 256) 0))) (and (= v_~y$w_buff0_used~0_695 (ite .cse0 v_~y$w_buff0_used~0_696 (ite .cse1 v_~y$w_buff0_used~0_696 (ite .cse2 0 v_~y$w_buff0_used~0_696)))) (= |v_ULTIMATE.start_main_#t~nondet39#1_99| v_~weak$$choice1~0_75) (= |v_ULTIMATE.start_main_#t~nondet35#1_103| v_~weak$$choice2~0_246) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_104| |v_ULTIMATE.start_main_#t~mem44#1_128|) .cse3 (= |v_ULTIMATE.start_main_#t~ite38#1_122| |v_ULTIMATE.start_main_#t~mem44#1_128|)) (and (= |v_ULTIMATE.start_main_#t~mem44#1_128| |v_ULTIMATE.start_main_#t~mem44#1_130|) .cse0 (= |v_ULTIMATE.start_main_#t~ite45#1_104| v_~y$mem_tmp~0_182))) (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29|) (= v_~main$tmp_guard1~0_62 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_83 1) (= |v_ULTIMATE.start_main_#t~ite38#1_122| 2) (= 2 v_~__unbuffered_p0_EAX~0_174) (= v_~__unbuffered_p2_EAX~0_94 1))) 1 0) 0) 0 1)) (= v_~y$mem_tmp~0_182 2) (= (store |v_#memory_int_888| |v_~#y~0.base_425| (store .cse4 |v_~#y~0.offset_425| |v_ULTIMATE.start_main_#t~ite45#1_104|)) |v_#memory_int_886|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33| 0) (= (ite .cse0 v_~y$r_buff0_thd0~0_314 (ite (or .cse5 .cse6 (and .cse7 .cse8)) v_~y$r_buff0_thd0~0_314 (ite (and (not .cse6) .cse9) 0 v_~y$r_buff0_thd0~0_314))) v_~y$r_buff0_thd0~0_313) (= v_~y$r_buff1_thd0~0_303 (ite .cse0 v_~y$r_buff1_thd0~0_304 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd0~0_313 256) 0))) (or .cse6 (and .cse7 .cse10) (and .cse10 .cse11))) v_~y$r_buff1_thd0~0_304 0))) (= v_~y$w_buff1~0_419 v_~y$w_buff1~0_420) (or (and .cse12 (or .cse9 (not .cse13)) (= |v_ULTIMATE.start_main_#t~mem37#1_152| |v_ULTIMATE.start_main_#t~mem37#1_150|) (= |v_ULTIMATE.start_main_#t~ite38#1_122| (ite .cse2 v_~y$w_buff0~0_411 v_~y$w_buff1~0_420)) (or .cse9 (not .cse11))) (and .cse1 (= |v_ULTIMATE.start_main_#t~ite38#1_122| |v_ULTIMATE.start_main_#t~mem37#1_150|))) (= |v_ULTIMATE.start_main_#t~nondet34#1_99| v_~weak$$choice0~0_155) (let ((.cse15 (= |v_ULTIMATE.start_main_#t~mem40#1_144| |v_ULTIMATE.start_main_#t~mem40#1_142|)) (.cse16 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_140 256) 0))) (or (and (let ((.cse14 (= (mod v_~weak$$choice1~0_75 256) 0))) (or (and .cse14 (= |v_ULTIMATE.start_main_#t~ite41#1_139| v_~__unbuffered_p0_EAX~0_175) .cse15) (and (= |v_ULTIMATE.start_main_#t~ite41#1_139| |v_ULTIMATE.start_main_#t~mem40#1_142|) (= |v_ULTIMATE.start_main_#t~mem40#1_142| (select (select (store |v_#memory_int_888| |v_~#y~0.base_425| (store .cse4 |v_~#y~0.offset_425| |v_ULTIMATE.start_main_#t~ite38#1_122|)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_141) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_141)) (not .cse14)))) (= |v_ULTIMATE.start_main_#t~ite41#1_139| v_~__unbuffered_p0_EAX~0_174) (not .cse16)) (and (= v_~__unbuffered_p0_EAX~0_175 v_~__unbuffered_p0_EAX~0_174) (= |v_ULTIMATE.start_main_#t~ite41#1_139| |v_ULTIMATE.start_main_#t~ite41#1_141|) .cse15 .cse16))) (= (ite .cse0 v_~y$w_buff1_used~0_702 (ite (or .cse17 .cse5 .cse6) v_~y$w_buff1_used~0_702 0)) v_~y$w_buff1_used~0_701) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|) (= v_~y$w_buff0~0_411 v_~y$w_buff0~0_410) (= v_~y$flush_delayed~0_222 0))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_99|, ~#y~0.offset=|v_~#y~0.offset_425|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_696, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_144|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_99|, ~#y~0.base=|v_~#y~0.base_425|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_141, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_130|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_175, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_141|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_420, ~y$w_buff0~0=v_~y$w_buff0~0_411, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_314, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_103|, #memory_int=|v_#memory_int_888|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_141, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_304, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_152|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_702} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_33|, ~#y~0.offset=|v_~#y~0.offset_425|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_695, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_103|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_65|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~#y~0.base=|v_~#y~0.base_425|, ~y$mem_tmp~0=v_~y$mem_tmp~0_182, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_174, ~weak$$choice1~0=v_~weak$$choice1~0_75, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_410, ~y$flush_delayed~0=v_~y$flush_delayed~0_222, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_94, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_68|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_67|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_141, ~weak$$choice0~0=v_~weak$$choice0~0_155, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29|, ~y$w_buff1~0=v_~y$w_buff1~0_419, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_313, #memory_int=|v_#memory_int_886|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_141, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_121|, ~weak$$choice2~0=v_~weak$$choice2~0_246, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_303, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_701} AuxVars[|v_ULTIMATE.start_main_#t~mem40#1_142|, |v_ULTIMATE.start_main_#t~mem37#1_150|, |v_ULTIMATE.start_main_#t~ite45#1_104|, |v_ULTIMATE.start_main_#t~ite38#1_122|, |v_ULTIMATE.start_main_#t~ite41#1_139|, |v_ULTIMATE.start_main_#t~mem44#1_128|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet35#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ULTIMATE.start_main_#t~mem36#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0] and [656] L827-->L835: Formula: (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_72 256) 0))) (let ((.cse11 (= (mod v_~y$r_buff1_thd3~0_73 256) 0)) (.cse10 (= (mod v_~y$w_buff1_used~0_219 256) 0)) (.cse8 (= (mod v_~y$w_buff0_used~0_218 256) 0)) (.cse2 (not .cse9)) (.cse1 (not (= (mod v_~y$w_buff0_used~0_217 256) 0)))) (let ((.cse6 (and .cse2 .cse1)) (.cse3 (not .cse8)) (.cse5 (not .cse10)) (.cse0 (not .cse11)) (.cse4 (select |v_#memory_int_265| |v_~#y~0.base_186|))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_218 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_71 256) 0)))) 0 v_~y$r_buff1_thd3~0_73) v_~y$r_buff1_thd3~0_72) (= v_~y$w_buff0_used~0_217 (ite (and .cse2 .cse3) 0 v_~y$w_buff0_used~0_218)) (= (store |v_#memory_int_265| |v_~#y~0.base_186| (store .cse4 |v_~#y~0.offset_186| |v_P2_#t~ite24_25|)) |v_#memory_int_264|) (= v_~y$w_buff1_used~0_218 (ite (or (and .cse5 .cse0) .cse6) 0 v_~y$w_buff1_used~0_219)) (= v_~y$r_buff0_thd3~0_71 (ite .cse6 0 v_~y$r_buff0_thd3~0_72)) (let ((.cse7 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and .cse7 (= |v_P2_#t~ite23_29| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_90) .cse2 .cse3) (and (or .cse8 .cse9) (or (and .cse7 .cse5 (= v_~y$w_buff1~0_102 |v_P2_#t~ite23_29|) .cse0) (and (or .cse10 .cse11) (= |v_P2_#t~ite23_29| |v_P2_#t~mem22_30|) (= |v_P2_#t~mem22_30| (select .cse4 |v_~#y~0.offset_186|)))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_29|)))))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_73, ~#y~0.offset=|v_~#y~0.offset_186|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_102, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_72, ~y$w_buff0~0=v_~y$w_buff0~0_90, #memory_int=|v_#memory_int_265|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_186|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_219} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_72, ~#y~0.offset=|v_~#y~0.offset_186|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_102, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_71, ~y$w_buff0~0=v_~y$w_buff0~0_90, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_264|, ~#y~0.base=|v_~#y~0.base_186|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_218} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~mem22_30|, |v_P2_#t~ite23_29|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-13 11:59:10,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [770] L825-->L802: Formula: (let ((.cse18 (= (mod v_~y$w_buff1_used~0_723 256) 0)) (.cse14 (= (mod v_~y$r_buff1_thd0~0_320 256) 0)) (.cse29 (= (mod v_~y$w_buff0_used~0_717 256) 0)) (.cse22 (= (mod v_~y$r_buff0_thd0~0_330 256) 0))) (let ((.cse17 (not .cse22)) (.cse16 (not .cse29)) (.cse21 (and .cse22 .cse14)) (.cse28 (and .cse22 .cse18)) (.cse20 (= (mod v_~weak$$choice2~0_254 256) 0))) (let ((.cse12 (not .cse20)) (.cse19 (or .cse21 .cse29 .cse28)) (.cse15 (and .cse17 .cse16))) (let ((.cse27 (ite .cse12 v_~y$w_buff0_used~0_717 (ite .cse19 v_~y$w_buff0_used~0_717 (ite .cse15 0 v_~y$w_buff0_used~0_717))))) (let ((.cse6 (= (mod .cse27 256) 0))) (let ((.cse11 (ite .cse12 v_~y$w_buff1_used~0_723 (ite (or .cse21 .cse6 .cse28) v_~y$w_buff1_used~0_723 0))) (.cse5 (= (mod v_~y$r_buff0_thd2~0_130 256) 0))) (let ((.cse1 (= (mod v_~y$r_buff1_thd2~0_124 256) 0)) (.cse7 (not .cse5)) (.cse26 (not (= (mod v_~y$w_buff0_used~0_715 256) 0))) (.cse0 (= (mod .cse11 256) 0))) (let ((.cse2 (not .cse0)) (.cse10 (and .cse7 .cse26)) (.cse9 (select |v_#memory_int_912| |v_~#y~0.base_433|)) (.cse3 (not .cse1)) (.cse8 (not .cse6))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= v_~weak$$choice0~0_163 |v_ULTIMATE.start_main_#t~nondet34#1_115|) (let ((.cse4 (= |v_P1Thread1of1ForFork2_#t~mem11_82| |v_P1_#t~mem11_70|))) (or (and (or (and (or .cse0 .cse1) (= |v_P1_#t~ite12_67| |v_P1_#t~mem11_70|) (= |v_ULTIMATE.start_main_#t~ite45#1_120| |v_P1_#t~mem11_70|)) (and (= v_~y$w_buff1~0_435 |v_P1_#t~ite12_67|) .cse2 .cse3 .cse4)) (or .cse5 .cse6) (= |v_P1_#t~ite12_67| |v_P1_#t~ite13_67|)) (and .cse7 .cse8 (= |v_P1_#t~ite12_67| |v_P1Thread1of1ForFork2_#t~ite12_82|) (= |v_P1_#t~ite13_67| v_~y$w_buff0~0_426) .cse4))) (= (store |v_#memory_int_912| |v_~#y~0.base_433| (store .cse9 |v_~#y~0.offset_433| |v_P1_#t~ite13_67|)) |v_#memory_int_910|) (= v_~y$w_buff1_used~0_721 (ite (or (and .cse2 .cse3) .cse10) 0 .cse11)) (= v_~y$mem_tmp~0_190 2) (= |v_ULTIMATE.start_main_#t~nondet35#1_119| v_~weak$$choice2~0_254) (= v_~y$r_buff1_thd0~0_319 (ite .cse12 v_~y$r_buff1_thd0~0_320 (ite (let ((.cse13 (= (mod v_~y$r_buff0_thd0~0_329 256) 0))) (or (and .cse0 .cse13) (and .cse13 .cse14) .cse6)) v_~y$r_buff1_thd0~0_320 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem37#1_174| |v_ULTIMATE.start_main_#t~mem37#1_176|) (= |v_ULTIMATE.start_main_#t~ite38#1_138| (ite .cse15 v_~y$w_buff0~0_427 v_~y$w_buff1~0_436)) .cse16 (or .cse17 (not .cse18)) (or .cse17 (not .cse14))) (and .cse19 (= |v_ULTIMATE.start_main_#t~ite38#1_138| |v_ULTIMATE.start_main_#t~mem37#1_174|))) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_120| |v_ULTIMATE.start_main_#t~mem44#1_152|) (= |v_ULTIMATE.start_main_#t~ite38#1_138| |v_ULTIMATE.start_main_#t~mem44#1_152|) .cse20) (and (= |v_ULTIMATE.start_main_#t~mem44#1_154| |v_ULTIMATE.start_main_#t~mem44#1_152|) (= |v_ULTIMATE.start_main_#t~ite45#1_120| v_~y$mem_tmp~0_190) .cse12)) (= v_~y$flush_delayed~0_230 0) (= (ite .cse10 0 v_~y$r_buff0_thd2~0_130) v_~y$r_buff0_thd2~0_129) (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|) (= v_~y$r_buff0_thd0~0_329 (ite .cse12 v_~y$r_buff0_thd0~0_330 (ite (or .cse21 .cse6 (and .cse0 .cse22)) v_~y$r_buff0_thd0~0_330 (ite (and .cse17 .cse8) 0 v_~y$r_buff0_thd0~0_330)))) (= v_~main$tmp_guard1~0_70 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_91 1) (= 2 v_~__unbuffered_p0_EAX~0_190) (= |v_ULTIMATE.start_main_#t~ite38#1_138| 2) (= v_~__unbuffered_p2_EAX~0_102 1))) 1 0) 0) 0 1)) (let ((.cse24 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_148 256))) (.cse23 (= |v_ULTIMATE.start_main_#t~mem40#1_168| |v_ULTIMATE.start_main_#t~mem40#1_166|))) (or (and (= v_~__unbuffered_p0_EAX~0_191 v_~__unbuffered_p0_EAX~0_190) .cse23 (= |v_ULTIMATE.start_main_#t~ite41#1_165| |v_ULTIMATE.start_main_#t~ite41#1_163|) .cse24) (and (= |v_ULTIMATE.start_main_#t~ite41#1_163| v_~__unbuffered_p0_EAX~0_190) (not .cse24) (let ((.cse25 (= (mod v_~weak$$choice1~0_83 256) 0))) (or (and (not .cse25) (= (select (select (store |v_#memory_int_912| |v_~#y~0.base_433| (store .cse9 |v_~#y~0.offset_433| |v_ULTIMATE.start_main_#t~ite38#1_138|)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149) |v_ULTIMATE.start_main_#t~mem40#1_166|) (= |v_ULTIMATE.start_main_#t~ite41#1_163| |v_ULTIMATE.start_main_#t~mem40#1_166|)) (and .cse25 .cse23 (= |v_ULTIMATE.start_main_#t~ite41#1_163| v_~__unbuffered_p0_EAX~0_191))))))) (= v_~y$r_buff1_thd2~0_123 (ite (or (and .cse26 (not (= (mod v_~y$r_buff0_thd2~0_129 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_721 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_124)) (= v_~y$w_buff0~0_427 v_~y$w_buff0~0_426) (= v_~y$w_buff0_used~0_715 (ite (and .cse7 .cse8) 0 .cse27)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|) (= v_~weak$$choice1~0_83 |v_ULTIMATE.start_main_#t~nondet39#1_115|) (= v_~y$w_buff1~0_436 v_~y$w_buff1~0_435)))))))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_115|, ~#y~0.offset=|v_~#y~0.offset_433|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_717, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_115|, ~#y~0.base=|v_~#y~0.base_433|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_154|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_191, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_165|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, ~y$w_buff0~0=v_~y$w_buff0~0_427, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_119|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_102, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_148, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_168|, P1Thread1of1ForFork2_#t~mem11=|v_P1Thread1of1ForFork2_#t~mem11_82|, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_82|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_436, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_330, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_130, #memory_int=|v_#memory_int_912|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_176|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_723} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~#y~0.offset=|v_~#y~0.offset_433|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_715, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_119|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_73|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ~#y~0.base=|v_~#y~0.base_433|, ~y$mem_tmp~0=v_~y$mem_tmp~0_190, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_190, ~weak$$choice1~0=v_~weak$$choice1~0_83, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, ~y$w_buff0~0=v_~y$w_buff0~0_426, ~y$flush_delayed~0=v_~y$flush_delayed~0_230, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_102, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_148, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_76|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_43|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_75|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_123, ~weak$$choice0~0=v_~weak$$choice0~0_163, ~y$w_buff1~0=v_~y$w_buff1~0_435, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_329, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_129, #memory_int=|v_#memory_int_910|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_137|, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_319, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_721} AuxVars[|v_ULTIMATE.start_main_#t~ite38#1_138|, |v_ULTIMATE.start_main_#t~mem37#1_174|, |v_ULTIMATE.start_main_#t~ite41#1_163|, |v_P1_#t~ite12_67|, |v_P1_#t~mem11_70|, |v_P1_#t~ite13_67|, |v_ULTIMATE.start_main_#t~mem44#1_152|, |v_ULTIMATE.start_main_#t~mem40#1_166|, |v_ULTIMATE.start_main_#t~ite45#1_120|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet35#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, P1Thread1of1ForFork2_#t~mem11, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite13, ULTIMATE.start_main_#t~mem36#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0] and [656] L827-->L835: Formula: (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_72 256) 0))) (let ((.cse11 (= (mod v_~y$r_buff1_thd3~0_73 256) 0)) (.cse10 (= (mod v_~y$w_buff1_used~0_219 256) 0)) (.cse8 (= (mod v_~y$w_buff0_used~0_218 256) 0)) (.cse2 (not .cse9)) (.cse1 (not (= (mod v_~y$w_buff0_used~0_217 256) 0)))) (let ((.cse6 (and .cse2 .cse1)) (.cse3 (not .cse8)) (.cse5 (not .cse10)) (.cse0 (not .cse11)) (.cse4 (select |v_#memory_int_265| |v_~#y~0.base_186|))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_218 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_71 256) 0)))) 0 v_~y$r_buff1_thd3~0_73) v_~y$r_buff1_thd3~0_72) (= v_~y$w_buff0_used~0_217 (ite (and .cse2 .cse3) 0 v_~y$w_buff0_used~0_218)) (= (store |v_#memory_int_265| |v_~#y~0.base_186| (store .cse4 |v_~#y~0.offset_186| |v_P2_#t~ite24_25|)) |v_#memory_int_264|) (= v_~y$w_buff1_used~0_218 (ite (or (and .cse5 .cse0) .cse6) 0 v_~y$w_buff1_used~0_219)) (= v_~y$r_buff0_thd3~0_71 (ite .cse6 0 v_~y$r_buff0_thd3~0_72)) (let ((.cse7 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and .cse7 (= |v_P2_#t~ite23_29| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_90) .cse2 .cse3) (and (or .cse8 .cse9) (or (and .cse7 .cse5 (= v_~y$w_buff1~0_102 |v_P2_#t~ite23_29|) .cse0) (and (or .cse10 .cse11) (= |v_P2_#t~ite23_29| |v_P2_#t~mem22_30|) (= |v_P2_#t~mem22_30| (select .cse4 |v_~#y~0.offset_186|)))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_29|)))))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_73, ~#y~0.offset=|v_~#y~0.offset_186|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_102, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_72, ~y$w_buff0~0=v_~y$w_buff0~0_90, #memory_int=|v_#memory_int_265|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_186|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_219} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_72, ~#y~0.offset=|v_~#y~0.offset_186|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_102, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_71, ~y$w_buff0~0=v_~y$w_buff0~0_90, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_264|, ~#y~0.base=|v_~#y~0.base_186|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_218} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~mem22_30|, |v_P2_#t~ite23_29|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-13 11:59:13,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [767] L825-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~y$w_buff1_used~0_706 256) 0)) (.cse2 (= (mod v_~y$r_buff1_thd0~0_308 256) 0)) (.cse18 (= (mod v_~y$w_buff0_used~0_700 256) 0)) (.cse16 (= (mod v_~y$r_buff0_thd0~0_318 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_248 256) 0)) (.cse10 (not .cse16)) (.cse9 (not .cse18)) (.cse15 (and .cse2 .cse16)) (.cse17 (and .cse11 .cse16))) (let ((.cse7 (or .cse18 .cse15 .cse17)) (.cse8 (and .cse10 .cse9)) (.cse6 (select |v_#memory_int_894| |v_~#y~0.base_427|)) (.cse4 (= (mod v_~y$w_buff1_used~0_705 256) 0)) (.cse1 (not .cse0)) (.cse5 (= (mod v_~y$w_buff0_used~0_699 256) 0))) (and (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite45#1_108| |v_ULTIMATE.start_main_#t~mem44#1_134|) (= |v_ULTIMATE.start_main_#t~ite38#1_126| |v_ULTIMATE.start_main_#t~mem44#1_134|)) (and (= |v_ULTIMATE.start_main_#t~mem44#1_136| |v_ULTIMATE.start_main_#t~mem44#1_134|) (= |v_ULTIMATE.start_main_#t~ite45#1_108| v_~y$mem_tmp~0_184) .cse1)) (= v_~y$flush_delayed~0_224 0) (= v_~y$w_buff1~0_424 v_~y$w_buff1~0_423) (= (ite .cse1 v_~y$r_buff1_thd0~0_308 (ite (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_317 256) 0))) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) v_~y$r_buff1_thd0~0_308 0)) v_~y$r_buff1_thd0~0_307) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= |v_#memory_int_892| (store |v_#memory_int_894| |v_~#y~0.base_427| (store .cse6 |v_~#y~0.offset_427| |v_ULTIMATE.start_main_#t~ite45#1_108|))) (= (ite .cse1 v_~y$w_buff0_used~0_700 (ite .cse7 v_~y$w_buff0_used~0_700 (ite .cse8 0 v_~y$w_buff0_used~0_700))) v_~y$w_buff0_used~0_699) (or (and .cse7 (= |v_ULTIMATE.start_main_#t~ite38#1_126| |v_ULTIMATE.start_main_#t~mem37#1_156|)) (and .cse9 (or .cse10 (not .cse2)) (= |v_ULTIMATE.start_main_#t~mem37#1_158| |v_ULTIMATE.start_main_#t~mem37#1_156|) (= |v_ULTIMATE.start_main_#t~ite38#1_126| (ite .cse8 v_~y$w_buff0~0_415 v_~y$w_buff1~0_424)) (or .cse10 (not .cse11)))) (= v_~weak$$choice0~0_157 |v_ULTIMATE.start_main_#t~nondet34#1_103|) (= |v_ULTIMATE.start_main_#t~nondet35#1_107| v_~weak$$choice2~0_248) (let ((.cse14 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_142 256) 0)) (.cse12 (= |v_ULTIMATE.start_main_#t~mem40#1_148| |v_ULTIMATE.start_main_#t~mem40#1_150|))) (or (and (let ((.cse13 (= (mod v_~weak$$choice1~0_77 256) 0))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite41#1_145| v_~__unbuffered_p0_EAX~0_179) .cse13) (and (= (select (select (store |v_#memory_int_894| |v_~#y~0.base_427| (store .cse6 |v_~#y~0.offset_427| |v_ULTIMATE.start_main_#t~ite38#1_126|)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143) |v_ULTIMATE.start_main_#t~mem40#1_148|) (= |v_ULTIMATE.start_main_#t~ite41#1_145| |v_ULTIMATE.start_main_#t~mem40#1_148|) (not .cse13)))) (not .cse14) (= |v_ULTIMATE.start_main_#t~ite41#1_145| v_~__unbuffered_p0_EAX~0_178)) (and (= v_~__unbuffered_p0_EAX~0_179 v_~__unbuffered_p0_EAX~0_178) .cse14 .cse12 (= |v_ULTIMATE.start_main_#t~ite41#1_147| |v_ULTIMATE.start_main_#t~ite41#1_145|)))) (= v_~y$r_buff0_thd0~0_317 (ite .cse1 v_~y$r_buff0_thd0~0_318 (ite (or .cse15 (and .cse4 .cse16) .cse5) v_~y$r_buff0_thd0~0_318 (ite (and .cse10 (not .cse5)) 0 v_~y$r_buff0_thd0~0_318)))) (= v_~weak$$choice1~0_77 |v_ULTIMATE.start_main_#t~nondet39#1_103|) (= v_~y$mem_tmp~0_184 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= v_~y$w_buff0~0_415 v_~y$w_buff0~0_414) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31| (mod v_~main$tmp_guard1~0_64 256)) (= (ite .cse1 v_~y$w_buff1_used~0_706 (ite (or .cse15 .cse17 .cse5) v_~y$w_buff1_used~0_706 0)) v_~y$w_buff1_used~0_705) (= v_~main$tmp_guard1~0_64 (ite (= (ite (not (and (= |v_ULTIMATE.start_main_#t~ite38#1_126| 2) (= v_~__unbuffered_p2_EAX~0_96 1) (= v_~__unbuffered_p1_EAX~0_85 1) (= 2 v_~__unbuffered_p0_EAX~0_178))) 1 0) 0) 0 1)))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_103|, ~#y~0.offset=|v_~#y~0.offset_427|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_700, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_150|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_103|, ~#y~0.base=|v_~#y~0.base_427|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_136|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_179, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_147|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_85, ~y$w_buff1~0=v_~y$w_buff1~0_424, ~y$w_buff0~0=v_~y$w_buff0~0_415, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_318, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_107|, #memory_int=|v_#memory_int_894|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_142, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_308, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_158|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_706} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ~#y~0.offset=|v_~#y~0.offset_427|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_699, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_107|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_67|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ~#y~0.base=|v_~#y~0.base_427|, ~y$mem_tmp~0=v_~y$mem_tmp~0_184, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~weak$$choice1~0=v_~weak$$choice1~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_414, ~y$flush_delayed~0=v_~y$flush_delayed~0_224, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_142, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_70|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_69|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_157, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_31|, ~y$w_buff1~0=v_~y$w_buff1~0_423, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_317, #memory_int=|v_#memory_int_892|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_125|, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_705} AuxVars[|v_ULTIMATE.start_main_#t~mem44#1_134|, |v_ULTIMATE.start_main_#t~ite45#1_108|, |v_ULTIMATE.start_main_#t~ite38#1_126|, |v_ULTIMATE.start_main_#t~mem37#1_156|, |v_ULTIMATE.start_main_#t~ite41#1_145|, |v_ULTIMATE.start_main_#t~mem40#1_148|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~y$w_buff0~0, ULTIMATE.start_main_#t~nondet35#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~mem40#1, ULTIMATE.start_main_#t~mem36#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0] and [656] L827-->L835: Formula: (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_72 256) 0))) (let ((.cse11 (= (mod v_~y$r_buff1_thd3~0_73 256) 0)) (.cse10 (= (mod v_~y$w_buff1_used~0_219 256) 0)) (.cse8 (= (mod v_~y$w_buff0_used~0_218 256) 0)) (.cse2 (not .cse9)) (.cse1 (not (= (mod v_~y$w_buff0_used~0_217 256) 0)))) (let ((.cse6 (and .cse2 .cse1)) (.cse3 (not .cse8)) (.cse5 (not .cse10)) (.cse0 (not .cse11)) (.cse4 (select |v_#memory_int_265| |v_~#y~0.base_186|))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_218 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_71 256) 0)))) 0 v_~y$r_buff1_thd3~0_73) v_~y$r_buff1_thd3~0_72) (= v_~y$w_buff0_used~0_217 (ite (and .cse2 .cse3) 0 v_~y$w_buff0_used~0_218)) (= (store |v_#memory_int_265| |v_~#y~0.base_186| (store .cse4 |v_~#y~0.offset_186| |v_P2_#t~ite24_25|)) |v_#memory_int_264|) (= v_~y$w_buff1_used~0_218 (ite (or (and .cse5 .cse0) .cse6) 0 v_~y$w_buff1_used~0_219)) (= v_~y$r_buff0_thd3~0_71 (ite .cse6 0 v_~y$r_buff0_thd3~0_72)) (let ((.cse7 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and .cse7 (= |v_P2_#t~ite23_29| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_90) .cse2 .cse3) (and (or .cse8 .cse9) (or (and .cse7 .cse5 (= v_~y$w_buff1~0_102 |v_P2_#t~ite23_29|) .cse0) (and (or .cse10 .cse11) (= |v_P2_#t~ite23_29| |v_P2_#t~mem22_30|) (= |v_P2_#t~mem22_30| (select .cse4 |v_~#y~0.offset_186|)))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_29|)))))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_73, ~#y~0.offset=|v_~#y~0.offset_186|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_102, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_72, ~y$w_buff0~0=v_~y$w_buff0~0_90, #memory_int=|v_#memory_int_265|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_186|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_219} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_72, ~#y~0.offset=|v_~#y~0.offset_186|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_102, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_71, ~y$w_buff0~0=v_~y$w_buff0~0_90, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_264|, ~#y~0.base=|v_~#y~0.base_186|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_218} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~mem22_30|, |v_P2_#t~ite23_29|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-13 11:59:15,684 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [643] L780-->L785: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:59:15,701 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [755] L780-->P0FINAL: Formula: (and (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 11:59:15,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [650] L802-->L805: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:59:15,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [756] L780-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_129 (+ v_~__unbuffered_cnt~0_130 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 11:59:15,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [676] L802-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 11:59:15,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L857-3-->L861: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [680] L802-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_11| 0) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 11:59:17,287 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:59:17,288 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13231 [2022-12-13 11:59:17,288 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 68 transitions, 536 flow [2022-12-13 11:59:17,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:17,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:17,288 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:17,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:59:17,288 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting L802 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:59:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:17,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2106563702, now seen corresponding path program 1 times [2022-12-13 11:59:17,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:17,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102172850] [2022-12-13 11:59:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:17,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:59:18,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:18,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102172850] [2022-12-13 11:59:18,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102172850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:18,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:18,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:59:18,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568974856] [2022-12-13 11:59:18,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:18,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:59:18,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:18,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:59:18,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:59:18,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 46 [2022-12-13 11:59:18,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 68 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:18,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:59:18,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 46 [2022-12-13 11:59:18,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:59:18,657 INFO L130 PetriNetUnfolder]: 1347/2304 cut-off events. [2022-12-13 11:59:18,657 INFO L131 PetriNetUnfolder]: For 4277/4472 co-relation queries the response was YES. [2022-12-13 11:59:18,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9736 conditions, 2304 events. 1347/2304 cut-off events. For 4277/4472 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 13586 event pairs, 244 based on Foata normal form. 36/1780 useless extension candidates. Maximal degree in co-relation 9716. Up to 1610 conditions per place. [2022-12-13 11:59:18,669 INFO L137 encePairwiseOnDemand]: 38/46 looper letters, 56 selfloop transitions, 6 changer transitions 19/88 dead transitions. [2022-12-13 11:59:18,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 826 flow [2022-12-13 11:59:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:59:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:59:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-13 11:59:18,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-13 11:59:18,671 INFO L175 Difference]: Start difference. First operand has 57 places, 68 transitions, 536 flow. Second operand 4 states and 86 transitions. [2022-12-13 11:59:18,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 826 flow [2022-12-13 11:59:18,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 780 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-13 11:59:18,679 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 420 flow [2022-12-13 11:59:18,679 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=420, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2022-12-13 11:59:18,680 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2022-12-13 11:59:18,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:59:18,680 INFO L89 Accepts]: Start accepts. Operand has 60 places, 57 transitions, 420 flow [2022-12-13 11:59:18,681 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:59:18,681 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:59:18,681 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 57 transitions, 420 flow [2022-12-13 11:59:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 57 transitions, 420 flow [2022-12-13 11:59:18,816 INFO L130 PetriNetUnfolder]: 670/1234 cut-off events. [2022-12-13 11:59:18,816 INFO L131 PetriNetUnfolder]: For 1652/1742 co-relation queries the response was YES. [2022-12-13 11:59:18,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 1234 events. 670/1234 cut-off events. For 1652/1742 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 7516 event pairs, 226 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 4240. Up to 850 conditions per place. [2022-12-13 11:59:18,826 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 57 transitions, 420 flow [2022-12-13 11:59:18,826 INFO L226 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-13 11:59:19,547 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:59:19,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 868 [2022-12-13 11:59:19,548 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 424 flow [2022-12-13 11:59:19,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:19,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:19,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:19,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:59:19,548 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:59:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1030927999, now seen corresponding path program 1 times [2022-12-13 11:59:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:19,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074615347] [2022-12-13 11:59:19,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:19,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:19,749 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 11:59:19,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:19,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074615347] [2022-12-13 11:59:19,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074615347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:19,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:19,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:59:19,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453355712] [2022-12-13 11:59:19,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:19,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:59:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:19,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:59:19,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:59:19,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-13 11:59:19,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:19,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:59:19,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-13 11:59:19,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:59:20,105 INFO L130 PetriNetUnfolder]: 1145/1844 cut-off events. [2022-12-13 11:59:20,105 INFO L131 PetriNetUnfolder]: For 4159/4195 co-relation queries the response was YES. [2022-12-13 11:59:20,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8056 conditions, 1844 events. 1145/1844 cut-off events. For 4159/4195 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9414 event pairs, 43 based on Foata normal form. 9/1161 useless extension candidates. Maximal degree in co-relation 8034. Up to 1387 conditions per place. [2022-12-13 11:59:20,116 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 59 selfloop transitions, 19 changer transitions 0/82 dead transitions. [2022-12-13 11:59:20,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 738 flow [2022-12-13 11:59:20,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:59:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:59:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 11:59:20,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 11:59:20,119 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 424 flow. Second operand 4 states and 76 transitions. [2022-12-13 11:59:20,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 738 flow [2022-12-13 11:59:20,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 663 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-12-13 11:59:20,131 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 396 flow [2022-12-13 11:59:20,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=396, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2022-12-13 11:59:20,133 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2022-12-13 11:59:20,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:59:20,133 INFO L89 Accepts]: Start accepts. Operand has 53 places, 55 transitions, 396 flow [2022-12-13 11:59:20,134 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:59:20,134 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:59:20,134 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 55 transitions, 396 flow [2022-12-13 11:59:20,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 396 flow [2022-12-13 11:59:20,230 INFO L130 PetriNetUnfolder]: 643/1156 cut-off events. [2022-12-13 11:59:20,230 INFO L131 PetriNetUnfolder]: For 1056/1272 co-relation queries the response was YES. [2022-12-13 11:59:20,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 1156 events. 643/1156 cut-off events. For 1056/1272 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 6743 event pairs, 118 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 4613. Up to 814 conditions per place. [2022-12-13 11:59:20,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 55 transitions, 396 flow [2022-12-13 11:59:20,236 INFO L226 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-13 11:59:20,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] $Ultimate##0-->L794: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.offset_21| v_P1Thread1of1ForFork2_~arg.offset_21) (= (store |v_#memory_int_773| |v_~#y~0.base_380| (store (select |v_#memory_int_773| |v_~#y~0.base_380|) |v_~#y~0.offset_380| 1)) |v_#memory_int_772|) (= |v_P1Thread1of1ForFork2_#in~arg.base_21| v_P1Thread1of1ForFork2_~arg.base_21) (= v_~x~0_54 v_~__unbuffered_p1_EAX~0_63)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, ~#y~0.offset=|v_~#y~0.offset_380|, #memory_int=|v_#memory_int_773|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~#y~0.base=|v_~#y~0.base_380|, ~x~0=v_~x~0_54} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_21, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_21, ~#y~0.offset=|v_~#y~0.offset_380|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, #memory_int=|v_#memory_int_772|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~#y~0.base=|v_~#y~0.base_380|, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0, #memory_int] and [687] $Ultimate##0-->L825: Formula: (let ((.cse7 (= (mod v_~y$r_buff1_thd3~0_87 256) 0)) (.cse4 (= (mod v_~y$w_buff1_used~0_281 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_86 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_280 256) 0))) (let ((.cse8 (= (mod v_~weak$$choice2~0_130 256) 0)) (.cse6 (not .cse16)) (.cse5 (not .cse13)) (.cse12 (select |v_#memory_int_339| |v_~#y~0.base_220|)) (.cse15 (and .cse13 .cse4)) (.cse14 (and .cse7 .cse13))) (let ((.cse2 (or .cse16 .cse15 .cse14)) (.cse0 (select .cse12 |v_~#y~0.offset_220|)) (.cse3 (and .cse6 .cse5)) (.cse9 (= (mod v_~y$w_buff1_used~0_280 256) 0)) (.cse1 (not .cse8)) (.cse11 (= (mod v_~y$w_buff0_used~0_279 256) 0))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff1~0_151 v_~y$w_buff1~0_150) (= v_~y$mem_tmp~0_64 .cse0) (= v_~y$w_buff0_used~0_279 (ite .cse1 v_~y$w_buff0_used~0_280 (ite .cse2 v_~y$w_buff0_used~0_280 (ite .cse3 0 v_~y$w_buff0_used~0_280)))) (or (and .cse2 (= |v_P2_#t~mem17_34| v_~__unbuffered_p2_EAX~0_32) (= |v_P2_#t~mem17_34| .cse0)) (and (or (not .cse4) .cse5) .cse6 (or .cse5 (not .cse7)) (= (ite .cse3 v_~y$w_buff0~0_135 v_~y$w_buff1~0_151) v_~__unbuffered_p2_EAX~0_32) (= |v_P2Thread1of1ForFork0_#t~mem17_6| |v_P2_#t~mem17_34|))) (or (and (= |v_P2_#t~ite21_37| |v_P2_#t~mem20_34|) (= |v_P2_#t~mem20_34| v_~__unbuffered_p2_EAX~0_32) .cse8) (and (= |v_P2Thread1of1ForFork0_#t~mem20_6| |v_P2_#t~mem20_34|) (= |v_P2_#t~ite21_37| v_~y$mem_tmp~0_64) .cse1)) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse1 v_~y$r_buff1_thd3~0_87 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_85 256) 0))) (or (and .cse9 .cse10) .cse11 (and .cse7 .cse10))) v_~y$r_buff1_thd3~0_87 0)) v_~y$r_buff1_thd3~0_86) (= v_~weak$$choice0~0_37 |v_P2Thread1of1ForFork0_#t~nondet14_6|) (= (store |v_#memory_int_339| |v_~#y~0.base_220| (store .cse12 |v_~#y~0.offset_220| |v_P2_#t~ite21_37|)) |v_#memory_int_338|) (= v_~y$flush_delayed~0_106 0) (= (ite .cse1 v_~y$r_buff0_thd3~0_86 (ite (or .cse11 (and .cse9 .cse13) .cse14) v_~y$r_buff0_thd3~0_86 (ite (and (not .cse11) .cse5) 0 v_~y$r_buff0_thd3~0_86))) v_~y$r_buff0_thd3~0_85) (= v_~y$w_buff1_used~0_280 (ite .cse1 v_~y$w_buff1_used~0_281 (ite (or .cse15 .cse11 .cse14) v_~y$w_buff1_used~0_281 0))) (= v_~y$w_buff0~0_135 v_~y$w_buff0~0_134) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork0_#t~nondet15_6|))))) InVars {~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_280, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_6|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_6|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_6|, ~#y~0.base=|v_~#y~0.base_220|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_135, #memory_int=|v_#memory_int_339|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_281, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_6|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_5|, ~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_279, ~#y~0.base=|v_~#y~0.base_220|, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_86, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_134, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_150, #memory_int=|v_#memory_int_338|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_5|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_280} AuxVars[|v_P2_#t~ite21_37|, |v_P2_#t~mem17_34|, |v_P2_#t~mem20_34|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem17, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-13 11:59:21,100 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:59:21,101 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 968 [2022-12-13 11:59:21,101 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 404 flow [2022-12-13 11:59:21,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:59:21,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:21,102 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:21,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:59:21,102 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:59:21,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1601912626, now seen corresponding path program 1 times [2022-12-13 11:59:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:21,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972329510] [2022-12-13 11:59:21,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:21,269 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 11:59:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:21,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972329510] [2022-12-13 11:59:21,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972329510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:21,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:21,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:59:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118952908] [2022-12-13 11:59:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:21,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:59:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:21,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:59:21,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:59:21,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-13 11:59:21,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 55 transitions, 404 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 11:59:21,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:59:21,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-13 11:59:21,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:59:21,662 INFO L130 PetriNetUnfolder]: 809/1491 cut-off events. [2022-12-13 11:59:21,662 INFO L131 PetriNetUnfolder]: For 3122/3167 co-relation queries the response was YES. [2022-12-13 11:59:21,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7191 conditions, 1491 events. 809/1491 cut-off events. For 3122/3167 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8755 event pairs, 61 based on Foata normal form. 189/1162 useless extension candidates. Maximal degree in co-relation 7172. Up to 919 conditions per place. [2022-12-13 11:59:21,668 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 55 selfloop transitions, 20 changer transitions 32/111 dead transitions. [2022-12-13 11:59:21,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 1062 flow [2022-12-13 11:59:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:59:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:59:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-13 11:59:21,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2022-12-13 11:59:21,670 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 404 flow. Second operand 6 states and 112 transitions. [2022-12-13 11:59:21,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 1062 flow [2022-12-13 11:59:21,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 111 transitions, 949 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 11:59:21,677 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 421 flow [2022-12-13 11:59:21,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2022-12-13 11:59:21,678 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2022-12-13 11:59:21,678 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:59:21,678 INFO L89 Accepts]: Start accepts. Operand has 58 places, 56 transitions, 421 flow [2022-12-13 11:59:21,679 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:59:21,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:59:21,679 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 56 transitions, 421 flow [2022-12-13 11:59:21,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 421 flow [2022-12-13 11:59:21,763 INFO L130 PetriNetUnfolder]: 334/772 cut-off events. [2022-12-13 11:59:21,764 INFO L131 PetriNetUnfolder]: For 1317/1413 co-relation queries the response was YES. [2022-12-13 11:59:21,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3118 conditions, 772 events. 334/772 cut-off events. For 1317/1413 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 4958 event pairs, 40 based on Foata normal form. 15/492 useless extension candidates. Maximal degree in co-relation 3100. Up to 487 conditions per place. [2022-12-13 11:59:21,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 56 transitions, 421 flow [2022-12-13 11:59:21,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-13 11:59:21,787 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:59:21,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 11:59:21,788 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 421 flow [2022-12-13 11:59:21,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 11:59:21,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:21,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:21,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:59:21,788 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:59:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:21,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1587061658, now seen corresponding path program 1 times [2022-12-13 11:59:21,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:21,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845812493] [2022-12-13 11:59:21,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:21,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:21,998 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 11:59:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:21,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845812493] [2022-12-13 11:59:21,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845812493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:21,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:21,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:59:21,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985259227] [2022-12-13 11:59:21,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:21,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:59:22,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:22,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:59:22,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:59:22,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-13 11:59:22,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 11:59:22,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:59:22,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-13 11:59:22,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:59:22,275 INFO L130 PetriNetUnfolder]: 404/858 cut-off events. [2022-12-13 11:59:22,275 INFO L131 PetriNetUnfolder]: For 2492/2525 co-relation queries the response was YES. [2022-12-13 11:59:22,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4174 conditions, 858 events. 404/858 cut-off events. For 2492/2525 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5037 event pairs, 7 based on Foata normal form. 126/734 useless extension candidates. Maximal degree in co-relation 4153. Up to 502 conditions per place. [2022-12-13 11:59:22,280 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 44 selfloop transitions, 29 changer transitions 24/101 dead transitions. [2022-12-13 11:59:22,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 101 transitions, 932 flow [2022-12-13 11:59:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:59:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:59:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-12-13 11:59:22,289 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2022-12-13 11:59:22,289 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 421 flow. Second operand 8 states and 109 transitions. [2022-12-13 11:59:22,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 101 transitions, 932 flow [2022-12-13 11:59:22,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 101 transitions, 826 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-12-13 11:59:22,302 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 400 flow [2022-12-13 11:59:22,303 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=400, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2022-12-13 11:59:22,303 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 23 predicate places. [2022-12-13 11:59:22,303 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:59:22,303 INFO L89 Accepts]: Start accepts. Operand has 62 places, 54 transitions, 400 flow [2022-12-13 11:59:22,307 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:59:22,307 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:59:22,307 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 54 transitions, 400 flow [2022-12-13 11:59:22,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 54 transitions, 400 flow [2022-12-13 11:59:22,360 INFO L130 PetriNetUnfolder]: 136/403 cut-off events. [2022-12-13 11:59:22,361 INFO L131 PetriNetUnfolder]: For 651/696 co-relation queries the response was YES. [2022-12-13 11:59:22,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1637 conditions, 403 events. 136/403 cut-off events. For 651/696 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2392 event pairs, 4 based on Foata normal form. 11/251 useless extension candidates. Maximal degree in co-relation 1617. Up to 190 conditions per place. [2022-12-13 11:59:22,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 54 transitions, 400 flow [2022-12-13 11:59:22,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 11:59:27,955 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:59:27,956 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5653 [2022-12-13 11:59:27,956 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 388 flow [2022-12-13 11:59:27,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 11:59:27,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:59:27,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:27,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:59:27,956 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 11:59:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1394340321, now seen corresponding path program 1 times [2022-12-13 11:59:27,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:27,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922010409] [2022-12-13 11:59:27,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:27,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:59:28,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:59:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:59:28,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:59:28,080 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:59:28,081 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 11:59:28,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 11:59:28,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 11:59:28,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 11:59:28,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 11:59:28,086 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:28,090 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:59:28,090 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:59:28,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:59:28 BasicIcfg [2022-12-13 11:59:28,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:59:28,190 INFO L158 Benchmark]: Toolchain (without parser) took 57720.19ms. Allocated memory was 176.2MB in the beginning and 645.9MB in the end (delta: 469.8MB). Free memory was 151.3MB in the beginning and 500.9MB in the end (delta: -349.5MB). Peak memory consumption was 121.3MB. Max. memory is 8.0GB. [2022-12-13 11:59:28,190 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:59:28,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.53ms. Allocated memory is still 176.2MB. Free memory was 150.8MB in the beginning and 122.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 11:59:28,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.66ms. Allocated memory is still 176.2MB. Free memory was 122.5MB in the beginning and 119.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:59:28,191 INFO L158 Benchmark]: Boogie Preprocessor took 62.46ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 116.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:59:28,191 INFO L158 Benchmark]: RCFGBuilder took 1074.31ms. Allocated memory was 176.2MB in the beginning and 248.5MB in the end (delta: 72.4MB). Free memory was 116.7MB in the beginning and 203.4MB in the end (delta: -86.7MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. [2022-12-13 11:59:28,191 INFO L158 Benchmark]: TraceAbstraction took 55901.91ms. Allocated memory was 248.5MB in the beginning and 645.9MB in the end (delta: 397.4MB). Free memory was 201.9MB in the beginning and 500.9MB in the end (delta: -299.0MB). Peak memory consumption was 99.5MB. Max. memory is 8.0GB. [2022-12-13 11:59:28,193 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 176.2MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 596.53ms. Allocated memory is still 176.2MB. Free memory was 150.8MB in the beginning and 122.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.66ms. Allocated memory is still 176.2MB. Free memory was 122.5MB in the beginning and 119.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.46ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 116.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1074.31ms. Allocated memory was 176.2MB in the beginning and 248.5MB in the end (delta: 72.4MB). Free memory was 116.7MB in the beginning and 203.4MB in the end (delta: -86.7MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. * TraceAbstraction took 55901.91ms. Allocated memory was 248.5MB in the beginning and 645.9MB in the end (delta: 397.4MB). Free memory was 201.9MB in the beginning and 500.9MB in the end (delta: -299.0MB). Peak memory consumption was 99.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 119 PlacesBefore, 39 PlacesAfterwards, 110 TransitionsBefore, 30 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1365, independent: 1272, independent conditional: 1272, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1365, independent: 1272, independent conditional: 0, independent unconditional: 1272, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1365, independent: 1272, independent conditional: 0, independent unconditional: 1272, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1365, independent: 1272, independent conditional: 0, independent unconditional: 1272, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 867, independent: 822, independent conditional: 0, independent unconditional: 822, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 867, independent: 802, independent conditional: 0, independent unconditional: 802, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 421, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 389, dependent conditional: 0, dependent unconditional: 389, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1365, independent: 450, independent conditional: 0, independent unconditional: 450, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 867, unknown conditional: 0, unknown unconditional: 867] , Statistics on independence cache: Total cache size (in pairs): 1597, Positive cache size: 1552, Positive conditional cache size: 0, Positive unconditional cache size: 1552, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, 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.2s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 143, independent: 111, independent conditional: 111, 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: 143, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 143, independent: 111, independent conditional: 0, independent unconditional: 111, 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: 143, independent: 111, independent conditional: 0, independent unconditional: 111, 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: 123, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 123, independent: 81, independent conditional: 0, independent unconditional: 81, 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: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 197, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 123, unknown conditional: 0, unknown unconditional: 123] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 108, independent conditional: 7, independent unconditional: 101, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 134, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 134, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 43 PlacesBefore, 42 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 237, independent conditional: 237, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 286, independent: 237, independent conditional: 43, independent unconditional: 194, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 286, independent: 237, independent conditional: 0, independent unconditional: 237, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 286, independent: 237, independent conditional: 0, independent unconditional: 237, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 286, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 55, unknown conditional: 0, unknown unconditional: 55] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222, independent: 180, independent conditional: 180, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 222, independent: 180, independent conditional: 26, independent unconditional: 154, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222, independent: 180, independent conditional: 1, independent unconditional: 179, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222, independent: 180, independent conditional: 1, independent unconditional: 179, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 222, independent: 172, independent conditional: 1, independent unconditional: 171, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 86, independent conditional: 12, independent unconditional: 74, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 86, independent conditional: 6, independent unconditional: 80, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 86, independent conditional: 6, independent unconditional: 80, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 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: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, independent: 86, independent conditional: 6, independent unconditional: 80, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 52 PlacesBefore, 52 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 194, independent: 170, independent conditional: 170, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 194, independent: 170, independent conditional: 84, independent unconditional: 86, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 194, independent: 170, independent conditional: 66, independent unconditional: 104, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 194, independent: 170, independent conditional: 66, independent unconditional: 104, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 8, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 143, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 194, independent: 157, independent conditional: 58, independent unconditional: 99, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 15, unknown conditional: 8, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 192, Positive conditional cache size: 8, Positive unconditional cache size: 184, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 84, independent conditional: 45, independent unconditional: 39, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 84, independent conditional: 32, independent unconditional: 52, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 84, independent conditional: 32, independent unconditional: 52, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 79, independent conditional: 27, independent unconditional: 52, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 197, Positive conditional cache size: 13, Positive unconditional cache size: 184, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.6s, 59 PlacesBefore, 59 PlacesAfterwards, 53 TransitionsBefore, 55 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 192, independent: 170, independent conditional: 170, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 192, independent: 170, independent conditional: 100, independent unconditional: 70, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 192, independent: 170, independent conditional: 86, independent unconditional: 84, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 192, independent: 170, independent conditional: 86, independent unconditional: 84, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 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: 192, independent: 151, independent conditional: 67, independent unconditional: 84, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 224, Positive conditional cache size: 32, Positive unconditional cache size: 192, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.1s, 57 PlacesBefore, 57 PlacesAfterwards, 65 TransitionsBefore, 68 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 294, independent: 294, independent conditional: 294, 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: 294, independent: 294, independent conditional: 252, independent unconditional: 42, 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: 294, independent: 294, independent conditional: 252, independent unconditional: 42, 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: 294, independent: 294, independent conditional: 252, independent unconditional: 42, 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: 21, independent: 21, independent conditional: 18, 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: 21, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 43, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 294, independent: 273, independent conditional: 234, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 21, unknown conditional: 18, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 313, Positive conditional cache size: 50, Positive unconditional cache size: 263, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 59 PlacesBefore, 59 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 24, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 30, independent conditional: 22, independent unconditional: 8, 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: 30, independent: 30, independent conditional: 22, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 28, independent conditional: 22, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 325, Positive conditional cache size: 50, Positive unconditional cache size: 275, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 53 PlacesBefore, 53 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 339, Positive conditional cache size: 50, Positive unconditional cache size: 289, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 339, Positive conditional cache size: 50, Positive unconditional cache size: 289, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 60 PlacesBefore, 56 PlacesAfterwards, 54 TransitionsBefore, 51 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 410, Positive cache size: 369, Positive conditional cache size: 62, Positive unconditional cache size: 307, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1789, ((void *)0), P0, ((void *)0))=0, t1789={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t1790; [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1790, ((void *)0), P1, ((void *)0))=1, t1789={7:0}, t1790={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t1791; [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1791, ((void *)0), P2, ((void *)0))=2, t1789={7:0}, t1790={8:0}, t1791={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 [L779] 1 x = 1 [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 __unbuffered_p1_EAX = x [L794] 2 y = 1 [L811] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 2 y$flush_delayed = weak$$choice2 [L814] EXPR 2 \read(y) [L814] 2 y$mem_tmp = y [L815] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 2 \read(y) [L815] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 2 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 2 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 2 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 2 \read(y) [L822] 2 __unbuffered_p2_EAX = y [L823] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L823] 2 y = y$flush_delayed ? y$mem_tmp : y [L824] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __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=3, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __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=3, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 3 y = 2 [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __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=3, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __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=3, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 855]: 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: 853]: 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: 857]: 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, 150 locations, 4 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: 55.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 494 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 494 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1227 IncrementalHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 184 mSolverCounterUnsat, 4 mSDtfsCounter, 1227 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=536occurred in iteration=10, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 1823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 11:59:28,238 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...