/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:10:24,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:10:24,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:10:24,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:10:24,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:10:24,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:10:24,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:10:24,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:10:24,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:10:24,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:10:24,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:10:24,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:10:24,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:10:24,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:10:24,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:10:24,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:10:24,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:10:24,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:10:24,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:10:24,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:10:24,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:10:24,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:10:24,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:10:24,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:10:24,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:10:24,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:10:24,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:10:24,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:10:24,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:10:24,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:10:24,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:10:24,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:10:24,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:10:24,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:10:24,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:10:24,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:10:24,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:10:24,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:10:24,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:10:24,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:10:24,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:10:24,212 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:10:24,239 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:10:24,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:10:24,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:10:24,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:10:24,241 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:10:24,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:10:24,253 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:10:24,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:10:24,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:10:24,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:10:24,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:10:24,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:10:24,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:10:24,254 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:10:24,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:10:24,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:10:24,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:10:24,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:10:24,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:10:24,254 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:10:24,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:10:24,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:10:24,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:10:24,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:10:24,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:10:24,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:10:24,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:10:24,255 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:10:24,255 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-06 04:10:24,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:10:24,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:10:24,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:10:24,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:10:24,533 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:10:24,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2022-12-06 04:10:25,482 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:10:25,720 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:10:25,720 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2022-12-06 04:10:25,742 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f6add8a5/84cf7c78cac7483ab94372c0f55591cc/FLAGeed4dce33 [2022-12-06 04:10:25,754 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f6add8a5/84cf7c78cac7483ab94372c0f55591cc [2022-12-06 04:10:25,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:10:25,757 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:10:25,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:10:25,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:10:25,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:10:25,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:25" (1/1) ... [2022-12-06 04:10:25,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4acec209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:25, skipping insertion in model container [2022-12-06 04:10:25,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:25" (1/1) ... [2022-12-06 04:10:25,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:10:25,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:10:25,958 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/mix023_tso.i[944,957] [2022-12-06 04:10:26,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:10:26,183 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:10:26,192 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/mix023_tso.i[944,957] [2022-12-06 04:10:26,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:26,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:26,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:10:26,273 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:10:26,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26 WrapperNode [2022-12-06 04:10:26,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:10:26,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:10:26,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:10:26,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:10:26,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (1/1) ... [2022-12-06 04:10:26,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (1/1) ... [2022-12-06 04:10:26,338 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 274 [2022-12-06 04:10:26,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:10:26,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:10:26,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:10:26,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:10:26,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (1/1) ... [2022-12-06 04:10:26,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (1/1) ... [2022-12-06 04:10:26,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (1/1) ... [2022-12-06 04:10:26,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (1/1) ... [2022-12-06 04:10:26,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (1/1) ... [2022-12-06 04:10:26,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (1/1) ... [2022-12-06 04:10:26,367 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (1/1) ... [2022-12-06 04:10:26,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (1/1) ... [2022-12-06 04:10:26,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:10:26,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:10:26,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:10:26,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:10:26,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (1/1) ... [2022-12-06 04:10:26,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:10:26,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:10:26,404 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-06 04:10:26,414 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-06 04:10:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:10:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:10:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:10:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:10:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:10:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:10:26,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:10:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:10:26,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:10:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:10:26,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:10:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:10:26,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:10:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:10:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:10:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:10:26,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:10:26,444 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:10:26,608 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:10:26,609 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:10:27,007 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:10:27,187 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:10:27,187 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:10:27,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:10:27 BoogieIcfgContainer [2022-12-06 04:10:27,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:10:27,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:10:27,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:10:27,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:10:27,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:10:25" (1/3) ... [2022-12-06 04:10:27,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba36145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:10:27, skipping insertion in model container [2022-12-06 04:10:27,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:26" (2/3) ... [2022-12-06 04:10:27,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba36145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:10:27, skipping insertion in model container [2022-12-06 04:10:27,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:10:27" (3/3) ... [2022-12-06 04:10:27,197 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2022-12-06 04:10:27,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:10:27,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-06 04:10:27,211 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:10:27,255 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:10:27,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-12-06 04:10:27,342 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-12-06 04:10:27,342 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:27,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-06 04:10:27,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2022-12-06 04:10:27,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2022-12-06 04:10:27,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:27,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2022-12-06 04:10:27,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2022-12-06 04:10:27,422 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-12-06 04:10:27,422 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:27,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-06 04:10:27,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2022-12-06 04:10:27,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 3392 [2022-12-06 04:10:34,819 INFO L203 LiptonReduction]: Total number of compositions: 115 [2022-12-06 04:10:34,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:10:34,842 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;@24936d46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:10:34,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-12-06 04:10:34,846 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 04:10:34,869 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:34,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:34,870 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:10:34,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:10:34,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:34,874 INFO L85 PathProgramCache]: Analyzing trace with hash 739307433, now seen corresponding path program 1 times [2022-12-06 04:10:34,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:34,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610668687] [2022-12-06 04:10:34,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:35,159 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-06 04:10:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:35,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610668687] [2022-12-06 04:10:35,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610668687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:35,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:35,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:35,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845674171] [2022-12-06 04:10:35,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:35,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:35,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:35,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:35,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:35,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2022-12-06 04:10:35,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 04:10:35,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:35,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2022-12-06 04:10:35,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:37,031 INFO L130 PetriNetUnfolder]: 9196/13070 cut-off events. [2022-12-06 04:10:37,032 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-12-06 04:10:37,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25671 conditions, 13070 events. 9196/13070 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 78670 event pairs, 1336 based on Foata normal form. 0/11501 useless extension candidates. Maximal degree in co-relation 25659. Up to 10405 conditions per place. [2022-12-06 04:10:37,099 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 46 selfloop transitions, 2 changer transitions 4/56 dead transitions. [2022-12-06 04:10:37,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 234 flow [2022-12-06 04:10:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-06 04:10:37,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2022-12-06 04:10:37,110 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 3 states and 69 transitions. [2022-12-06 04:10:37,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 234 flow [2022-12-06 04:10:37,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:10:37,116 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 76 flow [2022-12-06 04:10:37,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-12-06 04:10:37,121 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2022-12-06 04:10:37,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:37,122 INFO L89 Accepts]: Start accepts. Operand has 45 places, 32 transitions, 76 flow [2022-12-06 04:10:37,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:37,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:37,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 76 flow [2022-12-06 04:10:37,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 76 flow [2022-12-06 04:10:37,140 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-06 04:10:37,140 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:37,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:10:37,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 76 flow [2022-12-06 04:10:37,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-06 04:10:37,249 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:37,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-06 04:10:37,252 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2022-12-06 04:10:37,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 04:10:37,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:37,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:37,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:10:37,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:10:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash -628071039, now seen corresponding path program 1 times [2022-12-06 04:10:37,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:37,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373689431] [2022-12-06 04:10:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:37,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:37,373 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-06 04:10:37,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:37,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373689431] [2022-12-06 04:10:37,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373689431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:37,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:37,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658366438] [2022-12-06 04:10:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:37,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:37,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:37,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:37,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:37,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-06 04:10:37,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-06 04:10:37,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:37,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-06 04:10:37,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:38,794 INFO L130 PetriNetUnfolder]: 7477/10607 cut-off events. [2022-12-06 04:10:38,794 INFO L131 PetriNetUnfolder]: For 517/517 co-relation queries the response was YES. [2022-12-06 04:10:38,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21427 conditions, 10607 events. 7477/10607 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 60076 event pairs, 1461 based on Foata normal form. 0/9786 useless extension candidates. Maximal degree in co-relation 21417. Up to 7937 conditions per place. [2022-12-06 04:10:38,837 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 36 selfloop transitions, 2 changer transitions 4/46 dead transitions. [2022-12-06 04:10:38,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 190 flow [2022-12-06 04:10:38,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 04:10:38,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2022-12-06 04:10:38,839 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 3 states and 55 transitions. [2022-12-06 04:10:38,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 190 flow [2022-12-06 04:10:38,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:38,842 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2022-12-06 04:10:38,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-06 04:10:38,843 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2022-12-06 04:10:38,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:38,843 INFO L89 Accepts]: Start accepts. Operand has 42 places, 29 transitions, 70 flow [2022-12-06 04:10:38,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:38,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:38,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 70 flow [2022-12-06 04:10:38,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 70 flow [2022-12-06 04:10:38,848 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 04:10:38,848 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:38,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:10:38,849 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 70 flow [2022-12-06 04:10:38,849 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 04:10:38,867 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:38,868 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 04:10:38,869 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2022-12-06 04:10:38,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-06 04:10:38,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:38,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:38,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:10:38,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:10:38,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:38,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2014090829, now seen corresponding path program 1 times [2022-12-06 04:10:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:38,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534446874] [2022-12-06 04:10:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:47,902 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-06 04:10:47,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:47,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534446874] [2022-12-06 04:10:47,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534446874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:47,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:47,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969813082] [2022-12-06 04:10:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:47,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:47,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:47,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:47,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:10:47,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 04:10:47,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:47,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:10:47,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:49,206 INFO L130 PetriNetUnfolder]: 10667/14338 cut-off events. [2022-12-06 04:10:49,206 INFO L131 PetriNetUnfolder]: For 530/530 co-relation queries the response was YES. [2022-12-06 04:10:49,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29602 conditions, 14338 events. 10667/14338 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 69489 event pairs, 3035 based on Foata normal form. 300/14638 useless extension candidates. Maximal degree in co-relation 29592. Up to 10723 conditions per place. [2022-12-06 04:10:49,260 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 46 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2022-12-06 04:10:49,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 210 flow [2022-12-06 04:10:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 04:10:49,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2022-12-06 04:10:49,262 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 49 transitions. [2022-12-06 04:10:49,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 210 flow [2022-12-06 04:10:49,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:49,265 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 74 flow [2022-12-06 04:10:49,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-12-06 04:10:49,266 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2022-12-06 04:10:49,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:49,266 INFO L89 Accepts]: Start accepts. Operand has 41 places, 29 transitions, 74 flow [2022-12-06 04:10:49,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:49,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:49,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 74 flow [2022-12-06 04:10:49,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 74 flow [2022-12-06 04:10:49,271 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 04:10:49,271 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:49,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:10:49,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 74 flow [2022-12-06 04:10:49,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 04:10:49,273 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:49,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 04:10:49,274 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 74 flow [2022-12-06 04:10:49,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 04:10:49,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:49,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:49,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:10:49,274 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:10:49,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:49,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1706598062, now seen corresponding path program 1 times [2022-12-06 04:10:49,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:49,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158302795] [2022-12-06 04:10:49,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:49,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:49,502 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-06 04:10:49,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:49,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158302795] [2022-12-06 04:10:49,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158302795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:49,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:49,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120263313] [2022-12-06 04:10:49,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:49,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:49,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 04:10:49,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:49,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:49,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 04:10:49,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:50,062 INFO L130 PetriNetUnfolder]: 4165/5999 cut-off events. [2022-12-06 04:10:50,062 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2022-12-06 04:10:50,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12636 conditions, 5999 events. 4165/5999 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 31299 event pairs, 1717 based on Foata normal form. 96/6074 useless extension candidates. Maximal degree in co-relation 12625. Up to 3409 conditions per place. [2022-12-06 04:10:50,086 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 35 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-12-06 04:10:50,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 175 flow [2022-12-06 04:10:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 04:10:50,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2022-12-06 04:10:50,087 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 74 flow. Second operand 3 states and 50 transitions. [2022-12-06 04:10:50,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 175 flow [2022-12-06 04:10:50,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:50,089 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 78 flow [2022-12-06 04:10:50,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-06 04:10:50,089 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2022-12-06 04:10:50,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:50,089 INFO L89 Accepts]: Start accepts. Operand has 42 places, 29 transitions, 78 flow [2022-12-06 04:10:50,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:50,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:50,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 78 flow [2022-12-06 04:10:50,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 29 transitions, 78 flow [2022-12-06 04:10:50,095 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 04:10:50,095 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:10:50,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 29 events. 0/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:10:50,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 29 transitions, 78 flow [2022-12-06 04:10:50,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 04:10:50,096 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:50,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 04:10:50,097 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 78 flow [2022-12-06 04:10:50,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:50,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:50,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:50,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:10:50,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:10:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 70466623, now seen corresponding path program 1 times [2022-12-06 04:10:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:50,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705546904] [2022-12-06 04:10:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:50,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:50,394 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-06 04:10:50,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:50,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705546904] [2022-12-06 04:10:50,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705546904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:50,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:50,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982877487] [2022-12-06 04:10:50,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:50,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:50,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:50,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:50,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 04:10:50,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:50,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:50,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 04:10:50,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:50,885 INFO L130 PetriNetUnfolder]: 2869/4165 cut-off events. [2022-12-06 04:10:50,886 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2022-12-06 04:10:50,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9239 conditions, 4165 events. 2869/4165 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 21052 event pairs, 739 based on Foata normal form. 144/4284 useless extension candidates. Maximal degree in co-relation 9227. Up to 3399 conditions per place. [2022-12-06 04:10:50,907 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2022-12-06 04:10:50,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 218 flow [2022-12-06 04:10:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-06 04:10:50,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 04:10:50,909 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 78 flow. Second operand 3 states and 58 transitions. [2022-12-06 04:10:50,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 218 flow [2022-12-06 04:10:50,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:50,913 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 107 flow [2022-12-06 04:10:50,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-06 04:10:50,914 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2022-12-06 04:10:50,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:50,914 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 107 flow [2022-12-06 04:10:50,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:50,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:50,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 107 flow [2022-12-06 04:10:50,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 107 flow [2022-12-06 04:10:50,932 INFO L130 PetriNetUnfolder]: 45/127 cut-off events. [2022-12-06 04:10:50,933 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 04:10:50,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 127 events. 45/127 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 516 event pairs, 23 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 242. Up to 76 conditions per place. [2022-12-06 04:10:50,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 107 flow [2022-12-06 04:10:50,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-06 04:10:51,067 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:51,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-06 04:10:51,069 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 107 flow [2022-12-06 04:10:51,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:51,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:51,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:51,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:10:51,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:10:51,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:51,070 INFO L85 PathProgramCache]: Analyzing trace with hash 589358696, now seen corresponding path program 1 times [2022-12-06 04:10:51,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:51,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341775518] [2022-12-06 04:10:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:51,357 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-06 04:10:51,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:51,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341775518] [2022-12-06 04:10:51,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341775518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:51,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:51,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732407916] [2022-12-06 04:10:51,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:51,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:51,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:51,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:51,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 04:10:51,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-06 04:10:51,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:51,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 04:10:51,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:51,688 INFO L130 PetriNetUnfolder]: 1681/2581 cut-off events. [2022-12-06 04:10:51,688 INFO L131 PetriNetUnfolder]: For 329/329 co-relation queries the response was YES. [2022-12-06 04:10:51,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6608 conditions, 2581 events. 1681/2581 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12971 event pairs, 498 based on Foata normal form. 168/2724 useless extension candidates. Maximal degree in co-relation 6595. Up to 1023 conditions per place. [2022-12-06 04:10:51,701 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2022-12-06 04:10:51,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 323 flow [2022-12-06 04:10:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-06 04:10:51,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2022-12-06 04:10:51,703 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 107 flow. Second operand 4 states and 80 transitions. [2022-12-06 04:10:51,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 323 flow [2022-12-06 04:10:51,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:51,706 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 154 flow [2022-12-06 04:10:51,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-06 04:10:51,706 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2022-12-06 04:10:51,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:51,706 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 154 flow [2022-12-06 04:10:51,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:51,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:51,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 154 flow [2022-12-06 04:10:51,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 154 flow [2022-12-06 04:10:51,719 INFO L130 PetriNetUnfolder]: 33/103 cut-off events. [2022-12-06 04:10:51,719 INFO L131 PetriNetUnfolder]: For 29/44 co-relation queries the response was YES. [2022-12-06 04:10:51,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 103 events. 33/103 cut-off events. For 29/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 333 event pairs, 7 based on Foata normal form. 4/104 useless extension candidates. Maximal degree in co-relation 261. Up to 60 conditions per place. [2022-12-06 04:10:51,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 154 flow [2022-12-06 04:10:51,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 626 [2022-12-06 04:10:51,807 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:51,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 04:10:51,807 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 154 flow [2022-12-06 04:10:51,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-06 04:10:51,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:51,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:51,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:10:51,808 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:10:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash -74390886, now seen corresponding path program 1 times [2022-12-06 04:10:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:51,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479225816] [2022-12-06 04:10:51,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:52,170 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-06 04:10:52,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:52,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479225816] [2022-12-06 04:10:52,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479225816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:52,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:52,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:52,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636060103] [2022-12-06 04:10:52,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:52,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:52,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:52,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:52,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:52,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 04:10:52,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:52,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:52,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 04:10:52,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:52,457 INFO L130 PetriNetUnfolder]: 1315/2032 cut-off events. [2022-12-06 04:10:52,457 INFO L131 PetriNetUnfolder]: For 1336/1336 co-relation queries the response was YES. [2022-12-06 04:10:52,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5670 conditions, 2032 events. 1315/2032 cut-off events. For 1336/1336 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9903 event pairs, 456 based on Foata normal form. 73/2080 useless extension candidates. Maximal degree in co-relation 5655. Up to 792 conditions per place. [2022-12-06 04:10:52,468 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 66 selfloop transitions, 13 changer transitions 0/83 dead transitions. [2022-12-06 04:10:52,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 83 transitions, 438 flow [2022-12-06 04:10:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:10:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:10:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-06 04:10:52,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2022-12-06 04:10:52,471 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 154 flow. Second operand 5 states and 100 transitions. [2022-12-06 04:10:52,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 83 transitions, 438 flow [2022-12-06 04:10:52,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 420 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:52,476 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 204 flow [2022-12-06 04:10:52,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2022-12-06 04:10:52,477 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2022-12-06 04:10:52,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:52,477 INFO L89 Accepts]: Start accepts. Operand has 49 places, 41 transitions, 204 flow [2022-12-06 04:10:52,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:52,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:52,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 41 transitions, 204 flow [2022-12-06 04:10:52,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 204 flow [2022-12-06 04:10:52,491 INFO L130 PetriNetUnfolder]: 21/73 cut-off events. [2022-12-06 04:10:52,492 INFO L131 PetriNetUnfolder]: For 60/75 co-relation queries the response was YES. [2022-12-06 04:10:52,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 73 events. 21/73 cut-off events. For 60/75 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 168 event pairs, 1 based on Foata normal form. 4/74 useless extension candidates. Maximal degree in co-relation 212. Up to 38 conditions per place. [2022-12-06 04:10:52,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 204 flow [2022-12-06 04:10:52,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 626 [2022-12-06 04:10:52,494 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:52,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 04:10:52,495 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 204 flow [2022-12-06 04:10:52,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:52,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:52,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:52,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:10:52,496 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:10:52,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash -100250155, now seen corresponding path program 1 times [2022-12-06 04:10:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:52,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436238587] [2022-12-06 04:10:52,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:52,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:52,721 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-06 04:10:52,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:52,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436238587] [2022-12-06 04:10:52,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436238587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:52,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:52,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104032521] [2022-12-06 04:10:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:52,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:52,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:52,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 04:10:52,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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-06 04:10:52,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:52,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 04:10:52,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:53,059 INFO L130 PetriNetUnfolder]: 1862/2868 cut-off events. [2022-12-06 04:10:53,059 INFO L131 PetriNetUnfolder]: For 2657/2657 co-relation queries the response was YES. [2022-12-06 04:10:53,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8352 conditions, 2868 events. 1862/2868 cut-off events. For 2657/2657 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14468 event pairs, 471 based on Foata normal form. 10/2873 useless extension candidates. Maximal degree in co-relation 8336. Up to 1759 conditions per place. [2022-12-06 04:10:53,071 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 65 selfloop transitions, 2 changer transitions 23/93 dead transitions. [2022-12-06 04:10:53,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 663 flow [2022-12-06 04:10:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 04:10:53,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6293103448275862 [2022-12-06 04:10:53,073 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 204 flow. Second operand 4 states and 73 transitions. [2022-12-06 04:10:53,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 663 flow [2022-12-06 04:10:53,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 93 transitions, 573 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-06 04:10:53,088 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 183 flow [2022-12-06 04:10:53,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=170, 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=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-06 04:10:53,088 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2022-12-06 04:10:53,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:53,088 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 183 flow [2022-12-06 04:10:53,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:53,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:53,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 183 flow [2022-12-06 04:10:53,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 183 flow [2022-12-06 04:10:53,100 INFO L130 PetriNetUnfolder]: 41/122 cut-off events. [2022-12-06 04:10:53,100 INFO L131 PetriNetUnfolder]: For 111/127 co-relation queries the response was YES. [2022-12-06 04:10:53,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 122 events. 41/122 cut-off events. For 111/127 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 436 event pairs, 2 based on Foata normal form. 6/120 useless extension candidates. Maximal degree in co-relation 311. Up to 52 conditions per place. [2022-12-06 04:10:53,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 183 flow [2022-12-06 04:10:53,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 04:10:53,114 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:53,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 04:10:53,115 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 183 flow [2022-12-06 04:10:53,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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-06 04:10:53,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:53,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:53,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:10:53,115 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:10:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash 154593167, now seen corresponding path program 2 times [2022-12-06 04:10:53,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:53,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081677146] [2022-12-06 04:10:53,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:53,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:53,427 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-06 04:10:53,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:53,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081677146] [2022-12-06 04:10:53,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081677146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:53,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:53,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:10:53,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182461390] [2022-12-06 04:10:53,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:53,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:53,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:53,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:53,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:53,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 04:10:53,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:53,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:53,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 04:10:53,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:53,761 INFO L130 PetriNetUnfolder]: 1636/2510 cut-off events. [2022-12-06 04:10:53,761 INFO L131 PetriNetUnfolder]: For 1688/1688 co-relation queries the response was YES. [2022-12-06 04:10:53,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6951 conditions, 2510 events. 1636/2510 cut-off events. For 1688/1688 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12979 event pairs, 533 based on Foata normal form. 25/2508 useless extension candidates. Maximal degree in co-relation 6934. Up to 1015 conditions per place. [2022-12-06 04:10:53,771 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 17 changer transitions 9/84 dead transitions. [2022-12-06 04:10:53,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 452 flow [2022-12-06 04:10:53,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-06 04:10:53,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2022-12-06 04:10:53,773 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 183 flow. Second operand 6 states and 104 transitions. [2022-12-06 04:10:53,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 452 flow [2022-12-06 04:10:53,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 434 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 04:10:53,790 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 212 flow [2022-12-06 04:10:53,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2022-12-06 04:10:53,791 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2022-12-06 04:10:53,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:53,791 INFO L89 Accepts]: Start accepts. Operand has 54 places, 41 transitions, 212 flow [2022-12-06 04:10:53,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:53,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:53,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 41 transitions, 212 flow [2022-12-06 04:10:53,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 41 transitions, 212 flow [2022-12-06 04:10:53,799 INFO L130 PetriNetUnfolder]: 21/68 cut-off events. [2022-12-06 04:10:53,799 INFO L131 PetriNetUnfolder]: For 77/88 co-relation queries the response was YES. [2022-12-06 04:10:53,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 68 events. 21/68 cut-off events. For 77/88 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 0 based on Foata normal form. 1/64 useless extension candidates. Maximal degree in co-relation 197. Up to 22 conditions per place. [2022-12-06 04:10:53,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 41 transitions, 212 flow [2022-12-06 04:10:53,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-06 04:11:02,799 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:11:02,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9009 [2022-12-06 04:11:02,800 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 206 flow [2022-12-06 04:11:02,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:02,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:02,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:02,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:11:02,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:11:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:02,801 INFO L85 PathProgramCache]: Analyzing trace with hash -900520884, now seen corresponding path program 1 times [2022-12-06 04:11:02,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:02,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854248020] [2022-12-06 04:11:02,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:02,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:04,077 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-06 04:11:04,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:04,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854248020] [2022-12-06 04:11:04,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854248020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:04,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:04,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 04:11:04,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053613600] [2022-12-06 04:11:04,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:04,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 04:11:04,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 04:11:04,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 04:11:04,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 04:11:04,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 206 flow. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-06 04:11:04,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:04,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 04:11:04,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:04,852 INFO L130 PetriNetUnfolder]: 2834/4429 cut-off events. [2022-12-06 04:11:04,852 INFO L131 PetriNetUnfolder]: For 5513/5513 co-relation queries the response was YES. [2022-12-06 04:11:04,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13093 conditions, 4429 events. 2834/4429 cut-off events. For 5513/5513 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 24882 event pairs, 149 based on Foata normal form. 1/4413 useless extension candidates. Maximal degree in co-relation 13076. Up to 1057 conditions per place. [2022-12-06 04:11:04,867 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 98 selfloop transitions, 20 changer transitions 59/180 dead transitions. [2022-12-06 04:11:04,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 180 transitions, 1297 flow [2022-12-06 04:11:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 04:11:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 04:11:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2022-12-06 04:11:04,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2022-12-06 04:11:04,869 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 206 flow. Second operand 10 states and 150 transitions. [2022-12-06 04:11:04,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 180 transitions, 1297 flow [2022-12-06 04:11:04,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 180 transitions, 1084 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-12-06 04:11:04,902 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 291 flow [2022-12-06 04:11:04,903 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=291, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2022-12-06 04:11:04,903 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2022-12-06 04:11:04,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:04,903 INFO L89 Accepts]: Start accepts. Operand has 59 places, 55 transitions, 291 flow [2022-12-06 04:11:04,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:04,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:04,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 55 transitions, 291 flow [2022-12-06 04:11:04,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 55 transitions, 291 flow [2022-12-06 04:11:04,968 INFO L130 PetriNetUnfolder]: 360/815 cut-off events. [2022-12-06 04:11:04,968 INFO L131 PetriNetUnfolder]: For 1565/1669 co-relation queries the response was YES. [2022-12-06 04:11:04,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 815 events. 360/815 cut-off events. For 1565/1669 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5395 event pairs, 75 based on Foata normal form. 48/824 useless extension candidates. Maximal degree in co-relation 2644. Up to 254 conditions per place. [2022-12-06 04:11:04,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 55 transitions, 291 flow [2022-12-06 04:11:04,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-06 04:11:05,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L801: Formula: (and (= (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_230 256))) (not (= (mod v_~x$w_buff0_used~0_253 256) 0)))) 1 0) |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff1_thd2~0_71 v_~x$r_buff0_thd2~0_93) (= v_~x$r_buff1_thd1~0_33 v_~x$r_buff0_thd1~0_37) (= v_~x$r_buff1_thd3~0_37 v_~x$r_buff0_thd3~0_37) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_91 v_~x$r_buff0_thd0~0_93) (= v_~x$w_buff0_used~0_254 v_~x$w_buff1_used~0_230) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$r_buff1_thd4~0_51 v_~x$r_buff0_thd4~0_51) (= v_~x$r_buff0_thd2~0_92 1) (= v_~x$w_buff0~0_130 v_~x$w_buff1~0_112) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= 2 v_~x$w_buff0~0_129) (= v_~x$w_buff0_used~0_253 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_93, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_254} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_129, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_71, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_230, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_33, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_92, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_253, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] and [596] L840-->L852: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_153 256) 0))) (.cse10 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse6 (not (= (mod v_~x$w_buff0_used~0_207 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0)))) (let ((.cse1 (and .cse6 .cse11)) (.cse4 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_145 256) 0)))) (.cse7 (and .cse8 .cse10)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_208 256) 0)) .cse11)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_197 256) 0)) .cse5)) (.cse3 (and .cse10 (not (= (mod v_~z$w_buff0_used~0_154 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_208) v_~x$w_buff0_used~0_207) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_197) v_~x$w_buff1_used~0_196) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= v_~z~0_147 (ite .cse3 v_~z$w_buff0~0_87 (ite .cse4 v_~z$w_buff1~0_78 v_~z~0_148))) (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse5 (not (= (mod v_~x$w_buff1_used~0_196 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse6)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse7 0 v_~z$r_buff0_thd3~0_38) v_~z$r_buff0_thd3~0_37) (= v_~z$w_buff1_used~0_144 (ite (or .cse4 .cse7) 0 v_~z$w_buff1_used~0_145)) (= (ite .cse0 v_~x$w_buff0~0_93 (ite .cse2 v_~x$w_buff1~0_88 v_~x~0_144)) v_~x~0_143) (= (ite (or (and .cse8 (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_144 256) 0)) .cse9)) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33) (= v_~z$w_buff0_used~0_153 (ite .cse3 0 v_~z$w_buff0_used~0_154))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_154, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_145, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_197, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_208, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_144} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_153, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_144, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_196, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_207, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_143} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:11:05,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L801: Formula: (and (= (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_230 256))) (not (= (mod v_~x$w_buff0_used~0_253 256) 0)))) 1 0) |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff1_thd2~0_71 v_~x$r_buff0_thd2~0_93) (= v_~x$r_buff1_thd1~0_33 v_~x$r_buff0_thd1~0_37) (= v_~x$r_buff1_thd3~0_37 v_~x$r_buff0_thd3~0_37) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_91 v_~x$r_buff0_thd0~0_93) (= v_~x$w_buff0_used~0_254 v_~x$w_buff1_used~0_230) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$r_buff1_thd4~0_51 v_~x$r_buff0_thd4~0_51) (= v_~x$r_buff0_thd2~0_92 1) (= v_~x$w_buff0~0_130 v_~x$w_buff1~0_112) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= 2 v_~x$w_buff0~0_129) (= v_~x$w_buff0_used~0_253 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_93, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_254} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_129, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_71, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_230, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_33, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_92, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_253, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] and [746] $Ultimate##0-->L872: Formula: (and (= v_~z$r_buff0_thd4~0_142 1) (= v_~z$w_buff0~0_217 2) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_317 256) 0)) (not (= (mod v_~z$w_buff1_used~0_290 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_25|) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_63) (= v_~z$r_buff0_thd2~0_33 v_~z$r_buff1_thd2~0_29) (= v_~z$w_buff0_used~0_318 v_~z$w_buff1_used~0_290) (= v_~z$w_buff0~0_218 v_~z$w_buff1~0_195) (= v_~z$r_buff0_thd0~0_154 v_~z$r_buff1_thd0~0_146) (= v_~z$r_buff0_thd4~0_143 v_~z$r_buff1_thd4~0_125) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_25) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_25| 0)) (= v_~z$w_buff0_used~0_317 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_25| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_25|)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_154, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_318, ~z$w_buff0~0=v_~z$w_buff0~0_218, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_143, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_33} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_125, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_317, ~z$w_buff0~0=v_~z$w_buff0~0_217, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_290, ~z$w_buff1~0=v_~z$w_buff1~0_195, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_25|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_25|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_154, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_146, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_142, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_33} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] [2022-12-06 04:11:05,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:11:05,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 937 [2022-12-06 04:11:05,840 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 293 flow [2022-12-06 04:11:05,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-06 04:11:05,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:05,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:05,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:11:05,840 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:11:05,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:05,841 INFO L85 PathProgramCache]: Analyzing trace with hash 60478779, now seen corresponding path program 1 times [2022-12-06 04:11:05,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:05,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883784845] [2022-12-06 04:11:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:05,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:06,083 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-06 04:11:06,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:06,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883784845] [2022-12-06 04:11:06,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883784845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:06,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:06,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:06,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906273247] [2022-12-06 04:11:06,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:06,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:06,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:06,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:06,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:06,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 04:11:06,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:06,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:06,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 04:11:06,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:06,692 INFO L130 PetriNetUnfolder]: 3336/5426 cut-off events. [2022-12-06 04:11:06,692 INFO L131 PetriNetUnfolder]: For 14076/14079 co-relation queries the response was YES. [2022-12-06 04:11:06,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20809 conditions, 5426 events. 3336/5426 cut-off events. For 14076/14079 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 34840 event pairs, 350 based on Foata normal form. 3/5379 useless extension candidates. Maximal degree in co-relation 20788. Up to 2891 conditions per place. [2022-12-06 04:11:06,712 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 71 selfloop transitions, 1 changer transitions 44/118 dead transitions. [2022-12-06 04:11:06,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 118 transitions, 887 flow [2022-12-06 04:11:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 04:11:06,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2022-12-06 04:11:06,716 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 293 flow. Second operand 4 states and 65 transitions. [2022-12-06 04:11:06,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 118 transitions, 887 flow [2022-12-06 04:11:06,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 118 transitions, 857 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:06,800 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 276 flow [2022-12-06 04:11:06,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2022-12-06 04:11:06,801 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2022-12-06 04:11:06,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:06,801 INFO L89 Accepts]: Start accepts. Operand has 59 places, 52 transitions, 276 flow [2022-12-06 04:11:06,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:06,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:06,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 52 transitions, 276 flow [2022-12-06 04:11:06,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 276 flow [2022-12-06 04:11:06,876 INFO L130 PetriNetUnfolder]: 384/899 cut-off events. [2022-12-06 04:11:06,876 INFO L131 PetriNetUnfolder]: For 1556/1685 co-relation queries the response was YES. [2022-12-06 04:11:06,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 899 events. 384/899 cut-off events. For 1556/1685 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6427 event pairs, 60 based on Foata normal form. 57/896 useless extension candidates. Maximal degree in co-relation 2643. Up to 275 conditions per place. [2022-12-06 04:11:06,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 52 transitions, 276 flow [2022-12-06 04:11:06,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-06 04:11:06,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [589] L820-->L827: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd2~0_40 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_53 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_165 256) 0)))) (let ((.cse4 (and .cse5 .cse1)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_166 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_153 256) 0)) .cse2))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_166) v_~x$w_buff0_used~0_165) (= v_~x$r_buff1_thd2~0_39 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_52 256) 0)) .cse1) (and (not (= 0 (mod v_~x$w_buff1_used~0_152 256))) .cse2)) 0 v_~x$r_buff1_thd2~0_40)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_153) v_~x$w_buff1_used~0_152) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_53) v_~x$r_buff0_thd2~0_52) (= (ite .cse0 v_~x$w_buff0~0_65 (ite .cse3 v_~x$w_buff1~0_60 v_~x~0_102)) v_~x~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$w_buff1~0=v_~x$w_buff1~0_60, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_40, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_153, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_53, ~x~0=v_~x~0_102, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_166} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$w_buff1~0=v_~x$w_buff1~0_60, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_39, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_152, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_52, ~x~0=v_~x~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_165} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [751] $Ultimate##0-->L774: Formula: (and (= v_~a~0_49 1) (= v_~x~0_722 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|} OutVars{~a~0=v_~a~0_49, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_722, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 04:11:06,973 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [596] L840-->L852: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_153 256) 0))) (.cse10 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse6 (not (= (mod v_~x$w_buff0_used~0_207 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0)))) (let ((.cse1 (and .cse6 .cse11)) (.cse4 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_145 256) 0)))) (.cse7 (and .cse8 .cse10)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_208 256) 0)) .cse11)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_197 256) 0)) .cse5)) (.cse3 (and .cse10 (not (= (mod v_~z$w_buff0_used~0_154 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_208) v_~x$w_buff0_used~0_207) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_197) v_~x$w_buff1_used~0_196) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= v_~z~0_147 (ite .cse3 v_~z$w_buff0~0_87 (ite .cse4 v_~z$w_buff1~0_78 v_~z~0_148))) (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse5 (not (= (mod v_~x$w_buff1_used~0_196 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse6)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse7 0 v_~z$r_buff0_thd3~0_38) v_~z$r_buff0_thd3~0_37) (= v_~z$w_buff1_used~0_144 (ite (or .cse4 .cse7) 0 v_~z$w_buff1_used~0_145)) (= (ite .cse0 v_~x$w_buff0~0_93 (ite .cse2 v_~x$w_buff1~0_88 v_~x~0_144)) v_~x~0_143) (= (ite (or (and .cse8 (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_144 256) 0)) .cse9)) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33) (= v_~z$w_buff0_used~0_153 (ite .cse3 0 v_~z$w_buff0_used~0_154))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_154, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_145, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_197, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_208, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_144} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_153, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_144, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_196, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_207, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_143} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0] and [751] $Ultimate##0-->L774: Formula: (and (= v_~a~0_49 1) (= v_~x~0_722 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|} OutVars{~a~0=v_~a~0_49, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_722, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 04:11:07,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L801-->L817: Formula: (let ((.cse9 (= (mod v_~x$r_buff1_thd2~0_50 256) 0)) (.cse2 (= (mod v_~x$r_buff0_thd2~0_63 256) 0))) (let ((.cse5 (not .cse2)) (.cse3 (and .cse2 .cse9)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_177 256) 0) .cse2)) (.cse12 (= (mod v_~x$w_buff0_used~0_190 256) 0))) (let ((.cse10 (or .cse3 .cse6 .cse12)) (.cse11 (and (not .cse12) .cse5))) (let ((.cse1 (= (mod v_~x$w_buff1_used~0_176 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_189 256) 0)) (.cse7 (ite .cse10 v_~x~0_127 (ite .cse11 v_~x$w_buff0~0_82 v_~x$w_buff1~0_77))) (.cse0 (not (= (mod v_~weak$$choice2~0_124 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd2~0_63 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~x$r_buff0_thd2~0_63 (ite (and (not .cse4) .cse5) 0 v_~x$r_buff0_thd2~0_63))) v_~x$r_buff0_thd2~0_62) (= (ite .cse0 v_~x$w_buff1_used~0_177 (ite (or .cse3 .cse6 .cse4) v_~x$w_buff1_used~0_177 0)) v_~x$w_buff1_used~0_176) (= v_~x$mem_tmp~0_44 v_~x~0_127) (= v_~x$w_buff1~0_77 v_~x$w_buff1~0_76) (= v_~x$w_buff0~0_82 v_~x$w_buff0~0_81) (= .cse7 v_~__unbuffered_p1_EAX~0_20) (= v_~x$r_buff1_thd2~0_49 (ite .cse0 v_~x$r_buff1_thd2~0_50 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd2~0_62 256) 0))) (or (and .cse1 .cse8) .cse4 (and .cse8 .cse9))) v_~x$r_buff1_thd2~0_50 0))) (= v_~weak$$choice0~0_34 |v_P1Thread1of1ForFork3_#t~nondet3#1_1|) (= (ite .cse0 v_~x$mem_tmp~0_44 .cse7) v_~x~0_125) (= v_~x$flush_delayed~0_54 0) (= (ite .cse0 v_~x$w_buff0_used~0_190 (ite .cse10 v_~x$w_buff0_used~0_190 (ite .cse11 0 v_~x$w_buff0_used~0_190))) v_~x$w_buff0_used~0_189) (= v_~weak$$choice2~0_124 |v_P1Thread1of1ForFork3_#t~nondet4#1_1|)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_82, P1Thread1of1ForFork3_#t~nondet3#1=|v_P1Thread1of1ForFork3_#t~nondet3#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_77, P1Thread1of1ForFork3_#t~nondet4#1=|v_P1Thread1of1ForFork3_#t~nondet4#1_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_177, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_190} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_81, ~x$flush_delayed~0=v_~x$flush_delayed~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_176, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_189, ~weak$$choice0~0=v_~weak$$choice0~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_124, ~x~0=v_~x~0_125} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_#t~nondet3#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#t~nondet4#1, ~weak$$choice2~0, ~x~0] and [751] $Ultimate##0-->L774: Formula: (and (= v_~a~0_49 1) (= v_~x~0_722 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|} OutVars{~a~0=v_~a~0_49, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_722, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 04:11:07,340 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:11:07,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 540 [2022-12-06 04:11:07,341 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 283 flow [2022-12-06 04:11:07,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:07,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:07,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:07,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:11:07,341 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:11:07,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1962687432, now seen corresponding path program 1 times [2022-12-06 04:11:07,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:07,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560852834] [2022-12-06 04:11:07,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:07,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:08,643 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-06 04:11:08,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:08,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560852834] [2022-12-06 04:11:08,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560852834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:08,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:08,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:11:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87333748] [2022-12-06 04:11:08,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:08,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:11:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:08,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:11:08,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:11:08,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 04:11:08,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 283 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-06 04:11:08,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:08,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 04:11:08,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:09,961 INFO L130 PetriNetUnfolder]: 4193/6945 cut-off events. [2022-12-06 04:11:09,961 INFO L131 PetriNetUnfolder]: For 14093/14094 co-relation queries the response was YES. [2022-12-06 04:11:09,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26784 conditions, 6945 events. 4193/6945 cut-off events. For 14093/14094 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 47086 event pairs, 433 based on Foata normal form. 2/6853 useless extension candidates. Maximal degree in co-relation 26762. Up to 2305 conditions per place. [2022-12-06 04:11:09,988 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 121 selfloop transitions, 22 changer transitions 52/197 dead transitions. [2022-12-06 04:11:09,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 197 transitions, 1523 flow [2022-12-06 04:11:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 04:11:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 04:11:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2022-12-06 04:11:09,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2022-12-06 04:11:09,990 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 283 flow. Second operand 9 states and 111 transitions. [2022-12-06 04:11:09,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 197 transitions, 1523 flow [2022-12-06 04:11:10,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 197 transitions, 1515 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:10,186 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 438 flow [2022-12-06 04:11:10,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=438, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2022-12-06 04:11:10,187 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2022-12-06 04:11:10,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:10,187 INFO L89 Accepts]: Start accepts. Operand has 67 places, 66 transitions, 438 flow [2022-12-06 04:11:10,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:10,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:10,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 66 transitions, 438 flow [2022-12-06 04:11:10,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 66 transitions, 438 flow [2022-12-06 04:11:10,341 INFO L130 PetriNetUnfolder]: 807/1947 cut-off events. [2022-12-06 04:11:10,341 INFO L131 PetriNetUnfolder]: For 5021/5467 co-relation queries the response was YES. [2022-12-06 04:11:10,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6577 conditions, 1947 events. 807/1947 cut-off events. For 5021/5467 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 16739 event pairs, 94 based on Foata normal form. 155/1972 useless extension candidates. Maximal degree in co-relation 6554. Up to 577 conditions per place. [2022-12-06 04:11:10,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 66 transitions, 438 flow [2022-12-06 04:11:10,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 710 [2022-12-06 04:11:10,358 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:10,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 04:11:10,359 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 438 flow [2022-12-06 04:11:10,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-06 04:11:10,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:10,359 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:10,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:11:10,359 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:11:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1575144380, now seen corresponding path program 2 times [2022-12-06 04:11:10,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:10,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496751581] [2022-12-06 04:11:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:10,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:12,164 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-06 04:11:12,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:12,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496751581] [2022-12-06 04:11:12,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496751581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:12,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:12,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 04:11:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722863442] [2022-12-06 04:11:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:12,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 04:11:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 04:11:12,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-06 04:11:12,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 04:11:12,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 438 flow. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:12,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:12,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 04:11:12,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:13,292 INFO L130 PetriNetUnfolder]: 3742/6337 cut-off events. [2022-12-06 04:11:13,292 INFO L131 PetriNetUnfolder]: For 18533/18547 co-relation queries the response was YES. [2022-12-06 04:11:13,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27814 conditions, 6337 events. 3742/6337 cut-off events. For 18533/18547 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 43475 event pairs, 618 based on Foata normal form. 16/6274 useless extension candidates. Maximal degree in co-relation 27788. Up to 2472 conditions per place. [2022-12-06 04:11:13,315 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 87 selfloop transitions, 12 changer transitions 78/179 dead transitions. [2022-12-06 04:11:13,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 179 transitions, 1553 flow [2022-12-06 04:11:13,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:11:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:11:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-06 04:11:13,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2022-12-06 04:11:13,317 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 438 flow. Second operand 7 states and 83 transitions. [2022-12-06 04:11:13,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 179 transitions, 1553 flow [2022-12-06 04:11:13,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 179 transitions, 1553 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:11:13,470 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 574 flow [2022-12-06 04:11:13,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=574, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2022-12-06 04:11:13,471 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 28 predicate places. [2022-12-06 04:11:13,471 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:13,471 INFO L89 Accepts]: Start accepts. Operand has 77 places, 71 transitions, 574 flow [2022-12-06 04:11:13,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:13,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:13,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 71 transitions, 574 flow [2022-12-06 04:11:13,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 71 transitions, 574 flow [2022-12-06 04:11:13,633 INFO L130 PetriNetUnfolder]: 743/1813 cut-off events. [2022-12-06 04:11:13,633 INFO L131 PetriNetUnfolder]: For 8006/8313 co-relation queries the response was YES. [2022-12-06 04:11:13,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6997 conditions, 1813 events. 743/1813 cut-off events. For 8006/8313 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 15407 event pairs, 119 based on Foata normal form. 143/1871 useless extension candidates. Maximal degree in co-relation 6968. Up to 534 conditions per place. [2022-12-06 04:11:13,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 71 transitions, 574 flow [2022-12-06 04:11:13,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-06 04:11:13,892 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [760] $Ultimate##0-->L840: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_13| v_P2Thread1of1ForFork0_~arg.base_13) (= |v_P2Thread1of1ForFork0_#in~arg.offset_13| v_P2Thread1of1ForFork0_~arg.offset_13) (= v_~z~0_706 1) (= v_~y~0_56 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_13, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_13, ~z~0=v_~z~0_706, ~y~0=v_~y~0_56, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~z~0, ~y~0] and [605] L891-->L903: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_203 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd4~0_36 256) 0))) (.cse5 (not (= (mod v_~z$r_buff1_thd4~0_68 256) 0))) (.cse6 (not (= (mod v_~z$w_buff0_used~0_149 256) 0))) (.cse10 (not (= (mod v_~z$r_buff0_thd4~0_77 256) 0)))) (let ((.cse1 (and .cse6 .cse10)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff1_used~0_141 256) 0)))) (.cse7 (and .cse4 .cse11)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_204 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~x$w_buff1_used~0_193 256) 0)) .cse3)) (.cse9 (and (not (= (mod v_~z$w_buff0_used~0_150 256) 0)) .cse10))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_204) v_~x$w_buff0_used~0_203) (= v_~z$r_buff0_thd4~0_76 (ite .cse1 0 v_~z$r_buff0_thd4~0_77)) (= (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_141) v_~z$w_buff1_used~0_140) (= v_~x$r_buff1_thd4~0_35 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_192 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_35 256) 0)))) 0 v_~x$r_buff1_thd4~0_36)) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_140 256) 0)) .cse5) (and .cse6 (not (= (mod v_~z$r_buff0_thd4~0_76 256) 0)))) 0 v_~z$r_buff1_thd4~0_68) v_~z$r_buff1_thd4~0_67) (= (ite (or .cse7 .cse8) 0 v_~x$w_buff1_used~0_193) v_~x$w_buff1_used~0_192) (= (ite .cse9 v_~z$w_buff0~0_85 (ite .cse2 v_~z$w_buff1~0_76 v_~z~0_144)) v_~z~0_143) (= v_~x$r_buff0_thd4~0_35 (ite .cse7 0 v_~x$r_buff0_thd4~0_36)) (= (ite .cse0 v_~x$w_buff0~0_91 (ite .cse8 v_~x$w_buff1~0_86 v_~x~0_140)) v_~x~0_139) (= v_~z$w_buff0_used~0_149 (ite .cse9 0 v_~z$w_buff0_used~0_150))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_68, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_150, ~z$w_buff0~0=v_~z$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_141, ~z$w_buff1~0=v_~z$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_193, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_36, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_36, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_77, ~z~0=v_~z~0_144, ~x~0=v_~x~0_140} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_91, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_67, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_149, ~z$w_buff0~0=v_~z$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_140, ~z$w_buff1~0=v_~z$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_192, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_35, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_35, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_76, ~z~0=v_~z~0_143, ~x~0=v_~x~0_139} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~z~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 04:11:14,079 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [751] $Ultimate##0-->L774: Formula: (and (= v_~a~0_49 1) (= v_~x~0_722 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|} OutVars{~a~0=v_~a~0_49, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_722, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [648] $Ultimate##0-->L801: Formula: (and (= (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_230 256))) (not (= (mod v_~x$w_buff0_used~0_253 256) 0)))) 1 0) |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff1_thd2~0_71 v_~x$r_buff0_thd2~0_93) (= v_~x$r_buff1_thd1~0_33 v_~x$r_buff0_thd1~0_37) (= v_~x$r_buff1_thd3~0_37 v_~x$r_buff0_thd3~0_37) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_91 v_~x$r_buff0_thd0~0_93) (= v_~x$w_buff0_used~0_254 v_~x$w_buff1_used~0_230) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$r_buff1_thd4~0_51 v_~x$r_buff0_thd4~0_51) (= v_~x$r_buff0_thd2~0_92 1) (= v_~x$w_buff0~0_130 v_~x$w_buff1~0_112) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= 2 v_~x$w_buff0~0_129) (= v_~x$w_buff0_used~0_253 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_93, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_254} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_129, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_71, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_230, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_33, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_92, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_253, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] [2022-12-06 04:11:14,374 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:11:14,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 904 [2022-12-06 04:11:14,375 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 582 flow [2022-12-06 04:11:14,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:14,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:14,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:14,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:11:14,375 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:11:14,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:14,376 INFO L85 PathProgramCache]: Analyzing trace with hash -397001758, now seen corresponding path program 1 times [2022-12-06 04:11:14,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:14,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759137874] [2022-12-06 04:11:14,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:14,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:11:14,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:11:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:11:14,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:11:14,584 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:11:14,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2022-12-06 04:11:14,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2022-12-06 04:11:14,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2022-12-06 04:11:14,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2022-12-06 04:11:14,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2022-12-06 04:11:14,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-12-06 04:11:14,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2022-12-06 04:11:14,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2022-12-06 04:11:14,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2022-12-06 04:11:14,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:11:14,587 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:14,591 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:11:14,591 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:11:14,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:11:14 BasicIcfg [2022-12-06 04:11:14,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:11:14,668 INFO L158 Benchmark]: Toolchain (without parser) took 48911.02ms. Allocated memory was 175.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 149.6MB in the beginning and 1.1GB in the end (delta: -923.1MB). Peak memory consumption was 142.8MB. Max. memory is 8.0GB. [2022-12-06 04:11:14,668 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:11:14,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.50ms. Allocated memory is still 175.1MB. Free memory was 149.1MB in the beginning and 115.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-06 04:11:14,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.47ms. Allocated memory is still 175.1MB. Free memory was 115.6MB in the beginning and 111.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-06 04:11:14,669 INFO L158 Benchmark]: Boogie Preprocessor took 33.02ms. Allocated memory is still 175.1MB. Free memory was 111.9MB in the beginning and 108.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:11:14,669 INFO L158 Benchmark]: RCFGBuilder took 817.22ms. Allocated memory was 175.1MB in the beginning and 221.2MB in the end (delta: 46.1MB). Free memory was 108.7MB in the beginning and 136.3MB in the end (delta: -27.6MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2022-12-06 04:11:14,669 INFO L158 Benchmark]: TraceAbstraction took 47477.00ms. Allocated memory was 221.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 135.8MB in the beginning and 1.1GB in the end (delta: -936.9MB). Peak memory consumption was 81.8MB. Max. memory is 8.0GB. [2022-12-06 04:11:14,670 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.09ms. Allocated memory is still 175.1MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 514.50ms. Allocated memory is still 175.1MB. Free memory was 149.1MB in the beginning and 115.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.47ms. Allocated memory is still 175.1MB. Free memory was 115.6MB in the beginning and 111.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.02ms. Allocated memory is still 175.1MB. Free memory was 111.9MB in the beginning and 108.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 817.22ms. Allocated memory was 175.1MB in the beginning and 221.2MB in the end (delta: 46.1MB). Free memory was 108.7MB in the beginning and 136.3MB in the end (delta: -27.6MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. * TraceAbstraction took 47477.00ms. Allocated memory was 221.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 135.8MB in the beginning and 1.1GB in the end (delta: -936.9MB). Peak memory consumption was 81.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 158 PlacesBefore, 49 PlacesAfterwards, 147 TransitionsBefore, 37 TransitionsAfterwards, 3392 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 61 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2620, independent: 2546, independent conditional: 2546, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2620, independent: 2546, independent conditional: 0, independent unconditional: 2546, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2620, independent: 2546, independent conditional: 0, independent unconditional: 2546, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2620, independent: 2546, independent conditional: 0, independent unconditional: 2546, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2174, independent: 2112, independent conditional: 0, independent unconditional: 2112, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2174, independent: 2059, independent conditional: 0, independent unconditional: 2059, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 115, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 557, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 494, dependent conditional: 0, dependent unconditional: 494, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2620, independent: 434, independent conditional: 0, independent unconditional: 434, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 2174, unknown conditional: 0, unknown unconditional: 2174] , Statistics on independence cache: Total cache size (in pairs): 3180, Positive cache size: 3118, Positive conditional cache size: 0, Positive unconditional cache size: 3118, Negative cache size: 62, Negative conditional cache size: 0, Negative unconditional cache size: 62, 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, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 176, independent conditional: 176, 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: 210, independent: 176, independent conditional: 15, independent unconditional: 161, dependent: 34, dependent conditional: 3, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, independent: 176, independent conditional: 15, independent unconditional: 161, dependent: 34, dependent conditional: 3, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 176, independent conditional: 15, independent unconditional: 161, dependent: 34, dependent conditional: 3, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 185, independent: 158, independent conditional: 14, independent unconditional: 144, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 185, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 97, dependent conditional: 8, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, independent: 18, independent conditional: 1, independent unconditional: 17, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 185, unknown conditional: 16, unknown unconditional: 169] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 158, Positive conditional cache size: 14, Positive unconditional cache size: 144, Negative cache size: 27, Negative conditional cache size: 2, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 164, independent conditional: 164, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 196, independent: 164, independent conditional: 18, independent unconditional: 146, dependent: 32, dependent conditional: 1, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, independent: 164, independent conditional: 18, independent unconditional: 146, dependent: 32, dependent conditional: 1, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, independent: 164, independent conditional: 18, independent unconditional: 146, dependent: 32, dependent conditional: 1, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 1, independent unconditional: 13, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 5, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, independent: 150, independent conditional: 17, independent unconditional: 133, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 17, unknown conditional: 2, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 172, Positive conditional cache size: 15, Positive unconditional cache size: 157, Negative cache size: 30, Negative conditional cache size: 3, Negative unconditional cache size: 27, 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, 41 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 192, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 192, independent: 162, independent conditional: 9, independent unconditional: 153, dependent: 30, dependent conditional: 5, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 192, independent: 162, independent conditional: 0, independent unconditional: 162, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 192, independent: 162, independent conditional: 0, independent unconditional: 162, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 192, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 173, Positive conditional cache size: 15, Positive unconditional cache size: 158, Negative cache size: 30, Negative conditional cache size: 3, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, independent: 157, independent conditional: 157, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 186, independent: 157, independent conditional: 6, independent unconditional: 151, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 186, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 186, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 186, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 173, Positive conditional cache size: 15, Positive unconditional cache size: 158, Negative cache size: 30, Negative conditional cache size: 3, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 64, independent conditional: 6, independent unconditional: 58, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 64, independent conditional: 6, independent unconditional: 58, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 64, independent conditional: 6, independent unconditional: 58, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 128, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 63, independent conditional: 6, independent unconditional: 57, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 174, Positive conditional cache size: 15, Positive unconditional cache size: 159, Negative cache size: 42, Negative conditional cache size: 3, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 626 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 135, independent: 104, independent conditional: 9, independent unconditional: 95, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 104, independent conditional: 9, independent unconditional: 95, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 104, independent conditional: 9, independent unconditional: 95, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 98, independent conditional: 9, independent unconditional: 89, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 180, Positive conditional cache size: 15, Positive unconditional cache size: 165, Negative cache size: 46, Negative conditional cache size: 3, Negative unconditional cache size: 43, 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, 49 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 626 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 161, independent: 126, independent conditional: 25, independent unconditional: 101, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 161, independent: 126, independent conditional: 25, independent unconditional: 101, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 161, independent: 126, independent conditional: 25, independent unconditional: 101, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 7, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 161, independent: 117, independent conditional: 18, independent unconditional: 99, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 9, unknown conditional: 7, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 189, Positive conditional cache size: 22, Positive unconditional cache size: 167, Negative cache size: 46, Negative conditional cache size: 3, Negative unconditional cache size: 43, 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, 51 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, independent: 115, independent conditional: 115, 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: 149, independent: 115, independent conditional: 25, independent unconditional: 90, 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: 149, independent: 115, independent conditional: 25, independent unconditional: 90, 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: 149, independent: 115, independent conditional: 25, independent unconditional: 90, 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: 3, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, independent: 113, independent conditional: 24, independent unconditional: 89, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 191, Positive conditional cache size: 23, Positive unconditional cache size: 168, Negative cache size: 47, Negative conditional cache size: 3, Negative unconditional cache size: 44, 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: 9.0s, 53 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 38 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 330, independent: 266, independent conditional: 266, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 330, independent: 266, independent conditional: 115, independent unconditional: 151, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 330, independent: 266, independent conditional: 115, independent unconditional: 151, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 330, independent: 266, independent conditional: 115, independent unconditional: 151, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 12, independent unconditional: 5, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 330, independent: 249, independent conditional: 103, independent unconditional: 146, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 26, unknown conditional: 12, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 230, Positive conditional cache size: 37, Positive unconditional cache size: 193, Negative cache size: 56, Negative conditional cache size: 3, Negative unconditional cache size: 53, 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.9s, 57 PlacesBefore, 56 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 401, independent: 375, independent conditional: 375, 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: 401, independent: 375, independent conditional: 253, independent unconditional: 122, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 401, independent: 375, independent conditional: 223, independent unconditional: 152, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 401, independent: 375, independent conditional: 223, independent unconditional: 152, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 401, independent: 371, independent conditional: 219, independent unconditional: 152, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 254, Positive conditional cache size: 41, Positive unconditional cache size: 213, Negative cache size: 58, Negative conditional cache size: 5, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 58 PlacesBefore, 57 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 143, independent conditional: 143, 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: 155, independent: 143, independent conditional: 101, independent unconditional: 42, 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: 155, independent: 143, independent conditional: 56, independent unconditional: 87, 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: 155, independent: 143, independent conditional: 56, independent unconditional: 87, 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: 26, independent: 23, independent conditional: 8, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 120, independent conditional: 48, independent unconditional: 72, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 26, unknown conditional: 8, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 369, Positive cache size: 308, Positive conditional cache size: 50, Positive unconditional cache size: 258, Negative cache size: 61, Negative conditional cache size: 5, Negative unconditional cache size: 56, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 45, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 710 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 369, Positive cache size: 308, Positive conditional cache size: 50, Positive unconditional cache size: 258, Negative cache size: 61, Negative conditional cache size: 5, Negative unconditional cache size: 56, 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.7s, 76 PlacesBefore, 75 PlacesAfterwards, 71 TransitionsBefore, 70 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 23, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 30, independent conditional: 9, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 9, independent unconditional: 21, 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: 6, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 30, independent: 24, independent conditional: 6, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 338, Positive conditional cache size: 53, Positive unconditional cache size: 285, Negative cache size: 61, Negative conditional cache size: 5, Negative unconditional cache size: 56, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t625; [L921] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t625, ((void *)0), P0, ((void *)0))=-4, t625={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L922] 0 pthread_t t626; [L923] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t626, ((void *)0), P1, ((void *)0))=-3, t625={5:0}, t626={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L924] 0 pthread_t t627; [L925] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t627, ((void *)0), P2, ((void *)0))=-2, t625={5:0}, t626={6:0}, t627={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L926] 0 pthread_t t628; [L927] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t628, ((void *)0), P3, ((void *)0))=-1, t625={5:0}, t626={6:0}, t627={7:0}, t628={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L794] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L794] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 3 y = 1 [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L865] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L865] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=4, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L890] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 1 a = 1 [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=3, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 2 return 0; [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 3 return 0; [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L907] 4 return 0; [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L931] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L931] RET 0 assume_abort_if_not(main$tmp_guard0) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L973] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 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: 923]: 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: 927]: 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: 921]: 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: 925]: 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 9 procedures, 190 locations, 9 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: 47.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 609 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1285 IncrementalHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 6 mSDtfsCounter, 1285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=582occurred in iteration=13, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 3518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-06 04:11:14,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...