/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:57:35,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:57:35,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:57:35,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:57:35,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:57:35,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:57:35,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:57:35,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:57:35,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:57:35,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:57:35,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:57:35,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:57:35,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:57:35,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:57:35,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:57:35,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:57:35,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:57:35,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:57:35,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:57:35,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:57:35,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:57:35,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:57:35,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:57:35,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:57:35,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:57:35,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:57:35,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:57:35,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:57:35,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:57:35,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:57:35,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:57:35,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:57:35,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:57:35,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:57:35,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:57:35,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:57:35,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:57:35,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:57:35,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:57:35,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:57:35,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:57:35,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:57:35,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:57:35,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:57:35,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:57:35,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:57:35,893 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:57:35,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:57:35,894 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:57:35,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:57:35,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:57:35,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:57:35,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:57:35,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:57:35,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:57:35,896 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:57:35,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:57:35,896 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:57:35,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:57:35,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:57:35,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:57:35,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:57:35,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:57:35,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:57:35,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:57:35,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:57:35,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:57:35,897 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:57:35,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:57:35,898 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:57:35,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:57:36,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:57:36,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:57:36,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:57:36,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:57:36,230 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:57:36,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2022-12-13 11:57:37,385 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:57:37,601 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:57:37,602 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2022-12-13 11:57:37,631 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6cb906d4/bc2e56c44c114f16af693adec529015d/FLAG5addbe62e [2022-12-13 11:57:37,653 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6cb906d4/bc2e56c44c114f16af693adec529015d [2022-12-13 11:57:37,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:57:37,657 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:57:37,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:57:37,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:57:37,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:57:37,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:57:37" (1/1) ... [2022-12-13 11:57:37,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c21299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:37, skipping insertion in model container [2022-12-13 11:57:37,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:57:37" (1/1) ... [2022-12-13 11:57:37,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:57:37,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:57:37,894 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/rfi003_tso.i[944,957] [2022-12-13 11:57:38,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:57:38,160 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:57:38,169 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/rfi003_tso.i[944,957] [2022-12-13 11:57:38,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:38,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:38,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:57:38,243 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:57:38,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38 WrapperNode [2022-12-13 11:57:38,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:57:38,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:57:38,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:57:38,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:57:38,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (1/1) ... [2022-12-13 11:57:38,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (1/1) ... [2022-12-13 11:57:38,291 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-12-13 11:57:38,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:57:38,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:57:38,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:57:38,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:57:38,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (1/1) ... [2022-12-13 11:57:38,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (1/1) ... [2022-12-13 11:57:38,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (1/1) ... [2022-12-13 11:57:38,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (1/1) ... [2022-12-13 11:57:38,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (1/1) ... [2022-12-13 11:57:38,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (1/1) ... [2022-12-13 11:57:38,316 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (1/1) ... [2022-12-13 11:57:38,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (1/1) ... [2022-12-13 11:57:38,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:57:38,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:57:38,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:57:38,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:57:38,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (1/1) ... [2022-12-13 11:57:38,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:57:38,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:57:38,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:57:38,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:57:38,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:57:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:57:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:57:38,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:57:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:57:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:57:38,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:57:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:57:38,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:57:38,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:57:38,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:57:38,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:57:38,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:57:38,416 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:57:38,601 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:57:38,603 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:57:38,850 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:57:39,051 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:57:39,052 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:57:39,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:57:39 BoogieIcfgContainer [2022-12-13 11:57:39,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:57:39,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:57:39,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:57:39,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:57:39,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:57:37" (1/3) ... [2022-12-13 11:57:39,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b42719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:57:39, skipping insertion in model container [2022-12-13 11:57:39,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:38" (2/3) ... [2022-12-13 11:57:39,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b42719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:57:39, skipping insertion in model container [2022-12-13 11:57:39,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:57:39" (3/3) ... [2022-12-13 11:57:39,063 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_tso.i [2022-12-13 11:57:39,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:57:39,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:57:39,080 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:57:39,128 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:57:39,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-13 11:57:39,242 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-13 11:57:39,242 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:39,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 11:57:39,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-13 11:57:39,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-13 11:57:39,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:39,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-13 11:57:39,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2022-12-13 11:57:39,309 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-13 11:57:39,309 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:39,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 11:57:39,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-13 11:57:39,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 1244 [2022-12-13 11:57:46,474 INFO L241 LiptonReduction]: Total number of compositions: 72 [2022-12-13 11:57:46,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:57:46,500 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;@2718ef85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:57:46,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 11:57:46,505 INFO L130 PetriNetUnfolder]: 1/22 cut-off events. [2022-12-13 11:57:46,505 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:46,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:46,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 11:57:46,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:46,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1842977443, now seen corresponding path program 1 times [2022-12-13 11:57:46,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:46,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077663229] [2022-12-13 11:57:46,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:46,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:46,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:46,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077663229] [2022-12-13 11:57:46,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077663229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:46,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:46,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:57:46,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797309877] [2022-12-13 11:57:46,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:46,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:47,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:47,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:47,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 48 [2022-12-13 11:57:47,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:47,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:47,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 48 [2022-12-13 11:57:47,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:47,721 INFO L130 PetriNetUnfolder]: 1931/3253 cut-off events. [2022-12-13 11:57:47,721 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 11:57:47,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6367 conditions, 3253 events. 1931/3253 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 19567 event pairs, 383 based on Foata normal form. 0/1954 useless extension candidates. Maximal degree in co-relation 6357. Up to 2413 conditions per place. [2022-12-13 11:57:47,733 INFO L137 encePairwiseOnDemand]: 43/48 looper letters, 25 selfloop transitions, 2 changer transitions 40/73 dead transitions. [2022-12-13 11:57:47,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 286 flow [2022-12-13 11:57:47,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-12-13 11:57:47,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 11:57:47,745 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 102 flow. Second operand 3 states and 90 transitions. [2022-12-13 11:57:47,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 286 flow [2022-12-13 11:57:47,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:47,750 INFO L231 Difference]: Finished difference. Result has 52 places, 25 transitions, 58 flow [2022-12-13 11:57:47,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=52, PETRI_TRANSITIONS=25} [2022-12-13 11:57:47,754 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2022-12-13 11:57:47,754 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:47,755 INFO L89 Accepts]: Start accepts. Operand has 52 places, 25 transitions, 58 flow [2022-12-13 11:57:47,757 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:47,757 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:47,757 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 25 transitions, 58 flow [2022-12-13 11:57:47,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 58 flow [2022-12-13 11:57:47,762 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 11:57:47,762 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:47,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:57:47,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 58 flow [2022-12-13 11:57:47,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-13 11:57:47,961 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:47,963 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-13 11:57:47,963 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 58 flow [2022-12-13 11:57:47,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:47,964 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:47,964 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:47,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:57:47,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:47,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1297735710, now seen corresponding path program 1 times [2022-12-13 11:57:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:47,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538545237] [2022-12-13 11:57:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:47,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:48,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:48,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538545237] [2022-12-13 11:57:48,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538545237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:48,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:48,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:57:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638874842] [2022-12-13 11:57:48,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:48,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:48,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:48,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:48,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:48,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 11:57:48,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:48,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:48,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 11:57:48,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:48,730 INFO L130 PetriNetUnfolder]: 293/538 cut-off events. [2022-12-13 11:57:48,730 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-13 11:57:48,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 538 events. 293/538 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2137 event pairs, 141 based on Foata normal form. 28/508 useless extension candidates. Maximal degree in co-relation 1073. Up to 286 conditions per place. [2022-12-13 11:57:48,733 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 26 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-13 11:57:48,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 130 flow [2022-12-13 11:57:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 11:57:48,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-13 11:57:48,735 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 58 flow. Second operand 3 states and 44 transitions. [2022-12-13 11:57:48,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 130 flow [2022-12-13 11:57:48,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:48,737 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 62 flow [2022-12-13 11:57:48,737 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 11:57:48,738 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -21 predicate places. [2022-12-13 11:57:48,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:48,738 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 62 flow [2022-12-13 11:57:48,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:48,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:48,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 62 flow [2022-12-13 11:57:48,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 62 flow [2022-12-13 11:57:48,744 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 11:57:48,744 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:48,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:57:48,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 62 flow [2022-12-13 11:57:48,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-13 11:57:48,774 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:48,776 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 11:57:48,776 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 62 flow [2022-12-13 11:57:48,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:48,776 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:48,776 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:48,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:57:48,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:48,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1350564112, now seen corresponding path program 1 times [2022-12-13 11:57:48,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:48,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267435681] [2022-12-13 11:57:48,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:48,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:49,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:49,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267435681] [2022-12-13 11:57:49,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267435681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:49,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:49,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:57:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097013170] [2022-12-13 11:57:49,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:49,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:57:49,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:49,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:57:49,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:57:49,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 11:57:49,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:49,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:49,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 11:57:49,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:49,769 INFO L130 PetriNetUnfolder]: 250/471 cut-off events. [2022-12-13 11:57:49,769 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 11:57:49,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 471 events. 250/471 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1932 event pairs, 107 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 975. Up to 412 conditions per place. [2022-12-13 11:57:49,772 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 26 selfloop transitions, 12 changer transitions 0/44 dead transitions. [2022-12-13 11:57:49,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 181 flow [2022-12-13 11:57:49,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:57:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:57:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-13 11:57:49,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 11:57:49,774 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 62 flow. Second operand 6 states and 75 transitions. [2022-12-13 11:57:49,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 181 flow [2022-12-13 11:57:49,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 175 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:49,776 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 138 flow [2022-12-13 11:57:49,777 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2022-12-13 11:57:49,777 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2022-12-13 11:57:49,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:49,777 INFO L89 Accepts]: Start accepts. Operand has 40 places, 37 transitions, 138 flow [2022-12-13 11:57:49,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:49,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:49,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 37 transitions, 138 flow [2022-12-13 11:57:49,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 138 flow [2022-12-13 11:57:49,790 INFO L130 PetriNetUnfolder]: 16/87 cut-off events. [2022-12-13 11:57:49,790 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 11:57:49,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 87 events. 16/87 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 360 event pairs, 2 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 157. Up to 19 conditions per place. [2022-12-13 11:57:49,791 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 37 transitions, 138 flow [2022-12-13 11:57:49,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-13 11:57:49,828 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L768-->L779: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [415] L842-->L849: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_119 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_277 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_114 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_254 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_278 256) 0)) .cse5))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~y$w_buff1_used~0_253 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_254)) (= v_~y$r_buff0_thd0~0_113 (ite .cse0 0 v_~y$r_buff0_thd0~0_114)) (= v_~y$r_buff1_thd0~0_118 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_113 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_253 256) 0)))) 0 v_~y$r_buff1_thd0~0_119)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| 0)) (= v_~y~0_214 (ite .cse4 v_~y$w_buff0~0_137 (ite .cse1 v_~y$w_buff1~0_135 v_~y~0_215))) (= (ite .cse4 0 v_~y$w_buff0_used~0_278) v_~y$w_buff0_used~0_277)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_278, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_137, ~y~0=v_~y~0_215, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_119, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_254, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_113, ~y$w_buff0~0=v_~y$w_buff0~0_137, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ~y~0=v_~y~0_214, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_118, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_253, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 11:57:50,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L768-->L779: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [380] $Ultimate##0-->L741: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_181 2)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_181, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 11:57:50,733 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L768-->L795: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_248 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_712 256) 0))) (and (= v_~weak$$choice2~0_248 |v_P1Thread1of1ForFork1_#t~nondet4#1_50|) (= v_~y$w_buff1~0_441 v_~y$w_buff0~0_465) (= v_~y$r_buff0_thd2~0_334 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= v_~y$w_buff0~0_463 1) (= v_~y$r_buff1_thd2~0_274 (ite .cse0 v_~y$r_buff0_thd2~0_336 (ite (let ((.cse2 (= 0 (mod v_~y$r_buff0_thd2~0_334 256)))) (or (and .cse2 (= (mod v_~y$r_buff0_thd2~0_336 256) 0)) (and .cse2 (= (mod v_~y$w_buff1_used~0_670 256) 0)) .cse1)) v_~y$r_buff0_thd2~0_336 0))) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| 0)) (= (ite (= (mod v_~y$w_buff0_used~0_714 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= v_~y~0_631 v_~y$mem_tmp~0_200) (= v_~y$r_buff0_thd1~0_153 v_~y$r_buff1_thd1~0_143) (= v_~y$r_buff0_thd0~0_405 v_~y$r_buff1_thd0~0_416) (= v_~y$flush_delayed~0_219 0) (= v_~weak$$choice0~0_167 |v_P1Thread1of1ForFork1_#t~nondet3#1_50|) (= v_~y~0_630 (ite .cse0 v_~y$mem_tmp~0_200 v_~__unbuffered_p1_EAX~0_138)) (= v_~__unbuffered_p1_EAX~0_138 v_~y$w_buff0~0_463) (= (ite .cse0 1 0) v_~y$w_buff0_used~0_712) (= v_~y$w_buff1_used~0_670 (ite .cse0 v_~y$w_buff0_used~0_714 (ite .cse1 v_~y$w_buff0_used~0_714 0))))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_50|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_714, ~y$w_buff0~0=v_~y$w_buff0~0_465, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_50|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_405, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_153, ~y~0=v_~y~0_631} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_712, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_42|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_274, ~weak$$choice0~0=v_~weak$$choice0~0_167, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_143, ~y$mem_tmp~0=v_~y$mem_tmp~0_200, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_138, ~y$w_buff1~0=v_~y$w_buff1~0_441, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|, ~y$w_buff0~0=v_~y$w_buff0~0_463, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_405, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_334, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_219, ~y~0=v_~y~0_630, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_416, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_670} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [415] L842-->L849: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_119 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_277 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_114 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_254 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_278 256) 0)) .cse5))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~y$w_buff1_used~0_253 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_254)) (= v_~y$r_buff0_thd0~0_113 (ite .cse0 0 v_~y$r_buff0_thd0~0_114)) (= v_~y$r_buff1_thd0~0_118 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_113 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_253 256) 0)))) 0 v_~y$r_buff1_thd0~0_119)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| 0)) (= v_~y~0_214 (ite .cse4 v_~y$w_buff0~0_137 (ite .cse1 v_~y$w_buff1~0_135 v_~y~0_215))) (= (ite .cse4 0 v_~y$w_buff0_used~0_278) v_~y$w_buff0_used~0_277)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_278, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_137, ~y~0=v_~y~0_215, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_119, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_254, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_113, ~y$w_buff0~0=v_~y$w_buff0~0_137, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ~y~0=v_~y~0_214, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_118, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_253, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 11:57:51,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L768-->L795: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_248 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_712 256) 0))) (and (= v_~weak$$choice2~0_248 |v_P1Thread1of1ForFork1_#t~nondet4#1_50|) (= v_~y$w_buff1~0_441 v_~y$w_buff0~0_465) (= v_~y$r_buff0_thd2~0_334 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= v_~y$w_buff0~0_463 1) (= v_~y$r_buff1_thd2~0_274 (ite .cse0 v_~y$r_buff0_thd2~0_336 (ite (let ((.cse2 (= 0 (mod v_~y$r_buff0_thd2~0_334 256)))) (or (and .cse2 (= (mod v_~y$r_buff0_thd2~0_336 256) 0)) (and .cse2 (= (mod v_~y$w_buff1_used~0_670 256) 0)) .cse1)) v_~y$r_buff0_thd2~0_336 0))) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| 0)) (= (ite (= (mod v_~y$w_buff0_used~0_714 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= v_~y~0_631 v_~y$mem_tmp~0_200) (= v_~y$r_buff0_thd1~0_153 v_~y$r_buff1_thd1~0_143) (= v_~y$r_buff0_thd0~0_405 v_~y$r_buff1_thd0~0_416) (= v_~y$flush_delayed~0_219 0) (= v_~weak$$choice0~0_167 |v_P1Thread1of1ForFork1_#t~nondet3#1_50|) (= v_~y~0_630 (ite .cse0 v_~y$mem_tmp~0_200 v_~__unbuffered_p1_EAX~0_138)) (= v_~__unbuffered_p1_EAX~0_138 v_~y$w_buff0~0_463) (= (ite .cse0 1 0) v_~y$w_buff0_used~0_712) (= v_~y$w_buff1_used~0_670 (ite .cse0 v_~y$w_buff0_used~0_714 (ite .cse1 v_~y$w_buff0_used~0_714 0))))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_50|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_714, ~y$w_buff0~0=v_~y$w_buff0~0_465, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_50|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_405, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_153, ~y~0=v_~y~0_631} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_712, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_42|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_274, ~weak$$choice0~0=v_~weak$$choice0~0_167, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_143, ~y$mem_tmp~0=v_~y$mem_tmp~0_200, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_138, ~y$w_buff1~0=v_~y$w_buff1~0_441, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|, ~y$w_buff0~0=v_~y$w_buff0~0_463, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_405, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_334, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_219, ~y~0=v_~y~0_630, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_416, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_670} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [380] $Ultimate##0-->L741: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_181 2)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_181, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 11:57:51,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] L768-->L811: Formula: (let ((.cse13 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_62| 256) 0)))) (let ((.cse10 (ite .cse13 1 0))) (let ((.cse18 (= (mod .cse10 256) 0))) (let ((.cse17 (not .cse18))) (let ((.cse14 (ite .cse13 1 (ite .cse18 1 (ite .cse17 0 1))))) (let ((.cse6 (ite .cse13 v_~y$w_buff0_used~0_768 (ite .cse18 v_~y$w_buff0_used~0_768 0))) (.cse15 (= (mod .cse14 256) 0))) (let ((.cse7 (and (= (mod .cse6 256) 0) .cse15))) (let ((.cse1 (ite .cse13 v_~y$r_buff0_thd2~0_366 (ite (or .cse7 (and (= (mod v_~y$r_buff0_thd2~0_366 256) 0) .cse15) .cse18) v_~y$r_buff0_thd2~0_366 0)))) (let ((.cse4 (= (mod .cse1 256) 0))) (let ((.cse16 (not .cse15)) (.cse8 (and .cse4 .cse15))) (let ((.cse11 (or .cse7 .cse18 .cse8)) (.cse12 (and .cse16 .cse17))) (let ((.cse9 (ite .cse11 v_~y$mem_tmp~0_212 (ite .cse12 v_~y$w_buff0~0_497 v_~y$w_buff1~0_469))) (.cse0 (not (= (mod v_~weak$$choice2~0_260 256) 0))) (.cse3 (= (mod v_~y$w_buff1_used~0_718 256) 0)) (.cse5 (= (mod v_~y$w_buff0_used~0_766 256) 0))) (and (= v_~y$flush_delayed~0_231 0) (= (ite .cse0 .cse1 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_364 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) .cse1 0)) v_~y$r_buff1_thd2~0_298) (= v_~y$w_buff1_used~0_718 (ite .cse0 .cse6 (ite (or .cse7 .cse5 .cse8) .cse6 0))) (= v_~y$w_buff0~0_497 1) (= v_~weak$$choice0~0_179 |v_P1Thread1of1ForFork1_#t~nondet5#1_50|) (= v_~y$r_buff0_thd0~0_425 v_~y$r_buff1_thd0~0_436) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= v_~y~0_684 (ite .cse0 v_~y$mem_tmp~0_212 .cse9)) (= v_~weak$$choice2~0_260 |v_P1Thread1of1ForFork1_#t~nondet6#1_50|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48| (ite (= 0 (mod v_~y$w_buff0_used~0_768 256)) 1 0)) (= (ite .cse0 .cse10 (ite .cse11 .cse10 (ite .cse12 0 .cse10))) v_~y$w_buff0_used~0_766) (= v_~__unbuffered_p1_EBX~0_137 .cse9) (= (ite .cse13 v_~y~0_686 v_~__unbuffered_p1_EAX~0_150) v_~y$mem_tmp~0_212) (= v_~__unbuffered_p1_EAX~0_150 v_~y$w_buff0~0_497) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| 0)) (= v_~y$r_buff0_thd2~0_364 (ite .cse0 .cse14 (ite (or .cse5 (and .cse3 .cse15) .cse8) .cse14 (ite (and .cse16 (not .cse5)) 0 .cse14)))) (= v_~y$r_buff0_thd1~0_179 v_~y$r_buff1_thd1~0_169) (= v_~y$w_buff1~0_469 v_~y$w_buff0~0_499)))))))))))))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_62|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_768, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_50|, ~y$w_buff0~0=v_~y$w_buff0~0_499, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_425, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_366, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_179, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_50|, ~y~0=v_~y~0_686} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_137, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_766, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_61|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_48|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_298, ~weak$$choice0~0=v_~weak$$choice0~0_179, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_169, ~y$mem_tmp~0=v_~y$mem_tmp~0_212, ~y$w_buff1~0=v_~y$w_buff1~0_469, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_150, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|, ~y$w_buff0~0=v_~y$w_buff0~0_497, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_425, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_364, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_179, ~y$flush_delayed~0=v_~y$flush_delayed~0_231, ~y~0=v_~y~0_684, ~weak$$choice2~0=v_~weak$$choice2~0_260, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_436, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_718} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [415] L842-->L849: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_119 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_277 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_114 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_254 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_278 256) 0)) .cse5))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= v_~y$w_buff1_used~0_253 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_254)) (= v_~y$r_buff0_thd0~0_113 (ite .cse0 0 v_~y$r_buff0_thd0~0_114)) (= v_~y$r_buff1_thd0~0_118 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_113 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_253 256) 0)))) 0 v_~y$r_buff1_thd0~0_119)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| 0)) (= v_~y~0_214 (ite .cse4 v_~y$w_buff0~0_137 (ite .cse1 v_~y$w_buff1~0_135 v_~y~0_215))) (= (ite .cse4 0 v_~y$w_buff0_used~0_278) v_~y$w_buff0_used~0_277)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_278, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_137, ~y~0=v_~y~0_215, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_119, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_254, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_113, ~y$w_buff0~0=v_~y$w_buff0~0_137, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ~y~0=v_~y~0_214, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_118, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_253, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 11:57:52,187 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] L768-->L811: Formula: (let ((.cse13 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_62| 256) 0)))) (let ((.cse10 (ite .cse13 1 0))) (let ((.cse18 (= (mod .cse10 256) 0))) (let ((.cse17 (not .cse18))) (let ((.cse14 (ite .cse13 1 (ite .cse18 1 (ite .cse17 0 1))))) (let ((.cse6 (ite .cse13 v_~y$w_buff0_used~0_768 (ite .cse18 v_~y$w_buff0_used~0_768 0))) (.cse15 (= (mod .cse14 256) 0))) (let ((.cse7 (and (= (mod .cse6 256) 0) .cse15))) (let ((.cse1 (ite .cse13 v_~y$r_buff0_thd2~0_366 (ite (or .cse7 (and (= (mod v_~y$r_buff0_thd2~0_366 256) 0) .cse15) .cse18) v_~y$r_buff0_thd2~0_366 0)))) (let ((.cse4 (= (mod .cse1 256) 0))) (let ((.cse16 (not .cse15)) (.cse8 (and .cse4 .cse15))) (let ((.cse11 (or .cse7 .cse18 .cse8)) (.cse12 (and .cse16 .cse17))) (let ((.cse9 (ite .cse11 v_~y$mem_tmp~0_212 (ite .cse12 v_~y$w_buff0~0_497 v_~y$w_buff1~0_469))) (.cse0 (not (= (mod v_~weak$$choice2~0_260 256) 0))) (.cse3 (= (mod v_~y$w_buff1_used~0_718 256) 0)) (.cse5 (= (mod v_~y$w_buff0_used~0_766 256) 0))) (and (= v_~y$flush_delayed~0_231 0) (= (ite .cse0 .cse1 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_364 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) .cse1 0)) v_~y$r_buff1_thd2~0_298) (= v_~y$w_buff1_used~0_718 (ite .cse0 .cse6 (ite (or .cse7 .cse5 .cse8) .cse6 0))) (= v_~y$w_buff0~0_497 1) (= v_~weak$$choice0~0_179 |v_P1Thread1of1ForFork1_#t~nondet5#1_50|) (= v_~y$r_buff0_thd0~0_425 v_~y$r_buff1_thd0~0_436) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= v_~y~0_684 (ite .cse0 v_~y$mem_tmp~0_212 .cse9)) (= v_~weak$$choice2~0_260 |v_P1Thread1of1ForFork1_#t~nondet6#1_50|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48| (ite (= 0 (mod v_~y$w_buff0_used~0_768 256)) 1 0)) (= (ite .cse0 .cse10 (ite .cse11 .cse10 (ite .cse12 0 .cse10))) v_~y$w_buff0_used~0_766) (= v_~__unbuffered_p1_EBX~0_137 .cse9) (= (ite .cse13 v_~y~0_686 v_~__unbuffered_p1_EAX~0_150) v_~y$mem_tmp~0_212) (= v_~__unbuffered_p1_EAX~0_150 v_~y$w_buff0~0_497) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| 0)) (= v_~y$r_buff0_thd2~0_364 (ite .cse0 .cse14 (ite (or .cse5 (and .cse3 .cse15) .cse8) .cse14 (ite (and .cse16 (not .cse5)) 0 .cse14)))) (= v_~y$r_buff0_thd1~0_179 v_~y$r_buff1_thd1~0_169) (= v_~y$w_buff1~0_469 v_~y$w_buff0~0_499)))))))))))))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_62|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_768, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_50|, ~y$w_buff0~0=v_~y$w_buff0~0_499, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_425, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_366, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_179, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_50|, ~y~0=v_~y~0_686} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_137, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_766, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_61|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_48|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_298, ~weak$$choice0~0=v_~weak$$choice0~0_179, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_169, ~y$mem_tmp~0=v_~y$mem_tmp~0_212, ~y$w_buff1~0=v_~y$w_buff1~0_469, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_150, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|, ~y$w_buff0~0=v_~y$w_buff0~0_497, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_425, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_364, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_179, ~y$flush_delayed~0=v_~y$flush_delayed~0_231, ~y~0=v_~y~0_684, ~weak$$choice2~0=v_~weak$$choice2~0_260, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_436, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_718} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [380] $Ultimate##0-->L741: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_181 2)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_181, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 11:57:53,162 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:57:53,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3387 [2022-12-13 11:57:53,164 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 164 flow [2022-12-13 11:57:53,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:53,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:53,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:53,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:57:53,165 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:53,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1575104506, now seen corresponding path program 1 times [2022-12-13 11:57:53,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:53,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000228311] [2022-12-13 11:57:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:53,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:53,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:53,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000228311] [2022-12-13 11:57:53,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000228311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:53,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:53,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:57:53,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057988093] [2022-12-13 11:57:53,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:53,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:53,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:53,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:53,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:53,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 11:57:53,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:53,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:53,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 11:57:53,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:53,886 INFO L130 PetriNetUnfolder]: 250/474 cut-off events. [2022-12-13 11:57:53,886 INFO L131 PetriNetUnfolder]: For 258/258 co-relation queries the response was YES. [2022-12-13 11:57:53,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 474 events. 250/474 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2151 event pairs, 80 based on Foata normal form. 4/423 useless extension candidates. Maximal degree in co-relation 1208. Up to 403 conditions per place. [2022-12-13 11:57:53,890 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 33 selfloop transitions, 12 changer transitions 0/51 dead transitions. [2022-12-13 11:57:53,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 342 flow [2022-12-13 11:57:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:57:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-13 11:57:53,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2022-12-13 11:57:53,894 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 164 flow. Second operand 4 states and 69 transitions. [2022-12-13 11:57:53,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 342 flow [2022-12-13 11:57:53,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 286 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:53,898 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 226 flow [2022-12-13 11:57:53,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2022-12-13 11:57:53,899 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2022-12-13 11:57:53,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:53,899 INFO L89 Accepts]: Start accepts. Operand has 40 places, 41 transitions, 226 flow [2022-12-13 11:57:53,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:53,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:53,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 41 transitions, 226 flow [2022-12-13 11:57:53,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 41 transitions, 226 flow [2022-12-13 11:57:53,914 INFO L130 PetriNetUnfolder]: 23/108 cut-off events. [2022-12-13 11:57:53,915 INFO L131 PetriNetUnfolder]: For 30/32 co-relation queries the response was YES. [2022-12-13 11:57:53,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 108 events. 23/108 cut-off events. For 30/32 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 498 event pairs, 1 based on Foata normal form. 2/80 useless extension candidates. Maximal degree in co-relation 226. Up to 28 conditions per place. [2022-12-13 11:57:53,916 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 41 transitions, 226 flow [2022-12-13 11:57:53,916 INFO L226 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-13 11:57:53,970 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:53,972 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 11:57:53,973 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 226 flow [2022-12-13 11:57:53,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:53,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:53,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:53,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:57:53,973 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:53,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:53,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1583530546, now seen corresponding path program 1 times [2022-12-13 11:57:53,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:53,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309594703] [2022-12-13 11:57:53,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:53,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:54,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309594703] [2022-12-13 11:57:54,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309594703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:54,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:54,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:54,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776537338] [2022-12-13 11:57:54,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:54,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:54,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:54,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:54,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:54,194 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-13 11:57:54,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:54,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:54,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-13 11:57:54,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:54,413 INFO L130 PetriNetUnfolder]: 239/490 cut-off events. [2022-12-13 11:57:54,413 INFO L131 PetriNetUnfolder]: For 271/271 co-relation queries the response was YES. [2022-12-13 11:57:54,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 490 events. 239/490 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2398 event pairs, 38 based on Foata normal form. 61/442 useless extension candidates. Maximal degree in co-relation 1270. Up to 298 conditions per place. [2022-12-13 11:57:54,416 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 35 selfloop transitions, 7 changer transitions 35/80 dead transitions. [2022-12-13 11:57:54,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 80 transitions, 459 flow [2022-12-13 11:57:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:57:54,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-13 11:57:54,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61875 [2022-12-13 11:57:54,418 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 226 flow. Second operand 5 states and 99 transitions. [2022-12-13 11:57:54,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 80 transitions, 459 flow [2022-12-13 11:57:54,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 80 transitions, 416 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 11:57:54,421 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 171 flow [2022-12-13 11:57:54,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-12-13 11:57:54,422 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-12-13 11:57:54,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:54,422 INFO L89 Accepts]: Start accepts. Operand has 44 places, 35 transitions, 171 flow [2022-12-13 11:57:54,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:54,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:54,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 171 flow [2022-12-13 11:57:54,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 171 flow [2022-12-13 11:57:54,449 INFO L130 PetriNetUnfolder]: 64/188 cut-off events. [2022-12-13 11:57:54,449 INFO L131 PetriNetUnfolder]: For 158/158 co-relation queries the response was YES. [2022-12-13 11:57:54,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 188 events. 64/188 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1051 event pairs, 30 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 542. Up to 109 conditions per place. [2022-12-13 11:57:54,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 171 flow [2022-12-13 11:57:54,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 11:57:54,519 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:54,520 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 11:57:54,520 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 171 flow [2022-12-13 11:57:54,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:54,520 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:54,520 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:54,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:57:54,521 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:54,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:54,521 INFO L85 PathProgramCache]: Analyzing trace with hash 560805109, now seen corresponding path program 1 times [2022-12-13 11:57:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:54,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146243084] [2022-12-13 11:57:54,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:54,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:54,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146243084] [2022-12-13 11:57:54,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146243084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:54,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:54,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:57:54,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554213630] [2022-12-13 11:57:54,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:54,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:54,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:54,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:54,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:54,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-13 11:57:54,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:54,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:54,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-13 11:57:54,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:54,867 INFO L130 PetriNetUnfolder]: 93/247 cut-off events. [2022-12-13 11:57:54,868 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2022-12-13 11:57:54,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 247 events. 93/247 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1119 event pairs, 11 based on Foata normal form. 39/235 useless extension candidates. Maximal degree in co-relation 791. Up to 112 conditions per place. [2022-12-13 11:57:54,869 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 29 selfloop transitions, 13 changer transitions 15/60 dead transitions. [2022-12-13 11:57:54,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 381 flow [2022-12-13 11:57:54,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:57:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:57:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-13 11:57:54,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-13 11:57:54,872 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 171 flow. Second operand 6 states and 76 transitions. [2022-12-13 11:57:54,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 381 flow [2022-12-13 11:57:54,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 320 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-13 11:57:54,876 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 178 flow [2022-12-13 11:57:54,876 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-12-13 11:57:54,878 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-12-13 11:57:54,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:54,878 INFO L89 Accepts]: Start accepts. Operand has 44 places, 35 transitions, 178 flow [2022-12-13 11:57:54,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:54,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:54,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 178 flow [2022-12-13 11:57:54,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 178 flow [2022-12-13 11:57:54,892 INFO L130 PetriNetUnfolder]: 13/92 cut-off events. [2022-12-13 11:57:54,892 INFO L131 PetriNetUnfolder]: For 76/82 co-relation queries the response was YES. [2022-12-13 11:57:54,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 92 events. 13/92 cut-off events. For 76/82 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 399 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 251. Up to 46 conditions per place. [2022-12-13 11:57:54,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 178 flow [2022-12-13 11:57:54,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-13 11:57:57,399 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [490] L768-->L818: Formula: (let ((.cse10 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_74| 256) 0)))) (let ((.cse27 (ite .cse10 1 0))) (let ((.cse29 (= (mod .cse27 256) 0))) (let ((.cse28 (not .cse29))) (let ((.cse21 (ite .cse10 1 (ite .cse29 1 (ite .cse28 0 1))))) (let ((.cse25 (ite .cse10 v_~y$w_buff0_used~0_784 (ite .cse29 v_~y$w_buff0_used~0_784 0))) (.cse23 (= (mod .cse21 256) 0))) (let ((.cse26 (and (= (mod .cse25 256) 0) .cse23))) (let ((.cse18 (ite .cse10 v_~y$r_buff0_thd2~0_380 (ite (or .cse29 .cse26 (and (= (mod v_~y$r_buff0_thd2~0_380 256) 0) .cse23)) v_~y$r_buff0_thd2~0_380 0)))) (let ((.cse20 (= (mod .cse18 256) 0))) (let ((.cse24 (not .cse23)) (.cse22 (and .cse20 .cse23))) (let ((.cse5 (not (= (mod v_~weak$$choice2~0_268 256) 0))) (.cse14 (or .cse29 .cse22 .cse26)) (.cse15 (and .cse28 .cse24))) (let ((.cse3 (ite .cse5 .cse27 (ite .cse14 .cse27 (ite .cse15 0 .cse27))))) (let ((.cse19 (= (mod .cse3 256) 0))) (let ((.cse11 (ite .cse5 .cse25 (ite (or .cse22 .cse19 .cse26) .cse25 0)))) (let ((.cse13 (= (mod .cse11 256) 0)) (.cse16 (not .cse19))) (let ((.cse1 (ite .cse5 .cse21 (ite (or .cse22 (and .cse13 .cse23) .cse19) .cse21 (ite (and .cse16 .cse24) 0 .cse21))))) (let ((.cse17 (= (mod .cse1 256) 0))) (let ((.cse9 (ite .cse5 .cse18 (ite (or (and .cse13 .cse17) .cse19 (and .cse17 .cse20)) .cse18 0)))) (let ((.cse8 (not (= (mod v_~y$w_buff0_used~0_782 256) 0))) (.cse7 (not (= (mod .cse9 256) 0))) (.cse12 (not .cse17))) (let ((.cse2 (and .cse12 .cse16)) (.cse6 (ite .cse14 v_~y$mem_tmp~0_220 (ite .cse15 v_~y$w_buff0~0_511 v_~y$w_buff1~0_477))) (.cse4 (and (not .cse13) .cse7)) (.cse0 (and .cse12 .cse8))) (and (= v_~y$r_buff0_thd0~0_433 v_~y$r_buff1_thd0~0_444) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= v_~y$flush_delayed~0_239 0) (= v_~y$r_buff0_thd2~0_378 (ite .cse0 0 .cse1)) (= v_~__unbuffered_p1_EAX~0_156 v_~y$w_buff0~0_511) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| 0)) (= v_~weak$$choice0~0_187 |v_P1Thread1of1ForFork1_#t~nondet5#1_62|) (= v_~y$w_buff0_used~0_782 (ite .cse2 0 .cse3)) (= v_~weak$$choice2~0_268 |v_P1Thread1of1ForFork1_#t~nondet6#1_62|) (= v_~y~0_702 (ite .cse2 v_~y$w_buff0~0_511 (ite .cse4 v_~y$w_buff1~0_477 (ite .cse5 v_~y$mem_tmp~0_220 .cse6)))) (= v_~y$w_buff1~0_477 v_~y$w_buff0~0_512) (= v_~y$r_buff1_thd2~0_306 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_728 256) 0)) .cse7) (and (not (= (mod v_~y$r_buff0_thd2~0_378 256) 0)) .cse8)) 0 .cse9)) (= .cse6 v_~__unbuffered_p1_EBX~0_143) (= (ite .cse10 v_~y~0_704 v_~__unbuffered_p1_EAX~0_156) v_~y$mem_tmp~0_220) (= (ite (= (mod v_~y$w_buff0_used~0_784 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= v_~y$w_buff0~0_511 1) (= v_~y$r_buff0_thd1~0_185 v_~y$r_buff1_thd1~0_175) (= v_~y$w_buff1_used~0_728 (ite (or .cse4 .cse0) 0 .cse11))))))))))))))))))))))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_74|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_784, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_62|, ~y$w_buff0~0=v_~y$w_buff0~0_512, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_433, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_380, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_185, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_62|, ~y~0=v_~y~0_704} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_143, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_782, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_69|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_54|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_187, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_175, ~y$mem_tmp~0=v_~y$mem_tmp~0_220, ~y$w_buff1~0=v_~y$w_buff1~0_477, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_156, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|, ~y$w_buff0~0=v_~y$w_buff0~0_511, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_433, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_378, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_185, ~y$flush_delayed~0=v_~y$flush_delayed~0_239, ~y~0=v_~y~0_702, ~weak$$choice2~0=v_~weak$$choice2~0_268, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_444, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_728} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [380] $Ultimate##0-->L741: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~y~0_181 2)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_181, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 11:57:57,848 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:57:57,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2971 [2022-12-13 11:57:57,849 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 172 flow [2022-12-13 11:57:57,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:57,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:57,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:57,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:57:57,850 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:57,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:57,851 INFO L85 PathProgramCache]: Analyzing trace with hash -407087846, now seen corresponding path program 1 times [2022-12-13 11:57:57,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:57,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130697923] [2022-12-13 11:57:57,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:57,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:58,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:58,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130697923] [2022-12-13 11:57:58,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130697923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:58,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:58,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:58,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396721716] [2022-12-13 11:57:58,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:58,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:58,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:58,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:58,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:58,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-13 11:57:58,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:58,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:58,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-13 11:57:58,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:58,216 INFO L130 PetriNetUnfolder]: 79/208 cut-off events. [2022-12-13 11:57:58,216 INFO L131 PetriNetUnfolder]: For 404/416 co-relation queries the response was YES. [2022-12-13 11:57:58,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 208 events. 79/208 cut-off events. For 404/416 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 840 event pairs, 14 based on Foata normal form. 21/195 useless extension candidates. Maximal degree in co-relation 687. Up to 95 conditions per place. [2022-12-13 11:57:58,218 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 24 selfloop transitions, 1 changer transitions 20/51 dead transitions. [2022-12-13 11:57:58,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 355 flow [2022-12-13 11:57:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:57:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-13 11:57:58,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-13 11:57:58,220 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 172 flow. Second operand 4 states and 54 transitions. [2022-12-13 11:57:58,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 355 flow [2022-12-13 11:57:58,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 51 transitions, 289 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-13 11:57:58,222 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 113 flow [2022-12-13 11:57:58,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-13 11:57:58,223 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2022-12-13 11:57:58,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:58,223 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 113 flow [2022-12-13 11:57:58,224 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:58,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:58,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 113 flow [2022-12-13 11:57:58,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 113 flow [2022-12-13 11:57:58,236 INFO L130 PetriNetUnfolder]: 9/56 cut-off events. [2022-12-13 11:57:58,237 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 11:57:58,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 56 events. 9/56 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 161 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 125. Up to 28 conditions per place. [2022-12-13 11:57:58,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 113 flow [2022-12-13 11:57:58,240 INFO L226 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-13 11:57:58,352 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:57:58,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 11:57:58,352 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 111 flow [2022-12-13 11:57:58,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:58,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:58,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:58,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:57:58,353 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:58,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1138674181, now seen corresponding path program 1 times [2022-12-13 11:57:58,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:58,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176530004] [2022-12-13 11:57:58,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:58,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:59,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:59,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176530004] [2022-12-13 11:57:59,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176530004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:59,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:59,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:57:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781883270] [2022-12-13 11:57:59,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:59,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:57:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:59,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:57:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:57:59,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2022-12-13 11:57:59,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:59,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:59,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2022-12-13 11:57:59,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:59,444 INFO L130 PetriNetUnfolder]: 52/171 cut-off events. [2022-12-13 11:57:59,444 INFO L131 PetriNetUnfolder]: For 142/153 co-relation queries the response was YES. [2022-12-13 11:57:59,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 171 events. 52/171 cut-off events. For 142/153 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 750 event pairs, 12 based on Foata normal form. 19/160 useless extension candidates. Maximal degree in co-relation 487. Up to 55 conditions per place. [2022-12-13 11:57:59,445 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 17 selfloop transitions, 7 changer transitions 23/54 dead transitions. [2022-12-13 11:57:59,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 315 flow [2022-12-13 11:57:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:57:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:57:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-13 11:57:59,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2022-12-13 11:57:59,447 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 111 flow. Second operand 7 states and 75 transitions. [2022-12-13 11:57:59,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 315 flow [2022-12-13 11:57:59,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 312 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:59,449 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 152 flow [2022-12-13 11:57:59,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-12-13 11:57:59,451 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2022-12-13 11:57:59,451 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:59,451 INFO L89 Accepts]: Start accepts. Operand has 43 places, 31 transitions, 152 flow [2022-12-13 11:57:59,451 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:59,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:59,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 152 flow [2022-12-13 11:57:59,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 152 flow [2022-12-13 11:57:59,461 INFO L130 PetriNetUnfolder]: 11/57 cut-off events. [2022-12-13 11:57:59,461 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-13 11:57:59,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 57 events. 11/57 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 163 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 149. Up to 28 conditions per place. [2022-12-13 11:57:59,462 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 152 flow [2022-12-13 11:57:59,463 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 11:58:00,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] $Ultimate##0-->L795: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_309 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_926 256) 0))) (and (= v_~y$r_buff0_thd2~0_464 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= v_~y$r_buff0_thd0~0_487 v_~y$r_buff1_thd0~0_499) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_19| |v_P1Thread1of1ForFork1_~arg#1.base_19|) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_19| |v_P1Thread1of1ForFork1_~arg#1.offset_19|) (= v_~y$flush_delayed~0_280 0) (= |v_P1Thread1of1ForFork1_#t~nondet3#1_104| v_~weak$$choice0~0_228) (= v_~y$r_buff0_thd1~0_241 v_~y$r_buff1_thd1~0_232) (= (ite .cse0 1 0) v_~y$w_buff0_used~0_926) (= v_~__unbuffered_p1_EAX~0_185 v_~y$w_buff0~0_612) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_64| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_64|) (= v_~y~0_844 (ite .cse0 v_~y$mem_tmp~0_261 v_~__unbuffered_p1_EAX~0_185)) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_64| 0)) (= v_~y$w_buff0~0_612 1) (= (ite .cse0 v_~y$r_buff0_thd2~0_466 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_464 256) 0))) (or .cse1 (and (= (mod v_~y$w_buff1_used~0_864 256) 0) .cse2) (and (= (mod v_~y$r_buff0_thd2~0_466 256) 0) .cse2))) v_~y$r_buff0_thd2~0_466 0)) v_~y$r_buff1_thd2~0_382) (= v_~y$w_buff1~0_570 v_~y$w_buff0~0_614) (= (ite .cse0 v_~y$w_buff0_used~0_928 (ite .cse1 v_~y$w_buff0_used~0_928 0)) v_~y$w_buff1_used~0_864) (= v_~y~0_845 v_~y$mem_tmp~0_261) (= v_~x~0_40 1) (= (ite (= (mod v_~y$w_buff0_used~0_928 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_64|) (= v_~weak$$choice2~0_309 |v_P1Thread1of1ForFork1_#t~nondet4#1_112|))) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_19|, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_928, ~y$w_buff0~0=v_~y$w_buff0~0_614, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_104|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_487, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_466, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_241, ~y~0=v_~y~0_845, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_19|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_19|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_926, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_19|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_19|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~y$mem_tmp~0=v_~y$mem_tmp~0_261, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_185, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_64|, ~y$w_buff0~0=v_~y$w_buff0~0_612, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_241, ~y$flush_delayed~0=v_~y$flush_delayed~0_280, ~y~0=v_~y~0_844, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_19|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_64|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_382, ~weak$$choice0~0=v_~weak$$choice0~0_228, ~y$w_buff1~0=v_~y$w_buff1~0_570, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_487, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_464, ~weak$$choice2~0=v_~weak$$choice2~0_309, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_499, ~x~0=v_~x~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_864} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] and [355] L751-->L758: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_187 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_40 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd1~0_36 256) 0)))) (let ((.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_173 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_188 256) 0))))) (and (= v_~y$r_buff0_thd1~0_39 (ite .cse0 0 v_~y$r_buff0_thd1~0_40)) (= v_~y~0_129 (ite .cse1 v_~y$w_buff0~0_75 (ite .cse2 v_~y$w_buff1~0_80 v_~y~0_130))) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_172 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_39 256) 0)))) 0 v_~y$r_buff1_thd1~0_36) v_~y$r_buff1_thd1~0_35) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_173) v_~y$w_buff1_used~0_172) (= (ite .cse1 0 v_~y$w_buff0_used~0_188) v_~y$w_buff0_used~0_187)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_36, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_188, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_75, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y~0=v_~y~0_130, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_187, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_75, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y~0=v_~y~0_129, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 11:58:01,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] $Ultimate##0-->L758: Formula: (let ((.cse4 (not (= (mod v_~weak$$choice2~0_315 256) 0)))) (let ((.cse1 (ite .cse4 1 0))) (let ((.cse9 (= (mod .cse1 256) 0))) (let ((.cse5 (ite .cse4 v_~y$w_buff0_used~0_944 (ite .cse9 v_~y$w_buff0_used~0_944 0)))) (let ((.cse6 (not (= (mod v_~y$w_buff0_used~0_942 256) 0))) (.cse10 (= (mod .cse5 256) 0)) (.cse7 (not (= (mod v_~y$r_buff0_thd1~0_250 256) 0))) (.cse11 (not .cse9))) (let ((.cse0 (and .cse7 .cse11)) (.cse3 (and .cse7 (not .cse10))) (.cse2 (and .cse7 .cse6))) (and (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_68| 0)) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_23| |v_P1Thread1of1ForFork1_~arg#1.offset_23|) (= v_~y$flush_delayed~0_286 0) (= (ite .cse0 0 .cse1) v_~y$w_buff0_used~0_942) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_68| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_68|) (= v_~y$r_buff0_thd1~0_249 (ite .cse2 0 v_~y$r_buff0_thd1~0_250)) (= v_~y~0_860 v_~y$mem_tmp~0_267) (= v_~y$w_buff1~0_580 v_~y$w_buff0~0_627) (= v_~y~0_858 (ite .cse0 v_~y$w_buff0~0_626 (ite .cse3 v_~y$w_buff1~0_580 (ite .cse4 v_~y$mem_tmp~0_267 v_~__unbuffered_p1_EAX~0_189)))) (= |v_P1Thread1of1ForFork1_#t~nondet3#1_112| v_~weak$$choice0~0_234) (= (ite (= (mod v_~y$w_buff0_used~0_944 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_68|) (= v_~y$w_buff1_used~0_876 (ite (or .cse3 .cse2) 0 .cse5)) (= v_~x~0_46 1) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_249 256) 0)) .cse6) (and .cse7 (not (= (mod v_~y$w_buff1_used~0_876 256) 0)))) 0 v_~y$r_buff0_thd1~0_250) v_~y$r_buff1_thd1~0_240) (= v_~y$r_buff1_thd2~0_390 (ite .cse4 v_~y$r_buff0_thd2~0_477 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd2~0_476 256) 0))) (or (and .cse8 (= (mod v_~y$r_buff0_thd2~0_477 256) 0)) .cse9 (and .cse10 .cse8))) v_~y$r_buff0_thd2~0_477 0))) (= (ite .cse4 1 (ite .cse9 1 (ite .cse11 0 1))) v_~y$r_buff0_thd2~0_476) (= v_~__unbuffered_p1_EAX~0_189 v_~y$w_buff0~0_626) (= v_~y$r_buff0_thd0~0_491 v_~y$r_buff1_thd0~0_503) (= v_~y$w_buff0~0_626 1) (= v_~weak$$choice2~0_315 |v_P1Thread1of1ForFork1_#t~nondet4#1_120|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_23| |v_P1Thread1of1ForFork1_~arg#1.base_23|)))))))) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_23|, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_120|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_944, ~y$w_buff0~0=v_~y$w_buff0~0_627, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_491, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_112|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_250, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_477, ~y~0=v_~y~0_860, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_23|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_942, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_23|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_240, ~y$mem_tmp~0=v_~y$mem_tmp~0_267, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_189, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_68|, ~y$w_buff0~0=v_~y$w_buff0~0_626, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_249, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~y~0=v_~y~0_858, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_23|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_68|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_390, ~weak$$choice0~0=v_~weak$$choice0~0_234, ~y$w_buff1~0=v_~y$w_buff1~0_580, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_491, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_476, ~weak$$choice2~0=v_~weak$$choice2~0_315, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_503, ~x~0=v_~x~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_876} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] and [364] L795-->L811: Formula: (let ((.cse7 (= (mod v_~y$r_buff1_thd2~0_90 256) 0)) (.cse4 (= 0 (mod v_~y$r_buff0_thd2~0_105 256)))) (let ((.cse6 (not .cse4)) (.cse9 (and .cse4 (= (mod v_~y$w_buff1_used~0_197 256) 0))) (.cse2 (and .cse4 .cse7)) (.cse12 (= (mod v_~y$w_buff0_used~0_214 256) 0))) (let ((.cse10 (or .cse9 .cse2 .cse12)) (.cse11 (and (not .cse12) .cse6))) (let ((.cse0 (ite .cse10 v_~y~0_161 (ite .cse11 v_~y$w_buff0~0_94 v_~y$w_buff1~0_99))) (.cse5 (= (mod v_~y$w_buff1_used~0_196 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_213 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_102 256) 0)))) (and (= v_~y$w_buff0~0_94 v_~y$w_buff0~0_93) (= 0 v_~y$flush_delayed~0_77) (= v_~__unbuffered_p1_EBX~0_24 .cse0) (= v_~weak$$choice2~0_102 |v_P1Thread1of1ForFork1_#t~nondet6#1_1|) (= v_~y$w_buff1~0_99 v_~y$w_buff1~0_98) (= v_~y$r_buff0_thd2~0_104 (ite .cse1 v_~y$r_buff0_thd2~0_105 (ite (or .cse2 .cse3 (and .cse4 .cse5)) v_~y$r_buff0_thd2~0_105 (ite (and .cse6 (not .cse3)) 0 v_~y$r_buff0_thd2~0_105)))) (= v_~y~0_159 (ite .cse1 v_~y$mem_tmp~0_56 .cse0)) (= v_~y~0_161 v_~y$mem_tmp~0_56) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_25) (= (ite .cse1 v_~y$r_buff1_thd2~0_90 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd2~0_104 256) 0))) (or (and .cse7 .cse8) .cse3 (and .cse5 .cse8))) v_~y$r_buff1_thd2~0_90 0)) v_~y$r_buff1_thd2~0_89) (= (ite .cse1 v_~y$w_buff1_used~0_197 (ite (or .cse9 .cse2 .cse3) v_~y$w_buff1_used~0_197 0)) v_~y$w_buff1_used~0_196) (= (ite .cse1 v_~y$w_buff0_used~0_214 (ite .cse10 v_~y$w_buff0_used~0_214 (ite .cse11 0 v_~y$w_buff0_used~0_214))) v_~y$w_buff0_used~0_213)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_90, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_214, ~y$w_buff1~0=v_~y$w_buff1~0_99, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_94, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~y~0=v_~y~0_161, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_213, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_89, ~weak$$choice0~0=v_~weak$$choice0~0_25, ~y$mem_tmp~0=v_~y$mem_tmp~0_56, ~y$w_buff1~0=v_~y$w_buff1~0_98, ~y$w_buff0~0=v_~y$w_buff0~0_93, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~y$flush_delayed~0=v_~y$flush_delayed~0_77, ~y~0=v_~y~0_159, ~weak$$choice2~0=v_~weak$$choice2~0_102, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_196} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 11:58:02,001 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [505] $Ultimate##0-->L751: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_972 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_254 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd1~0_245 256) 0)))) (let ((.cse0 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_905 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_973 256) 0)))) (.cse1 (and .cse5 .cse3))) (and (= v_P0Thread1of1ForFork0_~arg.offset_55 |v_P0Thread1of1ForFork0_#in~arg.offset_55|) (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_905) v_~y$w_buff1_used~0_904) (= v_~y~0_888 (ite .cse2 v_~y$w_buff0~0_642 (ite .cse0 v_~y$w_buff1~0_594 2))) (= v_~x~0_48 v_~__unbuffered_p0_EAX~0_140) (= (ite .cse2 0 v_~y$w_buff0_used~0_973) v_~y$w_buff0_used~0_972) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_253 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_904 256) 0)) .cse4)) 0 v_~y$r_buff1_thd1~0_245) v_~y$r_buff1_thd1~0_244) (= v_~y$r_buff0_thd1~0_253 (ite .cse1 0 v_~y$r_buff0_thd1~0_254)) (= v_P0Thread1of1ForFork0_~arg.base_55 |v_P0Thread1of1ForFork0_#in~arg.base_55|)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_245, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_55|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_973, ~y$w_buff1~0=v_~y$w_buff1~0_594, ~y$w_buff0~0=v_~y$w_buff0~0_642, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_254, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_55|, ~x~0=v_~x~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_905} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_972, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_55|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_55, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_244, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_140, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_55|, ~y$w_buff1~0=v_~y$w_buff1~0_594, ~y$w_buff0~0=v_~y$w_buff0~0_642, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_253, ~y~0=v_~y~0_888, ~x~0=v_~x~0_48, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_904} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] and [506] $Ultimate##0-->L811: Formula: (let ((.cse23 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_124| 256) 0)))) (let ((.cse29 (ite .cse23 1 0))) (let ((.cse26 (= (mod .cse29 256) 0))) (let ((.cse12 (not (= (mod v_~y$r_buff0_thd1~0_258 256) 0))) (.cse28 (not .cse26))) (let ((.cse21 (and .cse12 .cse28))) (let ((.cse2 (ite .cse21 0 .cse29))) (let ((.cse24 (= (mod .cse2 256) 0)) (.cse27 (ite .cse23 v_~y$w_buff0_used~0_978 (ite .cse26 v_~y$w_buff0_used~0_978 0)))) (let ((.cse25 (= (mod .cse27 256) 0)) (.cse14 (not .cse24)) (.cse6 (ite .cse23 1 (ite .cse26 1 (ite .cse28 0 1))))) (let ((.cse9 (= (mod .cse6 256) 0)) (.cse5 (and .cse12 .cse14)) (.cse22 (and .cse12 (not .cse25)))) (let ((.cse19 (ite (or .cse5 .cse22) 0 .cse27)) (.cse16 (ite .cse23 v_~y$r_buff0_thd2~0_506 (ite (or (and .cse25 .cse9) (and .cse9 (= (mod v_~y$r_buff0_thd2~0_506 256) 0)) .cse26) v_~y$r_buff0_thd2~0_506 0)))) (let ((.cse18 (= (mod .cse16 256) 0)) (.cse13 (= (mod .cse19 256) 0))) (let ((.cse11 (not .cse9)) (.cse20 (and .cse13 .cse9)) (.cse10 (and .cse18 .cse9))) (let ((.cse3 (or .cse20 .cse24 .cse10)) (.cse15 (ite .cse21 v_~y$w_buff0~0_644 (ite .cse22 v_~y$w_buff1~0_596 (ite .cse23 v_~y~0_894 v_~__unbuffered_p1_EAX~0_191)))) (.cse4 (and .cse11 .cse14))) (let ((.cse1 (ite .cse3 .cse15 (ite .cse4 v_~y$w_buff0~0_644 v_~y$w_buff1~0_596))) (.cse8 (= (mod v_~y$w_buff1_used~0_908 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_317 256) 0))) (.cse7 (= (mod v_~y$w_buff0_used~0_976 256) 0))) (and (= v_~y~0_892 (ite .cse0 v_~y$mem_tmp~0_269 .cse1)) (= v_~y$w_buff0_used~0_976 (ite .cse0 .cse2 (ite .cse3 .cse2 (ite .cse4 0 .cse2)))) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_70| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_70|) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_25| |v_P1Thread1of1ForFork1_~arg#1.offset_25|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_70| 0)) (= v_~__unbuffered_p1_EAX~0_191 v_~y$w_buff0~0_644) (= v_~y$w_buff0~0_644 1) (= v_~y$flush_delayed~0_288 0) (= .cse1 v_~__unbuffered_p1_EBX~0_175) (= (ite (= (mod v_~y$w_buff0_used~0_978 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_70|) (= v_~weak$$choice2~0_317 |v_P1Thread1of1ForFork1_#t~nondet6#1_98|) (= v_~y$r_buff0_thd1~0_257 (ite .cse5 0 v_~y$r_buff0_thd1~0_258)) (= v_~y$w_buff1~0_596 v_~y$w_buff0~0_646) (= v_~y$r_buff0_thd2~0_504 (ite .cse0 .cse6 (ite (or .cse7 (and .cse8 .cse9) .cse10) .cse6 (ite (and .cse11 (not .cse7)) 0 .cse6)))) (= v_~y$r_buff1_thd1~0_248 (ite (or (and .cse12 (not .cse13)) (and (not (= (mod v_~y$r_buff0_thd1~0_257 256) 0)) .cse14)) 0 v_~y$r_buff0_thd1~0_258)) (= v_~x~0_50 1) (= v_~y$mem_tmp~0_269 .cse15) (= v_~weak$$choice0~0_236 |v_P1Thread1of1ForFork1_#t~nondet5#1_98|) (= v_~y$r_buff1_thd2~0_416 (ite .cse0 .cse16 (ite (let ((.cse17 (= (mod v_~y$r_buff0_thd2~0_504 256) 0))) (or (and .cse8 .cse17) (and .cse18 .cse17) .cse7)) .cse16 0))) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_25| |v_P1Thread1of1ForFork1_~arg#1.base_25|) (= v_~y$w_buff1_used~0_908 (ite .cse0 .cse19 (ite (or .cse20 .cse7 .cse10) .cse19 0))) (= v_~y$r_buff0_thd0~0_493 v_~y$r_buff1_thd0~0_505)))))))))))))))) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_25|, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_124|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_978, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_98|, ~y$w_buff0~0=v_~y$w_buff0~0_646, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_493, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_506, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_258, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_98|, ~y~0=v_~y~0_894, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_25|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_25|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_976, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_115|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_25|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_25|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_248, ~y$mem_tmp~0=v_~y$mem_tmp~0_269, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_191, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_70|, ~y$w_buff0~0=v_~y$w_buff0~0_644, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_257, ~y$flush_delayed~0=v_~y$flush_delayed~0_288, ~y~0=v_~y~0_892, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_175, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_25|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_70|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_416, ~weak$$choice0~0=v_~weak$$choice0~0_236, ~y$w_buff1~0=v_~y$w_buff1~0_596, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_493, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_504, ~weak$$choice2~0=v_~weak$$choice2~0_317, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_505, ~x~0=v_~x~0_50, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_908} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~y~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet6#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 11:58:02,568 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] $Ultimate##0-->L779: Formula: (and (= v_~y$r_buff0_thd2~0_457 v_~y$r_buff1_thd2~0_378) (= v_~y$r_buff0_thd0~0_483 v_~y$r_buff1_thd0~0_495) (= v_~y$w_buff1~0_565 v_~y$w_buff0~0_605) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_15| |v_P1Thread1of1ForFork1_~arg#1.offset_15|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_15| |v_P1Thread1of1ForFork1_~arg#1.base_15|) (= v_~y$w_buff0_used~0_916 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_60| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_857 256) 0)) (not (= (mod v_~y$w_buff0_used~0_916 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_60| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_60|) (= v_~y$w_buff0_used~0_917 v_~y$w_buff1_used~0_857) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_60| 0)) (= v_~y$r_buff0_thd1~0_235 v_~y$r_buff1_thd1~0_225) (= v_~y$w_buff0~0_604 1) (= v_~x~0_36 1) (= v_~y$r_buff0_thd2~0_456 1)) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_917, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_483, ~y$w_buff0~0=v_~y$w_buff0~0_605, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_457, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_235, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_15|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_15|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_916, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_60|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_15|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_378, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_225, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_60|, ~y$w_buff1~0=v_~y$w_buff1~0_565, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_483, ~y$w_buff0~0=v_~y$w_buff0~0_604, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_456, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_235, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_495, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_857} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] and [355] L751-->L758: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_187 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_40 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd1~0_36 256) 0)))) (let ((.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_173 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_188 256) 0))))) (and (= v_~y$r_buff0_thd1~0_39 (ite .cse0 0 v_~y$r_buff0_thd1~0_40)) (= v_~y~0_129 (ite .cse1 v_~y$w_buff0~0_75 (ite .cse2 v_~y$w_buff1~0_80 v_~y~0_130))) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_172 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_39 256) 0)))) 0 v_~y$r_buff1_thd1~0_36) v_~y$r_buff1_thd1~0_35) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_173) v_~y$w_buff1_used~0_172) (= (ite .cse1 0 v_~y$w_buff0_used~0_188) v_~y$w_buff0_used~0_187)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_36, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_188, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_75, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y~0=v_~y~0_130, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_187, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_75, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y~0=v_~y~0_129, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 11:58:02,743 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] $Ultimate##0-->L811: Formula: (let ((.cse16 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_116| 256) 0)))) (let ((.cse1 (ite .cse16 1 0))) (let ((.cse18 (= (mod .cse1 256) 0))) (let ((.cse17 (not .cse18))) (let ((.cse9 (ite .cse16 1 (ite .cse18 1 (ite .cse17 0 1))))) (let ((.cse11 (= (mod .cse9 256) 0)) (.cse13 (ite .cse16 v_~y$w_buff0_used~0_938 (ite .cse18 v_~y$w_buff0_used~0_938 0)))) (let ((.cse14 (and .cse11 (= (mod .cse13 256) 0)))) (let ((.cse4 (ite .cse16 v_~y$r_buff0_thd2~0_472 (ite (or .cse18 .cse14 (and .cse11 (= (mod v_~y$r_buff0_thd2~0_472 256) 0))) v_~y$r_buff0_thd2~0_472 0)))) (let ((.cse8 (= 0 (mod .cse4 256)))) (let ((.cse12 (not .cse11)) (.cse10 (and .cse11 .cse8))) (let ((.cse2 (or .cse10 .cse18 .cse14)) (.cse3 (and .cse12 .cse17))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_872 256) 0)) (.cse5 (= (mod v_~y$w_buff0_used~0_936 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_311 256) 0))) (.cse15 (ite .cse2 v_~y$mem_tmp~0_263 (ite .cse3 v_~y$w_buff0~0_620 v_~y$w_buff0~0_622)))) (and (= v_~y$flush_delayed~0_282 0) (= v_~y$w_buff0_used~0_936 (ite .cse0 .cse1 (ite .cse2 .cse1 (ite .cse3 0 .cse1)))) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_21| |v_P1Thread1of1ForFork1_~arg#1.offset_21|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_66| 0)) (= v_~__unbuffered_p1_EAX~0_187 v_~y$w_buff0~0_620) (= (ite .cse0 .cse4 (ite (let ((.cse6 (= (mod v_~y$r_buff0_thd2~0_470 256) 0))) (or .cse5 (and .cse6 .cse7) (and .cse6 .cse8))) .cse4 0)) v_~y$r_buff1_thd2~0_386) (= (ite .cse0 .cse9 (ite (or .cse10 (and .cse11 .cse7) .cse5) .cse9 (ite (and (not .cse5) .cse12) 0 .cse9))) v_~y$r_buff0_thd2~0_470) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_21| |v_P1Thread1of1ForFork1_~arg#1.base_21|) (= v_~y$w_buff0~0_620 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_66| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_66|) (= (ite .cse0 .cse13 (ite (or .cse10 .cse5 .cse14) .cse13 0)) v_~y$w_buff1_used~0_872) (= v_~__unbuffered_p1_EBX~0_173 .cse15) (= (ite .cse16 v_~y~0_854 v_~__unbuffered_p1_EAX~0_187) v_~y$mem_tmp~0_263) (= v_~y$r_buff0_thd1~0_247 v_~y$r_buff1_thd1~0_238) (= v_~y$w_buff1~0_576 v_~y$w_buff0~0_622) (= v_~weak$$choice0~0_230 |v_P1Thread1of1ForFork1_#t~nondet5#1_94|) (= v_~y~0_852 (ite .cse0 v_~y$mem_tmp~0_263 .cse15)) (= v_~y$r_buff0_thd0~0_489 v_~y$r_buff1_thd0~0_501) (= v_~x~0_44 1) (= (ite (= (mod v_~y$w_buff0_used~0_938 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_66|) (= v_~weak$$choice2~0_311 |v_P1Thread1of1ForFork1_#t~nondet6#1_94|)))))))))))))) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_21|, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_116|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_938, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_94|, ~y$w_buff0~0=v_~y$w_buff0~0_622, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_489, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_472, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_247, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_94|, ~y~0=v_~y~0_854, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_21|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_21|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_936, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_107|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_21|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_21|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_263, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_187, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_66|, ~y$w_buff0~0=v_~y$w_buff0~0_620, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_247, ~y$flush_delayed~0=v_~y$flush_delayed~0_282, ~y~0=v_~y~0_852, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_173, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_21|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_66|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_386, ~weak$$choice0~0=v_~weak$$choice0~0_230, ~y$w_buff1~0=v_~y$w_buff1~0_576, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_489, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_470, ~weak$$choice2~0=v_~weak$$choice2~0_311, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_501, ~x~0=v_~x~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_872} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] and [355] L751-->L758: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_187 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_40 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd1~0_36 256) 0)))) (let ((.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_173 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_188 256) 0))))) (and (= v_~y$r_buff0_thd1~0_39 (ite .cse0 0 v_~y$r_buff0_thd1~0_40)) (= v_~y~0_129 (ite .cse1 v_~y$w_buff0~0_75 (ite .cse2 v_~y$w_buff1~0_80 v_~y~0_130))) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_172 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_39 256) 0)))) 0 v_~y$r_buff1_thd1~0_36) v_~y$r_buff1_thd1~0_35) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_173) v_~y$w_buff1_used~0_172) (= (ite .cse1 0 v_~y$w_buff0_used~0_188) v_~y$w_buff0_used~0_187)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_36, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_188, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_75, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y~0=v_~y~0_130, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_187, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_75, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y~0=v_~y~0_129, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0]