/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:11:47,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:11:47,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:11:47,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:11:47,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:11:47,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:11:47,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:11:48,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:11:48,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:11:48,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:11:48,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:11:48,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:11:48,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:11:48,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:11:48,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:11:48,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:11:48,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:11:48,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:11:48,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:11:48,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:11:48,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:11:48,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:11:48,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:11:48,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:11:48,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:11:48,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:11:48,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:11:48,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:11:48,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:11:48,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:11:48,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:11:48,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:11:48,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:11:48,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:11:48,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:11:48,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:11:48,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:11:48,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:11:48,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:11:48,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:11:48,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:11:48,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:11:48,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:11:48,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:11:48,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:11:48,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:11:48,077 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:11:48,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:11:48,078 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:11:48,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:11:48,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:11:48,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:11:48,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:11:48,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:11:48,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:11:48,079 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:11:48,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:11:48,079 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:11:48,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:11:48,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:11:48,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:11:48,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:11:48,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:11:48,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:11:48,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:11:48,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:11:48,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:11:48,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:11:48,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:11:48,081 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:11:48,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:11:48,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:11:48,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:11:48,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:11:48,394 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:11:48,395 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:11:48,396 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-12-05 23:11:49,579 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:11:49,777 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:11:49,778 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-12-05 23:11:49,797 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd8f484b/0a75d9d2e9a24d36baad7585758c6a5d/FLAGee02c3556 [2022-12-05 23:11:49,813 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd8f484b/0a75d9d2e9a24d36baad7585758c6a5d [2022-12-05 23:11:49,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:11:49,817 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:11:49,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:11:49,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:11:49,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:11:49,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:11:49" (1/1) ... [2022-12-05 23:11:49,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720aebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:49, skipping insertion in model container [2022-12-05 23:11:49,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:11:49" (1/1) ... [2022-12-05 23:11:49,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:11:49,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:11:49,993 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/safe006_power.opt-thin000_power.opt.i[969,982] [2022-12-05 23:11:50,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:11:50,236 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:11:50,248 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/safe006_power.opt-thin000_power.opt.i[969,982] [2022-12-05 23:11:50,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:50,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:50,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:11:50,318 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:11:50,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50 WrapperNode [2022-12-05 23:11:50,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:11:50,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:11:50,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:11:50,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:11:50,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (1/1) ... [2022-12-05 23:11:50,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (1/1) ... [2022-12-05 23:11:50,369 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-12-05 23:11:50,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:11:50,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:11:50,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:11:50,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:11:50,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (1/1) ... [2022-12-05 23:11:50,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (1/1) ... [2022-12-05 23:11:50,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (1/1) ... [2022-12-05 23:11:50,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (1/1) ... [2022-12-05 23:11:50,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (1/1) ... [2022-12-05 23:11:50,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (1/1) ... [2022-12-05 23:11:50,399 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (1/1) ... [2022-12-05 23:11:50,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (1/1) ... [2022-12-05 23:11:50,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:11:50,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:11:50,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:11:50,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:11:50,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (1/1) ... [2022-12-05 23:11:50,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:11:50,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:11:50,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:11:50,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:11:50,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:11:50,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:11:50,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:11:50,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:11:50,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:11:50,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:11:50,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:11:50,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:11:50,494 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:11:50,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:11:50,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:11:50,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:11:50,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:11:50,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:11:50,497 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:11:50,617 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:11:50,627 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:11:51,058 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:11:51,383 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:11:51,383 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:11:51,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:11:51 BoogieIcfgContainer [2022-12-05 23:11:51,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:11:51,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:11:51,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:11:51,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:11:51,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:11:49" (1/3) ... [2022-12-05 23:11:51,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625e2d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:11:51, skipping insertion in model container [2022-12-05 23:11:51,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:50" (2/3) ... [2022-12-05 23:11:51,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625e2d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:11:51, skipping insertion in model container [2022-12-05 23:11:51,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:11:51" (3/3) ... [2022-12-05 23:11:51,395 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2022-12-05 23:11:51,411 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:11:51,411 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:11:51,411 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:11:51,476 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:11:51,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 220 flow [2022-12-05 23:11:51,552 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 23:11:51,552 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:51,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 23:11:51,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 105 transitions, 220 flow [2022-12-05 23:11:51,561 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 103 transitions, 212 flow [2022-12-05 23:11:51,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:51,587 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 103 transitions, 212 flow [2022-12-05 23:11:51,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 103 transitions, 212 flow [2022-12-05 23:11:51,618 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 23:11:51,618 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:51,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 23:11:51,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 103 transitions, 212 flow [2022-12-05 23:11:51,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 1034 [2022-12-05 23:12:10,121 INFO L203 LiptonReduction]: Total number of compositions: 86 [2022-12-05 23:12:10,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:12:10,139 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;@3832a31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:12:10,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:12:10,142 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-05 23:12:10,142 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:12:10,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:10,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:12:10,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:12:10,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:10,147 INFO L85 PathProgramCache]: Analyzing trace with hash 21796768, now seen corresponding path program 1 times [2022-12-05 23:12:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:10,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775148401] [2022-12-05 23:12:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:12:10,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:10,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775148401] [2022-12-05 23:12:10,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775148401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:10,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:10,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:12:10,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829138949] [2022-12-05 23:12:10,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:10,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:12:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:10,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:12:10,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:12:10,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 23:12:10,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:10,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:10,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 23:12:10,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:10,744 INFO L130 PetriNetUnfolder]: 179/321 cut-off events. [2022-12-05 23:12:10,744 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 23:12:10,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 321 events. 179/321 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1306 event pairs, 56 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 642. Up to 205 conditions per place. [2022-12-05 23:12:10,751 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 20 selfloop transitions, 2 changer transitions 6/29 dead transitions. [2022-12-05 23:12:10,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 123 flow [2022-12-05 23:12:10,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:12:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:12:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-05 23:12:10,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-05 23:12:10,766 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 36 transitions. [2022-12-05 23:12:10,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 123 flow [2022-12-05 23:12:10,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:12:10,771 INFO L231 Difference]: Finished difference. Result has 25 places, 15 transitions, 38 flow [2022-12-05 23:12:10,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=25, PETRI_TRANSITIONS=15} [2022-12-05 23:12:10,777 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 23:12:10,777 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:10,778 INFO L89 Accepts]: Start accepts. Operand has 25 places, 15 transitions, 38 flow [2022-12-05 23:12:10,780 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:10,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:10,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 15 transitions, 38 flow [2022-12-05 23:12:10,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 15 transitions, 38 flow [2022-12-05 23:12:10,789 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-05 23:12:10,789 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:12:10,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:12:10,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 15 transitions, 38 flow [2022-12-05 23:12:10,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 23:12:10,895 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:12:10,898 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-05 23:12:10,898 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-05 23:12:10,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:10,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:10,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:10,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:12:10,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:12:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash 876009641, now seen corresponding path program 1 times [2022-12-05 23:12:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:10,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941647139] [2022-12-05 23:12:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:10,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:12:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:11,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941647139] [2022-12-05 23:12:11,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941647139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:11,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:11,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:12:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738913883] [2022-12-05 23:12:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:11,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:12:11,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:12:11,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:12:11,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:12:11,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:11,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:11,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:12:11,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:11,258 INFO L130 PetriNetUnfolder]: 106/195 cut-off events. [2022-12-05 23:12:11,258 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 23:12:11,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 195 events. 106/195 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 727 event pairs, 18 based on Foata normal form. 4/198 useless extension candidates. Maximal degree in co-relation 412. Up to 173 conditions per place. [2022-12-05 23:12:11,263 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 19 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2022-12-05 23:12:11,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 96 flow [2022-12-05 23:12:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:12:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:12:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-05 23:12:11,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 23:12:11,267 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 25 transitions. [2022-12-05 23:12:11,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 96 flow [2022-12-05 23:12:11,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:12:11,271 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2022-12-05 23:12:11,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2022-12-05 23:12:11,272 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -4 predicate places. [2022-12-05 23:12:11,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:11,272 INFO L89 Accepts]: Start accepts. Operand has 23 places, 15 transitions, 42 flow [2022-12-05 23:12:11,272 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:11,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:11,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-05 23:12:11,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 15 transitions, 42 flow [2022-12-05 23:12:11,278 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-05 23:12:11,278 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:12:11,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:12:11,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-05 23:12:11,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-05 23:12:11,333 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:12:11,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-05 23:12:11,335 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2022-12-05 23:12:11,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:11,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:11,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:11,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:12:11,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:12:11,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:11,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1386493607, now seen corresponding path program 1 times [2022-12-05 23:12:11,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:11,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704095889] [2022-12-05 23:12:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:11,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:12:11,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:11,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704095889] [2022-12-05 23:12:11,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704095889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:11,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:11,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:12:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393744474] [2022-12-05 23:12:11,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:11,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:12:11,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:11,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:12:11,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:12:11,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:12:11,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:11,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:11,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:12:11,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:11,629 INFO L130 PetriNetUnfolder]: 160/294 cut-off events. [2022-12-05 23:12:11,629 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-05 23:12:11,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 294 events. 160/294 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1041 event pairs, 47 based on Foata normal form. 20/314 useless extension candidates. Maximal degree in co-relation 640. Up to 114 conditions per place. [2022-12-05 23:12:11,631 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 18 selfloop transitions, 3 changer transitions 7/28 dead transitions. [2022-12-05 23:12:11,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 127 flow [2022-12-05 23:12:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:12:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:12:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-05 23:12:11,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:12:11,633 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 30 transitions. [2022-12-05 23:12:11,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 127 flow [2022-12-05 23:12:11,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:12:11,634 INFO L231 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2022-12-05 23:12:11,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2022-12-05 23:12:11,638 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2022-12-05 23:12:11,639 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:11,640 INFO L89 Accepts]: Start accepts. Operand has 26 places, 15 transitions, 52 flow [2022-12-05 23:12:11,640 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:11,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:11,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 15 transitions, 52 flow [2022-12-05 23:12:11,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 15 transitions, 52 flow [2022-12-05 23:12:11,647 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-05 23:12:11,647 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:12:11,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 15 events. 0/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:12:11,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 15 transitions, 52 flow [2022-12-05 23:12:11,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-05 23:12:11,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] L798-->L801: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] and [612] $Ultimate##0-->L754: Formula: (and (= |v_P0Thread1of1ForFork0_~arg#1.offset_5| |v_P0Thread1of1ForFork0_#in~arg#1.offset_5|) (= v_~y~0_4 v_~__unbuffered_p0_EAX~0_14) (= |v_P0Thread1of1ForFork0_~arg#1.base_5| |v_P0Thread1of1ForFork0_#in~arg#1.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_5|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_5|, ~y~0=v_~y~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_5|, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_5|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_5|, ~y~0=v_~y~0_4, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset] [2022-12-05 23:12:13,005 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:12:13,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1367 [2022-12-05 23:12:13,006 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 13 transitions, 48 flow [2022-12-05 23:12:13,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:13,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:13,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:13,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:12:13,007 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:12:13,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1386665223, now seen corresponding path program 1 times [2022-12-05 23:12:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:13,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996551028] [2022-12-05 23:12:13,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:13,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:12:14,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:14,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996551028] [2022-12-05 23:12:14,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996551028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:14,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:14,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:12:14,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796275806] [2022-12-05 23:12:14,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:14,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:12:14,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:14,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:12:14,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:12:14,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 23:12:14,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 13 transitions, 48 flow. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:14,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:14,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 23:12:14,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:14,177 INFO L130 PetriNetUnfolder]: 58/112 cut-off events. [2022-12-05 23:12:14,177 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 23:12:14,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 112 events. 58/112 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 311 event pairs, 20 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 270. Up to 98 conditions per place. [2022-12-05 23:12:14,178 INFO L137 encePairwiseOnDemand]: 6/13 looper letters, 16 selfloop transitions, 7 changer transitions 0/23 dead transitions. [2022-12-05 23:12:14,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 114 flow [2022-12-05 23:12:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:12:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:12:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-12-05 23:12:14,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-05 23:12:14,180 INFO L175 Difference]: Start difference. First operand has 24 places, 13 transitions, 48 flow. Second operand 5 states and 25 transitions. [2022-12-05 23:12:14,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 114 flow [2022-12-05 23:12:14,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 23 transitions, 100 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-05 23:12:14,183 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 77 flow [2022-12-05 23:12:14,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-05 23:12:14,184 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 23:12:14,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:14,185 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 77 flow [2022-12-05 23:12:14,185 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:14,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:14,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 77 flow [2022-12-05 23:12:14,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 77 flow [2022-12-05 23:12:14,196 INFO L130 PetriNetUnfolder]: 10/38 cut-off events. [2022-12-05 23:12:14,196 INFO L131 PetriNetUnfolder]: For 11/12 co-relation queries the response was YES. [2022-12-05 23:12:14,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 38 events. 10/38 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 102 event pairs, 4 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 85. Up to 20 conditions per place. [2022-12-05 23:12:14,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 77 flow [2022-12-05 23:12:14,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-05 23:12:14,246 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [688] $Ultimate##0-->L754: Formula: (let ((.cse4 (= (mod v_~x$r_buff0_thd2~0_268 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_505 256) 0)) (.cse25 (mod v_~x$w_buff0_used~0_506 256)) (.cse26 (mod v_~weak$$choice0~0_109 256))) (let ((.cse17 (= .cse26 0)) (.cse16 (= (mod v_~x$w_buff1_used~0_449 256) 0)) (.cse22 (= .cse25 0)) (.cse7 (= 0 (mod v_~weak$$choice2~0_78 256))) (.cse3 (not .cse1)) (.cse11 (not .cse4)) (.cse23 (select |v_#memory_int_480| |v_~#x~0.base_250|))) (let ((.cse18 (select .cse23 |v_~#x~0.offset_250|)) (.cse2 (and .cse3 .cse11)) (.cse6 (not (= (mod v_~x$w_buff1_used~0_448 256) 0))) (.cse0 (not .cse7)) (.cse8 (not .cse22)) (.cse20 (not .cse16)) (.cse5 (= (mod v_~x$r_buff1_thd2~0_264 256) 0)) (.cse21 (= (mod v_~weak$$choice1~0_150 256) 0)) (.cse19 (not .cse17))) (and (= (ite .cse0 v_~x$r_buff0_thd2~0_268 (ite .cse1 v_~x$r_buff0_thd2~0_268 (ite .cse2 0 (ite (and .cse3 .cse4 .cse5 .cse6) v_~x$r_buff0_thd2~0_268 0)))) v_~x$r_buff0_thd2~0_267) (= v_P1Thread1of1ForFork1_~arg.base_23 |v_P1Thread1of1ForFork1_#in~arg.base_23|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_118 |v_~#x~0.base_250|) (= v_~x$w_buff1~0_269 v_~x$w_buff1~0_270) (= v_~weak$$choice0~0_109 |v_P1Thread1of1ForFork1_#t~nondet6_46|) (= v_~y~0_46 1) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_118 |v_~#x~0.offset_250|) (= v_~weak$$choice2~0_78 |v_P1Thread1of1ForFork1_#t~nondet7_46|) (= v_~weak$$choice1~0_150 |v_P1Thread1of1ForFork1_#t~nondet9_46|) (or (and (= |v_P1_#t~ite21_56| |v_P1_#t~mem20_63|) (= v_~__unbuffered_p1_EAX~0_163 |v_P1_#t~mem20_63|) .cse7) (and .cse0 (= |v_P1Thread1of1ForFork1_#t~mem20_46| |v_P1_#t~mem20_63|) (= |v_P1_#t~ite21_56| v_~x$mem_tmp~0_66))) (let ((.cse9 (= |v_P1_#t~ite16_78| |v_P1Thread1of1ForFork1_#t~ite16_46|)) (.cse10 (= |v_P1_#t~ite12_82| |v_P1Thread1of1ForFork1_#t~ite12_46|)) (.cse12 (= |v_P1_#t~ite14_88| |v_P1Thread1of1ForFork1_#t~ite14_46|)) (.cse13 (= |v_P1_#t~ite15_82| |v_P1Thread1of1ForFork1_#t~ite15_46|)) (.cse14 (= |v_P1Thread1of1ForFork1_#t~mem11_46| |v_P1_#t~mem11_83|)) (.cse15 (= |v_P1Thread1of1ForFork1_#t~mem13_46| |v_P1_#t~mem13_91|))) (or (and .cse8 (= |v_P1Thread1of1ForFork1_#t~mem10_46| |v_P1_#t~mem10_61|) (or (and .cse9 (= |v_P1_#t~ite17_66| v_~x$w_buff0~0_312) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse4 (= |v_P1_#t~ite17_66| |v_P1_#t~ite16_78|) (or (and (= |v_P1_#t~ite15_82| |v_P1_#t~ite16_78|) (or .cse16 (not .cse5)) .cse10 (or (and .cse16 (or (and .cse17 (= |v_P1_#t~ite14_88| |v_P1_#t~mem13_91|) (= |v_P1_#t~mem13_91| .cse18)) (and (= |v_P1_#t~ite14_88| v_~x$w_buff0~0_312) .cse19 .cse15)) (= |v_P1_#t~ite14_88| |v_P1_#t~ite15_82|)) (and .cse20 (= |v_P1_#t~ite15_82| (ite .cse19 v_~x$w_buff1~0_270 v_~x$w_buff0~0_312)) .cse12 .cse15)) .cse14) (and .cse20 .cse5 (= |v_P1_#t~ite12_82| |v_P1_#t~ite16_78|) (or (and .cse17 (= |v_P1_#t~ite12_82| (ite (not .cse21) v_~x$w_buff0~0_312 v_~x$w_buff1~0_270)) .cse14) (and (= |v_P1_#t~ite12_82| |v_P1_#t~mem11_83|) (= |v_P1_#t~mem11_83| .cse18) .cse19)) .cse12 .cse13 .cse15)))) (= |v_P1_#t~ite17_66| v_~__unbuffered_p1_EAX~0_163)) (and (= |v_P1_#t~mem10_61| .cse18) .cse22 .cse9 (= v_~__unbuffered_p1_EAX~0_163 |v_P1_#t~mem10_61|) .cse10 (= |v_P1_#t~ite17_66| |v_P1Thread1of1ForFork1_#t~ite17_45|) .cse12 .cse13 .cse14 .cse15))) (= v_~y~0_46 v_~__unbuffered_p0_EAX~0_85) (= v_~x$w_buff0~0_312 v_~x$w_buff0~0_311) (= (store |v_#memory_int_480| |v_~#x~0.base_250| (store .cse23 |v_~#x~0.offset_250| |v_P1_#t~ite21_56|)) |v_#memory_int_479|) (= v_~__unbuffered_p1_EAX$read_delayed~0_115 1) (= v_~x$mem_tmp~0_66 .cse18) (= |v_P1Thread1of1ForFork1_#in~arg.offset_23| v_P1Thread1of1ForFork1_~arg.offset_23) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_23| |v_P0Thread1of1ForFork0_~arg#1.offset_23|) (= (ite .cse0 v_~x$w_buff1_used~0_449 (ite .cse1 v_~x$w_buff1_used~0_449 (ite .cse2 0 (ite (and .cse20 .cse3 .cse4 .cse5) v_~weak$$choice0~0_109 0)))) v_~x$w_buff1_used~0_448) (= (ite .cse0 v_~x$r_buff1_thd2~0_264 (ite .cse1 v_~x$r_buff1_thd2~0_264 (let ((.cse24 (= (mod v_~x$r_buff0_thd2~0_267 256) 0))) (ite (and .cse3 (not .cse24)) 0 (ite (and .cse24 .cse3 .cse5 .cse6) (ite .cse19 v_~x$r_buff1_thd2~0_264 0) 0))))) v_~x$r_buff1_thd2~0_263) (= (ite (= (ite .cse0 .cse25 (ite .cse22 .cse25 (ite (and .cse8 .cse11) 0 (ite (and .cse8 .cse20 .cse4 .cse5) (ite (or .cse21 .cse19) 1 0) .cse26)))) 0) 0 1) v_~x$w_buff0_used~0_505) (= v_~x$flush_delayed~0_88 0) (= |v_P0Thread1of1ForFork0_~arg#1.base_23| |v_P0Thread1of1ForFork0_#in~arg#1.base_23|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_312, P1Thread1of1ForFork1_#t~mem20=|v_P1Thread1of1ForFork1_#t~mem20_46|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_23|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork1_#t~mem10=|v_P1Thread1of1ForFork1_#t~mem10_46|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_23|, P1Thread1of1ForFork1_#t~mem13=|v_P1Thread1of1ForFork1_#t~mem13_46|, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_46|, ~#x~0.offset=|v_~#x~0.offset_250|, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_46|, ~x$w_buff1~0=v_~x$w_buff1~0_270, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_449, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_46|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_46|, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_46|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_268, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_46|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_46|, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_506, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_46|, #memory_int=|v_#memory_int_480|, ~#x~0.base=|v_~#x~0.base_250|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_311, ~x$flush_delayed~0=v_~x$flush_delayed~0_88, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_115, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_23|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_25|, ~x$mem_tmp~0=v_~x$mem_tmp~0_66, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~weak$$choice1~0=v_~weak$$choice1~0_150, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_163, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_118, ~y~0=v_~y~0_46, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_25|, P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_25|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_23|, ~#x~0.offset=|v_~#x~0.offset_250|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_23, ~x$w_buff1~0=v_~x$w_buff1~0_269, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_23|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_118, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_263, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_448, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_505, ~weak$$choice0~0=v_~weak$$choice0~0_109, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_23, #memory_int=|v_#memory_int_479|, ~#x~0.base=|v_~#x~0.base_250|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~weak$$choice2~0=v_~weak$$choice2~0_78, P1Thread1of1ForFork1_#t~mem19=|v_P1Thread1of1ForFork1_#t~mem19_25|} AuxVars[|v_P1_#t~ite14_88|, |v_P1_#t~ite16_78|, |v_P1_#t~mem11_83|, |v_P1_#t~mem10_61|, |v_P1_#t~ite21_56|, |v_P1_#t~mem13_91|, |v_P1_#t~ite15_82|, |v_P1_#t~ite12_82|, |v_P1_#t~ite17_66|, |v_P1_#t~mem20_63|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_#t~mem20, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, P1Thread1of1ForFork1_#t~ite21, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, ~y~0, P1Thread1of1ForFork1_#t~mem8, P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~mem10, P1Thread1of1ForFork1_#t~mem13, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, ~x$w_buff1~0, P0Thread1of1ForFork0_~arg#1.base, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork1_#t~nondet9, P1Thread1of1ForFork1_#t~ite12, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#t~ite17, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite16, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0, P1Thread1of1ForFork1_#t~mem19] and [584] L801-->L808: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_124 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_198 256) 0)) (.cse8 (not .cse6)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_197 256) 0))) (.cse1 (= (mod v_~x$w_buff1_used~0_185 256) 0)) (.cse0 (= (mod v_~x$r_buff1_thd2~0_116 256) 0))) (let ((.cse2 (select |v_#memory_int_183| |v_~#x~0.base_130|)) (.cse3 (not .cse0)) (.cse4 (not .cse1)) (.cse11 (and .cse8 .cse10)) (.cse9 (not .cse7))) (and (let ((.cse5 (= |v_P1Thread1of1ForFork1_#t~mem22_1| |v_P1_#t~mem22_34|))) (or (and (= |v_P1_#t~ite23_29| |v_P1_#t~ite24_23|) (or (and (or .cse0 .cse1) (= |v_P1_#t~ite23_29| |v_P1_#t~mem22_34|) (= (select .cse2 |v_~#x~0.offset_130|) |v_P1_#t~mem22_34|)) (and (= |v_P1_#t~ite23_29| v_~x$w_buff1~0_98) .cse3 .cse4 .cse5)) (or .cse6 .cse7)) (and .cse8 .cse9 (= |v_P1_#t~ite23_29| |v_P1Thread1of1ForFork1_#t~ite23_1|) (= |v_P1_#t~ite24_23| v_~x$w_buff0~0_103) .cse5))) (= (store |v_#memory_int_183| |v_~#x~0.base_130| (store .cse2 |v_~#x~0.offset_130| |v_P1_#t~ite24_23|)) |v_#memory_int_182|) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_184 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_123 256) 0)) .cse10)) 0 v_~x$r_buff1_thd2~0_116) v_~x$r_buff1_thd2~0_115) (= (ite (or .cse11 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_185) v_~x$w_buff1_used~0_184) (= v_~x$r_buff0_thd2~0_123 (ite .cse11 0 v_~x$r_buff0_thd2~0_124)) (= v_~x$w_buff0_used~0_197 (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_198)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_103, ~#x~0.offset=|v_~#x~0.offset_130|, ~x$w_buff1~0=v_~x$w_buff1~0_98, P1Thread1of1ForFork1_#t~mem22=|v_P1Thread1of1ForFork1_#t~mem22_1|, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_1|, #memory_int=|v_#memory_int_183|, ~#x~0.base=|v_~#x~0.base_130|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_185, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_124, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_198} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~#x~0.offset=|v_~#x~0.offset_130|, ~x$w_buff1~0=v_~x$w_buff1~0_98, #memory_int=|v_#memory_int_182|, ~#x~0.base=|v_~#x~0.base_130|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_123, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} AuxVars[|v_P1_#t~ite24_23|, |v_P1_#t~mem22_34|, |v_P1_#t~ite23_29|] AssignedVars[P1Thread1of1ForFork1_#t~mem22, #memory_int, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-05 23:12:19,211 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] $Ultimate##0-->L765: Formula: (let ((.cse23 (mod v_~x$w_buff0_used~0_538 256))) (let ((.cse24 (mod v_~weak$$choice0~0_120 256)) (.cse20 (= (mod v_~x$w_buff1_used~0_480 256) 0)) (.cse16 (= .cse23 0)) (.cse8 (= (mod v_~x$r_buff0_thd2~0_292 256) 0)) (.cse2 (= (mod v_~weak$$choice2~0_89 256) 0))) (let ((.cse1 (select |v_#memory_int_511| |v_~#x~0.base_262|)) (.cse3 (not .cse2)) (.cse10 (not .cse8)) (.cse6 (= (mod v_~x$r_buff1_thd2~0_289 256) 0)) (.cse22 (not .cse16)) (.cse9 (not .cse20)) (.cse21 (= (mod v_~weak$$choice1~0_161 256) 0)) (.cse19 (not (= .cse24 0)))) (let ((.cse0 (ite (= (ite .cse3 .cse23 (ite .cse16 .cse23 (ite (and .cse10 .cse22) 0 (ite (and .cse6 .cse8 .cse22 .cse9) (ite (or .cse21 .cse19) 1 0) .cse24)))) 0) 0 1)) (.cse13 (select .cse1 |v_~#x~0.offset_262|))) (and (= v_~x$w_buff1_used~0_478 .cse0) (= v_~y~0_57 1) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_34| |v_P0Thread1of1ForFork0_~arg#1.offset_34|) (= v_~x$flush_delayed~0_99 0) (= v_~x$w_buff0~0_334 1) (= v_~x$r_buff0_thd0~0_167 v_~x$r_buff1_thd0~0_170) (= (store |v_#memory_int_511| |v_~#x~0.base_262| (store .cse1 |v_~#x~0.offset_262| |v_P1_#t~ite21_68|)) |v_#memory_int_510|) (= v_~x$r_buff0_thd1~0_223 1) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_129 |v_~#x~0.base_262|) (= v_~weak$$choice2~0_89 |v_P1Thread1of1ForFork1_#t~nondet7_68|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_51| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_51|) (= v_~y~0_57 v_~__unbuffered_p0_EAX~0_96) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_536 256) 0)) (not (= (mod v_~x$w_buff1_used~0_478 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_51|) (= v_~weak$$choice1~0_161 |v_P1Thread1of1ForFork1_#t~nondet9_68|) (or (and .cse2 (= |v_P1_#t~ite21_68| |v_P1_#t~mem20_75|) (= v_~__unbuffered_p1_EAX~0_174 |v_P1_#t~mem20_75|)) (and (= |v_P1_#t~ite21_68| v_~x$mem_tmp~0_77) .cse3 (= |v_P1Thread1of1ForFork1_#t~mem20_68| |v_P1_#t~mem20_75|))) (= |v_P0Thread1of1ForFork0_~arg#1.base_34| |v_P0Thread1of1ForFork0_#in~arg#1.base_34|) (= v_P1Thread1of1ForFork1_~arg.base_34 |v_P1Thread1of1ForFork1_#in~arg.base_34|) (= v_~weak$$choice0~0_120 |v_P1Thread1of1ForFork1_#t~nondet6_68|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_34| v_P1Thread1of1ForFork1_~arg.offset_34) (= v_~x$r_buff0_thd1~0_224 v_~x$r_buff1_thd1~0_164) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_51| 0)) (= v_~x$r_buff0_thd2~0_291 (ite .cse3 v_~x$r_buff0_thd2~0_292 (let ((.cse4 (= (mod .cse0 256) 0))) (ite .cse4 v_~x$r_buff0_thd2~0_292 (let ((.cse7 (not .cse4))) (let ((.cse5 (and .cse10 .cse7))) (ite .cse5 0 (ite (and .cse6 .cse7 (not (= (mod (ite .cse3 v_~x$w_buff1_used~0_480 (ite .cse4 v_~x$w_buff1_used~0_480 (ite .cse5 0 (ite (and .cse6 .cse7 .cse8 .cse9) v_~weak$$choice0~0_120 0)))) 256) 0)) .cse8) v_~x$r_buff0_thd2~0_292 0)))))))) (let ((.cse11 (= |v_P1_#t~ite15_94| |v_P1Thread1of1ForFork1_#t~ite15_68|)) (.cse12 (= |v_P1Thread1of1ForFork1_#t~mem11_68| |v_P1_#t~mem11_95|)) (.cse14 (= |v_P1Thread1of1ForFork1_#t~mem13_68| |v_P1_#t~mem13_103|)) (.cse15 (= |v_P1_#t~ite12_94| |v_P1Thread1of1ForFork1_#t~ite12_68|)) (.cse17 (= |v_P1_#t~ite16_90| |v_P1Thread1of1ForFork1_#t~ite16_68|)) (.cse18 (= |v_P1_#t~ite14_100| |v_P1Thread1of1ForFork1_#t~ite14_68|))) (or (and .cse11 (= |v_P1_#t~ite17_78| |v_P1Thread1of1ForFork1_#t~ite17_67|) .cse12 (= .cse13 |v_P1_#t~mem10_73|) .cse14 .cse15 (= v_~__unbuffered_p1_EAX~0_174 |v_P1_#t~mem10_73|) .cse16 .cse17 .cse18) (and (or (and .cse8 (= |v_P1_#t~ite17_78| |v_P1_#t~ite16_90|) (or (and (or (and (= |v_P1_#t~ite15_94| (ite .cse19 v_~x$w_buff1~0_293 v_~x$w_buff0~0_336)) .cse14 .cse9 .cse18) (and .cse20 (= |v_P1_#t~ite14_100| |v_P1_#t~mem13_103|) (= .cse13 |v_P1_#t~mem13_103|) (= |v_P1_#t~ite14_100| |v_P1_#t~ite15_94|))) (or .cse20 (not .cse6)) .cse12 .cse15 (= |v_P1_#t~ite15_94| |v_P1_#t~ite16_90|)) (and .cse11 .cse6 (= |v_P1_#t~ite12_94| (ite (not .cse21) v_~x$w_buff0~0_336 v_~x$w_buff1~0_293)) (= |v_P1_#t~ite12_94| |v_P1_#t~ite16_90|) .cse12 .cse14 .cse9 .cse18))) (and .cse11 .cse10 .cse12 .cse14 (= |v_P1_#t~ite17_78| v_~x$w_buff0~0_336) .cse15 .cse17 .cse18)) (= |v_P1_#t~ite17_78| v_~__unbuffered_p1_EAX~0_174) .cse22 (= |v_P1Thread1of1ForFork1_#t~mem10_68| |v_P1_#t~mem10_73|)))) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_129 |v_~#x~0.offset_262|) (= v_~__unbuffered_p1_EAX$read_delayed~0_126 1) (= v_~x$mem_tmp~0_77 .cse13) (= v_~x$r_buff0_thd2~0_291 v_~x$r_buff1_thd2~0_287) (= v_~x$w_buff0_used~0_536 1) (= v_~x$w_buff0~0_336 v_~x$w_buff1~0_291)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_336, P1Thread1of1ForFork1_#t~mem20=|v_P1Thread1of1ForFork1_#t~mem20_68|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_224, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_34|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_34|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_167, P1Thread1of1ForFork1_#t~mem10=|v_P1Thread1of1ForFork1_#t~mem10_68|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_34|, P1Thread1of1ForFork1_#t~mem13=|v_P1Thread1of1ForFork1_#t~mem13_68|, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_68|, ~#x~0.offset=|v_~#x~0.offset_262|, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_68|, ~x$w_buff1~0=v_~x$w_buff1~0_293, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_289, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_480, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_68|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_68|, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_68|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_292, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_68|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_68|, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_67|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_538, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_68|, #memory_int=|v_#memory_int_511|, ~#x~0.base=|v_~#x~0.base_262|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_34|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_334, ~x$flush_delayed~0=v_~x$flush_delayed~0_99, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_34|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_164, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_96, ~weak$$choice1~0=v_~weak$$choice1~0_161, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_174, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_51|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_129, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_36|, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_51|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_167, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_34|, ~#x~0.offset=|v_~#x~0.offset_262|, ~x$w_buff1~0=v_~x$w_buff1~0_291, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_287, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_478, ~weak$$choice0~0=v_~weak$$choice0~0_120, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_34|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_223, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_126, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_36|, ~x$mem_tmp~0=v_~x$mem_tmp~0_77, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_34|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_34|, ~y~0=v_~y~0_57, P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_36|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_34, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_34|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_129, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_291, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_170, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_536, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_34, #memory_int=|v_#memory_int_510|, ~#x~0.base=|v_~#x~0.base_262|, ~weak$$choice2~0=v_~weak$$choice2~0_89, P1Thread1of1ForFork1_#t~mem19=|v_P1Thread1of1ForFork1_#t~mem19_36|} AuxVars[|v_P1_#t~mem13_103|, |v_P1_#t~ite17_78|, |v_P1_#t~mem11_95|, |v_P1_#t~mem10_73|, |v_P1_#t~ite16_90|, |v_P1_#t~mem20_75|, |v_P1_#t~ite21_68|, |v_P1_#t~ite15_94|, |v_P1_#t~ite12_94|, |v_P1_#t~ite14_100|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_#t~mem20, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~ite21, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork1_#t~mem8, ~y~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~mem10, P1Thread1of1ForFork1_#t~mem13, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, ~x$w_buff1~0, P0Thread1of1ForFork0_~arg#1.base, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, P1Thread1of1ForFork1_#t~nondet9, P1Thread1of1ForFork1_#t~ite12, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#t~ite17, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite16, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0, P1Thread1of1ForFork1_#t~mem19] and [584] L801-->L808: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_124 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_198 256) 0)) (.cse8 (not .cse6)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_197 256) 0))) (.cse1 (= (mod v_~x$w_buff1_used~0_185 256) 0)) (.cse0 (= (mod v_~x$r_buff1_thd2~0_116 256) 0))) (let ((.cse2 (select |v_#memory_int_183| |v_~#x~0.base_130|)) (.cse3 (not .cse0)) (.cse4 (not .cse1)) (.cse11 (and .cse8 .cse10)) (.cse9 (not .cse7))) (and (let ((.cse5 (= |v_P1Thread1of1ForFork1_#t~mem22_1| |v_P1_#t~mem22_34|))) (or (and (= |v_P1_#t~ite23_29| |v_P1_#t~ite24_23|) (or (and (or .cse0 .cse1) (= |v_P1_#t~ite23_29| |v_P1_#t~mem22_34|) (= (select .cse2 |v_~#x~0.offset_130|) |v_P1_#t~mem22_34|)) (and (= |v_P1_#t~ite23_29| v_~x$w_buff1~0_98) .cse3 .cse4 .cse5)) (or .cse6 .cse7)) (and .cse8 .cse9 (= |v_P1_#t~ite23_29| |v_P1Thread1of1ForFork1_#t~ite23_1|) (= |v_P1_#t~ite24_23| v_~x$w_buff0~0_103) .cse5))) (= (store |v_#memory_int_183| |v_~#x~0.base_130| (store .cse2 |v_~#x~0.offset_130| |v_P1_#t~ite24_23|)) |v_#memory_int_182|) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_184 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_123 256) 0)) .cse10)) 0 v_~x$r_buff1_thd2~0_116) v_~x$r_buff1_thd2~0_115) (= (ite (or .cse11 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_185) v_~x$w_buff1_used~0_184) (= v_~x$r_buff0_thd2~0_123 (ite .cse11 0 v_~x$r_buff0_thd2~0_124)) (= v_~x$w_buff0_used~0_197 (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_198)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_103, ~#x~0.offset=|v_~#x~0.offset_130|, ~x$w_buff1~0=v_~x$w_buff1~0_98, P1Thread1of1ForFork1_#t~mem22=|v_P1Thread1of1ForFork1_#t~mem22_1|, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_1|, #memory_int=|v_#memory_int_183|, ~#x~0.base=|v_~#x~0.base_130|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_185, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_124, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_198} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~#x~0.offset=|v_~#x~0.offset_130|, ~x$w_buff1~0=v_~x$w_buff1~0_98, #memory_int=|v_#memory_int_182|, ~#x~0.base=|v_~#x~0.base_130|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_123, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} AuxVars[|v_P1_#t~ite24_23|, |v_P1_#t~mem22_34|, |v_P1_#t~ite23_29|] AssignedVars[P1Thread1of1ForFork1_#t~mem22, #memory_int, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-05 23:12:22,044 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] $Ultimate##0-->L765: Formula: (let ((.cse23 (mod v_~x$w_buff0_used~0_538 256))) (let ((.cse24 (mod v_~weak$$choice0~0_120 256)) (.cse20 (= (mod v_~x$w_buff1_used~0_480 256) 0)) (.cse16 (= .cse23 0)) (.cse8 (= (mod v_~x$r_buff0_thd2~0_292 256) 0)) (.cse2 (= (mod v_~weak$$choice2~0_89 256) 0))) (let ((.cse1 (select |v_#memory_int_511| |v_~#x~0.base_262|)) (.cse3 (not .cse2)) (.cse10 (not .cse8)) (.cse6 (= (mod v_~x$r_buff1_thd2~0_289 256) 0)) (.cse22 (not .cse16)) (.cse9 (not .cse20)) (.cse21 (= (mod v_~weak$$choice1~0_161 256) 0)) (.cse19 (not (= .cse24 0)))) (let ((.cse0 (ite (= (ite .cse3 .cse23 (ite .cse16 .cse23 (ite (and .cse10 .cse22) 0 (ite (and .cse6 .cse8 .cse22 .cse9) (ite (or .cse21 .cse19) 1 0) .cse24)))) 0) 0 1)) (.cse13 (select .cse1 |v_~#x~0.offset_262|))) (and (= v_~x$w_buff1_used~0_478 .cse0) (= v_~y~0_57 1) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_34| |v_P0Thread1of1ForFork0_~arg#1.offset_34|) (= v_~x$flush_delayed~0_99 0) (= v_~x$w_buff0~0_334 1) (= v_~x$r_buff0_thd0~0_167 v_~x$r_buff1_thd0~0_170) (= (store |v_#memory_int_511| |v_~#x~0.base_262| (store .cse1 |v_~#x~0.offset_262| |v_P1_#t~ite21_68|)) |v_#memory_int_510|) (= v_~x$r_buff0_thd1~0_223 1) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_129 |v_~#x~0.base_262|) (= v_~weak$$choice2~0_89 |v_P1Thread1of1ForFork1_#t~nondet7_68|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_51| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_51|) (= v_~y~0_57 v_~__unbuffered_p0_EAX~0_96) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_536 256) 0)) (not (= (mod v_~x$w_buff1_used~0_478 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_51|) (= v_~weak$$choice1~0_161 |v_P1Thread1of1ForFork1_#t~nondet9_68|) (or (and .cse2 (= |v_P1_#t~ite21_68| |v_P1_#t~mem20_75|) (= v_~__unbuffered_p1_EAX~0_174 |v_P1_#t~mem20_75|)) (and (= |v_P1_#t~ite21_68| v_~x$mem_tmp~0_77) .cse3 (= |v_P1Thread1of1ForFork1_#t~mem20_68| |v_P1_#t~mem20_75|))) (= |v_P0Thread1of1ForFork0_~arg#1.base_34| |v_P0Thread1of1ForFork0_#in~arg#1.base_34|) (= v_P1Thread1of1ForFork1_~arg.base_34 |v_P1Thread1of1ForFork1_#in~arg.base_34|) (= v_~weak$$choice0~0_120 |v_P1Thread1of1ForFork1_#t~nondet6_68|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_34| v_P1Thread1of1ForFork1_~arg.offset_34) (= v_~x$r_buff0_thd1~0_224 v_~x$r_buff1_thd1~0_164) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_51| 0)) (= v_~x$r_buff0_thd2~0_291 (ite .cse3 v_~x$r_buff0_thd2~0_292 (let ((.cse4 (= (mod .cse0 256) 0))) (ite .cse4 v_~x$r_buff0_thd2~0_292 (let ((.cse7 (not .cse4))) (let ((.cse5 (and .cse10 .cse7))) (ite .cse5 0 (ite (and .cse6 .cse7 (not (= (mod (ite .cse3 v_~x$w_buff1_used~0_480 (ite .cse4 v_~x$w_buff1_used~0_480 (ite .cse5 0 (ite (and .cse6 .cse7 .cse8 .cse9) v_~weak$$choice0~0_120 0)))) 256) 0)) .cse8) v_~x$r_buff0_thd2~0_292 0)))))))) (let ((.cse11 (= |v_P1_#t~ite15_94| |v_P1Thread1of1ForFork1_#t~ite15_68|)) (.cse12 (= |v_P1Thread1of1ForFork1_#t~mem11_68| |v_P1_#t~mem11_95|)) (.cse14 (= |v_P1Thread1of1ForFork1_#t~mem13_68| |v_P1_#t~mem13_103|)) (.cse15 (= |v_P1_#t~ite12_94| |v_P1Thread1of1ForFork1_#t~ite12_68|)) (.cse17 (= |v_P1_#t~ite16_90| |v_P1Thread1of1ForFork1_#t~ite16_68|)) (.cse18 (= |v_P1_#t~ite14_100| |v_P1Thread1of1ForFork1_#t~ite14_68|))) (or (and .cse11 (= |v_P1_#t~ite17_78| |v_P1Thread1of1ForFork1_#t~ite17_67|) .cse12 (= .cse13 |v_P1_#t~mem10_73|) .cse14 .cse15 (= v_~__unbuffered_p1_EAX~0_174 |v_P1_#t~mem10_73|) .cse16 .cse17 .cse18) (and (or (and .cse8 (= |v_P1_#t~ite17_78| |v_P1_#t~ite16_90|) (or (and (or (and (= |v_P1_#t~ite15_94| (ite .cse19 v_~x$w_buff1~0_293 v_~x$w_buff0~0_336)) .cse14 .cse9 .cse18) (and .cse20 (= |v_P1_#t~ite14_100| |v_P1_#t~mem13_103|) (= .cse13 |v_P1_#t~mem13_103|) (= |v_P1_#t~ite14_100| |v_P1_#t~ite15_94|))) (or .cse20 (not .cse6)) .cse12 .cse15 (= |v_P1_#t~ite15_94| |v_P1_#t~ite16_90|)) (and .cse11 .cse6 (= |v_P1_#t~ite12_94| (ite (not .cse21) v_~x$w_buff0~0_336 v_~x$w_buff1~0_293)) (= |v_P1_#t~ite12_94| |v_P1_#t~ite16_90|) .cse12 .cse14 .cse9 .cse18))) (and .cse11 .cse10 .cse12 .cse14 (= |v_P1_#t~ite17_78| v_~x$w_buff0~0_336) .cse15 .cse17 .cse18)) (= |v_P1_#t~ite17_78| v_~__unbuffered_p1_EAX~0_174) .cse22 (= |v_P1Thread1of1ForFork1_#t~mem10_68| |v_P1_#t~mem10_73|)))) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_129 |v_~#x~0.offset_262|) (= v_~__unbuffered_p1_EAX$read_delayed~0_126 1) (= v_~x$mem_tmp~0_77 .cse13) (= v_~x$r_buff0_thd2~0_291 v_~x$r_buff1_thd2~0_287) (= v_~x$w_buff0_used~0_536 1) (= v_~x$w_buff0~0_336 v_~x$w_buff1~0_291)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_336, P1Thread1of1ForFork1_#t~mem20=|v_P1Thread1of1ForFork1_#t~mem20_68|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_224, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_34|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_34|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_167, P1Thread1of1ForFork1_#t~mem10=|v_P1Thread1of1ForFork1_#t~mem10_68|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_34|, P1Thread1of1ForFork1_#t~mem13=|v_P1Thread1of1ForFork1_#t~mem13_68|, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_68|, ~#x~0.offset=|v_~#x~0.offset_262|, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_68|, ~x$w_buff1~0=v_~x$w_buff1~0_293, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_289, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_480, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_68|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_68|, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_68|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_292, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_68|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_68|, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_67|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_538, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_68|, #memory_int=|v_#memory_int_511|, ~#x~0.base=|v_~#x~0.base_262|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_34|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_334, ~x$flush_delayed~0=v_~x$flush_delayed~0_99, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_34|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_164, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_96, ~weak$$choice1~0=v_~weak$$choice1~0_161, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_174, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_51|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_129, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_36|, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_51|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_167, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_34|, ~#x~0.offset=|v_~#x~0.offset_262|, ~x$w_buff1~0=v_~x$w_buff1~0_291, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_287, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_478, ~weak$$choice0~0=v_~weak$$choice0~0_120, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_34|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_223, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_126, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_36|, ~x$mem_tmp~0=v_~x$mem_tmp~0_77, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_34|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_34|, ~y~0=v_~y~0_57, P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_36|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_34, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_34|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_129, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_291, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_170, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_536, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_34, #memory_int=|v_#memory_int_510|, ~#x~0.base=|v_~#x~0.base_262|, ~weak$$choice2~0=v_~weak$$choice2~0_89, P1Thread1of1ForFork1_#t~mem19=|v_P1Thread1of1ForFork1_#t~mem19_36|} AuxVars[|v_P1_#t~mem13_103|, |v_P1_#t~ite17_78|, |v_P1_#t~mem11_95|, |v_P1_#t~mem10_73|, |v_P1_#t~ite16_90|, |v_P1_#t~mem20_75|, |v_P1_#t~ite21_68|, |v_P1_#t~ite15_94|, |v_P1_#t~ite12_94|, |v_P1_#t~ite14_100|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_#t~mem20, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~ite21, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork1_#t~mem8, ~y~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~mem10, P1Thread1of1ForFork1_#t~mem13, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, ~x$w_buff1~0, P0Thread1of1ForFork0_~arg#1.base, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, P1Thread1of1ForFork1_#t~nondet9, P1Thread1of1ForFork1_#t~ite12, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#t~ite17, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite16, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0, P1Thread1of1ForFork1_#t~mem19] and [506] L833-->L839: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd0~0_31 256) 0))) (let ((.cse7 (= 0 (mod v_~x$r_buff1_thd0~0_33 256))) (.cse6 (= 0 (mod v_~x$w_buff1_used~0_147 256))) (.cse1 (not .cse9)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_163 256) 0))) (.cse10 (= (mod v_~x$w_buff0_used~0_164 256) 0))) (let ((.cse0 (not .cse10)) (.cse2 (and .cse1 .cse11)) (.cse5 (not .cse6)) (.cse4 (not .cse7)) (.cse8 (select |v_#memory_int_143| |v_~#x~0.base_98|))) (and (= (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_164) v_~x$w_buff0_used~0_163) (= (ite .cse2 0 v_~x$r_buff0_thd0~0_31) v_~x$r_buff0_thd0~0_30) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem29#1_29| |v_ULTIMATE.start_main_#t~mem29#1_25|))) (or (and .cse0 (= v_~x$w_buff0~0_75 |v_ULTIMATE.start_main_#t~ite31#1_28|) .cse1 .cse3 (= |v_ULTIMATE.start_main_#t~ite30#1_30| |v_ULTIMATE.start_main_#t~ite30#1_26|)) (and (= |v_ULTIMATE.start_main_#t~ite30#1_30| |v_ULTIMATE.start_main_#t~ite31#1_28|) (or (and .cse4 .cse3 .cse5 (= v_~x$w_buff1~0_66 |v_ULTIMATE.start_main_#t~ite30#1_30|)) (and (or .cse6 .cse7) (= |v_ULTIMATE.start_main_#t~mem29#1_29| (select .cse8 |v_~#x~0.offset_98|)) (= |v_ULTIMATE.start_main_#t~mem29#1_29| |v_ULTIMATE.start_main_#t~ite30#1_30|))) (or .cse9 .cse10)))) (= (ite (or .cse2 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_147) v_~x$w_buff1_used~0_146) (= v_~x$r_buff1_thd0~0_32 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_30 256) 0)) .cse11) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_146 256) 0)))) 0 v_~x$r_buff1_thd0~0_33)) (= (store |v_#memory_int_143| |v_~#x~0.base_98| (store .cse8 |v_~#x~0.offset_98| |v_ULTIMATE.start_main_#t~ite31#1_28|)) |v_#memory_int_142|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_75, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_31, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_26|, ~#x~0.offset=|v_~#x~0.offset_98|, ~x$w_buff1~0=v_~x$w_buff1~0_66, #memory_int=|v_#memory_int_143|, ~#x~0.base=|v_~#x~0.base_98|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_25|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_164} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_75, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ULTIMATE.start_main_#t~ite31#1=|v_ULTIMATE.start_main_#t~ite31#1_24|, ~#x~0.offset=|v_~#x~0.offset_98|, ~x$w_buff1~0=v_~x$w_buff1~0_66, #memory_int=|v_#memory_int_142|, ~#x~0.base=|v_~#x~0.base_98|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_163} AuxVars[|v_ULTIMATE.start_main_#t~ite30#1_30|, |v_ULTIMATE.start_main_#t~mem29#1_29|, |v_ULTIMATE.start_main_#t~ite31#1_28|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite31#1, #memory_int, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~mem29#1, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-05 23:12:26,758 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:12:26,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12575 [2022-12-05 23:12:26,759 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 84 flow [2022-12-05 23:12:26,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:26,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:26,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:26,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:12:26,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:12:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1386495994, now seen corresponding path program 1 times [2022-12-05 23:12:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:26,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488462205] [2022-12-05 23:12:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:12:28,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:28,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488462205] [2022-12-05 23:12:28,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488462205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:28,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:28,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:12:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370407934] [2022-12-05 23:12:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:28,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:12:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:12:28,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:12:28,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 23:12:28,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 84 flow. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:28,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:28,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 23:12:28,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:28,980 INFO L130 PetriNetUnfolder]: 53/101 cut-off events. [2022-12-05 23:12:28,980 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-05 23:12:28,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 101 events. 53/101 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 293 event pairs, 3 based on Foata normal form. 4/102 useless extension candidates. Maximal degree in co-relation 314. Up to 72 conditions per place. [2022-12-05 23:12:28,981 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 17 selfloop transitions, 8 changer transitions 0/25 dead transitions. [2022-12-05 23:12:28,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 25 transitions, 160 flow [2022-12-05 23:12:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:12:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:12:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-12-05 23:12:28,983 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3375 [2022-12-05 23:12:28,983 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 84 flow. Second operand 5 states and 27 transitions. [2022-12-05 23:12:28,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 25 transitions, 160 flow [2022-12-05 23:12:28,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 138 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-05 23:12:28,984 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 100 flow [2022-12-05 23:12:28,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-05 23:12:28,985 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2022-12-05 23:12:28,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:28,985 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 100 flow [2022-12-05 23:12:28,986 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:28,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:28,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 100 flow [2022-12-05 23:12:28,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 18 transitions, 100 flow [2022-12-05 23:12:28,999 INFO L130 PetriNetUnfolder]: 11/37 cut-off events. [2022-12-05 23:12:28,999 INFO L131 PetriNetUnfolder]: For 33/34 co-relation queries the response was YES. [2022-12-05 23:12:28,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 37 events. 11/37 cut-off events. For 33/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 103 event pairs, 2 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 108. Up to 20 conditions per place. [2022-12-05 23:12:29,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 18 transitions, 100 flow [2022-12-05 23:12:29,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-05 23:12:29,001 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:12:29,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-05 23:12:29,002 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 100 flow [2022-12-05 23:12:29,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:29,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:29,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:29,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:12:29,003 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:12:29,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash 876015407, now seen corresponding path program 1 times [2022-12-05 23:12:29,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:29,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210251843] [2022-12-05 23:12:29,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:12:29,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:29,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210251843] [2022-12-05 23:12:29,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210251843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:29,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:29,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:12:29,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99434742] [2022-12-05 23:12:29,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:29,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:12:29,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:29,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:12:29,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:12:29,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 23:12:29,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 100 flow. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:29,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:29,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 23:12:29,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:29,560 INFO L130 PetriNetUnfolder]: 51/98 cut-off events. [2022-12-05 23:12:29,561 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-05 23:12:29,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 98 events. 51/98 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 271 event pairs, 21 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 336. Up to 93 conditions per place. [2022-12-05 23:12:29,562 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 17 selfloop transitions, 8 changer transitions 0/25 dead transitions. [2022-12-05 23:12:29,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 190 flow [2022-12-05 23:12:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:12:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:12:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-12-05 23:12:29,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-05 23:12:29,564 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 100 flow. Second operand 4 states and 24 transitions. [2022-12-05 23:12:29,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 190 flow [2022-12-05 23:12:29,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 167 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-05 23:12:29,568 INFO L231 Difference]: Finished difference. Result has 28 places, 24 transitions, 154 flow [2022-12-05 23:12:29,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2022-12-05 23:12:29,570 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-05 23:12:29,570 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:29,570 INFO L89 Accepts]: Start accepts. Operand has 28 places, 24 transitions, 154 flow [2022-12-05 23:12:29,570 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:29,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:29,571 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 24 transitions, 154 flow [2022-12-05 23:12:29,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 154 flow [2022-12-05 23:12:29,583 INFO L130 PetriNetUnfolder]: 11/37 cut-off events. [2022-12-05 23:12:29,583 INFO L131 PetriNetUnfolder]: For 40/43 co-relation queries the response was YES. [2022-12-05 23:12:29,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 37 events. 11/37 cut-off events. For 40/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 91 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 121. Up to 16 conditions per place. [2022-12-05 23:12:29,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 24 transitions, 154 flow [2022-12-05 23:12:29,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-05 23:12:29,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] $Ultimate##0-->L839: Formula: (let ((.cse27 (mod v_~x$w_buff0_used~0_550 256))) (let ((.cse28 (mod v_~weak$$choice0~0_124 256)) (.cse17 (= (mod v_~x$w_buff1_used~0_492 256) 0)) (.cse8 (= .cse27 0)) (.cse19 (= 0 (mod v_~x$r_buff0_thd2~0_302 256))) (.cse24 (= (mod v_~weak$$choice2~0_93 256) 0))) (let ((.cse21 (not .cse24)) (.cse13 (not .cse19)) (.cse12 (not .cse8)) (.cse15 (= (mod v_~x$r_buff1_thd2~0_300 256) 0)) (.cse16 (not .cse17)) (.cse18 (not (= .cse28 0))) (.cse14 (= (mod v_~weak$$choice1~0_165 256) 0))) (let ((.cse25 (ite (= (ite .cse21 .cse27 (ite .cse8 .cse27 (ite (and .cse13 .cse12) 0 (ite (and .cse12 .cse15 .cse19 .cse16) (ite (or .cse18 .cse14) 1 0) .cse28)))) 0) 0 1)) (.cse0 (= (mod v_~x$r_buff0_thd0~0_172 256) 0))) (let ((.cse26 (select |v_#memory_int_522| |v_~#x~0.base_266|)) (.cse3 (not (= (mod v_~x$w_buff0_used~0_548 256) 0))) (.cse1 (not .cse0)) (.cse20 (= (mod .cse25 256) 0))) (let ((.cse23 (not .cse20)) (.cse2 (and .cse3 .cse1)) (.cse5 (select .cse26 |v_~#x~0.offset_266|))) (and (= v_P1Thread1of1ForFork1_~arg.base_38 |v_P1Thread1of1ForFork1_#in~arg.base_38|) (= v_~x$w_buff0~0_344 1) (= v_~x$flush_delayed~0_103 0) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_38| |v_P0Thread1of1ForFork0_~arg#1.offset_38|) (= v_~__unbuffered_p1_EAX$read_delayed~0_130 1) (or (and .cse0 (= |v_P1_#t~ite21_72| |v_ULTIMATE.start_main_#t~mem29#1_157|) (= |v_ULTIMATE.start_main_#t~ite30#1_158| |v_ULTIMATE.start_main_#t~mem29#1_157|) (= |v_ULTIMATE.start_main_#t~ite30#1_158| |v_ULTIMATE.start_main_#t~ite31#1_126|)) (and (= v_~x$w_buff0~0_344 |v_ULTIMATE.start_main_#t~ite31#1_126|) (= |v_ULTIMATE.start_main_#t~ite30#1_158| |v_ULTIMATE.start_main_#t~ite30#1_160|) (= |v_ULTIMATE.start_main_#t~mem29#1_159| |v_ULTIMATE.start_main_#t~mem29#1_157|) .cse1)) (= v_~weak$$choice1~0_165 |v_P1Thread1of1ForFork1_#t~nondet9_76|) (= v_~x$r_buff0_thd0~0_171 (ite .cse2 0 v_~x$r_buff0_thd0~0_172)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_133 |v_~#x~0.offset_266|) (= v_~y~0_61 1) (= v_~x$r_buff1_thd0~0_174 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_490 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_171 256) 0)))) 0 v_~x$r_buff0_thd0~0_172)) (= v_~x$r_buff0_thd1~0_232 v_~x$r_buff1_thd1~0_168) (= v_~weak$$choice0~0_124 |v_P1Thread1of1ForFork1_#t~nondet6_76|) (= |v_P0Thread1of1ForFork0_~arg#1.base_38| |v_P0Thread1of1ForFork0_#in~arg#1.base_38|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_55| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_55|) (let ((.cse10 (= |v_P1_#t~ite16_94| |v_P1Thread1of1ForFork1_#t~ite16_76|)) (.cse7 (= |v_P1_#t~ite15_98| |v_P1Thread1of1ForFork1_#t~ite15_76|)) (.cse6 (= |v_P1_#t~ite12_98| |v_P1Thread1of1ForFork1_#t~ite12_76|)) (.cse4 (= |v_P1Thread1of1ForFork1_#t~mem13_76| |v_P1_#t~mem13_107|)) (.cse9 (= |v_P1_#t~ite14_104| |v_P1Thread1of1ForFork1_#t~ite14_76|)) (.cse11 (= |v_P1Thread1of1ForFork1_#t~mem11_76| |v_P1_#t~mem11_99|))) (or (and .cse4 (= |v_P1_#t~mem10_77| .cse5) .cse6 .cse7 .cse8 .cse9 (= |v_P1_#t~ite17_82| |v_P1Thread1of1ForFork1_#t~ite17_75|) .cse10 (= v_~__unbuffered_p1_EAX~0_178 |v_P1_#t~mem10_77|) .cse11) (and .cse12 (or (and .cse4 .cse6 .cse7 .cse9 .cse13 .cse10 (= |v_P1_#t~ite17_82| v_~x$w_buff0~0_345) .cse11) (and (= |v_P1_#t~ite17_82| |v_P1_#t~ite16_94|) (or (and .cse4 .cse7 .cse9 (= |v_P1_#t~ite12_98| (ite (not .cse14) v_~x$w_buff0~0_345 v_~x$w_buff1~0_302)) .cse15 .cse11 .cse16 (= |v_P1_#t~ite12_98| |v_P1_#t~ite16_94|)) (and (= |v_P1_#t~ite15_98| |v_P1_#t~ite16_94|) (or (not .cse15) .cse17) .cse6 (or (and .cse4 .cse9 (= |v_P1_#t~ite15_98| (ite .cse18 v_~x$w_buff1~0_302 v_~x$w_buff0~0_345)) .cse16) (and (= |v_P1_#t~mem13_107| .cse5) (= |v_P1_#t~ite14_104| |v_P1_#t~ite15_98|) (= |v_P1_#t~ite14_104| |v_P1_#t~mem13_107|) .cse17)) .cse11)) .cse19)) (= |v_P1_#t~ite17_82| v_~__unbuffered_p1_EAX~0_178) (= |v_P1Thread1of1ForFork1_#t~mem10_76| |v_P1_#t~mem10_77|)))) (= |v_P1Thread1of1ForFork1_#in~arg.offset_38| v_P1Thread1of1ForFork1_~arg.offset_38) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_55| 0)) (= (ite .cse20 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_55|) (= v_~x$r_buff0_thd1~0_231 1) (= v_~x$r_buff0_thd2~0_301 v_~x$r_buff1_thd2~0_299) (= (ite .cse1 0 1) v_~x$w_buff0_used~0_548) (= v_~y~0_61 v_~__unbuffered_p0_EAX~0_100) (= (ite .cse21 v_~x$r_buff0_thd2~0_302 (ite .cse20 v_~x$r_buff0_thd2~0_302 (let ((.cse22 (and .cse23 .cse13))) (ite .cse22 0 (ite (and .cse23 (not (= (mod (ite .cse21 v_~x$w_buff1_used~0_492 (ite .cse20 v_~x$w_buff1_used~0_492 (ite .cse22 0 (ite (and .cse23 .cse15 .cse19 .cse16) v_~weak$$choice0~0_124 0)))) 256) 0)) .cse15 .cse19) v_~x$r_buff0_thd2~0_302 0))))) v_~x$r_buff0_thd2~0_301) (or (and (= v_~__unbuffered_p1_EAX~0_178 |v_P1_#t~mem20_79|) (= |v_P1_#t~ite21_72| |v_P1_#t~mem20_79|) .cse24) (and (= |v_P1_#t~ite21_72| v_~x$mem_tmp~0_81) (= |v_P1Thread1of1ForFork1_#t~mem20_76| |v_P1_#t~mem20_79|) .cse21)) (= v_~x$w_buff0~0_345 v_~x$w_buff1~0_301) (= v_~x$w_buff1_used~0_490 (ite (or (and .cse23 .cse1) .cse2) 0 .cse25)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_133 |v_~#x~0.base_266|) (= v_~x$mem_tmp~0_81 .cse5) (= v_~weak$$choice2~0_93 |v_P1Thread1of1ForFork1_#t~nondet7_76|) (= (store |v_#memory_int_522| |v_~#x~0.base_266| (store .cse26 |v_~#x~0.offset_266| |v_ULTIMATE.start_main_#t~ite31#1_126|)) |v_#memory_int_520|)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_345, P1Thread1of1ForFork1_#t~mem20=|v_P1Thread1of1ForFork1_#t~mem20_76|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_232, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_38|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_38|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_172, P1Thread1of1ForFork1_#t~mem10=|v_P1Thread1of1ForFork1_#t~mem10_76|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_38|, P1Thread1of1ForFork1_#t~mem13=|v_P1Thread1of1ForFork1_#t~mem13_76|, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_76|, ~#x~0.offset=|v_~#x~0.offset_266|, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_76|, ~x$w_buff1~0=v_~x$w_buff1~0_302, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_492, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_300, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_76|, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_159|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_76|, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_76|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_76|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_76|, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_75|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_550, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_76|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_160|, #memory_int=|v_#memory_int_522|, ~#x~0.base=|v_~#x~0.base_266|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_38|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_344, ~x$flush_delayed~0=v_~x$flush_delayed~0_103, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_38|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_168, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_100, ~weak$$choice1~0=v_~weak$$choice1~0_165, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_178, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_55|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_133, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_40|, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_55|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_38|, ~#x~0.offset=|v_~#x~0.offset_266|, ~x$w_buff1~0=v_~x$w_buff1~0_301, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_490, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_299, ~weak$$choice0~0=v_~weak$$choice0~0_124, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_38|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_231, ULTIMATE.start_main_#t~ite31#1=|v_ULTIMATE.start_main_#t~ite31#1_125|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_130, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_81, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_38|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_38|, ~y~0=v_~y~0_61, P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_40|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_38, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_38|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_133, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_174, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_301, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_548, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_38, #memory_int=|v_#memory_int_520|, ~#x~0.base=|v_~#x~0.base_266|, ~weak$$choice2~0=v_~weak$$choice2~0_93, P1Thread1of1ForFork1_#t~mem19=|v_P1Thread1of1ForFork1_#t~mem19_40|} AuxVars[|v_P1_#t~ite14_104|, |v_P1_#t~ite21_72|, |v_P1_#t~mem20_79|, |v_ULTIMATE.start_main_#t~ite30#1_158|, |v_ULTIMATE.start_main_#t~ite31#1_126|, |v_P1_#t~mem13_107|, |v_P1_#t~ite15_98|, |v_P1_#t~ite12_98|, |v_ULTIMATE.start_main_#t~mem29#1_157|, |v_P1_#t~ite17_82|, |v_P1_#t~ite16_94|, |v_P1_#t~mem11_99|, |v_P1_#t~mem10_77|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_#t~mem20, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite31#1, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~ite21, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork1_#t~mem8, ~y~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd0~0, P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~mem10, P1Thread1of1ForFork1_#t~mem13, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, ~x$w_buff1~0, P0Thread1of1ForFork0_~arg#1.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, P1Thread1of1ForFork1_#t~nondet9, ULTIMATE.start_main_#t~mem29#1, P1Thread1of1ForFork1_#t~ite12, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#t~ite17, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite16, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite30#1, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0, P1Thread1of1ForFork1_#t~mem19] and [577] L765-->L772: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_42 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_169 256) 0))) (.cse1 (not .cse8)) (.cse6 (= (mod v_~x$r_buff1_thd1~0_33 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_155 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_170 256) 0))) (let ((.cse0 (not .cse9)) (.cse3 (not .cse5)) (.cse4 (not .cse6)) (.cse7 (select |v_#memory_int_151| |v_~#x~0.base_104|)) (.cse10 (and .cse11 .cse1))) (and (= (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_170) v_~x$w_buff0_used~0_169) (let ((.cse2 (= |v_P0_#t~mem3#1_34| |v_P0Thread1of1ForFork0_#t~mem3#1_1|))) (or (and (or (and .cse2 (= |v_P0_#t~ite4#1_29| v_~x$w_buff1~0_72) .cse3 .cse4) (and (= |v_P0_#t~mem3#1_34| |v_P0_#t~ite4#1_29|) (or .cse5 .cse6) (= |v_P0_#t~mem3#1_34| (select .cse7 |v_~#x~0.offset_104|)))) (= |v_P0_#t~ite4#1_29| |v_P0_#t~ite5#1_33|) (or .cse8 .cse9)) (and (= |v_P0_#t~ite4#1_29| |v_P0Thread1of1ForFork0_#t~ite4#1_1|) .cse2 (= |v_P0_#t~ite5#1_33| v_~x$w_buff0~0_77) .cse0 .cse1))) (= v_~x$w_buff1_used~0_154 (ite (or (and .cse3 .cse4) .cse10) 0 v_~x$w_buff1_used~0_155)) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_41 256) 0)) .cse11) (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_33) v_~x$r_buff1_thd1~0_32) (= (store |v_#memory_int_151| |v_~#x~0.base_104| (store .cse7 |v_~#x~0.offset_104| |v_P0_#t~ite5#1_33|)) |v_#memory_int_150|) (= (ite .cse10 0 v_~x$r_buff0_thd1~0_42) v_~x$r_buff0_thd1~0_41))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_77, P0Thread1of1ForFork0_#t~ite4#1=|v_P0Thread1of1ForFork0_#t~ite4#1_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_42, ~#x~0.offset=|v_~#x~0.offset_104|, ~x$w_buff1~0=v_~x$w_buff1~0_72, #memory_int=|v_#memory_int_151|, ~#x~0.base=|v_~#x~0.base_104|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_33, P0Thread1of1ForFork0_#t~mem3#1=|v_P0Thread1of1ForFork0_#t~mem3#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_170} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_77, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~#x~0.offset=|v_~#x~0.offset_104|, ~x$w_buff1~0=v_~x$w_buff1~0_72, #memory_int=|v_#memory_int_150|, ~#x~0.base=|v_~#x~0.base_104|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork0_#t~ite5#1=|v_P0Thread1of1ForFork0_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_169} AuxVars[|v_P0_#t~mem3#1_34|, |v_P0_#t~ite5#1_33|, |v_P0_#t~ite4#1_29|] AssignedVars[P0Thread1of1ForFork0_#t~ite4#1, ~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~mem3#1, P0Thread1of1ForFork0_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-05 23:12:33,391 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] $Ultimate##0-->L839: Formula: (let ((.cse27 (mod v_~x$w_buff0_used~0_550 256))) (let ((.cse28 (mod v_~weak$$choice0~0_124 256)) (.cse17 (= (mod v_~x$w_buff1_used~0_492 256) 0)) (.cse8 (= .cse27 0)) (.cse19 (= 0 (mod v_~x$r_buff0_thd2~0_302 256))) (.cse24 (= (mod v_~weak$$choice2~0_93 256) 0))) (let ((.cse21 (not .cse24)) (.cse13 (not .cse19)) (.cse12 (not .cse8)) (.cse15 (= (mod v_~x$r_buff1_thd2~0_300 256) 0)) (.cse16 (not .cse17)) (.cse18 (not (= .cse28 0))) (.cse14 (= (mod v_~weak$$choice1~0_165 256) 0))) (let ((.cse25 (ite (= (ite .cse21 .cse27 (ite .cse8 .cse27 (ite (and .cse13 .cse12) 0 (ite (and .cse12 .cse15 .cse19 .cse16) (ite (or .cse18 .cse14) 1 0) .cse28)))) 0) 0 1)) (.cse0 (= (mod v_~x$r_buff0_thd0~0_172 256) 0))) (let ((.cse26 (select |v_#memory_int_522| |v_~#x~0.base_266|)) (.cse3 (not (= (mod v_~x$w_buff0_used~0_548 256) 0))) (.cse1 (not .cse0)) (.cse20 (= (mod .cse25 256) 0))) (let ((.cse23 (not .cse20)) (.cse2 (and .cse3 .cse1)) (.cse5 (select .cse26 |v_~#x~0.offset_266|))) (and (= v_P1Thread1of1ForFork1_~arg.base_38 |v_P1Thread1of1ForFork1_#in~arg.base_38|) (= v_~x$w_buff0~0_344 1) (= v_~x$flush_delayed~0_103 0) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_38| |v_P0Thread1of1ForFork0_~arg#1.offset_38|) (= v_~__unbuffered_p1_EAX$read_delayed~0_130 1) (or (and .cse0 (= |v_P1_#t~ite21_72| |v_ULTIMATE.start_main_#t~mem29#1_157|) (= |v_ULTIMATE.start_main_#t~ite30#1_158| |v_ULTIMATE.start_main_#t~mem29#1_157|) (= |v_ULTIMATE.start_main_#t~ite30#1_158| |v_ULTIMATE.start_main_#t~ite31#1_126|)) (and (= v_~x$w_buff0~0_344 |v_ULTIMATE.start_main_#t~ite31#1_126|) (= |v_ULTIMATE.start_main_#t~ite30#1_158| |v_ULTIMATE.start_main_#t~ite30#1_160|) (= |v_ULTIMATE.start_main_#t~mem29#1_159| |v_ULTIMATE.start_main_#t~mem29#1_157|) .cse1)) (= v_~weak$$choice1~0_165 |v_P1Thread1of1ForFork1_#t~nondet9_76|) (= v_~x$r_buff0_thd0~0_171 (ite .cse2 0 v_~x$r_buff0_thd0~0_172)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_133 |v_~#x~0.offset_266|) (= v_~y~0_61 1) (= v_~x$r_buff1_thd0~0_174 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_490 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_171 256) 0)))) 0 v_~x$r_buff0_thd0~0_172)) (= v_~x$r_buff0_thd1~0_232 v_~x$r_buff1_thd1~0_168) (= v_~weak$$choice0~0_124 |v_P1Thread1of1ForFork1_#t~nondet6_76|) (= |v_P0Thread1of1ForFork0_~arg#1.base_38| |v_P0Thread1of1ForFork0_#in~arg#1.base_38|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_55| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_55|) (let ((.cse10 (= |v_P1_#t~ite16_94| |v_P1Thread1of1ForFork1_#t~ite16_76|)) (.cse7 (= |v_P1_#t~ite15_98| |v_P1Thread1of1ForFork1_#t~ite15_76|)) (.cse6 (= |v_P1_#t~ite12_98| |v_P1Thread1of1ForFork1_#t~ite12_76|)) (.cse4 (= |v_P1Thread1of1ForFork1_#t~mem13_76| |v_P1_#t~mem13_107|)) (.cse9 (= |v_P1_#t~ite14_104| |v_P1Thread1of1ForFork1_#t~ite14_76|)) (.cse11 (= |v_P1Thread1of1ForFork1_#t~mem11_76| |v_P1_#t~mem11_99|))) (or (and .cse4 (= |v_P1_#t~mem10_77| .cse5) .cse6 .cse7 .cse8 .cse9 (= |v_P1_#t~ite17_82| |v_P1Thread1of1ForFork1_#t~ite17_75|) .cse10 (= v_~__unbuffered_p1_EAX~0_178 |v_P1_#t~mem10_77|) .cse11) (and .cse12 (or (and .cse4 .cse6 .cse7 .cse9 .cse13 .cse10 (= |v_P1_#t~ite17_82| v_~x$w_buff0~0_345) .cse11) (and (= |v_P1_#t~ite17_82| |v_P1_#t~ite16_94|) (or (and .cse4 .cse7 .cse9 (= |v_P1_#t~ite12_98| (ite (not .cse14) v_~x$w_buff0~0_345 v_~x$w_buff1~0_302)) .cse15 .cse11 .cse16 (= |v_P1_#t~ite12_98| |v_P1_#t~ite16_94|)) (and (= |v_P1_#t~ite15_98| |v_P1_#t~ite16_94|) (or (not .cse15) .cse17) .cse6 (or (and .cse4 .cse9 (= |v_P1_#t~ite15_98| (ite .cse18 v_~x$w_buff1~0_302 v_~x$w_buff0~0_345)) .cse16) (and (= |v_P1_#t~mem13_107| .cse5) (= |v_P1_#t~ite14_104| |v_P1_#t~ite15_98|) (= |v_P1_#t~ite14_104| |v_P1_#t~mem13_107|) .cse17)) .cse11)) .cse19)) (= |v_P1_#t~ite17_82| v_~__unbuffered_p1_EAX~0_178) (= |v_P1Thread1of1ForFork1_#t~mem10_76| |v_P1_#t~mem10_77|)))) (= |v_P1Thread1of1ForFork1_#in~arg.offset_38| v_P1Thread1of1ForFork1_~arg.offset_38) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_55| 0)) (= (ite .cse20 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_55|) (= v_~x$r_buff0_thd1~0_231 1) (= v_~x$r_buff0_thd2~0_301 v_~x$r_buff1_thd2~0_299) (= (ite .cse1 0 1) v_~x$w_buff0_used~0_548) (= v_~y~0_61 v_~__unbuffered_p0_EAX~0_100) (= (ite .cse21 v_~x$r_buff0_thd2~0_302 (ite .cse20 v_~x$r_buff0_thd2~0_302 (let ((.cse22 (and .cse23 .cse13))) (ite .cse22 0 (ite (and .cse23 (not (= (mod (ite .cse21 v_~x$w_buff1_used~0_492 (ite .cse20 v_~x$w_buff1_used~0_492 (ite .cse22 0 (ite (and .cse23 .cse15 .cse19 .cse16) v_~weak$$choice0~0_124 0)))) 256) 0)) .cse15 .cse19) v_~x$r_buff0_thd2~0_302 0))))) v_~x$r_buff0_thd2~0_301) (or (and (= v_~__unbuffered_p1_EAX~0_178 |v_P1_#t~mem20_79|) (= |v_P1_#t~ite21_72| |v_P1_#t~mem20_79|) .cse24) (and (= |v_P1_#t~ite21_72| v_~x$mem_tmp~0_81) (= |v_P1Thread1of1ForFork1_#t~mem20_76| |v_P1_#t~mem20_79|) .cse21)) (= v_~x$w_buff0~0_345 v_~x$w_buff1~0_301) (= v_~x$w_buff1_used~0_490 (ite (or (and .cse23 .cse1) .cse2) 0 .cse25)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_133 |v_~#x~0.base_266|) (= v_~x$mem_tmp~0_81 .cse5) (= v_~weak$$choice2~0_93 |v_P1Thread1of1ForFork1_#t~nondet7_76|) (= (store |v_#memory_int_522| |v_~#x~0.base_266| (store .cse26 |v_~#x~0.offset_266| |v_ULTIMATE.start_main_#t~ite31#1_126|)) |v_#memory_int_520|)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_345, P1Thread1of1ForFork1_#t~mem20=|v_P1Thread1of1ForFork1_#t~mem20_76|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_232, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_38|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_38|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_172, P1Thread1of1ForFork1_#t~mem10=|v_P1Thread1of1ForFork1_#t~mem10_76|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_38|, P1Thread1of1ForFork1_#t~mem13=|v_P1Thread1of1ForFork1_#t~mem13_76|, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_76|, ~#x~0.offset=|v_~#x~0.offset_266|, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_76|, ~x$w_buff1~0=v_~x$w_buff1~0_302, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_492, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_300, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_76|, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_159|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_76|, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_76|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_76|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_76|, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_75|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_550, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_76|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_160|, #memory_int=|v_#memory_int_522|, ~#x~0.base=|v_~#x~0.base_266|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_38|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_344, ~x$flush_delayed~0=v_~x$flush_delayed~0_103, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_38|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_168, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_100, ~weak$$choice1~0=v_~weak$$choice1~0_165, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_178, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_55|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_133, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_40|, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_55|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_38|, ~#x~0.offset=|v_~#x~0.offset_266|, ~x$w_buff1~0=v_~x$w_buff1~0_301, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_490, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_299, ~weak$$choice0~0=v_~weak$$choice0~0_124, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_38|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_231, ULTIMATE.start_main_#t~ite31#1=|v_ULTIMATE.start_main_#t~ite31#1_125|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_130, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_81, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_38|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_38|, ~y~0=v_~y~0_61, P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_40|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_38, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_38|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_133, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_174, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_301, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_548, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_38, #memory_int=|v_#memory_int_520|, ~#x~0.base=|v_~#x~0.base_266|, ~weak$$choice2~0=v_~weak$$choice2~0_93, P1Thread1of1ForFork1_#t~mem19=|v_P1Thread1of1ForFork1_#t~mem19_40|} AuxVars[|v_P1_#t~ite14_104|, |v_P1_#t~ite21_72|, |v_P1_#t~mem20_79|, |v_ULTIMATE.start_main_#t~ite30#1_158|, |v_ULTIMATE.start_main_#t~ite31#1_126|, |v_P1_#t~mem13_107|, |v_P1_#t~ite15_98|, |v_P1_#t~ite12_98|, |v_ULTIMATE.start_main_#t~mem29#1_157|, |v_P1_#t~ite17_82|, |v_P1_#t~ite16_94|, |v_P1_#t~mem11_99|, |v_P1_#t~mem10_77|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_#t~mem20, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite31#1, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~ite21, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork1_#t~mem8, ~y~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd0~0, P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~mem10, P1Thread1of1ForFork1_#t~mem13, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, ~x$w_buff1~0, P0Thread1of1ForFork0_~arg#1.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, P1Thread1of1ForFork1_#t~nondet9, ULTIMATE.start_main_#t~mem29#1, P1Thread1of1ForFork1_#t~ite12, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#t~ite17, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite16, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite30#1, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0, P1Thread1of1ForFork1_#t~mem19] and [584] L801-->L808: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_124 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_198 256) 0)) (.cse8 (not .cse6)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_197 256) 0))) (.cse1 (= (mod v_~x$w_buff1_used~0_185 256) 0)) (.cse0 (= (mod v_~x$r_buff1_thd2~0_116 256) 0))) (let ((.cse2 (select |v_#memory_int_183| |v_~#x~0.base_130|)) (.cse3 (not .cse0)) (.cse4 (not .cse1)) (.cse11 (and .cse8 .cse10)) (.cse9 (not .cse7))) (and (let ((.cse5 (= |v_P1Thread1of1ForFork1_#t~mem22_1| |v_P1_#t~mem22_34|))) (or (and (= |v_P1_#t~ite23_29| |v_P1_#t~ite24_23|) (or (and (or .cse0 .cse1) (= |v_P1_#t~ite23_29| |v_P1_#t~mem22_34|) (= (select .cse2 |v_~#x~0.offset_130|) |v_P1_#t~mem22_34|)) (and (= |v_P1_#t~ite23_29| v_~x$w_buff1~0_98) .cse3 .cse4 .cse5)) (or .cse6 .cse7)) (and .cse8 .cse9 (= |v_P1_#t~ite23_29| |v_P1Thread1of1ForFork1_#t~ite23_1|) (= |v_P1_#t~ite24_23| v_~x$w_buff0~0_103) .cse5))) (= (store |v_#memory_int_183| |v_~#x~0.base_130| (store .cse2 |v_~#x~0.offset_130| |v_P1_#t~ite24_23|)) |v_#memory_int_182|) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_184 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_123 256) 0)) .cse10)) 0 v_~x$r_buff1_thd2~0_116) v_~x$r_buff1_thd2~0_115) (= (ite (or .cse11 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_185) v_~x$w_buff1_used~0_184) (= v_~x$r_buff0_thd2~0_123 (ite .cse11 0 v_~x$r_buff0_thd2~0_124)) (= v_~x$w_buff0_used~0_197 (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_198)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_103, ~#x~0.offset=|v_~#x~0.offset_130|, ~x$w_buff1~0=v_~x$w_buff1~0_98, P1Thread1of1ForFork1_#t~mem22=|v_P1Thread1of1ForFork1_#t~mem22_1|, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_1|, #memory_int=|v_#memory_int_183|, ~#x~0.base=|v_~#x~0.base_130|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_185, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_124, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_198} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~#x~0.offset=|v_~#x~0.offset_130|, ~x$w_buff1~0=v_~x$w_buff1~0_98, #memory_int=|v_#memory_int_182|, ~#x~0.base=|v_~#x~0.base_130|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_123, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} AuxVars[|v_P1_#t~ite24_23|, |v_P1_#t~mem22_34|, |v_P1_#t~ite23_29|] AssignedVars[P1Thread1of1ForFork1_#t~mem22, #memory_int, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-05 23:12:37,482 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [689] $Ultimate##0-->L808: Formula: (let ((.cse37 (mod v_~x$w_buff0_used~0_532 256)) (.cse38 (mod v_~weak$$choice0~0_118 256))) (let ((.cse14 (= .cse38 0)) (.cse20 (= .cse37 0)) (.cse18 (= (mod v_~x$w_buff1_used~0_474 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd2~0_287 256) 0)) (.cse3 (= (mod v_~weak$$choice2~0_87 256) 0))) (let ((.cse4 (not .cse3)) (.cse8 (not .cse12)) (.cse16 (not .cse18)) (.cse17 (= (mod v_~x$r_buff1_thd2~0_283 256) 0)) (.cse19 (not .cse20)) (.cse15 (not .cse14)) (.cse13 (= (mod v_~weak$$choice1~0_159 256) 0))) (let ((.cse33 (ite (= (ite .cse4 .cse37 (ite .cse20 .cse37 (ite (and .cse8 .cse19) 0 (ite (and .cse12 .cse16 .cse17 .cse19) (ite (or .cse15 .cse13) 1 0) .cse38)))) 0) 0 1))) (let ((.cse29 (= (mod .cse33 256) 0))) (let ((.cse30 (not .cse29))) (let ((.cse36 (and .cse30 .cse8))) (let ((.cse23 (ite .cse4 v_~x$w_buff1_used~0_474 (ite .cse29 v_~x$w_buff1_used~0_474 (ite .cse36 0 (ite (and .cse30 .cse12 .cse16 .cse17) v_~weak$$choice0~0_118 0)))))) (let ((.cse27 (= (mod .cse23 256) 0))) (let ((.cse22 (not .cse27))) (let ((.cse1 (ite .cse4 v_~x$r_buff0_thd2~0_287 (ite .cse29 v_~x$r_buff0_thd2~0_287 (ite .cse36 0 (ite (and .cse30 .cse12 .cse22 .cse17) v_~x$r_buff0_thd2~0_287 0)))))) (let ((.cse28 (= (mod .cse1 256) 0))) (let ((.cse31 (not .cse28))) (let ((.cse32 (and .cse30 .cse31))) (let ((.cse35 (ite .cse4 v_~x$r_buff1_thd2~0_283 (ite .cse29 v_~x$r_buff1_thd2~0_283 (ite .cse32 0 (ite (and .cse28 .cse30 .cse22 .cse17) (ite .cse15 v_~x$r_buff1_thd2~0_283 0) 0)))))) (let ((.cse26 (= (mod .cse35 256) 0)) (.cse34 (not (= (mod v_~x$w_buff0_used~0_530 256) 0))) (.cse24 (select |v_#memory_int_506| |v_~#x~0.base_260|))) (let ((.cse2 (select .cse24 |v_~#x~0.offset_260|)) (.cse0 (and .cse34 .cse31)) (.cse21 (not .cse26))) (and (= v_~x$r_buff0_thd2~0_285 (ite .cse0 0 .cse1)) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_32| |v_P0Thread1of1ForFork0_~arg#1.offset_32|) (= v_~y~0_55 1) (= v_~x$mem_tmp~0_75 .cse2) (= v_~x$w_buff0~0_331 v_~x$w_buff0~0_330) (or (and (= |v_P1_#t~ite21_66| |v_P1_#t~mem20_73|) (= v_~__unbuffered_p1_EAX~0_172 |v_P1_#t~mem20_73|) .cse3) (and (= |v_P1_#t~ite21_66| v_~x$mem_tmp~0_75) (= |v_P1Thread1of1ForFork1_#t~mem20_64| |v_P1_#t~mem20_73|) .cse4)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_127 |v_~#x~0.base_260|) (= v_~x$flush_delayed~0_97 0) (= v_~__unbuffered_p1_EAX$read_delayed~0_124 1) (= |v_P0Thread1of1ForFork0_~arg#1.base_32| |v_P0Thread1of1ForFork0_#in~arg#1.base_32|) (let ((.cse5 (= |v_P1Thread1of1ForFork1_#t~mem11_64| |v_P1_#t~mem11_93|)) (.cse6 (= |v_P1_#t~ite16_88| |v_P1Thread1of1ForFork1_#t~ite16_64|)) (.cse7 (= |v_P1_#t~ite12_92| |v_P1Thread1of1ForFork1_#t~ite12_64|)) (.cse9 (= |v_P1Thread1of1ForFork1_#t~mem13_64| |v_P1_#t~mem13_101|)) (.cse10 (= |v_P1_#t~ite15_92| |v_P1Thread1of1ForFork1_#t~ite15_64|)) (.cse11 (= |v_P1_#t~ite14_98| |v_P1Thread1of1ForFork1_#t~ite14_64|))) (or (and (= |v_P1_#t~ite17_76| v_~__unbuffered_p1_EAX~0_172) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_P1_#t~ite17_76| v_~x$w_buff0~0_331)) (and .cse12 (or (and (or (and .cse5 (= |v_P1_#t~ite12_92| (ite (not .cse13) v_~x$w_buff0~0_331 v_~x$w_buff1~0_288)) .cse14) (and .cse15 (= .cse2 |v_P1_#t~mem11_93|) (= |v_P1_#t~ite12_92| |v_P1_#t~mem11_93|))) (= |v_P1_#t~ite12_92| |v_P1_#t~ite16_88|) .cse16 .cse9 .cse10 .cse11 .cse17) (and .cse5 .cse7 (= |v_P1_#t~ite15_92| |v_P1_#t~ite16_88|) (or (and (= |v_P1_#t~ite14_98| |v_P1_#t~ite15_92|) (or (and .cse9 (= |v_P1_#t~ite14_98| v_~x$w_buff0~0_331) .cse15) (and (= .cse2 |v_P1_#t~mem13_101|) (= |v_P1_#t~ite14_98| |v_P1_#t~mem13_101|) .cse14)) .cse18) (and (= |v_P1_#t~ite15_92| (ite .cse15 v_~x$w_buff1~0_288 v_~x$w_buff0~0_331)) .cse16 .cse9 .cse11)) (or (not .cse17) .cse18))) (= |v_P1_#t~ite17_76| |v_P1_#t~ite16_88|))) (= |v_P1Thread1of1ForFork1_#t~mem10_64| |v_P1_#t~mem10_71|) .cse19) (and .cse5 .cse6 (= v_~__unbuffered_p1_EAX~0_172 |v_P1_#t~mem10_71|) .cse7 (= .cse2 |v_P1_#t~mem10_71|) .cse9 .cse10 .cse20 .cse11 (= |v_P1_#t~ite17_76| |v_P1Thread1of1ForFork1_#t~ite17_63|)))) (= v_~weak$$choice2~0_87 |v_P1Thread1of1ForFork1_#t~nondet7_64|) (= v_~x$w_buff1_used~0_472 (ite (or .cse0 (and .cse21 .cse22)) 0 .cse23)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_127 |v_~#x~0.offset_260|) (= v_~x$w_buff1~0_288 v_~x$w_buff1~0_287) (= v_P1Thread1of1ForFork1_~arg.base_32 |v_P1Thread1of1ForFork1_#in~arg.base_32|) (= v_~weak$$choice0~0_118 |v_P1Thread1of1ForFork1_#t~nondet6_64|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_32| v_P1Thread1of1ForFork1_~arg.offset_32) (= |v_#memory_int_504| (store |v_#memory_int_506| |v_~#x~0.base_260| (store .cse24 |v_~#x~0.offset_260| |v_P1_#t~ite24_56|))) (let ((.cse25 (= |v_P1Thread1of1ForFork1_#t~mem22_66| |v_P1_#t~mem22_67|))) (or (and (= |v_P1_#t~ite23_62| |v_P1_#t~ite24_56|) (or (and .cse21 (= |v_P1_#t~ite23_62| v_~x$w_buff1~0_287) .cse22 .cse25) (and (= |v_P1_#t~ite23_62| |v_P1_#t~mem22_67|) (= |v_P1_#t~ite21_66| |v_P1_#t~mem22_67|) (or .cse26 .cse27))) (or .cse28 .cse29)) (and .cse30 (= |v_P1_#t~ite24_56| v_~x$w_buff0~0_330) (= |v_P1_#t~ite23_62| |v_P1Thread1of1ForFork1_#t~ite23_66|) .cse25 .cse31))) (= v_~y~0_55 v_~__unbuffered_p0_EAX~0_94) (= v_~x$w_buff0_used~0_530 (ite .cse32 0 .cse33)) (= v_~weak$$choice1~0_159 |v_P1Thread1of1ForFork1_#t~nondet9_64|) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_285 256) 0)) .cse34) (and .cse21 (not (= (mod v_~x$w_buff1_used~0_472 256) 0)))) 0 .cse35) v_~x$r_buff1_thd2~0_281))))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, P1Thread1of1ForFork1_#t~mem20=|v_P1Thread1of1ForFork1_#t~mem20_64|, P1Thread1of1ForFork1_#t~mem22=|v_P1Thread1of1ForFork1_#t~mem22_66|, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_66|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_32|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_32|, P1Thread1of1ForFork1_#t~mem10=|v_P1Thread1of1ForFork1_#t~mem10_64|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_32|, P1Thread1of1ForFork1_#t~mem13=|v_P1Thread1of1ForFork1_#t~mem13_64|, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_64|, ~#x~0.offset=|v_~#x~0.offset_260|, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_64|, ~x$w_buff1~0=v_~x$w_buff1~0_288, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_474, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_64|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_64|, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_64|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_287, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_64|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_64|, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_63|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_532, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_64|, #memory_int=|v_#memory_int_506|, ~#x~0.base=|v_~#x~0.base_260|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_32|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_330, ~x$flush_delayed~0=v_~x$flush_delayed~0_97, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_124, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_35|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_32|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_34|, ~x$mem_tmp~0=v_~x$mem_tmp~0_75, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_94, ~weak$$choice1~0=v_~weak$$choice1~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_172, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_32|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_127, ~y~0=v_~y~0_55, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_34|, P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_34|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_32|, ~#x~0.offset=|v_~#x~0.offset_260|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_32, ~x$w_buff1~0=v_~x$w_buff1~0_287, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_32|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_281, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_472, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_285, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_530, ~weak$$choice0~0=v_~weak$$choice0~0_118, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_32, #memory_int=|v_#memory_int_504|, ~#x~0.base=|v_~#x~0.base_260|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_32|, ~weak$$choice2~0=v_~weak$$choice2~0_87, P1Thread1of1ForFork1_#t~mem19=|v_P1Thread1of1ForFork1_#t~mem19_34|} AuxVars[|v_P1_#t~mem11_93|, |v_P1_#t~mem10_71|, |v_P1_#t~ite21_66|, |v_P1_#t~ite23_62|, |v_P1_#t~ite24_56|, |v_P1_#t~mem13_101|, |v_P1_#t~mem22_67|, |v_P1_#t~mem20_73|, |v_P1_#t~ite16_88|, |v_P1_#t~ite14_98|, |v_P1_#t~ite15_92|, |v_P1_#t~ite12_92|, |v_P1_#t~ite17_76|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_#t~mem20, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, P1Thread1of1ForFork1_#t~mem22, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite21, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, ~y~0, P1Thread1of1ForFork1_#t~mem8, P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~mem10, P1Thread1of1ForFork1_#t~mem13, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, ~x$w_buff1~0, P0Thread1of1ForFork0_~arg#1.base, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, P1Thread1of1ForFork1_#t~nondet9, P1Thread1of1ForFork1_#t~ite12, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#t~ite17, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite16, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0, P1Thread1of1ForFork1_#t~mem19] and [576] L754-->L765: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_3| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3|) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_3| 0)) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_19) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_15)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_15} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3|, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$w_buff1~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0] [2022-12-05 23:12:40,683 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [694] $Ultimate##0-->L772: Formula: (let ((.cse1 (= (mod v_~x$r_buff0_thd0~0_178 256) 0)) (.cse33 (mod v_~x$w_buff0_used~0_566 256))) (let ((.cse34 (mod v_~weak$$choice0~0_128 256)) (.cse29 (= (mod v_~x$w_buff1_used~0_508 256) 0)) (.cse22 (= .cse33 0)) (.cse9 (= (mod v_~x$r_buff0_thd2~0_314 256) 0)) (.cse12 (= (mod v_~weak$$choice2~0_97 256) 0)) (.cse2 (not .cse1))) (let ((.cse17 (ite .cse2 0 1)) (.cse4 (not .cse12)) (.cse11 (not .cse9)) (.cse28 (not .cse22)) (.cse8 (not .cse29)) (.cse10 (= (mod v_~x$r_buff1_thd2~0_312 256) 0)) (.cse30 (not (= .cse34 0))) (.cse31 (= (mod v_~weak$$choice1~0_171 256) 0))) (let ((.cse32 (ite (= (ite .cse4 .cse33 (ite .cse22 .cse33 (ite (and .cse28 .cse11) 0 (ite (and .cse28 .cse8 .cse9 .cse10) (ite (or .cse30 .cse31) 1 0) .cse34)))) 0) 0 1)) (.cse20 (= (mod .cse17 256) 0))) (let ((.cse16 (not .cse20)) (.cse5 (= (mod .cse32 256) 0))) (let ((.cse7 (not .cse5)) (.cse0 (and .cse2 .cse16))) (let ((.cse3 (select |v_#memory_int_538| |v_~#x~0.base_272|)) (.cse19 (ite (or (and .cse7 .cse2) .cse0) 0 .cse32))) (let ((.cse13 (not (= (mod v_~x$r_buff0_thd1~0_243 256) 0))) (.cse18 (not (= (mod .cse19 256) 0))) (.cse14 (not (= (mod v_~x$w_buff0_used~0_564 256) 0))) (.cse15 (select .cse3 |v_~#x~0.offset_272|))) (and (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_139 |v_~#x~0.offset_272|) (= (ite .cse0 0 v_~x$r_buff0_thd0~0_178) v_~x$r_buff0_thd0~0_177) (= v_~x$r_buff0_thd2~0_313 v_~x$r_buff1_thd2~0_311) (or (and .cse1 (= |v_P1_#t~ite21_78| |v_ULTIMATE.start_main_#t~mem29#1_165|) (= |v_ULTIMATE.start_main_#t~ite30#1_166| |v_ULTIMATE.start_main_#t~ite31#1_132|) (= |v_ULTIMATE.start_main_#t~ite30#1_166| |v_ULTIMATE.start_main_#t~mem29#1_165|)) (and (= |v_ULTIMATE.start_main_#t~ite30#1_168| |v_ULTIMATE.start_main_#t~ite30#1_166|) (= v_~x$w_buff0~0_354 |v_ULTIMATE.start_main_#t~ite31#1_132|) .cse2 (= |v_ULTIMATE.start_main_#t~mem29#1_167| |v_ULTIMATE.start_main_#t~mem29#1_165|))) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_59| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_59|) (= |v_P0Thread1of1ForFork0_~arg#1.base_42| |v_P0Thread1of1ForFork0_#in~arg#1.base_42|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_42| v_P1Thread1of1ForFork1_~arg.offset_42) (= |v_#memory_int_536| (store |v_#memory_int_538| |v_~#x~0.base_272| (store .cse3 |v_~#x~0.offset_272| |v_P0_#t~ite5#1_73|))) (= (ite .cse4 v_~x$r_buff0_thd2~0_314 (ite .cse5 v_~x$r_buff0_thd2~0_314 (let ((.cse6 (and .cse7 .cse11))) (ite .cse6 0 (ite (and (not (= (mod (ite .cse4 v_~x$w_buff1_used~0_508 (ite .cse5 v_~x$w_buff1_used~0_508 (ite .cse6 0 (ite (and .cse7 .cse8 .cse9 .cse10) v_~weak$$choice0~0_128 0)))) 256) 0)) .cse7 .cse9 .cse10) v_~x$r_buff0_thd2~0_314 0))))) v_~x$r_buff0_thd2~0_313) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_59| 0)) (= v_~__unbuffered_p1_EAX$read_delayed~0_136 1) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_139 |v_~#x~0.base_272|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_42| |v_P0Thread1of1ForFork0_~arg#1.offset_42|) (= (ite .cse5 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_59|) (= v_~y~0_65 1) (or (and (= v_~__unbuffered_p1_EAX~0_186 |v_P1_#t~mem20_85|) (= |v_P1_#t~ite21_78| |v_P1_#t~mem20_85|) .cse12) (and .cse4 (= |v_P1Thread1of1ForFork1_#t~mem20_84| |v_P1_#t~mem20_85|) (= |v_P1_#t~ite21_78| v_~x$mem_tmp~0_85))) (= v_~x$r_buff1_thd1~0_174 (ite (or (and .cse13 (not (= (mod v_~x$w_buff1_used~0_506 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd1~0_241 256) 0)))) 0 v_~x$r_buff0_thd1~0_243)) (= v_~x$w_buff0~0_354 1) (= v_~x$flush_delayed~0_107 0) (= v_~weak$$choice1~0_171 |v_P1Thread1of1ForFork1_#t~nondet9_84|) (= .cse15 v_~x$mem_tmp~0_85) (= v_~x$w_buff0~0_355 v_~x$w_buff1~0_311) (= v_~x$w_buff0_used~0_564 (ite .cse16 0 .cse17)) (= (ite (or .cse14 (and .cse13 .cse18)) 0 .cse19) v_~x$w_buff1_used~0_506) (= v_~x$r_buff1_thd0~0_180 (ite (or (and .cse18 .cse2) (and (not (= (mod v_~x$r_buff0_thd0~0_177 256) 0)) .cse16)) 0 v_~x$r_buff0_thd0~0_178)) (= v_~weak$$choice2~0_97 |v_P1Thread1of1ForFork1_#t~nondet7_84|) (= (ite .cse14 0 1) v_~x$r_buff0_thd1~0_241) (or (and (= |v_P0_#t~ite5#1_73| v_~x$w_buff0~0_354) (= |v_P0_#t~mem3#1_74| |v_P0Thread1of1ForFork0_#t~mem3#1_78|) (= |v_P0_#t~ite4#1_69| |v_P0Thread1of1ForFork0_#t~ite4#1_78|) .cse16) (and (= |v_P0_#t~ite4#1_69| |v_P0_#t~ite5#1_73|) (= |v_P0_#t~mem3#1_74| |v_P0_#t~ite4#1_69|) (= |v_P0_#t~mem3#1_74| |v_ULTIMATE.start_main_#t~ite31#1_132|) .cse20)) (= v_P1Thread1of1ForFork1_~arg.base_42 |v_P1Thread1of1ForFork1_#in~arg.base_42|) (= v_~y~0_65 v_~__unbuffered_p0_EAX~0_106) (= v_~weak$$choice0~0_128 |v_P1Thread1of1ForFork1_#t~nondet6_84|) (let ((.cse24 (= |v_P1_#t~ite16_100| |v_P1Thread1of1ForFork1_#t~ite16_84|)) (.cse21 (= |v_P1_#t~ite12_104| |v_P1Thread1of1ForFork1_#t~ite12_84|)) (.cse23 (= |v_P1Thread1of1ForFork1_#t~mem13_84| |v_P1_#t~mem13_113|)) (.cse25 (= |v_P1Thread1of1ForFork1_#t~mem11_84| |v_P1_#t~mem11_105|)) (.cse26 (= |v_P1_#t~ite15_104| |v_P1Thread1of1ForFork1_#t~ite15_84|)) (.cse27 (= |v_P1_#t~ite14_110| |v_P1Thread1of1ForFork1_#t~ite14_84|))) (or (and (= v_~__unbuffered_p1_EAX~0_186 |v_P1_#t~mem10_83|) (= .cse15 |v_P1_#t~mem10_83|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (= |v_P1_#t~ite17_88| |v_P1Thread1of1ForFork1_#t~ite17_83|)) (and .cse28 (= |v_P1_#t~ite17_88| v_~__unbuffered_p1_EAX~0_186) (or (and .cse21 .cse11 .cse23 (= |v_P1_#t~ite17_88| v_~x$w_buff0~0_355) .cse24 .cse25 .cse26 .cse27) (and (or (and (or (not .cse10) .cse29) (= |v_P1_#t~ite15_104| |v_P1_#t~ite16_100|) .cse21 .cse25 (or (and (= |v_P1_#t~ite15_104| (ite .cse30 v_~x$w_buff1~0_312 v_~x$w_buff0~0_355)) .cse23 .cse8 .cse27) (and (= |v_P1_#t~ite14_110| |v_P1_#t~ite15_104|) (= .cse15 |v_P1_#t~mem13_113|) (= |v_P1_#t~ite14_110| |v_P1_#t~mem13_113|) .cse29))) (and (= |v_P1_#t~ite12_104| |v_P1_#t~ite16_100|) .cse23 .cse8 .cse25 .cse26 (= |v_P1_#t~ite12_104| (ite (not .cse31) v_~x$w_buff0~0_355 v_~x$w_buff1~0_312)) .cse10 .cse27)) (= |v_P1_#t~ite16_100| |v_P1_#t~ite17_88|) .cse9)) (= |v_P1Thread1of1ForFork1_#t~mem10_84| |v_P1_#t~mem10_83|))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_355, P0Thread1of1ForFork0_#t~ite4#1=|v_P0Thread1of1ForFork0_#t~ite4#1_78|, P1Thread1of1ForFork1_#t~mem20=|v_P1Thread1of1ForFork1_#t~mem20_84|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_243, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_42|, P0Thread1of1ForFork0_#t~mem3#1=|v_P0Thread1of1ForFork0_#t~mem3#1_78|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_42|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_178, P1Thread1of1ForFork1_#t~mem10=|v_P1Thread1of1ForFork1_#t~mem10_84|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_42|, P1Thread1of1ForFork1_#t~mem13=|v_P1Thread1of1ForFork1_#t~mem13_84|, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_84|, ~#x~0.offset=|v_~#x~0.offset_272|, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_84|, ~x$w_buff1~0=v_~x$w_buff1~0_312, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_508, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_312, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_84|, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_167|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_84|, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_84|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_314, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_84|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_84|, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_83|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_566, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_84|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_168|, #memory_int=|v_#memory_int_538|, ~#x~0.base=|v_~#x~0.base_272|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_42|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_354, ~x$flush_delayed~0=v_~x$flush_delayed~0_107, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_42|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_174, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~weak$$choice1~0=v_~weak$$choice1~0_171, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_186, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_139, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_44|, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_59|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_177, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_42|, ~#x~0.offset=|v_~#x~0.offset_272|, ~x$w_buff1~0=v_~x$w_buff1~0_311, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_506, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_311, ~weak$$choice0~0=v_~weak$$choice0~0_128, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_42|, P0Thread1of1ForFork0_#t~ite5#1=|v_P0Thread1of1ForFork0_#t~ite5#1_41|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_241, ULTIMATE.start_main_#t~ite31#1=|v_ULTIMATE.start_main_#t~ite31#1_131|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_136, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_44|, ~x$mem_tmp~0=v_~x$mem_tmp~0_85, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_42|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_42|, ~y~0=v_~y~0_65, P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_44|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_42, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_42|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_139, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_180, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_313, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_564, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_42, #memory_int=|v_#memory_int_536|, ~#x~0.base=|v_~#x~0.base_272|, ~weak$$choice2~0=v_~weak$$choice2~0_97, P1Thread1of1ForFork1_#t~mem19=|v_P1Thread1of1ForFork1_#t~mem19_44|} AuxVars[|v_P1_#t~mem10_83|, |v_P1_#t~ite21_78|, |v_P1_#t~ite16_100|, |v_P1_#t~mem11_105|, |v_P0_#t~mem3#1_74|, |v_P1_#t~mem13_113|, |v_P1_#t~ite12_104|, |v_P1_#t~ite14_110|, |v_P1_#t~mem20_85|, |v_ULTIMATE.start_main_#t~ite30#1_166|, |v_ULTIMATE.start_main_#t~mem29#1_165|, |v_ULTIMATE.start_main_#t~ite31#1_132|, |v_P1_#t~ite15_104|, |v_P0_#t~ite4#1_69|, |v_P0_#t~ite5#1_73|, |v_P1_#t~ite17_88|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork0_#t~ite4#1, ~x$flush_delayed~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~mem3#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd0~0, P1Thread1of1ForFork1_#t~mem10, P1Thread1of1ForFork1_#t~nondet6, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite17, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite30#1, P0Thread1of1ForFork0_#t~ite5#1, P1Thread1of1ForFork1_#t~mem20, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite31#1, ~__unbuffered_p1_EAX$read_delayed~0, P1Thread1of1ForFork1_#t~ite21, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg#1.offset, ~y~0, P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~mem13, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, P0Thread1of1ForFork0_~arg#1.base, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, P1Thread1of1ForFork1_#t~nondet9, ULTIMATE.start_main_#t~mem29#1, P1Thread1of1ForFork1_#t~ite12, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite14, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite16, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0, P1Thread1of1ForFork1_#t~mem19] and [682] L839-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_111 1) (= v_~__unbuffered_p0_EAX~0_59 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|) (let ((.cse0 (= (mod v_~__unbuffered_p1_EAX$read_delayed~0_81 256) 0)) (.cse1 (= |v_ULTIMATE.start_main_#t~mem33#1_127| |v_ULTIMATE.start_main_#t~mem33#1_125|))) (or (and (= v_~__unbuffered_p1_EAX~0_111 |v_ULTIMATE.start_main_#t~ite34#1_122|) (not .cse0) (let ((.cse2 (= (mod v_~weak$$choice1~0_116 256) 0))) (or (and (= v_~__unbuffered_p1_EAX~0_112 |v_ULTIMATE.start_main_#t~ite34#1_122|) .cse1 .cse2) (and (= |v_ULTIMATE.start_main_#t~ite34#1_122| |v_ULTIMATE.start_main_#t~mem33#1_125|) (not .cse2) (= |v_ULTIMATE.start_main_#t~mem33#1_125| (select (select |v_#memory_int_322| v_~__unbuffered_p1_EAX$read_delayed_var~0.base_84) v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_84)))))) (and .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite34#1_124| |v_ULTIMATE.start_main_#t~ite34#1_122|) (= v_~__unbuffered_p1_EAX~0_112 v_~__unbuffered_p1_EAX~0_111)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~weak$$choice1~0_116 |v_ULTIMATE.start_main_#t~nondet32#1_77|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_127|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_112, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_124|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_81, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_84, #memory_int=|v_#memory_int_322|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_84, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_77|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_81, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_84, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_66|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~weak$$choice1~0=v_~weak$$choice1~0_116, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_84, #memory_int=|v_#memory_int_322|} AuxVars[|v_ULTIMATE.start_main_#t~ite34#1_122|, |v_ULTIMATE.start_main_#t~mem33#1_125|] AssignedVars[ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~nondet32#1, ~main$tmp_guard1~0] [2022-12-05 23:12:43,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] $Ultimate##0-->L808: Formula: (let ((.cse36 (mod v_~x$w_buff0_used~0_572 256))) (let ((.cse37 (mod v_~weak$$choice0~0_130 256)) (.cse21 (= (mod v_~x$w_buff1_used~0_514 256) 0)) (.cse12 (= .cse36 0)) (.cse23 (= (mod v_~x$r_buff0_thd2~0_319 256) 0)) (.cse24 (= (mod v_~weak$$choice2~0_99 256) 0))) (let ((.cse25 (not .cse24)) (.cse17 (not .cse23)) (.cse16 (not .cse12)) (.cse19 (= (mod v_~x$r_buff1_thd2~0_317 256) 0)) (.cse20 (not .cse21)) (.cse18 (= (mod v_~weak$$choice1~0_173 256) 0)) (.cse22 (not (= .cse37 0))) (.cse3 (= (mod v_~x$r_buff0_thd0~0_182 256) 0))) (let ((.cse1 (not .cse3)) (.cse34 (ite (= 0 (ite .cse25 .cse36 (ite .cse12 .cse36 (ite (and .cse16 .cse17) 0 (ite (and .cse16 .cse23 .cse19 .cse20) (ite (or .cse18 .cse22) 1 0) .cse37))))) 0 1))) (let ((.cse26 (= (mod .cse34 256) 0)) (.cse31 (ite .cse1 0 1))) (let ((.cse30 (= (mod .cse31 256) 0)) (.cse33 (not .cse26))) (let ((.cse6 (ite .cse25 v_~x$r_buff0_thd2~0_319 (ite .cse26 v_~x$r_buff0_thd2~0_319 (let ((.cse35 (and .cse33 .cse17))) (ite .cse35 0 (ite (and (not (= (mod (ite .cse25 v_~x$w_buff1_used~0_514 (ite .cse26 v_~x$w_buff1_used~0_514 (ite .cse35 0 (ite (and .cse23 .cse19 .cse33 .cse20) v_~weak$$choice0~0_130 0)))) 256) 0)) .cse23 .cse19 .cse33) v_~x$r_buff0_thd2~0_319 0)))))) (.cse2 (not .cse30))) (let ((.cse32 (and .cse2 .cse1)) (.cse29 (= (mod .cse6 256) 0))) (let ((.cse7 (select |v_#memory_int_544| |v_~#x~0.base_274|)) (.cse5 (not (= (mod v_~x$w_buff0_used~0_570 256) 0))) (.cse4 (not .cse29)) (.cse28 (ite (or (and .cse1 .cse33) .cse32) 0 .cse34))) (let ((.cse0 (not (= (mod .cse28 256) 0))) (.cse27 (and .cse5 .cse4)) (.cse8 (select .cse7 |v_~#x~0.offset_274|))) (and (= v_~weak$$choice1~0_173 |v_P1Thread1of1ForFork1_#t~nondet9_88|) (= v_~x$r_buff1_thd0~0_182 (ite (or (and .cse0 .cse1) (and .cse2 (not (= (mod v_~x$r_buff0_thd0~0_181 256) 0)))) 0 v_~x$r_buff0_thd0~0_182)) (= v_~y~0_67 1) (or (and .cse1 (= |v_ULTIMATE.start_main_#t~ite30#1_174| |v_ULTIMATE.start_main_#t~ite30#1_172|) (= v_~x$w_buff0~0_358 |v_ULTIMATE.start_main_#t~ite31#1_136|) (= |v_ULTIMATE.start_main_#t~mem29#1_173| |v_ULTIMATE.start_main_#t~mem29#1_171|)) (and (= |v_P1_#t~ite21_80| |v_ULTIMATE.start_main_#t~mem29#1_171|) .cse3 (= |v_ULTIMATE.start_main_#t~ite30#1_172| |v_ULTIMATE.start_main_#t~ite31#1_136|) (= |v_ULTIMATE.start_main_#t~ite30#1_172| |v_ULTIMATE.start_main_#t~mem29#1_171|))) (= |v_P1Thread1of1ForFork1_#in~arg.offset_44| v_P1Thread1of1ForFork1_~arg.offset_44) (= (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_512 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_317 256) 0)) .cse5)) 0 .cse6) v_~x$r_buff1_thd2~0_315) (= v_~x$w_buff0~0_358 1) (= v_~weak$$choice0~0_130 |v_P1Thread1of1ForFork1_#t~nondet6_88|) (= v_P1Thread1of1ForFork1_~arg.base_44 |v_P1Thread1of1ForFork1_#in~arg.base_44|) (= (store |v_#memory_int_544| |v_~#x~0.base_274| (store .cse7 |v_~#x~0.offset_274| |v_P1_#t~ite24_64|)) |v_#memory_int_542|) (let ((.cse11 (= |v_P1_#t~ite16_102| |v_P1Thread1of1ForFork1_#t~ite16_88|)) (.cse15 (= |v_P1_#t~ite15_106| |v_P1Thread1of1ForFork1_#t~ite15_88|)) (.cse9 (= |v_P1_#t~ite12_106| |v_P1Thread1of1ForFork1_#t~ite12_88|)) (.cse10 (= |v_P1_#t~ite14_112| |v_P1Thread1of1ForFork1_#t~ite14_88|)) (.cse13 (= |v_P1Thread1of1ForFork1_#t~mem13_88| |v_P1_#t~mem13_115|)) (.cse14 (= |v_P1Thread1of1ForFork1_#t~mem11_88| |v_P1_#t~mem11_107|))) (or (and (= |v_P1_#t~mem10_85| .cse8) (= v_~__unbuffered_p1_EAX~0_188 |v_P1_#t~mem10_85|) (= |v_P1_#t~ite17_90| |v_P1Thread1of1ForFork1_#t~ite17_87|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 (= |v_P1_#t~ite17_90| v_~__unbuffered_p1_EAX~0_188) (= |v_P1Thread1of1ForFork1_#t~mem10_88| |v_P1_#t~mem10_85|) (or (and (= |v_P1_#t~ite17_90| v_~x$w_buff0~0_359) .cse9 .cse10 .cse11 .cse13 .cse14 .cse17 .cse15) (and (or (and (= |v_P1_#t~ite12_106| (ite (not .cse18) v_~x$w_buff0~0_359 v_~x$w_buff1~0_316)) (= |v_P1_#t~ite12_106| |v_P1_#t~ite16_102|) .cse10 .cse19 .cse20 .cse13 .cse14 .cse15) (and (or .cse21 (not .cse19)) .cse9 (or (and (= |v_P1_#t~ite14_112| |v_P1_#t~mem13_115|) (= .cse8 |v_P1_#t~mem13_115|) .cse21 (= |v_P1_#t~ite14_112| |v_P1_#t~ite15_106|)) (and (= |v_P1_#t~ite15_106| (ite .cse22 v_~x$w_buff1~0_316 v_~x$w_buff0~0_359)) .cse10 .cse20 .cse13)) (= |v_P1_#t~ite15_106| |v_P1_#t~ite16_102|) .cse14)) .cse23 (= |v_P1_#t~ite16_102| |v_P1_#t~ite17_90|)))))) (or (and (= |v_P1_#t~ite21_80| |v_P1_#t~mem20_87|) (= v_~__unbuffered_p1_EAX~0_188 |v_P1_#t~mem20_87|) .cse24) (and (= |v_P1_#t~ite21_80| v_~x$mem_tmp~0_87) (= |v_P1Thread1of1ForFork1_#t~mem20_88| |v_P1_#t~mem20_87|) .cse25)) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61| (ite .cse26 1 0)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_141 |v_~#x~0.base_274|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_61| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61|) (= v_~x$flush_delayed~0_109 0) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_61| 0)) (= v_~x$w_buff0~0_359 v_~x$w_buff1~0_315) (= v_~x$w_buff1_used~0_512 (ite (or (and .cse0 .cse4) .cse27) 0 .cse28)) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_44| |v_P0Thread1of1ForFork0_~arg#1.offset_44|) (= v_~__unbuffered_p1_EAX$read_delayed~0_138 1) (= v_~x$r_buff0_thd2~0_317 (ite .cse27 0 .cse6)) (= v_~y~0_67 v_~__unbuffered_p0_EAX~0_108) (= |v_P0Thread1of1ForFork0_~arg#1.base_44| |v_P0Thread1of1ForFork0_#in~arg#1.base_44|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_141 |v_~#x~0.offset_274|) (= v_~x$mem_tmp~0_87 .cse8) (or (and (= |v_P1Thread1of1ForFork1_#t~mem22_78| |v_P1_#t~mem22_75|) .cse2 (= |v_P1_#t~ite23_70| |v_P1Thread1of1ForFork1_#t~ite23_78|) .cse4 (= |v_P1_#t~ite24_64| v_~x$w_buff0~0_358)) (and (= |v_P1_#t~ite23_70| |v_P1_#t~mem22_75|) (= |v_ULTIMATE.start_main_#t~ite31#1_136| |v_P1_#t~mem22_75|) (or .cse29 .cse30) (= |v_P1_#t~ite23_70| |v_P1_#t~ite24_64|))) (= v_~weak$$choice2~0_99 |v_P1Thread1of1ForFork1_#t~nondet7_88|) (= v_~x$r_buff0_thd1~0_248 v_~x$r_buff1_thd1~0_178) (= v_~x$r_buff0_thd1~0_247 1) (= (ite (and .cse2 .cse4) 0 .cse31) v_~x$w_buff0_used~0_570) (= v_~x$r_buff0_thd0~0_181 (ite .cse32 0 v_~x$r_buff0_thd0~0_182))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_359, P1Thread1of1ForFork1_#t~mem20=|v_P1Thread1of1ForFork1_#t~mem20_88|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_248, P1Thread1of1ForFork1_#t~mem22=|v_P1Thread1of1ForFork1_#t~mem22_78|, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_78|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_44|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_44|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_182, P1Thread1of1ForFork1_#t~mem10=|v_P1Thread1of1ForFork1_#t~mem10_88|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_44|, P1Thread1of1ForFork1_#t~mem13=|v_P1Thread1of1ForFork1_#t~mem13_88|, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_88|, ~#x~0.offset=|v_~#x~0.offset_274|, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_88|, ~x$w_buff1~0=v_~x$w_buff1~0_316, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_514, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_88|, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_173|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_88|, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_88|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_88|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_88|, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_87|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_572, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_88|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_174|, #memory_int=|v_#memory_int_544|, ~#x~0.base=|v_~#x~0.base_274|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_44|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_358, ~x$flush_delayed~0=v_~x$flush_delayed~0_109, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_41|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_44|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_178, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_108, ~weak$$choice1~0=v_~weak$$choice1~0_173, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_188, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_141, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_46|, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_61|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_181, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_44|, ~#x~0.offset=|v_~#x~0.offset_274|, ~x$w_buff1~0=v_~x$w_buff1~0_315, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_315, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_512, ~weak$$choice0~0=v_~weak$$choice0~0_130, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_44|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_247, ULTIMATE.start_main_#t~ite31#1=|v_ULTIMATE.start_main_#t~ite31#1_135|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_138, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_46|, ~x$mem_tmp~0=v_~x$mem_tmp~0_87, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_44|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_44|, ~y~0=v_~y~0_67, P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_46|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_44, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_44|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_141, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_317, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_182, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_570, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_44, #memory_int=|v_#memory_int_542|, ~#x~0.base=|v_~#x~0.base_274|, ~weak$$choice2~0=v_~weak$$choice2~0_99, P1Thread1of1ForFork1_#t~mem19=|v_P1Thread1of1ForFork1_#t~mem19_46|} AuxVars[|v_P1_#t~mem13_115|, |v_P1_#t~ite14_112|, |v_P1_#t~ite24_64|, |v_P1_#t~ite16_102|, |v_P1_#t~ite17_90|, |v_P1_#t~mem11_107|, |v_P1_#t~ite23_70|, |v_P1_#t~ite21_80|, |v_ULTIMATE.start_main_#t~ite31#1_136|, |v_P1_#t~mem20_87|, |v_P1_#t~ite12_106|, |v_P1_#t~mem22_75|, |v_ULTIMATE.start_main_#t~mem29#1_171|, |v_ULTIMATE.start_main_#t~ite30#1_172|, |v_P1_#t~ite15_106|, |v_P1_#t~mem10_85|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite24, ~x$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd0~0, P1Thread1of1ForFork1_#t~mem10, P1Thread1of1ForFork1_#t~nondet6, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite17, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite30#1, P1Thread1of1ForFork1_#t~mem20, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite31#1, ~__unbuffered_p1_EAX$read_delayed~0, P1Thread1of1ForFork1_#t~mem22, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite21, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg#1.offset, ~y~0, P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~mem13, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, P0Thread1of1ForFork0_~arg#1.base, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, P1Thread1of1ForFork1_#t~nondet9, ULTIMATE.start_main_#t~mem29#1, P1Thread1of1ForFork1_#t~ite12, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~ite14, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite16, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0, P1Thread1of1ForFork1_#t~mem19] and [682] L839-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_111 1) (= v_~__unbuffered_p0_EAX~0_59 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|) (let ((.cse0 (= (mod v_~__unbuffered_p1_EAX$read_delayed~0_81 256) 0)) (.cse1 (= |v_ULTIMATE.start_main_#t~mem33#1_127| |v_ULTIMATE.start_main_#t~mem33#1_125|))) (or (and (= v_~__unbuffered_p1_EAX~0_111 |v_ULTIMATE.start_main_#t~ite34#1_122|) (not .cse0) (let ((.cse2 (= (mod v_~weak$$choice1~0_116 256) 0))) (or (and (= v_~__unbuffered_p1_EAX~0_112 |v_ULTIMATE.start_main_#t~ite34#1_122|) .cse1 .cse2) (and (= |v_ULTIMATE.start_main_#t~ite34#1_122| |v_ULTIMATE.start_main_#t~mem33#1_125|) (not .cse2) (= |v_ULTIMATE.start_main_#t~mem33#1_125| (select (select |v_#memory_int_322| v_~__unbuffered_p1_EAX$read_delayed_var~0.base_84) v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_84)))))) (and .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite34#1_124| |v_ULTIMATE.start_main_#t~ite34#1_122|) (= v_~__unbuffered_p1_EAX~0_112 v_~__unbuffered_p1_EAX~0_111)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~weak$$choice1~0_116 |v_ULTIMATE.start_main_#t~nondet32#1_77|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_127|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_112, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_124|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_81, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_84, #memory_int=|v_#memory_int_322|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_84, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_77|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_81, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_84, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_66|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~weak$$choice1~0=v_~weak$$choice1~0_116, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_84, #memory_int=|v_#memory_int_322|} AuxVars[|v_ULTIMATE.start_main_#t~ite34#1_122|, |v_ULTIMATE.start_main_#t~mem33#1_125|] AssignedVars[ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~nondet32#1, ~main$tmp_guard1~0] [2022-12-05 23:12:47,401 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:12:47,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17832 [2022-12-05 23:12:47,402 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 165 flow [2022-12-05 23:12:47,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:47,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:47,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:47,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:12:47,403 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:12:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1386670028, now seen corresponding path program 1 times [2022-12-05 23:12:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:47,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513863339] [2022-12-05 23:12:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:12:47,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:47,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513863339] [2022-12-05 23:12:47,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513863339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:47,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:47,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:12:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715974046] [2022-12-05 23:12:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:47,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:12:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:47,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:12:47,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:12:47,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:12:47,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:47,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:47,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:12:47,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:47,681 INFO L130 PetriNetUnfolder]: 38/79 cut-off events. [2022-12-05 23:12:47,681 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-05 23:12:47,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 79 events. 38/79 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 22 based on Foata normal form. 2/81 useless extension candidates. Maximal degree in co-relation 267. Up to 75 conditions per place. [2022-12-05 23:12:47,682 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 14 selfloop transitions, 5 changer transitions 0/19 dead transitions. [2022-12-05 23:12:47,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 19 transitions, 139 flow [2022-12-05 23:12:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:12:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:12:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-12-05 23:12:47,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-05 23:12:47,683 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 165 flow. Second operand 3 states and 18 transitions. [2022-12-05 23:12:47,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 19 transitions, 139 flow [2022-12-05 23:12:47,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 113 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-05 23:12:47,685 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 96 flow [2022-12-05 23:12:47,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2022-12-05 23:12:47,686 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2022-12-05 23:12:47,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:47,686 INFO L89 Accepts]: Start accepts. Operand has 26 places, 19 transitions, 96 flow [2022-12-05 23:12:47,687 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:47,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:47,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 19 transitions, 96 flow [2022-12-05 23:12:47,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 96 flow [2022-12-05 23:12:47,697 INFO L130 PetriNetUnfolder]: 11/39 cut-off events. [2022-12-05 23:12:47,698 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-05 23:12:47,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 39 events. 11/39 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 98 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 110. Up to 18 conditions per place. [2022-12-05 23:12:47,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 96 flow [2022-12-05 23:12:47,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-05 23:12:47,701 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [689] $Ultimate##0-->L808: Formula: (let ((.cse37 (mod v_~x$w_buff0_used~0_532 256)) (.cse38 (mod v_~weak$$choice0~0_118 256))) (let ((.cse14 (= .cse38 0)) (.cse20 (= .cse37 0)) (.cse18 (= (mod v_~x$w_buff1_used~0_474 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd2~0_287 256) 0)) (.cse3 (= (mod v_~weak$$choice2~0_87 256) 0))) (let ((.cse4 (not .cse3)) (.cse8 (not .cse12)) (.cse16 (not .cse18)) (.cse17 (= (mod v_~x$r_buff1_thd2~0_283 256) 0)) (.cse19 (not .cse20)) (.cse15 (not .cse14)) (.cse13 (= (mod v_~weak$$choice1~0_159 256) 0))) (let ((.cse33 (ite (= (ite .cse4 .cse37 (ite .cse20 .cse37 (ite (and .cse8 .cse19) 0 (ite (and .cse12 .cse16 .cse17 .cse19) (ite (or .cse15 .cse13) 1 0) .cse38)))) 0) 0 1))) (let ((.cse29 (= (mod .cse33 256) 0))) (let ((.cse30 (not .cse29))) (let ((.cse36 (and .cse30 .cse8))) (let ((.cse23 (ite .cse4 v_~x$w_buff1_used~0_474 (ite .cse29 v_~x$w_buff1_used~0_474 (ite .cse36 0 (ite (and .cse30 .cse12 .cse16 .cse17) v_~weak$$choice0~0_118 0)))))) (let ((.cse27 (= (mod .cse23 256) 0))) (let ((.cse22 (not .cse27))) (let ((.cse1 (ite .cse4 v_~x$r_buff0_thd2~0_287 (ite .cse29 v_~x$r_buff0_thd2~0_287 (ite .cse36 0 (ite (and .cse30 .cse12 .cse22 .cse17) v_~x$r_buff0_thd2~0_287 0)))))) (let ((.cse28 (= (mod .cse1 256) 0))) (let ((.cse31 (not .cse28))) (let ((.cse32 (and .cse30 .cse31))) (let ((.cse35 (ite .cse4 v_~x$r_buff1_thd2~0_283 (ite .cse29 v_~x$r_buff1_thd2~0_283 (ite .cse32 0 (ite (and .cse28 .cse30 .cse22 .cse17) (ite .cse15 v_~x$r_buff1_thd2~0_283 0) 0)))))) (let ((.cse26 (= (mod .cse35 256) 0)) (.cse34 (not (= (mod v_~x$w_buff0_used~0_530 256) 0))) (.cse24 (select |v_#memory_int_506| |v_~#x~0.base_260|))) (let ((.cse2 (select .cse24 |v_~#x~0.offset_260|)) (.cse0 (and .cse34 .cse31)) (.cse21 (not .cse26))) (and (= v_~x$r_buff0_thd2~0_285 (ite .cse0 0 .cse1)) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_32| |v_P0Thread1of1ForFork0_~arg#1.offset_32|) (= v_~y~0_55 1) (= v_~x$mem_tmp~0_75 .cse2) (= v_~x$w_buff0~0_331 v_~x$w_buff0~0_330) (or (and (= |v_P1_#t~ite21_66| |v_P1_#t~mem20_73|) (= v_~__unbuffered_p1_EAX~0_172 |v_P1_#t~mem20_73|) .cse3) (and (= |v_P1_#t~ite21_66| v_~x$mem_tmp~0_75) (= |v_P1Thread1of1ForFork1_#t~mem20_64| |v_P1_#t~mem20_73|) .cse4)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_127 |v_~#x~0.base_260|) (= v_~x$flush_delayed~0_97 0) (= v_~__unbuffered_p1_EAX$read_delayed~0_124 1) (= |v_P0Thread1of1ForFork0_~arg#1.base_32| |v_P0Thread1of1ForFork0_#in~arg#1.base_32|) (let ((.cse5 (= |v_P1Thread1of1ForFork1_#t~mem11_64| |v_P1_#t~mem11_93|)) (.cse6 (= |v_P1_#t~ite16_88| |v_P1Thread1of1ForFork1_#t~ite16_64|)) (.cse7 (= |v_P1_#t~ite12_92| |v_P1Thread1of1ForFork1_#t~ite12_64|)) (.cse9 (= |v_P1Thread1of1ForFork1_#t~mem13_64| |v_P1_#t~mem13_101|)) (.cse10 (= |v_P1_#t~ite15_92| |v_P1Thread1of1ForFork1_#t~ite15_64|)) (.cse11 (= |v_P1_#t~ite14_98| |v_P1Thread1of1ForFork1_#t~ite14_64|))) (or (and (= |v_P1_#t~ite17_76| v_~__unbuffered_p1_EAX~0_172) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_P1_#t~ite17_76| v_~x$w_buff0~0_331)) (and .cse12 (or (and (or (and .cse5 (= |v_P1_#t~ite12_92| (ite (not .cse13) v_~x$w_buff0~0_331 v_~x$w_buff1~0_288)) .cse14) (and .cse15 (= .cse2 |v_P1_#t~mem11_93|) (= |v_P1_#t~ite12_92| |v_P1_#t~mem11_93|))) (= |v_P1_#t~ite12_92| |v_P1_#t~ite16_88|) .cse16 .cse9 .cse10 .cse11 .cse17) (and .cse5 .cse7 (= |v_P1_#t~ite15_92| |v_P1_#t~ite16_88|) (or (and (= |v_P1_#t~ite14_98| |v_P1_#t~ite15_92|) (or (and .cse9 (= |v_P1_#t~ite14_98| v_~x$w_buff0~0_331) .cse15) (and (= .cse2 |v_P1_#t~mem13_101|) (= |v_P1_#t~ite14_98| |v_P1_#t~mem13_101|) .cse14)) .cse18) (and (= |v_P1_#t~ite15_92| (ite .cse15 v_~x$w_buff1~0_288 v_~x$w_buff0~0_331)) .cse16 .cse9 .cse11)) (or (not .cse17) .cse18))) (= |v_P1_#t~ite17_76| |v_P1_#t~ite16_88|))) (= |v_P1Thread1of1ForFork1_#t~mem10_64| |v_P1_#t~mem10_71|) .cse19) (and .cse5 .cse6 (= v_~__unbuffered_p1_EAX~0_172 |v_P1_#t~mem10_71|) .cse7 (= .cse2 |v_P1_#t~mem10_71|) .cse9 .cse10 .cse20 .cse11 (= |v_P1_#t~ite17_76| |v_P1Thread1of1ForFork1_#t~ite17_63|)))) (= v_~weak$$choice2~0_87 |v_P1Thread1of1ForFork1_#t~nondet7_64|) (= v_~x$w_buff1_used~0_472 (ite (or .cse0 (and .cse21 .cse22)) 0 .cse23)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_127 |v_~#x~0.offset_260|) (= v_~x$w_buff1~0_288 v_~x$w_buff1~0_287) (= v_P1Thread1of1ForFork1_~arg.base_32 |v_P1Thread1of1ForFork1_#in~arg.base_32|) (= v_~weak$$choice0~0_118 |v_P1Thread1of1ForFork1_#t~nondet6_64|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_32| v_P1Thread1of1ForFork1_~arg.offset_32) (= |v_#memory_int_504| (store |v_#memory_int_506| |v_~#x~0.base_260| (store .cse24 |v_~#x~0.offset_260| |v_P1_#t~ite24_56|))) (let ((.cse25 (= |v_P1Thread1of1ForFork1_#t~mem22_66| |v_P1_#t~mem22_67|))) (or (and (= |v_P1_#t~ite23_62| |v_P1_#t~ite24_56|) (or (and .cse21 (= |v_P1_#t~ite23_62| v_~x$w_buff1~0_287) .cse22 .cse25) (and (= |v_P1_#t~ite23_62| |v_P1_#t~mem22_67|) (= |v_P1_#t~ite21_66| |v_P1_#t~mem22_67|) (or .cse26 .cse27))) (or .cse28 .cse29)) (and .cse30 (= |v_P1_#t~ite24_56| v_~x$w_buff0~0_330) (= |v_P1_#t~ite23_62| |v_P1Thread1of1ForFork1_#t~ite23_66|) .cse25 .cse31))) (= v_~y~0_55 v_~__unbuffered_p0_EAX~0_94) (= v_~x$w_buff0_used~0_530 (ite .cse32 0 .cse33)) (= v_~weak$$choice1~0_159 |v_P1Thread1of1ForFork1_#t~nondet9_64|) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_285 256) 0)) .cse34) (and .cse21 (not (= (mod v_~x$w_buff1_used~0_472 256) 0)))) 0 .cse35) v_~x$r_buff1_thd2~0_281))))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, P1Thread1of1ForFork1_#t~mem20=|v_P1Thread1of1ForFork1_#t~mem20_64|, P1Thread1of1ForFork1_#t~mem22=|v_P1Thread1of1ForFork1_#t~mem22_66|, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_66|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_32|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_32|, P1Thread1of1ForFork1_#t~mem10=|v_P1Thread1of1ForFork1_#t~mem10_64|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_32|, P1Thread1of1ForFork1_#t~mem13=|v_P1Thread1of1ForFork1_#t~mem13_64|, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_64|, ~#x~0.offset=|v_~#x~0.offset_260|, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_64|, ~x$w_buff1~0=v_~x$w_buff1~0_288, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_474, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_64|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_64|, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_64|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_287, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_64|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_64|, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_63|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_532, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_64|, #memory_int=|v_#memory_int_506|, ~#x~0.base=|v_~#x~0.base_260|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_32|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_330, ~x$flush_delayed~0=v_~x$flush_delayed~0_97, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_124, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_35|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_32|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_34|, ~x$mem_tmp~0=v_~x$mem_tmp~0_75, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_94, ~weak$$choice1~0=v_~weak$$choice1~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_172, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_32|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_127, ~y~0=v_~y~0_55, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_34|, P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_34|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_32|, ~#x~0.offset=|v_~#x~0.offset_260|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_32, ~x$w_buff1~0=v_~x$w_buff1~0_287, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_32|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_281, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_472, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_285, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_530, ~weak$$choice0~0=v_~weak$$choice0~0_118, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_32, #memory_int=|v_#memory_int_504|, ~#x~0.base=|v_~#x~0.base_260|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_32|, ~weak$$choice2~0=v_~weak$$choice2~0_87, P1Thread1of1ForFork1_#t~mem19=|v_P1Thread1of1ForFork1_#t~mem19_34|} AuxVars[|v_P1_#t~mem11_93|, |v_P1_#t~mem10_71|, |v_P1_#t~ite21_66|, |v_P1_#t~ite23_62|, |v_P1_#t~ite24_56|, |v_P1_#t~mem13_101|, |v_P1_#t~mem22_67|, |v_P1_#t~mem20_73|, |v_P1_#t~ite16_88|, |v_P1_#t~ite14_98|, |v_P1_#t~ite15_92|, |v_P1_#t~ite12_92|, |v_P1_#t~ite17_76|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_#t~mem20, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, P1Thread1of1ForFork1_#t~mem22, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite21, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, ~y~0, P1Thread1of1ForFork1_#t~mem8, P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~mem10, P1Thread1of1ForFork1_#t~mem13, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, ~x$w_buff1~0, P0Thread1of1ForFork0_~arg#1.base, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, P1Thread1of1ForFork1_#t~nondet9, P1Thread1of1ForFork1_#t~ite12, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#t~ite17, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite16, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0, P1Thread1of1ForFork1_#t~mem19] and [576] L754-->L765: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_3| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3|) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_3| 0)) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_19) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_15)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_15} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_3|, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$w_buff1~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0] [2022-12-05 23:12:50,690 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:12:50,691 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3005 [2022-12-05 23:12:50,691 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 98 flow [2022-12-05 23:12:50,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:50,692 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:50,692 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:50,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:12:50,692 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:12:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1387215876, now seen corresponding path program 1 times [2022-12-05 23:12:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:50,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067677928] [2022-12-05 23:12:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:12:51,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:51,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067677928] [2022-12-05 23:12:51,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067677928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:51,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:51,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:12:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057976352] [2022-12-05 23:12:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:51,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:12:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:51,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:12:51,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:12:51,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 23:12:51,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 98 flow. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:51,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:51,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 23:12:51,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:51,714 INFO L130 PetriNetUnfolder]: 45/92 cut-off events. [2022-12-05 23:12:51,714 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-05 23:12:51,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 92 events. 45/92 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 254 event pairs, 24 based on Foata normal form. 2/94 useless extension candidates. Maximal degree in co-relation 310. Up to 81 conditions per place. [2022-12-05 23:12:51,716 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 17 selfloop transitions, 7 changer transitions 0/24 dead transitions. [2022-12-05 23:12:51,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 24 transitions, 170 flow [2022-12-05 23:12:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:12:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:12:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-12-05 23:12:51,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.328125 [2022-12-05 23:12:51,717 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 98 flow. Second operand 4 states and 21 transitions. [2022-12-05 23:12:51,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 24 transitions, 170 flow [2022-12-05 23:12:51,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 157 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 23:12:51,720 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 120 flow [2022-12-05 23:12:51,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2022-12-05 23:12:51,722 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-05 23:12:51,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:51,722 INFO L89 Accepts]: Start accepts. Operand has 28 places, 21 transitions, 120 flow [2022-12-05 23:12:51,723 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:51,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:51,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 21 transitions, 120 flow [2022-12-05 23:12:51,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 21 transitions, 120 flow [2022-12-05 23:12:51,735 INFO L130 PetriNetUnfolder]: 10/42 cut-off events. [2022-12-05 23:12:51,735 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-05 23:12:51,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 42 events. 10/42 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 111 event pairs, 2 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 115. Up to 18 conditions per place. [2022-12-05 23:12:51,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 21 transitions, 120 flow [2022-12-05 23:12:51,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-05 23:12:51,738 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [691] $Ultimate##0-->L808: Formula: (let ((.cse28 (mod v_~x$w_buff0_used~0_544 256))) (let ((.cse29 (mod v_~weak$$choice0~0_122 256)) (.cse23 (= (mod v_~x$w_buff1_used~0_486 256) 0)) (.cse17 (= 0 .cse28)) (.cse24 (= (mod v_~x$r_buff0_thd2~0_297 256) 0)) (.cse8 (= (mod v_~weak$$choice2~0_91 256) 0))) (let ((.cse9 (not .cse8)) (.cse18 (not .cse24)) (.cse25 (not .cse17)) (.cse19 (not .cse23)) (.cse20 (= (mod v_~x$r_buff1_thd2~0_295 256) 0)) (.cse22 (not (= .cse29 0))) (.cse21 (= (mod v_~weak$$choice1~0_163 256) 0))) (let ((.cse7 (ite (= (ite .cse9 .cse28 (ite .cse17 .cse28 (ite (and .cse25 .cse18) 0 (ite (and .cse25 .cse24 .cse19 .cse20) (ite (or .cse22 .cse21) 1 0) .cse29)))) 0) 0 1))) (let ((.cse4 (= (mod .cse7 256) 0))) (let ((.cse6 (not .cse4))) (let ((.cse2 (ite .cse9 v_~x$r_buff0_thd2~0_297 (ite .cse4 v_~x$r_buff0_thd2~0_297 (let ((.cse27 (and .cse6 .cse18))) (ite .cse27 0 (ite (and .cse6 .cse24 (not (= (mod (ite .cse9 v_~x$w_buff1_used~0_486 (ite .cse4 v_~x$w_buff1_used~0_486 (ite .cse27 0 (ite (and .cse6 .cse24 .cse19 .cse20) v_~weak$$choice0~0_122 0)))) 256) 0)) .cse20) v_~x$r_buff0_thd2~0_297 0))))))) (let ((.cse3 (= (mod .cse2 256) 0))) (let ((.cse1 (not .cse3)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_542 256) 0))) (.cse26 (select |v_#memory_int_516| |v_~#x~0.base_264|))) (let ((.cse16 (select .cse26 |v_~#x~0.offset_264|)) (.cse5 (and .cse1 .cse0))) (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_36| v_P1Thread1of1ForFork1_~arg.offset_36) (= v_~weak$$choice1~0_163 |v_P1Thread1of1ForFork1_#t~nondet9_72|) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_295 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_484 256) 0)))) 0 .cse2) v_~x$r_buff1_thd2~0_293) (= v_~weak$$choice0~0_122 |v_P1Thread1of1ForFork1_#t~nondet6_72|) (= v_~__unbuffered_p1_EAX$read_delayed~0_128 1) (= v_~x$w_buff0~0_340 1) (= v_~x$r_buff0_thd1~0_228 v_~x$r_buff1_thd1~0_166) (= v_~x$r_buff0_thd0~0_169 v_~x$r_buff1_thd0~0_172) (= v_~x$flush_delayed~0_101 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_131 |v_~#x~0.base_264|) (= v_~weak$$choice2~0_91 |v_P1Thread1of1ForFork1_#t~nondet7_72|) (or (and .cse3 (= |v_P1_#t~ite23_64| |v_P1_#t~mem22_69|) (= |v_P1_#t~ite21_70| |v_P1_#t~mem22_69|) (= |v_P1_#t~ite23_64| |v_P1_#t~ite24_58|)) (and (= |v_P1_#t~ite23_64| |v_P1Thread1of1ForFork1_#t~ite23_70|) .cse1 (= |v_P1Thread1of1ForFork1_#t~mem22_70| |v_P1_#t~mem22_69|) (= |v_P1_#t~ite24_58| v_~x$w_buff0~0_340))) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_53| (ite .cse4 1 0)) (= v_~x$w_buff1_used~0_484 (ite (or .cse5 (and .cse6 .cse1)) 0 .cse7)) (or (and .cse8 (= |v_P1_#t~ite21_70| |v_P1_#t~mem20_77|) (= v_~__unbuffered_p1_EAX~0_176 |v_P1_#t~mem20_77|)) (and (= |v_P1_#t~ite21_70| v_~x$mem_tmp~0_79) (= |v_P1Thread1of1ForFork1_#t~mem20_72| |v_P1_#t~mem20_77|) .cse9)) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_53| 0)) (= v_~x$w_buff0~0_341 v_~x$w_buff1~0_297) (let ((.cse11 (= |v_P1_#t~ite16_92| |v_P1Thread1of1ForFork1_#t~ite16_72|)) (.cse14 (= |v_P1_#t~ite15_96| |v_P1Thread1of1ForFork1_#t~ite15_72|)) (.cse10 (= |v_P1_#t~ite12_96| |v_P1Thread1of1ForFork1_#t~ite12_72|)) (.cse12 (= |v_P1Thread1of1ForFork1_#t~mem13_72| |v_P1_#t~mem13_105|)) (.cse13 (= |v_P1_#t~ite14_102| |v_P1Thread1of1ForFork1_#t~ite14_72|)) (.cse15 (= |v_P1Thread1of1ForFork1_#t~mem11_72| |v_P1_#t~mem11_97|))) (or (and .cse10 .cse11 (= |v_P1_#t~ite17_80| |v_P1Thread1of1ForFork1_#t~ite17_71|) .cse12 .cse13 .cse14 .cse15 (= .cse16 |v_P1_#t~mem10_75|) .cse17 (= v_~__unbuffered_p1_EAX~0_176 |v_P1_#t~mem10_75|)) (and (or (and .cse10 (= |v_P1_#t~ite17_80| v_~x$w_buff0~0_341) .cse11 .cse12 .cse13 .cse14 .cse15 .cse18) (and (= |v_P1_#t~ite17_80| |v_P1_#t~ite16_92|) (or (and .cse12 .cse19 .cse13 .cse14 .cse15 (= |v_P1_#t~ite12_96| |v_P1_#t~ite16_92|) .cse20 (= |v_P1_#t~ite12_96| (ite (not .cse21) v_~x$w_buff0~0_341 v_~x$w_buff1~0_298))) (and .cse10 (or (and (= |v_P1_#t~ite15_96| (ite .cse22 v_~x$w_buff1~0_298 v_~x$w_buff0~0_341)) .cse12 .cse19 .cse13) (and (= |v_P1_#t~ite14_102| |v_P1_#t~ite15_96|) .cse23 (= .cse16 |v_P1_#t~mem13_105|) (= |v_P1_#t~ite14_102| |v_P1_#t~mem13_105|))) (= |v_P1_#t~ite15_96| |v_P1_#t~ite16_92|) .cse15 (or .cse23 (not .cse20)))) .cse24)) .cse25 (= |v_P1Thread1of1ForFork1_#t~mem10_72| |v_P1_#t~mem10_75|) (= |v_P1_#t~ite17_80| v_~__unbuffered_p1_EAX~0_176)))) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_131 |v_~#x~0.offset_264|) (= (store |v_#memory_int_516| |v_~#x~0.base_264| (store .cse26 |v_~#x~0.offset_264| |v_P1_#t~ite24_58|)) |v_#memory_int_514|) (= v_~y~0_59 v_~__unbuffered_p0_EAX~0_98) (= v_~x$mem_tmp~0_79 .cse16) (= v_~x$w_buff0_used~0_542 (ite .cse1 0 1)) (= v_~x$r_buff0_thd1~0_227 1) (= v_~y~0_59 1) (= v_P1Thread1of1ForFork1_~arg.base_36 |v_P1Thread1of1ForFork1_#in~arg.base_36|) (= |v_P0Thread1of1ForFork0_~arg#1.base_36| |v_P0Thread1of1ForFork0_#in~arg#1.base_36|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_53| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_53|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_36| |v_P0Thread1of1ForFork0_~arg#1.offset_36|) (= (ite .cse5 0 .cse2) v_~x$r_buff0_thd2~0_295)))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_341, P1Thread1of1ForFork1_#t~mem20=|v_P1Thread1of1ForFork1_#t~mem20_72|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_228, P1Thread1of1ForFork1_#t~mem22=|v_P1Thread1of1ForFork1_#t~mem22_70|, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_70|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_36|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_36|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_169, P1Thread1of1ForFork1_#t~mem10=|v_P1Thread1of1ForFork1_#t~mem10_72|, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_36|, P1Thread1of1ForFork1_#t~mem13=|v_P1Thread1of1ForFork1_#t~mem13_72|, P1Thread1of1ForFork1_#t~nondet6=|v_P1Thread1of1ForFork1_#t~nondet6_72|, ~#x~0.offset=|v_~#x~0.offset_264|, P1Thread1of1ForFork1_#t~mem11=|v_P1Thread1of1ForFork1_#t~mem11_72|, ~x$w_buff1~0=v_~x$w_buff1~0_298, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_295, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_486, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_72|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_72|, P1Thread1of1ForFork1_#t~nondet7=|v_P1Thread1of1ForFork1_#t~nondet7_72|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_297, P1Thread1of1ForFork1_#t~ite15=|v_P1Thread1of1ForFork1_#t~ite15_72|, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_72|, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_71|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_544, P1Thread1of1ForFork1_#t~ite16=|v_P1Thread1of1ForFork1_#t~ite16_72|, #memory_int=|v_#memory_int_516|, ~#x~0.base=|v_~#x~0.base_264|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_36|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_340, ~x$flush_delayed~0=v_~x$flush_delayed~0_101, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_37|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_36|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_166, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_98, ~weak$$choice1~0=v_~weak$$choice1~0_163, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_176, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_53|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_131, P1Thread1of1ForFork1_#t~mem8=|v_P1Thread1of1ForFork1_#t~mem8_38|, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_53|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_169, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_36|, ~#x~0.offset=|v_~#x~0.offset_264|, ~x$w_buff1~0=v_~x$w_buff1~0_297, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_293, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_484, ~weak$$choice0~0=v_~weak$$choice0~0_122, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_36|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_128, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_79, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_36|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_36|, ~y~0=v_~y~0_59, P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_38|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_36, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_36|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_295, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_172, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_542, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_36, #memory_int=|v_#memory_int_514|, ~#x~0.base=|v_~#x~0.base_264|, ~weak$$choice2~0=v_~weak$$choice2~0_91, P1Thread1of1ForFork1_#t~mem19=|v_P1Thread1of1ForFork1_#t~mem19_38|} AuxVars[|v_P1_#t~ite14_102|, |v_P1_#t~mem13_105|, |v_P1_#t~ite24_58|, |v_P1_#t~ite17_80|, |v_P1_#t~ite23_64|, |v_P1_#t~mem22_69|, |v_P1_#t~mem20_77|, |v_P1_#t~ite21_70|, |v_P1_#t~ite12_96|, |v_P1_#t~ite16_92|, |v_P1_#t~mem11_97|, |v_P1_#t~mem10_75|, |v_P1_#t~ite15_96|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_#t~mem20, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, P1Thread1of1ForFork1_#t~mem22, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, ~x$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~ite21, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork1_#t~mem8, ~y~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~mem10, P1Thread1of1ForFork1_#t~mem13, P1Thread1of1ForFork1_#t~nondet6, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~mem11, ~x$w_buff1~0, P0Thread1of1ForFork0_~arg#1.base, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, P1Thread1of1ForFork1_#t~nondet9, P1Thread1of1ForFork1_#t~ite12, P1Thread1of1ForFork1_#t~nondet7, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#t~ite17, ~x$w_buff0_used~0, P1Thread1of1ForFork1_#t~ite16, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, #memory_int, ~weak$$choice2~0, P1Thread1of1ForFork1_#t~mem19] and [577] L765-->L772: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_42 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_169 256) 0))) (.cse1 (not .cse8)) (.cse6 (= (mod v_~x$r_buff1_thd1~0_33 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_155 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_170 256) 0))) (let ((.cse0 (not .cse9)) (.cse3 (not .cse5)) (.cse4 (not .cse6)) (.cse7 (select |v_#memory_int_151| |v_~#x~0.base_104|)) (.cse10 (and .cse11 .cse1))) (and (= (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_170) v_~x$w_buff0_used~0_169) (let ((.cse2 (= |v_P0_#t~mem3#1_34| |v_P0Thread1of1ForFork0_#t~mem3#1_1|))) (or (and (or (and .cse2 (= |v_P0_#t~ite4#1_29| v_~x$w_buff1~0_72) .cse3 .cse4) (and (= |v_P0_#t~mem3#1_34| |v_P0_#t~ite4#1_29|) (or .cse5 .cse6) (= |v_P0_#t~mem3#1_34| (select .cse7 |v_~#x~0.offset_104|)))) (= |v_P0_#t~ite4#1_29| |v_P0_#t~ite5#1_33|) (or .cse8 .cse9)) (and (= |v_P0_#t~ite4#1_29| |v_P0Thread1of1ForFork0_#t~ite4#1_1|) .cse2 (= |v_P0_#t~ite5#1_33| v_~x$w_buff0~0_77) .cse0 .cse1))) (= v_~x$w_buff1_used~0_154 (ite (or (and .cse3 .cse4) .cse10) 0 v_~x$w_buff1_used~0_155)) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_41 256) 0)) .cse11) (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_33) v_~x$r_buff1_thd1~0_32) (= (store |v_#memory_int_151| |v_~#x~0.base_104| (store .cse7 |v_~#x~0.offset_104| |v_P0_#t~ite5#1_33|)) |v_#memory_int_150|) (= (ite .cse10 0 v_~x$r_buff0_thd1~0_42) v_~x$r_buff0_thd1~0_41))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_77, P0Thread1of1ForFork0_#t~ite4#1=|v_P0Thread1of1ForFork0_#t~ite4#1_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_42, ~#x~0.offset=|v_~#x~0.offset_104|, ~x$w_buff1~0=v_~x$w_buff1~0_72, #memory_int=|v_#memory_int_151|, ~#x~0.base=|v_~#x~0.base_104|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_33, P0Thread1of1ForFork0_#t~mem3#1=|v_P0Thread1of1ForFork0_#t~mem3#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_170} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_77, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~#x~0.offset=|v_~#x~0.offset_104|, ~x$w_buff1~0=v_~x$w_buff1~0_72, #memory_int=|v_#memory_int_150|, ~#x~0.base=|v_~#x~0.base_104|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork0_#t~ite5#1=|v_P0Thread1of1ForFork0_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_169} AuxVars[|v_P0_#t~mem3#1_34|, |v_P0_#t~ite5#1_33|, |v_P0_#t~ite4#1_29|] AssignedVars[P0Thread1of1ForFork0_#t~ite4#1, ~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~mem3#1, P0Thread1of1ForFork0_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-05 23:12:55,733 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:12:55,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4012 [2022-12-05 23:12:55,734 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 124 flow [2022-12-05 23:12:55,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:55,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:55,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:55,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:12:55,735 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:12:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1387454204, now seen corresponding path program 1 times [2022-12-05 23:12:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:55,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343640155] [2022-12-05 23:12:55,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:55,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:12:56,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-05 23:12:56,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:12:56,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343640155] [2022-12-05 23:12:56,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343640155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:12:56,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:12:56,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:12:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858173372] [2022-12-05 23:12:56,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:12:56,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:12:56,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:12:56,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:12:56,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:12:56,598 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:12:56,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 124 flow. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:56,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:12:56,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:12:56,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:12:56,748 INFO L130 PetriNetUnfolder]: 42/91 cut-off events. [2022-12-05 23:12:56,749 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-05 23:12:56,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 91 events. 42/91 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 273 event pairs, 20 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 316. Up to 72 conditions per place. [2022-12-05 23:12:56,749 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 19 selfloop transitions, 11 changer transitions 0/30 dead transitions. [2022-12-05 23:12:56,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 226 flow [2022-12-05 23:12:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:12:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:12:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-12-05 23:12:56,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27450980392156865 [2022-12-05 23:12:56,751 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 124 flow. Second operand 6 states and 28 transitions. [2022-12-05 23:12:56,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 226 flow [2022-12-05 23:12:56,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 208 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 23:12:56,752 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 158 flow [2022-12-05 23:12:56,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2022-12-05 23:12:56,753 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2022-12-05 23:12:56,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:12:56,753 INFO L89 Accepts]: Start accepts. Operand has 33 places, 24 transitions, 158 flow [2022-12-05 23:12:56,753 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:12:56,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:12:56,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 24 transitions, 158 flow [2022-12-05 23:12:56,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 158 flow [2022-12-05 23:12:56,767 INFO L130 PetriNetUnfolder]: 13/51 cut-off events. [2022-12-05 23:12:56,767 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-05 23:12:56,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 51 events. 13/51 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 154 event pairs, 4 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 159. Up to 24 conditions per place. [2022-12-05 23:12:56,768 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 158 flow [2022-12-05 23:12:56,768 INFO L188 LiptonReduction]: Number of co-enabled transitions 30 [2022-12-05 23:12:59,874 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:12:59,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3121 [2022-12-05 23:12:59,875 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 162 flow [2022-12-05 23:12:59,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:12:59,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:12:59,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:12:59,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:12:59,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:12:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:12:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1387483995, now seen corresponding path program 1 times [2022-12-05 23:12:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:12:59,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132760225] [2022-12-05 23:12:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:12:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:12:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:13:00,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:00,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132760225] [2022-12-05 23:13:00,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132760225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:00,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:00,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:13:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295259535] [2022-12-05 23:13:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:00,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:13:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:00,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:13:00,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:13:00,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:13:00,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:13:00,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:00,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:13:00,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:00,145 INFO L130 PetriNetUnfolder]: 21/60 cut-off events. [2022-12-05 23:13:00,145 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-05 23:13:00,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 60 events. 21/60 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 168 event pairs, 4 based on Foata normal form. 4/63 useless extension candidates. Maximal degree in co-relation 238. Up to 50 conditions per place. [2022-12-05 23:13:00,146 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 23 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2022-12-05 23:13:00,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 226 flow [2022-12-05 23:13:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:13:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:13:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-12-05 23:13:00,148 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2022-12-05 23:13:00,148 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 162 flow. Second operand 3 states and 22 transitions. [2022-12-05 23:13:00,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 226 flow [2022-12-05 23:13:00,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 197 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-05 23:13:00,150 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 157 flow [2022-12-05 23:13:00,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-05 23:13:00,152 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2022-12-05 23:13:00,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:00,152 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 157 flow [2022-12-05 23:13:00,152 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:00,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:00,153 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 157 flow [2022-12-05 23:13:00,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 157 flow [2022-12-05 23:13:00,169 INFO L130 PetriNetUnfolder]: 14/53 cut-off events. [2022-12-05 23:13:00,169 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-05 23:13:00,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 53 events. 14/53 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 161 event pairs, 2 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 174. Up to 23 conditions per place. [2022-12-05 23:13:00,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 157 flow [2022-12-05 23:13:00,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-05 23:13:00,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:13:00,520 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 9 out of bounds for length 9 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-05 23:13:00,546 INFO L158 Benchmark]: Toolchain (without parser) took 70729.04ms. Allocated memory was 181.4MB in the beginning and 1.0GB in the end (delta: 834.7MB). Free memory was 139.2MB in the beginning and 629.1MB in the end (delta: -490.0MB). Peak memory consumption was 345.2MB. Max. memory is 8.0GB. [2022-12-05 23:13:00,546 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 158.2MB in the beginning and 158.1MB in the end (delta: 82.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:13:00,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.11ms. Allocated memory is still 181.4MB. Free memory was 139.2MB in the beginning and 113.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 23:13:00,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.13ms. Allocated memory is still 181.4MB. Free memory was 113.5MB in the beginning and 110.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:13:00,547 INFO L158 Benchmark]: Boogie Preprocessor took 33.41ms. Allocated memory is still 181.4MB. Free memory was 110.8MB in the beginning and 108.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:13:00,547 INFO L158 Benchmark]: RCFGBuilder took 983.56ms. Allocated memory is still 181.4MB. Free memory was 108.7MB in the beginning and 136.4MB in the end (delta: -27.7MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. [2022-12-05 23:13:00,547 INFO L158 Benchmark]: TraceAbstraction took 69154.79ms. Allocated memory was 181.4MB in the beginning and 1.0GB in the end (delta: 834.7MB). Free memory was 135.9MB in the beginning and 629.1MB in the end (delta: -493.2MB). Peak memory consumption was 340.9MB. Max. memory is 8.0GB. [2022-12-05 23:13:00,549 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 158.2MB in the beginning and 158.1MB in the end (delta: 82.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 501.11ms. Allocated memory is still 181.4MB. Free memory was 139.2MB in the beginning and 113.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.13ms. Allocated memory is still 181.4MB. Free memory was 113.5MB in the beginning and 110.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.41ms. Allocated memory is still 181.4MB. Free memory was 110.8MB in the beginning and 108.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 983.56ms. Allocated memory is still 181.4MB. Free memory was 108.7MB in the beginning and 136.4MB in the end (delta: -27.7MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. * TraceAbstraction took 69154.79ms. Allocated memory was 181.4MB in the beginning and 1.0GB in the end (delta: 834.7MB). Free memory was 135.9MB in the beginning and 629.1MB in the end (delta: -493.2MB). Peak memory consumption was 340.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.5s, 108 PlacesBefore, 27 PlacesAfterwards, 103 TransitionsBefore, 21 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 52 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 773, independent: 722, independent conditional: 722, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 773, independent: 722, independent conditional: 0, independent unconditional: 722, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 773, independent: 722, independent conditional: 0, independent unconditional: 722, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 773, independent: 722, independent conditional: 0, independent unconditional: 722, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 663, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 663, independent: 621, independent conditional: 0, independent unconditional: 621, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 317, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 773, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 663, unknown conditional: 0, unknown unconditional: 663] , Statistics on independence cache: Total cache size (in pairs): 939, Positive cache size: 906, Positive conditional cache size: 0, Positive unconditional cache size: 906, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 22 PlacesBefore, 22 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 25, independent conditional: 8, independent unconditional: 17, dependent: 16, dependent conditional: 7, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 25, independent conditional: 8, independent unconditional: 17, dependent: 16, dependent conditional: 7, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 25, independent conditional: 8, independent unconditional: 17, dependent: 16, dependent conditional: 7, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 23, independent conditional: 7, independent unconditional: 16, dependent: 13, dependent conditional: 6, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 6, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 99, dependent conditional: 60, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 36, unknown conditional: 13, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 23, Positive conditional cache size: 7, Positive unconditional cache size: 16, Negative cache size: 13, Negative conditional cache size: 6, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 23 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 20, independent conditional: 7, independent unconditional: 13, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 30, Positive conditional cache size: 7, Positive unconditional cache size: 23, Negative cache size: 19, Negative conditional cache size: 6, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 26 PlacesBefore, 24 PlacesAfterwards, 15 TransitionsBefore, 13 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 25, independent conditional: 7, independent unconditional: 18, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 37, Positive conditional cache size: 7, Positive unconditional cache size: 30, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.6s, 25 PlacesBefore, 23 PlacesAfterwards, 18 TransitionsBefore, 16 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 3, independent unconditional: 3, 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: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 22, independent conditional: 21, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 11, independent conditional: 4, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 45, Positive conditional cache size: 10, Positive unconditional cache size: 35, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 17, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 20, independent conditional: 17, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 17, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 48, Positive conditional cache size: 12, Positive unconditional cache size: 36, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, 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: 17.8s, 28 PlacesBefore, 27 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 48, independent conditional: 48, 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: 78, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 48, independent conditional: 24, independent unconditional: 24, 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: 78, independent: 48, independent conditional: 24, independent unconditional: 24, 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: 7, independent: 6, independent conditional: 1, independent unconditional: 5, 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: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 42, independent conditional: 23, independent unconditional: 19, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 54, Positive conditional cache size: 13, Positive unconditional cache size: 41, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, 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: 3.0s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 55, Positive conditional cache size: 13, Positive unconditional cache size: 42, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, 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: 4.0s, 28 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 2, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 18, independent conditional: 2, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 2, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 17, independent conditional: 1, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 56, Positive conditional cache size: 14, Positive unconditional cache size: 42, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, 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: 3.1s, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 30 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 38, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 56, Positive conditional cache size: 14, Positive unconditional cache size: 42, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 9 out of bounds for length 9 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 9 out of bounds for length 9: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-05 23:13:00,583 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...