/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:41:31,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:41:31,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:41:31,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:41:31,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:41:31,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:41:31,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:41:31,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:41:31,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:41:31,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:41:31,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:41:31,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:41:31,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:41:31,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:41:31,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:41:31,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:41:31,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:41:31,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:41:31,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:41:31,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:41:31,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:41:31,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:41:31,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:41:31,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:41:31,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:41:31,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:41:31,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:41:31,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:41:31,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:41:31,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:41:31,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:41:31,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:41:31,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:41:31,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:41:31,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:41:31,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:41:31,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:41:31,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:41:31,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:41:31,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:41:31,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:41:31,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:41:31,149 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:41:31,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:41:31,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:41:31,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:41:31,151 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:41:31,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:41:31,151 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:41:31,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:41:31,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:41:31,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:41:31,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:41:31,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:41:31,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:41:31,152 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:41:31,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:41:31,152 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:41:31,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:41:31,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:41:31,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:41:31,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:41:31,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:41:31,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:41:31,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:41:31,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:41:31,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:41:31,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:41:31,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:41:31,153 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:41:31,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:41:31,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:41:31,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:41:31,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:41:31,420 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:41:31,420 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:41:31,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2022-12-13 00:41:32,508 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:41:32,749 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:41:32,750 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2022-12-13 00:41:32,770 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b112377/03761e5db02c42659d10c0dfe63de4e9/FLAGe0b880fb4 [2022-12-13 00:41:32,782 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b112377/03761e5db02c42659d10c0dfe63de4e9 [2022-12-13 00:41:32,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:41:32,784 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:41:32,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:41:32,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:41:32,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:41:32,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:41:32" (1/1) ... [2022-12-13 00:41:32,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e7b132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:32, skipping insertion in model container [2022-12-13 00:41:32,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:41:32" (1/1) ... [2022-12-13 00:41:32,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:41:32,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:41:32,966 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/mix038.opt.i[944,957] [2022-12-13 00:41:33,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:41:33,156 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:41:33,165 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/mix038.opt.i[944,957] [2022-12-13 00:41:33,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:33,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:33,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:41:33,233 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:41:33,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33 WrapperNode [2022-12-13 00:41:33,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:41:33,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:41:33,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:41:33,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:41:33,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (1/1) ... [2022-12-13 00:41:33,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (1/1) ... [2022-12-13 00:41:33,282 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2022-12-13 00:41:33,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:41:33,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:41:33,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:41:33,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:41:33,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (1/1) ... [2022-12-13 00:41:33,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (1/1) ... [2022-12-13 00:41:33,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (1/1) ... [2022-12-13 00:41:33,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (1/1) ... [2022-12-13 00:41:33,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (1/1) ... [2022-12-13 00:41:33,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (1/1) ... [2022-12-13 00:41:33,306 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (1/1) ... [2022-12-13 00:41:33,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (1/1) ... [2022-12-13 00:41:33,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:41:33,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:41:33,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:41:33,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:41:33,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (1/1) ... [2022-12-13 00:41:33,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:41:33,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:41:33,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:41:33,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:41:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:41:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:41:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:41:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:41:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:41:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:41:33,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:41:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:41:33,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:41:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:41:33,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:41:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:41:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:41:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:41:33,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:41:33,383 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:41:33,559 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:41:33,560 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:41:33,750 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:41:33,835 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:41:33,835 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:41:33,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:41:33 BoogieIcfgContainer [2022-12-13 00:41:33,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:41:33,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:41:33,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:41:33,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:41:33,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:41:32" (1/3) ... [2022-12-13 00:41:33,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b8d6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:41:33, skipping insertion in model container [2022-12-13 00:41:33,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:33" (2/3) ... [2022-12-13 00:41:33,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b8d6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:41:33, skipping insertion in model container [2022-12-13 00:41:33,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:41:33" (3/3) ... [2022-12-13 00:41:33,847 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2022-12-13 00:41:33,876 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:41:33,876 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:41:33,876 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:41:33,929 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:41:33,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 00:41:34,012 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 00:41:34,012 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:34,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:41:34,018 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 00:41:34,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-13 00:41:34,023 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:34,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 00:41:34,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-13 00:41:34,087 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 00:41:34,087 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:34,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:41:34,091 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 00:41:34,091 INFO L226 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-13 00:41:37,823 INFO L241 LiptonReduction]: Total number of compositions: 88 [2022-12-13 00:41:37,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:41:37,862 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;@418087ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:41:37,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:41:37,868 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 00:41:37,868 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:37,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:37,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:37,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:41:37,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:37,888 INFO L85 PathProgramCache]: Analyzing trace with hash -14424378, now seen corresponding path program 1 times [2022-12-13 00:41:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:37,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133863485] [2022-12-13 00:41:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:37,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:38,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:38,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133863485] [2022-12-13 00:41:38,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133863485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:38,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:38,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:41:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551685377] [2022-12-13 00:41:38,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:38,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:41:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:38,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:41:38,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:41:38,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 56 [2022-12-13 00:41:38,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:38,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:38,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 56 [2022-12-13 00:41:38,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:39,361 INFO L130 PetriNetUnfolder]: 8354/12960 cut-off events. [2022-12-13 00:41:39,361 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 00:41:39,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24918 conditions, 12960 events. 8354/12960 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 93873 event pairs, 824 based on Foata normal form. 0/7424 useless extension candidates. Maximal degree in co-relation 24907. Up to 10531 conditions per place. [2022-12-13 00:41:39,399 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 29 selfloop transitions, 3 changer transitions 42/84 dead transitions. [2022-12-13 00:41:39,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 325 flow [2022-12-13 00:41:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-12-13 00:41:39,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2022-12-13 00:41:39,410 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 121 flow. Second operand 3 states and 109 transitions. [2022-12-13 00:41:39,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 325 flow [2022-12-13 00:41:39,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:41:39,417 INFO L231 Difference]: Finished difference. Result has 62 places, 32 transitions, 76 flow [2022-12-13 00:41:39,418 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=62, PETRI_TRANSITIONS=32} [2022-12-13 00:41:39,421 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -3 predicate places. [2022-12-13 00:41:39,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:39,422 INFO L89 Accepts]: Start accepts. Operand has 62 places, 32 transitions, 76 flow [2022-12-13 00:41:39,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:39,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:39,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 32 transitions, 76 flow [2022-12-13 00:41:39,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 76 flow [2022-12-13 00:41:39,435 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 00:41:39,435 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:39,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 78 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:41:39,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 76 flow [2022-12-13 00:41:39,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 00:41:39,524 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:39,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 00:41:39,526 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 76 flow [2022-12-13 00:41:39,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:39,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:39,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:39,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:41:39,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:41:39,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash -976891757, now seen corresponding path program 1 times [2022-12-13 00:41:39,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:39,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783593198] [2022-12-13 00:41:39,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:39,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:39,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:39,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783593198] [2022-12-13 00:41:39,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783593198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:39,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:39,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:41:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560715895] [2022-12-13 00:41:39,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:39,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:41:39,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:39,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:41:39,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:41:39,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:41:39,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:39,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:39,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:41:39,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:40,195 INFO L130 PetriNetUnfolder]: 3419/5354 cut-off events. [2022-12-13 00:41:40,195 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-12-13 00:41:40,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10848 conditions, 5354 events. 3419/5354 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 31083 event pairs, 1107 based on Foata normal form. 0/4051 useless extension candidates. Maximal degree in co-relation 10838. Up to 3341 conditions per place. [2022-12-13 00:41:40,218 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 37 selfloop transitions, 6 changer transitions 2/52 dead transitions. [2022-12-13 00:41:40,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 212 flow [2022-12-13 00:41:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 00:41:40,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2022-12-13 00:41:40,219 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 76 flow. Second operand 3 states and 67 transitions. [2022-12-13 00:41:40,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 212 flow [2022-12-13 00:41:40,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:41:40,222 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 114 flow [2022-12-13 00:41:40,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-12-13 00:41:40,223 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -22 predicate places. [2022-12-13 00:41:40,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:40,223 INFO L89 Accepts]: Start accepts. Operand has 43 places, 36 transitions, 114 flow [2022-12-13 00:41:40,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:40,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:40,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 36 transitions, 114 flow [2022-12-13 00:41:40,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 114 flow [2022-12-13 00:41:40,235 INFO L130 PetriNetUnfolder]: 48/217 cut-off events. [2022-12-13 00:41:40,236 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-12-13 00:41:40,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 217 events. 48/217 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1295 event pairs, 24 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 356. Up to 81 conditions per place. [2022-12-13 00:41:40,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 114 flow [2022-12-13 00:41:40,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-13 00:41:40,260 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:40,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 00:41:40,261 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 114 flow [2022-12-13 00:41:40,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:40,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:40,261 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:40,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:41:40,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:41:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash -218873479, now seen corresponding path program 1 times [2022-12-13 00:41:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:40,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13853535] [2022-12-13 00:41:40,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:40,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:40,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13853535] [2022-12-13 00:41:40,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13853535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:40,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:40,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:41:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311184838] [2022-12-13 00:41:40,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:40,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:41:40,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:41:40,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:41:40,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 00:41:40,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:40,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:40,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 00:41:40,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:40,763 INFO L130 PetriNetUnfolder]: 2463/3903 cut-off events. [2022-12-13 00:41:40,763 INFO L131 PetriNetUnfolder]: For 1362/1362 co-relation queries the response was YES. [2022-12-13 00:41:40,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9155 conditions, 3903 events. 2463/3903 cut-off events. For 1362/1362 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21088 event pairs, 814 based on Foata normal form. 60/3143 useless extension candidates. Maximal degree in co-relation 9143. Up to 1767 conditions per place. [2022-12-13 00:41:40,786 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 41 selfloop transitions, 7 changer transitions 1/56 dead transitions. [2022-12-13 00:41:40,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 266 flow [2022-12-13 00:41:40,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:41:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:41:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 00:41:40,788 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6048387096774194 [2022-12-13 00:41:40,788 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 114 flow. Second operand 4 states and 75 transitions. [2022-12-13 00:41:40,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 266 flow [2022-12-13 00:41:40,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:41:40,795 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 148 flow [2022-12-13 00:41:40,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-13 00:41:40,796 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -19 predicate places. [2022-12-13 00:41:40,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:40,796 INFO L89 Accepts]: Start accepts. Operand has 46 places, 38 transitions, 148 flow [2022-12-13 00:41:40,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:40,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:40,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 148 flow [2022-12-13 00:41:40,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 148 flow [2022-12-13 00:41:40,810 INFO L130 PetriNetUnfolder]: 39/177 cut-off events. [2022-12-13 00:41:40,810 INFO L131 PetriNetUnfolder]: For 72/82 co-relation queries the response was YES. [2022-12-13 00:41:40,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 177 events. 39/177 cut-off events. For 72/82 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 972 event pairs, 14 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 346. Up to 68 conditions per place. [2022-12-13 00:41:40,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 148 flow [2022-12-13 00:41:40,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-13 00:41:40,814 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:40,815 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 00:41:40,815 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 148 flow [2022-12-13 00:41:40,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:40,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:40,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:40,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:41:40,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:41:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1787363359, now seen corresponding path program 1 times [2022-12-13 00:41:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:40,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928323594] [2022-12-13 00:41:40,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:40,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:40,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928323594] [2022-12-13 00:41:40,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928323594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:40,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:40,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:41:40,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354217933] [2022-12-13 00:41:40,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:40,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:41:40,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:40,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:41:40,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:41:40,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2022-12-13 00:41:40,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:40,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:40,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2022-12-13 00:41:40,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:41,135 INFO L130 PetriNetUnfolder]: 2005/3318 cut-off events. [2022-12-13 00:41:41,136 INFO L131 PetriNetUnfolder]: For 2145/2147 co-relation queries the response was YES. [2022-12-13 00:41:41,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8131 conditions, 3318 events. 2005/3318 cut-off events. For 2145/2147 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 18951 event pairs, 949 based on Foata normal form. 10/2705 useless extension candidates. Maximal degree in co-relation 8116. Up to 2885 conditions per place. [2022-12-13 00:41:41,150 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 39 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2022-12-13 00:41:41,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 288 flow [2022-12-13 00:41:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-13 00:41:41,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-13 00:41:41,152 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 148 flow. Second operand 3 states and 61 transitions. [2022-12-13 00:41:41,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 288 flow [2022-12-13 00:41:41,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:41:41,156 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 186 flow [2022-12-13 00:41:41,156 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-12-13 00:41:41,156 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-12-13 00:41:41,156 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:41,157 INFO L89 Accepts]: Start accepts. Operand has 47 places, 41 transitions, 186 flow [2022-12-13 00:41:41,157 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:41,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:41,157 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 41 transitions, 186 flow [2022-12-13 00:41:41,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 186 flow [2022-12-13 00:41:41,167 INFO L130 PetriNetUnfolder]: 33/161 cut-off events. [2022-12-13 00:41:41,167 INFO L131 PetriNetUnfolder]: For 85/94 co-relation queries the response was YES. [2022-12-13 00:41:41,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 161 events. 33/161 cut-off events. For 85/94 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 861 event pairs, 13 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 343. Up to 60 conditions per place. [2022-12-13 00:41:41,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 41 transitions, 186 flow [2022-12-13 00:41:41,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 654 [2022-12-13 00:41:41,170 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:41,171 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 00:41:41,171 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 186 flow [2022-12-13 00:41:41,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:41,171 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:41,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:41,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:41:41,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:41:41,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:41,171 INFO L85 PathProgramCache]: Analyzing trace with hash -426333123, now seen corresponding path program 1 times [2022-12-13 00:41:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:41,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948228448] [2022-12-13 00:41:41,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:41,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:41,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:41,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948228448] [2022-12-13 00:41:41,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948228448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:41,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:41,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:41:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147391328] [2022-12-13 00:41:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:41,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:41:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:41,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:41:41,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:41:41,255 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 00:41:41,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:41,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:41,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 00:41:41,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:41,664 INFO L130 PetriNetUnfolder]: 3481/5467 cut-off events. [2022-12-13 00:41:41,664 INFO L131 PetriNetUnfolder]: For 3682/3813 co-relation queries the response was YES. [2022-12-13 00:41:41,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13716 conditions, 5467 events. 3481/5467 cut-off events. For 3682/3813 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 34116 event pairs, 904 based on Foata normal form. 476/4011 useless extension candidates. Maximal degree in co-relation 13699. Up to 4150 conditions per place. [2022-12-13 00:41:41,681 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 62 selfloop transitions, 17 changer transitions 21/110 dead transitions. [2022-12-13 00:41:41,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 110 transitions, 664 flow [2022-12-13 00:41:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:41:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:41:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-13 00:41:41,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7066666666666667 [2022-12-13 00:41:41,682 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 186 flow. Second operand 5 states and 106 transitions. [2022-12-13 00:41:41,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 110 transitions, 664 flow [2022-12-13 00:41:41,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 110 transitions, 651 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 00:41:41,686 INFO L231 Difference]: Finished difference. Result has 53 places, 57 transitions, 311 flow [2022-12-13 00:41:41,686 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=53, PETRI_TRANSITIONS=57} [2022-12-13 00:41:41,687 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -12 predicate places. [2022-12-13 00:41:41,687 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:41,687 INFO L89 Accepts]: Start accepts. Operand has 53 places, 57 transitions, 311 flow [2022-12-13 00:41:41,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:41,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:41,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 57 transitions, 311 flow [2022-12-13 00:41:41,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 57 transitions, 311 flow [2022-12-13 00:41:41,802 INFO L130 PetriNetUnfolder]: 1383/2546 cut-off events. [2022-12-13 00:41:41,802 INFO L131 PetriNetUnfolder]: For 1147/1742 co-relation queries the response was YES. [2022-12-13 00:41:41,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7500 conditions, 2546 events. 1383/2546 cut-off events. For 1147/1742 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 20049 event pairs, 679 based on Foata normal form. 10/1237 useless extension candidates. Maximal degree in co-relation 7482. Up to 1988 conditions per place. [2022-12-13 00:41:41,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 57 transitions, 311 flow [2022-12-13 00:41:41,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 972 [2022-12-13 00:41:42,193 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:41:42,194 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 507 [2022-12-13 00:41:42,194 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 305 flow [2022-12-13 00:41:42,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:42,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:42,194 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:42,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:41:42,194 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:41:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:42,195 INFO L85 PathProgramCache]: Analyzing trace with hash 978958615, now seen corresponding path program 1 times [2022-12-13 00:41:42,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:42,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271281764] [2022-12-13 00:41:42,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:42,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:42,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:42,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271281764] [2022-12-13 00:41:42,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271281764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:42,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:42,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:41:42,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789428672] [2022-12-13 00:41:42,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:42,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:41:42,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:42,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:41:42,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:41:42,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 00:41:42,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:42,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:42,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 00:41:42,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:42,683 INFO L130 PetriNetUnfolder]: 3688/5850 cut-off events. [2022-12-13 00:41:42,683 INFO L131 PetriNetUnfolder]: For 7129/7492 co-relation queries the response was YES. [2022-12-13 00:41:42,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21164 conditions, 5850 events. 3688/5850 cut-off events. For 7129/7492 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 35364 event pairs, 1340 based on Foata normal form. 154/4848 useless extension candidates. Maximal degree in co-relation 21143. Up to 3540 conditions per place. [2022-12-13 00:41:42,707 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 53 selfloop transitions, 9 changer transitions 6/78 dead transitions. [2022-12-13 00:41:42,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 529 flow [2022-12-13 00:41:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:41:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:41:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-13 00:41:42,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2022-12-13 00:41:42,708 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 305 flow. Second operand 4 states and 77 transitions. [2022-12-13 00:41:42,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 529 flow [2022-12-13 00:41:42,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 78 transitions, 509 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 00:41:42,740 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 284 flow [2022-12-13 00:41:42,741 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2022-12-13 00:41:42,741 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -11 predicate places. [2022-12-13 00:41:42,741 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:42,741 INFO L89 Accepts]: Start accepts. Operand has 54 places, 49 transitions, 284 flow [2022-12-13 00:41:42,742 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:42,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:42,742 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 49 transitions, 284 flow [2022-12-13 00:41:42,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 49 transitions, 284 flow [2022-12-13 00:41:42,864 INFO L130 PetriNetUnfolder]: 1613/2766 cut-off events. [2022-12-13 00:41:42,865 INFO L131 PetriNetUnfolder]: For 1357/2009 co-relation queries the response was YES. [2022-12-13 00:41:42,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7883 conditions, 2766 events. 1613/2766 cut-off events. For 1357/2009 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 20441 event pairs, 839 based on Foata normal form. 6/1337 useless extension candidates. Maximal degree in co-relation 7863. Up to 2227 conditions per place. [2022-12-13 00:41:42,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 49 transitions, 284 flow [2022-12-13 00:41:42,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 722 [2022-12-13 00:41:42,898 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:42,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 00:41:42,899 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 284 flow [2022-12-13 00:41:42,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:42,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:42,899 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:42,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:41:42,899 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:41:42,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:42,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1459849372, now seen corresponding path program 1 times [2022-12-13 00:41:42,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:42,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031686580] [2022-12-13 00:41:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:43,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:43,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031686580] [2022-12-13 00:41:43,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031686580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:43,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:43,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:41:43,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662044568] [2022-12-13 00:41:43,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:43,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:41:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:43,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:41:43,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:41:43,011 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 00:41:43,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:43,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:43,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 00:41:43,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:43,398 INFO L130 PetriNetUnfolder]: 2305/4054 cut-off events. [2022-12-13 00:41:43,398 INFO L131 PetriNetUnfolder]: For 3562/3654 co-relation queries the response was YES. [2022-12-13 00:41:43,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14805 conditions, 4054 events. 2305/4054 cut-off events. For 3562/3654 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 28005 event pairs, 246 based on Foata normal form. 463/3066 useless extension candidates. Maximal degree in co-relation 14782. Up to 2542 conditions per place. [2022-12-13 00:41:43,415 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 52 selfloop transitions, 20 changer transitions 40/121 dead transitions. [2022-12-13 00:41:43,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 121 transitions, 924 flow [2022-12-13 00:41:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:41:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:41:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2022-12-13 00:41:43,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2022-12-13 00:41:43,416 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 284 flow. Second operand 6 states and 129 transitions. [2022-12-13 00:41:43,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 121 transitions, 924 flow [2022-12-13 00:41:43,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 121 transitions, 883 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 00:41:43,423 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 422 flow [2022-12-13 00:41:43,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2022-12-13 00:41:43,423 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2022-12-13 00:41:43,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:43,423 INFO L89 Accepts]: Start accepts. Operand has 61 places, 58 transitions, 422 flow [2022-12-13 00:41:43,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:43,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:43,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 422 flow [2022-12-13 00:41:43,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 58 transitions, 422 flow [2022-12-13 00:41:43,536 INFO L130 PetriNetUnfolder]: 840/1773 cut-off events. [2022-12-13 00:41:43,536 INFO L131 PetriNetUnfolder]: For 2251/3530 co-relation queries the response was YES. [2022-12-13 00:41:43,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7852 conditions, 1773 events. 840/1773 cut-off events. For 2251/3530 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 13806 event pairs, 212 based on Foata normal form. 9/985 useless extension candidates. Maximal degree in co-relation 7828. Up to 1384 conditions per place. [2022-12-13 00:41:43,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 58 transitions, 422 flow [2022-12-13 00:41:43,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-13 00:41:43,587 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:41:43,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 00:41:43,588 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 414 flow [2022-12-13 00:41:43,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:43,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:43,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:43,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:41:43,588 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:41:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:43,589 INFO L85 PathProgramCache]: Analyzing trace with hash 225531666, now seen corresponding path program 1 times [2022-12-13 00:41:43,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:43,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156889910] [2022-12-13 00:41:43,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:43,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:43,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:43,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156889910] [2022-12-13 00:41:43,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156889910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:43,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:43,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:41:43,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865078044] [2022-12-13 00:41:43,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:43,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:41:43,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:43,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:41:43,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:41:43,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 00:41:43,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:43,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:43,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 00:41:43,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:43,987 INFO L130 PetriNetUnfolder]: 1042/2088 cut-off events. [2022-12-13 00:41:43,988 INFO L131 PetriNetUnfolder]: For 2575/2638 co-relation queries the response was YES. [2022-12-13 00:41:43,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9797 conditions, 2088 events. 1042/2088 cut-off events. For 2575/2638 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 14394 event pairs, 48 based on Foata normal form. 295/1628 useless extension candidates. Maximal degree in co-relation 9770. Up to 1363 conditions per place. [2022-12-13 00:41:43,996 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 39 selfloop transitions, 28 changer transitions 23/97 dead transitions. [2022-12-13 00:41:43,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 97 transitions, 826 flow [2022-12-13 00:41:43,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:41:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:41:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-13 00:41:43,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-13 00:41:43,997 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 414 flow. Second operand 7 states and 120 transitions. [2022-12-13 00:41:43,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 97 transitions, 826 flow [2022-12-13 00:41:44,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 718 flow, removed 40 selfloop flow, removed 5 redundant places. [2022-12-13 00:41:44,032 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 379 flow [2022-12-13 00:41:44,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2022-12-13 00:41:44,033 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -2 predicate places. [2022-12-13 00:41:44,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:44,033 INFO L89 Accepts]: Start accepts. Operand has 63 places, 53 transitions, 379 flow [2022-12-13 00:41:44,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:44,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:44,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 53 transitions, 379 flow [2022-12-13 00:41:44,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 53 transitions, 379 flow [2022-12-13 00:41:44,052 INFO L130 PetriNetUnfolder]: 124/350 cut-off events. [2022-12-13 00:41:44,052 INFO L131 PetriNetUnfolder]: For 410/602 co-relation queries the response was YES. [2022-12-13 00:41:44,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 350 events. 124/350 cut-off events. For 410/602 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 1971 event pairs, 2 based on Foata normal form. 1/173 useless extension candidates. Maximal degree in co-relation 1358. Up to 235 conditions per place. [2022-12-13 00:41:44,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 53 transitions, 379 flow [2022-12-13 00:41:44,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-13 00:41:44,342 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:41:44,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-13 00:41:44,343 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 375 flow [2022-12-13 00:41:44,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:44,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:44,344 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:44,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:41:44,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:41:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1193462736, now seen corresponding path program 1 times [2022-12-13 00:41:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:44,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786832838] [2022-12-13 00:41:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:44,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:44,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786832838] [2022-12-13 00:41:44,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786832838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:44,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:44,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:41:44,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047879908] [2022-12-13 00:41:44,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:44,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:41:44,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:44,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:41:44,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:41:44,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 00:41:44,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:44,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:44,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 00:41:44,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:44,608 INFO L130 PetriNetUnfolder]: 480/894 cut-off events. [2022-12-13 00:41:44,608 INFO L131 PetriNetUnfolder]: For 2841/2956 co-relation queries the response was YES. [2022-12-13 00:41:44,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 894 events. 480/894 cut-off events. For 2841/2956 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4564 event pairs, 57 based on Foata normal form. 85/760 useless extension candidates. Maximal degree in co-relation 4113. Up to 496 conditions per place. [2022-12-13 00:41:44,612 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 34 selfloop transitions, 1 changer transitions 36/83 dead transitions. [2022-12-13 00:41:44,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 83 transitions, 736 flow [2022-12-13 00:41:44,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:41:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:41:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-13 00:41:44,613 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-13 00:41:44,613 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 375 flow. Second operand 4 states and 68 transitions. [2022-12-13 00:41:44,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 83 transitions, 736 flow [2022-12-13 00:41:44,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 568 flow, removed 48 selfloop flow, removed 8 redundant places. [2022-12-13 00:41:44,626 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 235 flow [2022-12-13 00:41:44,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2022-12-13 00:41:44,626 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -10 predicate places. [2022-12-13 00:41:44,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:44,626 INFO L89 Accepts]: Start accepts. Operand has 55 places, 44 transitions, 235 flow [2022-12-13 00:41:44,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:44,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:44,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 44 transitions, 235 flow [2022-12-13 00:41:44,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 235 flow [2022-12-13 00:41:44,641 INFO L130 PetriNetUnfolder]: 90/215 cut-off events. [2022-12-13 00:41:44,641 INFO L131 PetriNetUnfolder]: For 545/563 co-relation queries the response was YES. [2022-12-13 00:41:44,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 215 events. 90/215 cut-off events. For 545/563 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1105 event pairs, 0 based on Foata normal form. 4/100 useless extension candidates. Maximal degree in co-relation 660. Up to 109 conditions per place. [2022-12-13 00:41:44,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 44 transitions, 235 flow [2022-12-13 00:41:44,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-13 00:41:45,117 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:41:45,118 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 492 [2022-12-13 00:41:45,118 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 223 flow [2022-12-13 00:41:45,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:45,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:45,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:45,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:41:45,119 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:41:45,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:45,119 INFO L85 PathProgramCache]: Analyzing trace with hash 259087208, now seen corresponding path program 1 times [2022-12-13 00:41:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:45,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870016821] [2022-12-13 00:41:45,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:45,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:45,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870016821] [2022-12-13 00:41:45,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870016821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:45,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:45,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:41:45,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665658636] [2022-12-13 00:41:45,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:45,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:41:45,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:45,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:41:45,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:41:45,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2022-12-13 00:41:45,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:45,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:45,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2022-12-13 00:41:45,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:45,489 INFO L130 PetriNetUnfolder]: 209/405 cut-off events. [2022-12-13 00:41:45,489 INFO L131 PetriNetUnfolder]: For 1224/1242 co-relation queries the response was YES. [2022-12-13 00:41:45,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 405 events. 209/405 cut-off events. For 1224/1242 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2028 event pairs, 8 based on Foata normal form. 36/319 useless extension candidates. Maximal degree in co-relation 1459. Up to 202 conditions per place. [2022-12-13 00:41:45,491 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 28 selfloop transitions, 3 changer transitions 30/71 dead transitions. [2022-12-13 00:41:45,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 524 flow [2022-12-13 00:41:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:41:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:41:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-13 00:41:45,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2022-12-13 00:41:45,492 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 223 flow. Second operand 6 states and 63 transitions. [2022-12-13 00:41:45,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 524 flow [2022-12-13 00:41:45,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 482 flow, removed 3 selfloop flow, removed 10 redundant places. [2022-12-13 00:41:45,495 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 204 flow [2022-12-13 00:41:45,496 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-13 00:41:45,497 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -19 predicate places. [2022-12-13 00:41:45,497 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:45,497 INFO L89 Accepts]: Start accepts. Operand has 46 places, 39 transitions, 204 flow [2022-12-13 00:41:45,497 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:45,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:45,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 204 flow [2022-12-13 00:41:45,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 204 flow [2022-12-13 00:41:45,509 INFO L130 PetriNetUnfolder]: 81/182 cut-off events. [2022-12-13 00:41:45,509 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2022-12-13 00:41:45,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 182 events. 81/182 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 912 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 534. Up to 109 conditions per place. [2022-12-13 00:41:45,511 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 204 flow [2022-12-13 00:41:45,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-13 00:41:46,296 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] $Ultimate##0-->P0FINAL: Formula: (and (= v_~__unbuffered_cnt~0_443 (+ v_~__unbuffered_cnt~0_444 1)) (= v_~x~0_159 1) (= |v_P0Thread1of1ForFork1_#res.offset_65| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~a~0_42 1) (= |v_P0Thread1of1ForFork1_#res.base_65| 0) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_444, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_42, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_65|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_65|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_443, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_159, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [476] $Ultimate##0-->L779: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_153 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd2~0_140 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_308 256) 0)) (.cse1 (and .cse9 (= (mod v_~y$w_buff1_used~0_266 256) 0))) (.cse3 (and .cse8 .cse9))) (let ((.cse4 (or .cse11 .cse1 .cse3)) (.cse5 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_79 256) 0))) (.cse7 (= (mod v_~y$w_buff1_used~0_265 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_307 256) 0))) (and (= 0 v_~y$flush_delayed~0_84) (= v_~y~0_239 v_~y$mem_tmp~0_73) (= 2 v_~x~0_151) (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= v_~y$w_buff1_used~0_265 (ite .cse0 v_~y$w_buff1_used~0_266 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_266 0))) (= (ite .cse0 v_~y$w_buff0_used~0_308 (ite .cse4 v_~y$w_buff0_used~0_308 (ite .cse5 0 v_~y$w_buff0_used~0_308))) v_~y$w_buff0_used~0_307) (= v_~y~0_238 (ite .cse0 v_~y$mem_tmp~0_73 v_~__unbuffered_p1_EAX~0_157)) (= v_~y$r_buff1_thd2~0_152 (ite .cse0 v_~y$r_buff1_thd2~0_153 (ite (let ((.cse6 (= 0 (mod v_~y$r_buff0_thd2~0_139 256)))) (or (and .cse6 .cse7) .cse2 (and .cse8 .cse6))) v_~y$r_buff1_thd2~0_153 0))) (= |v_P1Thread1of1ForFork2_#t~nondet3_76| v_~weak$$choice0~0_52) (= v_~y$w_buff1~0_166 v_~y$w_buff1~0_165) (= |v_P1Thread1of1ForFork2_#t~nondet4_76| v_~weak$$choice2~0_79) (= v_~__unbuffered_p1_EAX~0_157 (ite .cse4 v_~y~0_239 (ite .cse5 v_~y$w_buff0~0_206 v_~y$w_buff1~0_166))) (= v_~y$w_buff0~0_205 v_~y$w_buff0~0_206) (= v_~y$r_buff0_thd2~0_139 (ite .cse0 v_~y$r_buff0_thd2~0_140 (ite (or (and .cse9 .cse7) .cse2 .cse3) v_~y$r_buff0_thd2~0_140 (ite (and (not .cse2) .cse10) 0 v_~y$r_buff0_thd2~0_140)))) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_153, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_308, ~y$w_buff1~0=v_~y$w_buff1~0_166, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_76|, ~y$w_buff0~0=v_~y$w_buff0~0_206, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_76|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_239, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_266} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_307, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_152, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_52, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_73, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_157, ~y$w_buff1~0=v_~y$w_buff1~0_165, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_139, ~y$flush_delayed~0=v_~y$flush_delayed~0_84, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_238, ~weak$$choice2~0=v_~weak$$choice2~0_79, ~x~0=v_~x~0_151, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 00:41:46,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [490] $Ultimate##0-->L756: Formula: (and (= v_~x~0_161 1) (= v_~a~0_44 1) (= v_~__unbuffered_cnt~0_447 (+ v_~__unbuffered_cnt~0_448 1)) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_448, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|} OutVars{~a~0=v_~a~0_44, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_447, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_161, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [476] $Ultimate##0-->L779: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_153 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd2~0_140 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_308 256) 0)) (.cse1 (and .cse9 (= (mod v_~y$w_buff1_used~0_266 256) 0))) (.cse3 (and .cse8 .cse9))) (let ((.cse4 (or .cse11 .cse1 .cse3)) (.cse5 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_79 256) 0))) (.cse7 (= (mod v_~y$w_buff1_used~0_265 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_307 256) 0))) (and (= 0 v_~y$flush_delayed~0_84) (= v_~y~0_239 v_~y$mem_tmp~0_73) (= 2 v_~x~0_151) (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= v_~y$w_buff1_used~0_265 (ite .cse0 v_~y$w_buff1_used~0_266 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_266 0))) (= (ite .cse0 v_~y$w_buff0_used~0_308 (ite .cse4 v_~y$w_buff0_used~0_308 (ite .cse5 0 v_~y$w_buff0_used~0_308))) v_~y$w_buff0_used~0_307) (= v_~y~0_238 (ite .cse0 v_~y$mem_tmp~0_73 v_~__unbuffered_p1_EAX~0_157)) (= v_~y$r_buff1_thd2~0_152 (ite .cse0 v_~y$r_buff1_thd2~0_153 (ite (let ((.cse6 (= 0 (mod v_~y$r_buff0_thd2~0_139 256)))) (or (and .cse6 .cse7) .cse2 (and .cse8 .cse6))) v_~y$r_buff1_thd2~0_153 0))) (= |v_P1Thread1of1ForFork2_#t~nondet3_76| v_~weak$$choice0~0_52) (= v_~y$w_buff1~0_166 v_~y$w_buff1~0_165) (= |v_P1Thread1of1ForFork2_#t~nondet4_76| v_~weak$$choice2~0_79) (= v_~__unbuffered_p1_EAX~0_157 (ite .cse4 v_~y~0_239 (ite .cse5 v_~y$w_buff0~0_206 v_~y$w_buff1~0_166))) (= v_~y$w_buff0~0_205 v_~y$w_buff0~0_206) (= v_~y$r_buff0_thd2~0_139 (ite .cse0 v_~y$r_buff0_thd2~0_140 (ite (or (and .cse9 .cse7) .cse2 .cse3) v_~y$r_buff0_thd2~0_140 (ite (and (not .cse2) .cse10) 0 v_~y$r_buff0_thd2~0_140)))) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_153, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_308, ~y$w_buff1~0=v_~y$w_buff1~0_166, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_76|, ~y$w_buff0~0=v_~y$w_buff0~0_206, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_76|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_239, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_266} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_307, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_152, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_52, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_73, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_157, ~y$w_buff1~0=v_~y$w_buff1~0_165, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_139, ~y$flush_delayed~0=v_~y$flush_delayed~0_84, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_238, ~weak$$choice2~0=v_~weak$$choice2~0_79, ~x~0=v_~x~0_151, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 00:41:46,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [491] $Ultimate##0-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~a~0_46 1) (= v_~x~0_163 1) (= |v_P0Thread1of1ForFork1_#res.offset_67| 0) (= |v_P0Thread1of1ForFork1_#res.base_67| 0) (= v_~__unbuffered_cnt~0_451 (+ v_~__unbuffered_cnt~0_452 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_452, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{~a~0=v_~a~0_46, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_67|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_67|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_451, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_163, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] and [476] $Ultimate##0-->L779: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_153 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd2~0_140 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_308 256) 0)) (.cse1 (and .cse9 (= (mod v_~y$w_buff1_used~0_266 256) 0))) (.cse3 (and .cse8 .cse9))) (let ((.cse4 (or .cse11 .cse1 .cse3)) (.cse5 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_79 256) 0))) (.cse7 (= (mod v_~y$w_buff1_used~0_265 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_307 256) 0))) (and (= 0 v_~y$flush_delayed~0_84) (= v_~y~0_239 v_~y$mem_tmp~0_73) (= 2 v_~x~0_151) (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= v_~y$w_buff1_used~0_265 (ite .cse0 v_~y$w_buff1_used~0_266 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_266 0))) (= (ite .cse0 v_~y$w_buff0_used~0_308 (ite .cse4 v_~y$w_buff0_used~0_308 (ite .cse5 0 v_~y$w_buff0_used~0_308))) v_~y$w_buff0_used~0_307) (= v_~y~0_238 (ite .cse0 v_~y$mem_tmp~0_73 v_~__unbuffered_p1_EAX~0_157)) (= v_~y$r_buff1_thd2~0_152 (ite .cse0 v_~y$r_buff1_thd2~0_153 (ite (let ((.cse6 (= 0 (mod v_~y$r_buff0_thd2~0_139 256)))) (or (and .cse6 .cse7) .cse2 (and .cse8 .cse6))) v_~y$r_buff1_thd2~0_153 0))) (= |v_P1Thread1of1ForFork2_#t~nondet3_76| v_~weak$$choice0~0_52) (= v_~y$w_buff1~0_166 v_~y$w_buff1~0_165) (= |v_P1Thread1of1ForFork2_#t~nondet4_76| v_~weak$$choice2~0_79) (= v_~__unbuffered_p1_EAX~0_157 (ite .cse4 v_~y~0_239 (ite .cse5 v_~y$w_buff0~0_206 v_~y$w_buff1~0_166))) (= v_~y$w_buff0~0_205 v_~y$w_buff0~0_206) (= v_~y$r_buff0_thd2~0_139 (ite .cse0 v_~y$r_buff0_thd2~0_140 (ite (or (and .cse9 .cse7) .cse2 .cse3) v_~y$r_buff0_thd2~0_140 (ite (and (not .cse2) .cse10) 0 v_~y$r_buff0_thd2~0_140)))) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_153, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_308, ~y$w_buff1~0=v_~y$w_buff1~0_166, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_76|, ~y$w_buff0~0=v_~y$w_buff0~0_206, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_76|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_239, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_266} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_307, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_152, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_52, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_73, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_157, ~y$w_buff1~0=v_~y$w_buff1~0_165, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_139, ~y$flush_delayed~0=v_~y$flush_delayed~0_84, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_238, ~weak$$choice2~0=v_~weak$$choice2~0_79, ~x~0=v_~x~0_151, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 00:41:46,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [479] $Ultimate##0-->L751: Formula: (and (= v_~x~0_155 1) (= v_~a~0_40 1) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_40, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_155, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [476] $Ultimate##0-->L779: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_153 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd2~0_140 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_308 256) 0)) (.cse1 (and .cse9 (= (mod v_~y$w_buff1_used~0_266 256) 0))) (.cse3 (and .cse8 .cse9))) (let ((.cse4 (or .cse11 .cse1 .cse3)) (.cse5 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_79 256) 0))) (.cse7 (= (mod v_~y$w_buff1_used~0_265 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_307 256) 0))) (and (= 0 v_~y$flush_delayed~0_84) (= v_~y~0_239 v_~y$mem_tmp~0_73) (= 2 v_~x~0_151) (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= v_~y$w_buff1_used~0_265 (ite .cse0 v_~y$w_buff1_used~0_266 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_266 0))) (= (ite .cse0 v_~y$w_buff0_used~0_308 (ite .cse4 v_~y$w_buff0_used~0_308 (ite .cse5 0 v_~y$w_buff0_used~0_308))) v_~y$w_buff0_used~0_307) (= v_~y~0_238 (ite .cse0 v_~y$mem_tmp~0_73 v_~__unbuffered_p1_EAX~0_157)) (= v_~y$r_buff1_thd2~0_152 (ite .cse0 v_~y$r_buff1_thd2~0_153 (ite (let ((.cse6 (= 0 (mod v_~y$r_buff0_thd2~0_139 256)))) (or (and .cse6 .cse7) .cse2 (and .cse8 .cse6))) v_~y$r_buff1_thd2~0_153 0))) (= |v_P1Thread1of1ForFork2_#t~nondet3_76| v_~weak$$choice0~0_52) (= v_~y$w_buff1~0_166 v_~y$w_buff1~0_165) (= |v_P1Thread1of1ForFork2_#t~nondet4_76| v_~weak$$choice2~0_79) (= v_~__unbuffered_p1_EAX~0_157 (ite .cse4 v_~y~0_239 (ite .cse5 v_~y$w_buff0~0_206 v_~y$w_buff1~0_166))) (= v_~y$w_buff0~0_205 v_~y$w_buff0~0_206) (= v_~y$r_buff0_thd2~0_139 (ite .cse0 v_~y$r_buff0_thd2~0_140 (ite (or (and .cse9 .cse7) .cse2 .cse3) v_~y$r_buff0_thd2~0_140 (ite (and (not .cse2) .cse10) 0 v_~y$r_buff0_thd2~0_140)))) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_153, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_308, ~y$w_buff1~0=v_~y$w_buff1~0_166, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_76|, ~y$w_buff0~0=v_~y$w_buff0~0_206, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_76|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_239, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_266} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_307, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_152, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_52, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_73, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_157, ~y$w_buff1~0=v_~y$w_buff1~0_165, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_139, ~y$flush_delayed~0=v_~y$flush_delayed~0_84, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~y~0=v_~y~0_238, ~weak$$choice2~0=v_~weak$$choice2~0_79, ~x~0=v_~x~0_151, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 00:41:47,296 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [478] $Ultimate##0-->L809: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg#1.base_32| |v_P2Thread1of1ForFork0_~arg#1.base_32|) (= v_~y$w_buff0_used~0_321 1) (= v_~a~0_38 v_~__unbuffered_p2_EBX~0_124) (= v_~y$w_buff1~0_175 v_~y$w_buff0~0_218) (= v_~y$r_buff0_thd3~0_138 1) (= v_~y$r_buff0_thd3~0_139 v_~y$r_buff1_thd3~0_92) (= v_~y$r_buff0_thd2~0_149 v_~y$r_buff1_thd2~0_162) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46| 0)) (= v_~y$r_buff0_thd1~0_46 v_~y$r_buff1_thd1~0_52) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46|) (= v_~z~0_56 v_~__unbuffered_p2_EAX~0_131) (= |v_P2Thread1of1ForFork0_~arg#1.offset_32| |v_P2Thread1of1ForFork0_#in~arg#1.offset_32|) (= v_~z~0_56 1) (= v_~y$r_buff0_thd0~0_134 v_~y$r_buff1_thd0~0_132) (= v_~y$w_buff0_used~0_322 v_~y$w_buff1_used~0_277) (= v_~y$w_buff0~0_217 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_321 256) 0)) (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 1 0))) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_32|, ~a~0=v_~a~0_38, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_322, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_139, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_218, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_149, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_124, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_321, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_162, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_32|, ~a~0=v_~a~0_38, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_92, ~y$w_buff1~0=v_~y$w_buff1~0_175, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_32|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_138, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_217, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_149, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_32|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_131, ~z~0=v_~z~0_56, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_132, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [492] $Ultimate##0-->L779: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd2~0_169 256) 0)) (.cse5 (= (mod v_~y$r_buff0_thd2~0_156 256) 0))) (let ((.cse7 (not .cse5)) (.cse3 (and .cse9 .cse5)) (.cse11 (= (mod v_~y$w_buff0_used~0_368 256) 0)) (.cse8 (and .cse5 (= (mod v_~y$w_buff1_used~0_322 256) 0)))) (let ((.cse0 (or .cse3 .cse11 .cse8)) (.cse1 (and .cse7 (not .cse11))) (.cse2 (not (= (mod v_~weak$$choice2~0_85 256) 0))) (.cse4 (= (mod v_~y$w_buff0_used~0_367 256) 0)) (.cse6 (= (mod v_~y$w_buff1_used~0_321 256) 0))) (and (= |v_P1Thread1of1ForFork2_#in~arg.base_25| v_P1Thread1of1ForFork2_~arg.base_25) (= v_~__unbuffered_p1_EAX~0_163 (ite .cse0 v_~y~0_291 (ite .cse1 v_~y$w_buff0~0_244 v_~y$w_buff1~0_200))) (= v_~y$w_buff1~0_200 v_~y$w_buff1~0_199) (= 0 v_~y$flush_delayed~0_90) (= v_~y~0_291 v_~y$mem_tmp~0_79) (= v_~y$w_buff0~0_244 v_~y$w_buff0~0_243) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= |v_P0Thread1of1ForFork1_#res.base_69| 0) (= |v_P0Thread1of1ForFork1_#res.offset_69| 0) (= |v_P1Thread1of1ForFork2_#in~arg.offset_25| v_P1Thread1of1ForFork2_~arg.offset_25) (= (ite .cse2 v_~y$r_buff0_thd2~0_156 (ite (or .cse3 .cse4 (and .cse5 .cse6)) v_~y$r_buff0_thd2~0_156 (ite (and (not .cse4) .cse7) 0 v_~y$r_buff0_thd2~0_156))) v_~y$r_buff0_thd2~0_155) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= v_~y$w_buff0_used~0_367 (ite .cse2 v_~y$w_buff0_used~0_368 (ite .cse0 v_~y$w_buff0_used~0_368 (ite .cse1 0 v_~y$w_buff0_used~0_368)))) (= v_~a~0_48 1) (= 2 v_~x~0_165) (= v_~y~0_290 (ite .cse2 v_~y$mem_tmp~0_79 v_~__unbuffered_p1_EAX~0_163)) (= |v_P1Thread1of1ForFork2_#t~nondet4_88| v_~weak$$choice2~0_85) (= v_~y$w_buff1_used~0_321 (ite .cse2 v_~y$w_buff1_used~0_322 (ite (or .cse3 .cse4 .cse8) v_~y$w_buff1_used~0_322 0))) (= |v_P1Thread1of1ForFork2_#t~nondet3_88| v_~weak$$choice0~0_58) (= v_~__unbuffered_cnt~0_455 (+ v_~__unbuffered_cnt~0_456 1)) (= v_~y$r_buff1_thd2~0_168 (ite .cse2 v_~y$r_buff1_thd2~0_169 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_155 256) 0))) (or .cse4 (and .cse9 .cse10) (and .cse6 .cse10))) v_~y$r_buff1_thd2~0_169 0))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_368, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_88|, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_88|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_169, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_25|, ~y$w_buff1~0=v_~y$w_buff1~0_200, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, ~y$w_buff0~0=v_~y$w_buff0~0_244, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_156, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_456, ~y~0=v_~y~0_291, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_322} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_367, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_69|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_69|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_25|, ~a~0=v_~a~0_48, ~y$mem_tmp~0=v_~y$mem_tmp~0_79, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_163, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, ~y$w_buff0~0=v_~y$w_buff0~0_243, ~y$flush_delayed~0=v_~y$flush_delayed~0_90, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, ~y~0=v_~y~0_290, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_25, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_168, ~weak$$choice0~0=v_~weak$$choice0~0_58, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_25, ~y$w_buff1~0=v_~y$w_buff1~0_199, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_155, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_455, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~x~0=v_~x~0_165, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_321} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P0Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd2~0, ~a~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 00:41:47,670 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [478] $Ultimate##0-->L809: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg#1.base_32| |v_P2Thread1of1ForFork0_~arg#1.base_32|) (= v_~y$w_buff0_used~0_321 1) (= v_~a~0_38 v_~__unbuffered_p2_EBX~0_124) (= v_~y$w_buff1~0_175 v_~y$w_buff0~0_218) (= v_~y$r_buff0_thd3~0_138 1) (= v_~y$r_buff0_thd3~0_139 v_~y$r_buff1_thd3~0_92) (= v_~y$r_buff0_thd2~0_149 v_~y$r_buff1_thd2~0_162) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46| 0)) (= v_~y$r_buff0_thd1~0_46 v_~y$r_buff1_thd1~0_52) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46|) (= v_~z~0_56 v_~__unbuffered_p2_EAX~0_131) (= |v_P2Thread1of1ForFork0_~arg#1.offset_32| |v_P2Thread1of1ForFork0_#in~arg#1.offset_32|) (= v_~z~0_56 1) (= v_~y$r_buff0_thd0~0_134 v_~y$r_buff1_thd0~0_132) (= v_~y$w_buff0_used~0_322 v_~y$w_buff1_used~0_277) (= v_~y$w_buff0~0_217 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_321 256) 0)) (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 1 0))) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_32|, ~a~0=v_~a~0_38, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_322, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_139, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_218, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_149, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_124, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_321, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_162, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_32|, ~a~0=v_~a~0_38, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_92, ~y$w_buff1~0=v_~y$w_buff1~0_175, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_32|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_138, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_217, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_149, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_32|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_131, ~z~0=v_~z~0_56, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_132, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [493] $Ultimate##0-->L779: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd2~0_173 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd2~0_160 256) 0))) (let ((.cse7 (not .cse4)) (.cse3 (and .cse9 .cse4)) (.cse11 (= (mod v_~y$w_buff0_used~0_372 256) 0)) (.cse10 (and .cse4 (= (mod v_~y$w_buff1_used~0_326 256) 0)))) (let ((.cse0 (or .cse3 .cse11 .cse10)) (.cse1 (and .cse7 (not .cse11))) (.cse5 (= (mod v_~y$w_buff1_used~0_325 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_87 256) 0))) (.cse6 (= (mod v_~y$w_buff0_used~0_371 256) 0))) (and (= v_~__unbuffered_p1_EAX~0_165 (ite .cse0 v_~y~0_295 (ite .cse1 v_~y$w_buff0~0_248 v_~y$w_buff1~0_204))) (= v_~y~0_294 (ite .cse2 v_~y$mem_tmp~0_81 v_~__unbuffered_p1_EAX~0_165)) (= v_~y~0_295 v_~y$mem_tmp~0_81) (= |v_P1Thread1of1ForFork2_#in~arg.base_27| v_P1Thread1of1ForFork2_~arg.base_27) (= |v_P1Thread1of1ForFork2_#t~nondet3_92| v_~weak$$choice0~0_60) (= (+ v_~__unbuffered_cnt~0_460 1) v_~__unbuffered_cnt~0_459) (= |v_P1Thread1of1ForFork2_#in~arg.offset_27| v_P1Thread1of1ForFork2_~arg.offset_27) (= 0 v_~y$flush_delayed~0_92) (= v_~y$w_buff1~0_204 v_~y$w_buff1~0_203) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= v_~y$w_buff0_used~0_371 (ite .cse2 v_~y$w_buff0_used~0_372 (ite .cse0 v_~y$w_buff0_used~0_372 (ite .cse1 0 v_~y$w_buff0_used~0_372)))) (= 2 v_~x~0_169) (= v_~y$w_buff0~0_248 v_~y$w_buff0~0_247) (= v_~a~0_50 1) (= v_~y$r_buff0_thd2~0_159 (ite .cse2 v_~y$r_buff0_thd2~0_160 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~y$r_buff0_thd2~0_160 (ite (and (not .cse6) .cse7) 0 v_~y$r_buff0_thd2~0_160)))) (= v_~y$r_buff1_thd2~0_172 (ite .cse2 v_~y$r_buff1_thd2~0_173 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd2~0_159 256) 0))) (or (and .cse5 .cse8) (and .cse9 .cse8) .cse6)) v_~y$r_buff1_thd2~0_173 0))) (= v_~y$w_buff1_used~0_325 (ite .cse2 v_~y$w_buff1_used~0_326 (ite (or .cse3 .cse10 .cse6) v_~y$w_buff1_used~0_326 0))) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= |v_P1Thread1of1ForFork2_#t~nondet4_92| v_~weak$$choice2~0_87))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_372, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_92|, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_92|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_173, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_27|, ~y$w_buff1~0=v_~y$w_buff1~0_204, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_160, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_460, ~y~0=v_~y~0_295, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_326} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_27|, ~a~0=v_~a~0_50, ~y$mem_tmp~0=v_~y$mem_tmp~0_81, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_165, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$w_buff0~0=v_~y$w_buff0~0_247, ~y$flush_delayed~0=v_~y$flush_delayed~0_92, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~y~0=v_~y~0_294, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_27, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_172, ~weak$$choice0~0=v_~weak$$choice0~0_60, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_27, ~y$w_buff1~0=v_~y$w_buff1~0_203, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_159, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_459, ~weak$$choice2~0=v_~weak$$choice2~0_87, ~x~0=v_~x~0_169, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd2~0, ~a~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 00:41:47,996 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [478] $Ultimate##0-->L809: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg#1.base_32| |v_P2Thread1of1ForFork0_~arg#1.base_32|) (= v_~y$w_buff0_used~0_321 1) (= v_~a~0_38 v_~__unbuffered_p2_EBX~0_124) (= v_~y$w_buff1~0_175 v_~y$w_buff0~0_218) (= v_~y$r_buff0_thd3~0_138 1) (= v_~y$r_buff0_thd3~0_139 v_~y$r_buff1_thd3~0_92) (= v_~y$r_buff0_thd2~0_149 v_~y$r_buff1_thd2~0_162) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46| 0)) (= v_~y$r_buff0_thd1~0_46 v_~y$r_buff1_thd1~0_52) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46|) (= v_~z~0_56 v_~__unbuffered_p2_EAX~0_131) (= |v_P2Thread1of1ForFork0_~arg#1.offset_32| |v_P2Thread1of1ForFork0_#in~arg#1.offset_32|) (= v_~z~0_56 1) (= v_~y$r_buff0_thd0~0_134 v_~y$r_buff1_thd0~0_132) (= v_~y$w_buff0_used~0_322 v_~y$w_buff1_used~0_277) (= v_~y$w_buff0~0_217 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_321 256) 0)) (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 1 0))) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_32|, ~a~0=v_~a~0_38, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_322, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_139, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_218, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_149, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_124, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_321, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_162, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_32|, ~a~0=v_~a~0_38, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_92, ~y$w_buff1~0=v_~y$w_buff1~0_175, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_32|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_138, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_217, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_149, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_32|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_131, ~z~0=v_~z~0_56, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_132, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [494] $Ultimate##0-->L779: Formula: (let ((.cse10 (= 0 (mod v_~y$r_buff1_thd2~0_177 256))) (.cse7 (= (mod v_~y$r_buff0_thd2~0_164 256) 0))) (let ((.cse8 (not .cse7)) (.cse4 (and .cse10 .cse7)) (.cse5 (and (= (mod v_~y$w_buff1_used~0_330 256) 0) .cse7)) (.cse11 (= (mod v_~y$w_buff0_used~0_376 256) 0))) (let ((.cse1 (or .cse4 .cse5 .cse11)) (.cse2 (and (not .cse11) .cse8)) (.cse0 (not (= (mod v_~weak$$choice2~0_89 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_375 256) 0)) (.cse6 (= (mod v_~y$w_buff1_used~0_329 256) 0))) (and (= v_~y~0_298 (ite .cse0 v_~y$mem_tmp~0_83 v_~__unbuffered_p1_EAX~0_167)) (= v_~__unbuffered_p1_EAX~0_167 (ite .cse1 v_~y~0_299 (ite .cse2 v_~y$w_buff0~0_252 v_~y$w_buff1~0_208))) (= v_~__unbuffered_cnt~0_463 (+ v_~__unbuffered_cnt~0_464 1)) (= v_P0Thread1of1ForFork1_~arg.offset_27 |v_P0Thread1of1ForFork1_#in~arg.offset_27|) (= 0 v_~y$flush_delayed~0_94) (= v_~y$w_buff1_used~0_329 (ite .cse0 v_~y$w_buff1_used~0_330 (ite (or .cse3 .cse4 .cse5) v_~y$w_buff1_used~0_330 0))) (= v_~y$w_buff1~0_208 v_~y$w_buff1~0_207) (= |v_P0Thread1of1ForFork1_#res.base_71| 0) (= |v_P1Thread1of1ForFork2_#in~arg.base_29| v_P1Thread1of1ForFork2_~arg.base_29) (= v_~y$w_buff0~0_252 v_~y$w_buff0~0_251) (= v_~a~0_52 1) (= 2 v_~x~0_173) (= |v_P0Thread1of1ForFork1_#res.offset_71| 0) (= |v_P1Thread1of1ForFork2_#t~nondet3_96| v_~weak$$choice0~0_62) (= |v_P1Thread1of1ForFork2_#t~nondet4_96| v_~weak$$choice2~0_89) (= (ite .cse0 v_~y$r_buff0_thd2~0_164 (ite (or .cse3 .cse4 (and .cse6 .cse7)) v_~y$r_buff0_thd2~0_164 (ite (and (not .cse3) .cse8) 0 v_~y$r_buff0_thd2~0_164))) v_~y$r_buff0_thd2~0_163) (= v_~y$w_buff0_used~0_375 (ite .cse0 v_~y$w_buff0_used~0_376 (ite .cse1 v_~y$w_buff0_used~0_376 (ite .cse2 0 v_~y$w_buff0_used~0_376)))) (= |v_P0Thread1of1ForFork1_#in~arg.base_27| v_P0Thread1of1ForFork1_~arg.base_27) (= |v_P1Thread1of1ForFork2_#in~arg.offset_29| v_P1Thread1of1ForFork2_~arg.offset_29) (= (ite .cse0 v_~y$r_buff1_thd2~0_177 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_163 256) 0))) (or .cse3 (and .cse6 .cse9) (and .cse10 .cse9))) v_~y$r_buff1_thd2~0_177 0)) v_~y$r_buff1_thd2~0_176) (= v_~y~0_299 v_~y$mem_tmp~0_83))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_376, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_96|, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_96|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_177, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_29|, ~y$w_buff1~0=v_~y$w_buff1~0_208, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~y$w_buff0~0=v_~y$w_buff0~0_252, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_164, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_464, ~y~0=v_~y~0_299, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_330} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_375, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_71|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_71|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_27, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_29|, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_83, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_167, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~y$w_buff0~0=v_~y$w_buff0~0_251, ~y$flush_delayed~0=v_~y$flush_delayed~0_94, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_27, ~y~0=v_~y~0_298, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_29, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_176, ~weak$$choice0~0=v_~weak$$choice0~0_62, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_29, ~y$w_buff1~0=v_~y$w_buff1~0_207, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_163, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_463, ~weak$$choice2~0=v_~weak$$choice2~0_89, ~x~0=v_~x~0_173, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_329} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P0Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd2~0, ~a~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 00:41:48,365 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [478] $Ultimate##0-->L809: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg#1.base_32| |v_P2Thread1of1ForFork0_~arg#1.base_32|) (= v_~y$w_buff0_used~0_321 1) (= v_~a~0_38 v_~__unbuffered_p2_EBX~0_124) (= v_~y$w_buff1~0_175 v_~y$w_buff0~0_218) (= v_~y$r_buff0_thd3~0_138 1) (= v_~y$r_buff0_thd3~0_139 v_~y$r_buff1_thd3~0_92) (= v_~y$r_buff0_thd2~0_149 v_~y$r_buff1_thd2~0_162) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46| 0)) (= v_~y$r_buff0_thd1~0_46 v_~y$r_buff1_thd1~0_52) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46|) (= v_~z~0_56 v_~__unbuffered_p2_EAX~0_131) (= |v_P2Thread1of1ForFork0_~arg#1.offset_32| |v_P2Thread1of1ForFork0_#in~arg#1.offset_32|) (= v_~z~0_56 1) (= v_~y$r_buff0_thd0~0_134 v_~y$r_buff1_thd0~0_132) (= v_~y$w_buff0_used~0_322 v_~y$w_buff1_used~0_277) (= v_~y$w_buff0~0_217 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_321 256) 0)) (not (= (mod v_~y$w_buff1_used~0_277 256) 0)))) 1 0))) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_32|, ~a~0=v_~a~0_38, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_322, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_139, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_218, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_149, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_124, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_321, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_162, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_32|, ~a~0=v_~a~0_38, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_92, ~y$w_buff1~0=v_~y$w_buff1~0_175, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_32|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_138, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_217, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_149, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_46|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_32|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_131, ~z~0=v_~z~0_56, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_132, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_277} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [495] $Ultimate##0-->L779: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd2~0_181 256) 0)) (.cse5 (= (mod v_~y$r_buff0_thd2~0_168 256) 0))) (let ((.cse7 (not .cse5)) (.cse3 (and .cse5 .cse9)) (.cse10 (and (= (mod v_~y$w_buff1_used~0_334 256) 0) .cse5)) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_380 256)))) (let ((.cse6 (= (mod v_~y$w_buff1_used~0_333 256) 0)) (.cse0 (or .cse3 .cse10 .cse11)) (.cse1 (and (not .cse11) .cse7)) (.cse2 (not (= (mod v_~weak$$choice2~0_91 256) 0))) (.cse4 (= 0 (mod v_~y$w_buff0_used~0_379 256)))) (and (= 0 v_~y$flush_delayed~0_96) (= |v_P1Thread1of1ForFork2_#t~nondet4_100| v_~weak$$choice2~0_91) (= v_~__unbuffered_p1_EAX~0_169 (ite .cse0 v_~y~0_303 (ite .cse1 v_~y$w_buff0~0_256 v_~y$w_buff1~0_212))) (= v_~y$r_buff0_thd2~0_167 (ite .cse2 v_~y$r_buff0_thd2~0_168 (ite (or .cse3 .cse4 (and .cse5 .cse6)) v_~y$r_buff0_thd2~0_168 (ite (and (not .cse4) .cse7) 0 v_~y$r_buff0_thd2~0_168)))) (= v_~y$w_buff1~0_212 v_~y$w_buff1~0_211) (= |v_P1Thread1of1ForFork2_#t~nondet3_100| v_~weak$$choice0~0_64) (= v_~a~0_54 1) (= v_~y~0_303 v_~y$mem_tmp~0_85) (= |v_P1Thread1of1ForFork2_#in~arg.base_31| v_P1Thread1of1ForFork2_~arg.base_31) (= v_P0Thread1of1ForFork1_~arg.offset_29 |v_P0Thread1of1ForFork1_#in~arg.offset_29|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_31| v_P1Thread1of1ForFork2_~arg.offset_31) (= v_~y$r_buff1_thd2~0_180 (ite .cse2 v_~y$r_buff1_thd2~0_181 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd2~0_167 256) 0))) (or .cse4 (and .cse8 .cse6) (and .cse8 .cse9))) v_~y$r_buff1_thd2~0_181 0))) (= (ite .cse2 v_~y$w_buff0_used~0_380 (ite .cse0 v_~y$w_buff0_used~0_380 (ite .cse1 0 v_~y$w_buff0_used~0_380))) v_~y$w_buff0_used~0_379) (= v_~y$w_buff0~0_256 v_~y$w_buff0~0_255) (= 2 v_~x~0_177) (= |v_P0Thread1of1ForFork1_#in~arg.base_29| v_P0Thread1of1ForFork1_~arg.base_29) (= (ite .cse2 v_~y$mem_tmp~0_85 v_~__unbuffered_p1_EAX~0_169) v_~y~0_302) (= v_~y$w_buff1_used~0_333 (ite .cse2 v_~y$w_buff1_used~0_334 (ite (or .cse3 .cse4 .cse10) v_~y$w_buff1_used~0_334 0))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_380, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_100|, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_100|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_181, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_31|, ~y$w_buff1~0=v_~y$w_buff1~0_212, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~y$w_buff0~0=v_~y$w_buff0~0_256, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_168, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_31|, ~y~0=v_~y~0_303, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_334} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_31, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_379, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_29, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_180, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_31|, ~weak$$choice0~0=v_~weak$$choice0~0_64, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_31, ~a~0=v_~a~0_54, ~y$mem_tmp~0=v_~y$mem_tmp~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_169, ~y$w_buff1~0=v_~y$w_buff1~0_211, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~y$w_buff0~0=v_~y$w_buff0~0_255, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_96, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_29, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_31|, ~y~0=v_~y~0_302, ~weak$$choice2~0=v_~weak$$choice2~0_91, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_333} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, ~weak$$choice2~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 00:41:48,715 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:41:48,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3219 [2022-12-13 00:41:48,716 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 245 flow [2022-12-13 00:41:48,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:48,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:48,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:48,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:41:48,717 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:41:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1850151845, now seen corresponding path program 1 times [2022-12-13 00:41:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:48,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783171686] [2022-12-13 00:41:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:48,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:41:48,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:41:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:41:48,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:41:48,799 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:41:48,799 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:41:48,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:41:48,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:41:48,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:41:48,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:41:48,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:41:48,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:41:48,801 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:48,805 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:41:48,805 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:41:48,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:41:48 BasicIcfg [2022-12-13 00:41:48,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:41:48,858 INFO L158 Benchmark]: Toolchain (without parser) took 16074.09ms. Allocated memory was 192.9MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 167.7MB in the beginning and 527.7MB in the end (delta: -360.0MB). Peak memory consumption was 490.4MB. Max. memory is 8.0GB. [2022-12-13 00:41:48,858 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory was 169.1MB in the beginning and 169.0MB in the end (delta: 87.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:41:48,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.55ms. Allocated memory is still 192.9MB. Free memory was 167.2MB in the beginning and 141.5MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:41:48,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.18ms. Allocated memory is still 192.9MB. Free memory was 141.5MB in the beginning and 138.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:41:48,859 INFO L158 Benchmark]: Boogie Preprocessor took 26.19ms. Allocated memory is still 192.9MB. Free memory was 138.9MB in the beginning and 137.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:41:48,859 INFO L158 Benchmark]: RCFGBuilder took 527.32ms. Allocated memory is still 192.9MB. Free memory was 137.3MB in the beginning and 106.9MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-13 00:41:48,859 INFO L158 Benchmark]: TraceAbstraction took 15019.20ms. Allocated memory was 192.9MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 105.9MB in the beginning and 527.7MB in the end (delta: -421.9MB). Peak memory consumption was 428.5MB. Max. memory is 8.0GB. [2022-12-13 00:41:48,860 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory was 169.1MB in the beginning and 169.0MB in the end (delta: 87.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.55ms. Allocated memory is still 192.9MB. Free memory was 167.2MB in the beginning and 141.5MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.18ms. Allocated memory is still 192.9MB. Free memory was 141.5MB in the beginning and 138.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.19ms. Allocated memory is still 192.9MB. Free memory was 138.9MB in the beginning and 137.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 527.32ms. Allocated memory is still 192.9MB. Free memory was 137.3MB in the beginning and 106.9MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 15019.20ms. Allocated memory was 192.9MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 105.9MB in the beginning and 527.7MB in the end (delta: -421.9MB). Peak memory consumption was 428.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 115 PlacesBefore, 65 PlacesAfterwards, 107 TransitionsBefore, 56 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 88 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3464, independent: 3343, independent conditional: 3343, independent unconditional: 0, dependent: 121, dependent conditional: 121, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3464, independent: 3343, independent conditional: 0, independent unconditional: 3343, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3464, independent: 3343, independent conditional: 0, independent unconditional: 3343, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3464, independent: 3343, independent conditional: 0, independent unconditional: 3343, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1952, independent: 1905, independent conditional: 0, independent unconditional: 1905, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1952, independent: 1871, independent conditional: 0, independent unconditional: 1871, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 171, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3464, independent: 1438, independent conditional: 0, independent unconditional: 1438, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 1952, unknown conditional: 0, unknown unconditional: 1952] , Statistics on independence cache: Total cache size (in pairs): 3696, Positive cache size: 3649, Positive conditional cache size: 0, Positive unconditional cache size: 3649, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311, independent: 277, independent conditional: 277, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 311, independent: 277, independent conditional: 22, independent unconditional: 255, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 311, independent: 277, independent conditional: 22, independent unconditional: 255, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 311, independent: 277, independent conditional: 22, independent unconditional: 255, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 215, independent conditional: 19, independent unconditional: 196, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 66, dependent conditional: 22, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 311, independent: 62, independent conditional: 3, independent unconditional: 59, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 239, unknown conditional: 22, unknown unconditional: 217] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 215, Positive conditional cache size: 19, Positive unconditional cache size: 196, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 146, independent conditional: 18, independent unconditional: 128, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 225, Positive conditional cache size: 19, Positive unconditional cache size: 206, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 612 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 189, independent: 174, independent conditional: 174, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 189, independent: 174, independent conditional: 16, independent unconditional: 158, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 189, independent: 174, independent conditional: 0, independent unconditional: 174, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 189, independent: 174, independent conditional: 0, independent unconditional: 174, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 189, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 230, Positive conditional cache size: 19, Positive unconditional cache size: 211, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 202, independent: 186, independent conditional: 28, independent unconditional: 158, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 202, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 202, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 202, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 230, Positive conditional cache size: 19, Positive unconditional cache size: 211, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 53 PlacesBefore, 53 PlacesAfterwards, 57 TransitionsBefore, 56 TransitionsAfterwards, 972 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 452, independent: 426, independent conditional: 426, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 452, independent: 426, independent conditional: 194, independent unconditional: 232, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 452, independent: 426, independent conditional: 174, independent unconditional: 252, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 452, independent: 426, independent conditional: 174, independent unconditional: 252, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 452, independent: 421, independent conditional: 169, independent unconditional: 252, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 235, Positive conditional cache size: 24, Positive unconditional cache size: 211, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 722 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 99, independent conditional: 33, independent unconditional: 66, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 99, independent conditional: 27, independent unconditional: 72, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 99, independent conditional: 27, independent unconditional: 72, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 98, independent conditional: 27, independent unconditional: 71, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 236, Positive conditional cache size: 24, Positive unconditional cache size: 212, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 59 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 371, independent: 335, independent conditional: 335, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 371, independent: 335, independent conditional: 185, independent unconditional: 150, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 371, independent: 335, independent conditional: 151, independent unconditional: 184, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 371, independent: 335, independent conditional: 151, independent unconditional: 184, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 371, independent: 329, independent conditional: 146, independent unconditional: 183, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 242, Positive conditional cache size: 29, Positive unconditional cache size: 213, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 60 PlacesBefore, 58 PlacesAfterwards, 53 TransitionsBefore, 51 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 312, independent: 278, independent conditional: 278, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 312, independent: 278, independent conditional: 182, independent unconditional: 96, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 312, independent: 278, independent conditional: 126, independent unconditional: 152, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 312, independent: 278, independent conditional: 126, independent unconditional: 152, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 312, independent: 272, independent conditional: 120, independent unconditional: 152, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 257, Positive conditional cache size: 35, Positive unconditional cache size: 222, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 53 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 40 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 340, independent: 302, independent conditional: 302, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 340, independent: 302, independent conditional: 233, independent unconditional: 69, dependent: 38, dependent conditional: 28, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 368, independent: 302, independent conditional: 135, independent unconditional: 167, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 368, independent: 302, independent conditional: 135, independent unconditional: 167, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 368, independent: 297, independent conditional: 135, independent unconditional: 162, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 338, Positive cache size: 310, Positive conditional cache size: 36, Positive unconditional cache size: 274, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 154, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 43 PlacesBefore, 40 PlacesAfterwards, 39 TransitionsBefore, 36 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, independent: 131, independent conditional: 131, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 131, independent: 131, independent conditional: 121, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 131, independent: 131, independent conditional: 121, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 131, independent: 131, independent conditional: 121, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 131, independent: 120, independent conditional: 111, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 547, Positive cache size: 519, Positive conditional cache size: 49, Positive unconditional cache size: 470, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1004, ((void *)0), P0, ((void *)0))=-1, t1004={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1005, ((void *)0), P1, ((void *)0))=0, t1004={5:0}, t1005={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1006, ((void *)0), P2, ((void *)0))=1, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 z = 1 [L805] 3 __unbuffered_p2_EAX = z [L808] 3 __unbuffered_p2_EBX = a [L747] 3 a = 1 [L750] 3 x = 1 [L762] 3 x = 2 [L765] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 3 y$flush_delayed = weak$$choice2 [L768] 3 y$mem_tmp = y [L769] 3 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 3 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 3 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 3 __unbuffered_p1_EAX = y [L777] 3 y = y$flush_delayed ? y$mem_tmp : y [L778] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 861 IncrementalHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 11 mSDtfsCounter, 861 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:41:48,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...