/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:02:25,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:02:25,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:02:25,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:02:25,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:02:25,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:02:25,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:02:25,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:02:25,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:02:25,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:02:25,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:02:25,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:02:25,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:02:25,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:02:25,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:02:25,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:02:25,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:02:25,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:02:25,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:02:25,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:02:25,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:02:25,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:02:25,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:02:25,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:02:25,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:02:25,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:02:25,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:02:25,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:02:25,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:02:25,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:02:25,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:02:25,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:02:25,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:02:25,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:02:25,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:02:25,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:02:25,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:02:25,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:02:25,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:02:25,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:02:25,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:02:25,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:02:25,274 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:02:25,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:02:25,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:02:25,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:02:25,276 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:02:25,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:02:25,276 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:02:25,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:02:25,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:02:25,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:02:25,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:02:25,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:02:25,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:02:25,278 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:02:25,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:02:25,278 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:02:25,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:02:25,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:02:25,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:02:25,278 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:02:25,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:02:25,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:02:25,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:02:25,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:02:25,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:02:25,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:02:25,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:02:25,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:02:25,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:02:25,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:02:25,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:02:25,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:02:25,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:02:25,608 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:02:25,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:02:26,549 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:02:26,774 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:02:26,774 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:02:26,790 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0626136a/1a81d594493b43c59436ca54d5a8779a/FLAG23e869235 [2022-12-05 23:02:26,799 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0626136a/1a81d594493b43c59436ca54d5a8779a [2022-12-05 23:02:26,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:02:26,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:02:26,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:02:26,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:02:26,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:02:26,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:02:26" (1/1) ... [2022-12-05 23:02:26,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc272b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:26, skipping insertion in model container [2022-12-05 23:02:26,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:02:26" (1/1) ... [2022-12-05 23:02:26,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:02:26,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:02:27,004 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/mix040_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:02:27,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:02:27,208 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:02:27,217 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/mix040_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:02:27,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:02:27,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:02:27,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:02:27,296 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:02:27,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27 WrapperNode [2022-12-05 23:02:27,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:02:27,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:02:27,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:02:27,298 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:02:27,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (1/1) ... [2022-12-05 23:02:27,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (1/1) ... [2022-12-05 23:02:27,334 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-05 23:02:27,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:02:27,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:02:27,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:02:27,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:02:27,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (1/1) ... [2022-12-05 23:02:27,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (1/1) ... [2022-12-05 23:02:27,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (1/1) ... [2022-12-05 23:02:27,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (1/1) ... [2022-12-05 23:02:27,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (1/1) ... [2022-12-05 23:02:27,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (1/1) ... [2022-12-05 23:02:27,352 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (1/1) ... [2022-12-05 23:02:27,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (1/1) ... [2022-12-05 23:02:27,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:02:27,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:02:27,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:02:27,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:02:27,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (1/1) ... [2022-12-05 23:02:27,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:02:27,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:02:27,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:02:27,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:02:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:02:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:02:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:02:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:02:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:02:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:02:27,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:02:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:02:27,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:02:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:02:27,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:02:27,440 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:02:27,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:02:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:02:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:02:27,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:02:27,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:02:27,442 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:02:27,555 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:02:27,556 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:02:27,865 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:02:27,979 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:02:27,979 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:02:27,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:02:27 BoogieIcfgContainer [2022-12-05 23:02:27,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:02:27,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:02:27,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:02:27,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:02:27,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:02:26" (1/3) ... [2022-12-05 23:02:27,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638e484b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:02:27, skipping insertion in model container [2022-12-05 23:02:27,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:02:27" (2/3) ... [2022-12-05 23:02:27,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638e484b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:02:27, skipping insertion in model container [2022-12-05 23:02:27,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:02:27" (3/3) ... [2022-12-05 23:02:27,989 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:02:28,001 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:02:28,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:02:28,001 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:02:28,043 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:02:28,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 23:02:28,131 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 23:02:28,131 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:02:28,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 23:02:28,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 23:02:28,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-05 23:02:28,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:28,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 23:02:28,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-05 23:02:28,198 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 23:02:28,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:02:28,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 23:02:28,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 23:02:28,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 3270 [2022-12-05 23:02:32,779 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-05 23:02:32,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:02:32,793 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;@510c7abd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:02:32,793 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 23:02:32,794 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 23:02:32,794 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:02:32,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:32,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:02:32,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash 556139, now seen corresponding path program 1 times [2022-12-05 23:02:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:32,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180536669] [2022-12-05 23:02:32,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:32,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:33,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-05 23:02:33,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:33,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180536669] [2022-12-05 23:02:33,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180536669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:02:33,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:02:33,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:02:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133210084] [2022-12-05 23:02:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:02:33,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:02:33,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:33,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:02:33,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:02:33,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-05 23:02:33,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:33,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:33,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-05 23:02:33,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:33,898 INFO L130 PetriNetUnfolder]: 6050/8308 cut-off events. [2022-12-05 23:02:33,898 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-05 23:02:33,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16707 conditions, 8308 events. 6050/8308 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 41419 event pairs, 3098 based on Foata normal form. 0/7547 useless extension candidates. Maximal degree in co-relation 16695. Up to 6574 conditions per place. [2022-12-05 23:02:33,933 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-05 23:02:33,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-05 23:02:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:02:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:02:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-05 23:02:33,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-05 23:02:33,941 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 70 transitions. [2022-12-05 23:02:33,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-05 23:02:33,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:02:33,945 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-05 23:02:33,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-05 23:02:33,949 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-05 23:02:33,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:33,949 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-05 23:02:33,951 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:33,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:33,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-05 23:02:33,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-05 23:02:33,956 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-05 23:02:33,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:02:33,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:02:33,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-05 23:02:33,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-05 23:02:34,026 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:02:34,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-05 23:02:34,028 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-05 23:02:34,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:34,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:34,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:02:34,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:02:34,028 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1501688075, now seen corresponding path program 1 times [2022-12-05 23:02:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:34,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453256676] [2022-12-05 23:02:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:34,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:34,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453256676] [2022-12-05 23:02:34,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453256676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:02:34,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:02:34,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:02:34,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025561275] [2022-12-05 23:02:34,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:02:34,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:02:34,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:34,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:02:34,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:02:34,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:02:34,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-05 23:02:34,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:34,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:02:34,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:35,836 INFO L130 PetriNetUnfolder]: 16243/22100 cut-off events. [2022-12-05 23:02:35,837 INFO L131 PetriNetUnfolder]: For 1019/1019 co-relation queries the response was YES. [2022-12-05 23:02:35,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45716 conditions, 22100 events. 16243/22100 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 116949 event pairs, 5739 based on Foata normal form. 634/22734 useless extension candidates. Maximal degree in co-relation 45706. Up to 13082 conditions per place. [2022-12-05 23:02:35,922 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 43 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2022-12-05 23:02:35,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2022-12-05 23:02:35,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:02:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:02:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-05 23:02:35,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-05 23:02:35,924 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 52 transitions. [2022-12-05 23:02:35,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2022-12-05 23:02:35,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:02:35,926 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 126 flow [2022-12-05 23:02:35,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2022-12-05 23:02:35,927 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2022-12-05 23:02:35,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:35,927 INFO L89 Accepts]: Start accepts. Operand has 41 places, 35 transitions, 126 flow [2022-12-05 23:02:35,928 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:35,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:35,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 126 flow [2022-12-05 23:02:35,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 126 flow [2022-12-05 23:02:36,066 INFO L130 PetriNetUnfolder]: 276/697 cut-off events. [2022-12-05 23:02:36,067 INFO L131 PetriNetUnfolder]: For 87/118 co-relation queries the response was YES. [2022-12-05 23:02:36,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 697 events. 276/697 cut-off events. For 87/118 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4661 event pairs, 120 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 1348. Up to 325 conditions per place. [2022-12-05 23:02:36,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 126 flow [2022-12-05 23:02:36,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-05 23:02:36,122 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:02:36,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-05 23:02:36,124 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 126 flow [2022-12-05 23:02:36,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-05 23:02:36,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:36,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:02:36,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:02:36,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash 692308755, now seen corresponding path program 1 times [2022-12-05 23:02:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:36,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084604841] [2022-12-05 23:02:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:36,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:36,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:36,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084604841] [2022-12-05 23:02:36,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084604841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:02:36,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:02:36,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:02:36,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616219752] [2022-12-05 23:02:36,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:02:36,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:02:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:36,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:02:36,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:02:36,305 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:02:36,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 126 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:36,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:36,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:02:36,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:37,856 INFO L130 PetriNetUnfolder]: 15063/20506 cut-off events. [2022-12-05 23:02:37,860 INFO L131 PetriNetUnfolder]: For 9338/9338 co-relation queries the response was YES. [2022-12-05 23:02:37,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51831 conditions, 20506 events. 15063/20506 cut-off events. For 9338/9338 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 104055 event pairs, 4008 based on Foata normal form. 210/20716 useless extension candidates. Maximal degree in co-relation 51819. Up to 8969 conditions per place. [2022-12-05 23:02:38,018 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 56 selfloop transitions, 9 changer transitions 0/65 dead transitions. [2022-12-05 23:02:38,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 346 flow [2022-12-05 23:02:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:02:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:02:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-05 23:02:38,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-05 23:02:38,020 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 126 flow. Second operand 4 states and 60 transitions. [2022-12-05 23:02:38,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 346 flow [2022-12-05 23:02:38,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:02:38,050 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 178 flow [2022-12-05 23:02:38,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-12-05 23:02:38,051 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-05 23:02:38,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:38,051 INFO L89 Accepts]: Start accepts. Operand has 45 places, 40 transitions, 178 flow [2022-12-05 23:02:38,052 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:38,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:38,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 40 transitions, 178 flow [2022-12-05 23:02:38,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 178 flow [2022-12-05 23:02:38,090 INFO L130 PetriNetUnfolder]: 222/560 cut-off events. [2022-12-05 23:02:38,090 INFO L131 PetriNetUnfolder]: For 330/403 co-relation queries the response was YES. [2022-12-05 23:02:38,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 560 events. 222/560 cut-off events. For 330/403 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3401 event pairs, 69 based on Foata normal form. 0/545 useless extension candidates. Maximal degree in co-relation 1304. Up to 265 conditions per place. [2022-12-05 23:02:38,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 178 flow [2022-12-05 23:02:38,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 588 [2022-12-05 23:02:38,114 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:02:38,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-05 23:02:38,115 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 178 flow [2022-12-05 23:02:38,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:38,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:38,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:02:38,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:02:38,116 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:38,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:38,116 INFO L85 PathProgramCache]: Analyzing trace with hash -25078181, now seen corresponding path program 1 times [2022-12-05 23:02:38,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:38,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398188916] [2022-12-05 23:02:38,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:38,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:38,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:38,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398188916] [2022-12-05 23:02:38,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398188916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:02:38,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:02:38,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:02:38,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115890601] [2022-12-05 23:02:38,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:02:38,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:02:38,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:02:38,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:02:38,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:02:38,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 178 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:38,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:38,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:02:38,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:39,719 INFO L130 PetriNetUnfolder]: 14788/20131 cut-off events. [2022-12-05 23:02:39,726 INFO L131 PetriNetUnfolder]: For 15209/15209 co-relation queries the response was YES. [2022-12-05 23:02:39,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54164 conditions, 20131 events. 14788/20131 cut-off events. For 15209/15209 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 105934 event pairs, 2844 based on Foata normal form. 40/20171 useless extension candidates. Maximal degree in co-relation 54149. Up to 11267 conditions per place. [2022-12-05 23:02:39,835 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 63 selfloop transitions, 18 changer transitions 0/81 dead transitions. [2022-12-05 23:02:39,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 81 transitions, 472 flow [2022-12-05 23:02:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:02:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:02:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-05 23:02:39,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-05 23:02:39,836 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 178 flow. Second operand 4 states and 72 transitions. [2022-12-05 23:02:39,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 81 transitions, 472 flow [2022-12-05 23:02:39,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:02:39,847 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 283 flow [2022-12-05 23:02:39,847 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2022-12-05 23:02:39,848 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2022-12-05 23:02:39,848 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:39,848 INFO L89 Accepts]: Start accepts. Operand has 49 places, 47 transitions, 283 flow [2022-12-05 23:02:39,848 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:39,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:39,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 47 transitions, 283 flow [2022-12-05 23:02:39,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 47 transitions, 283 flow [2022-12-05 23:02:39,877 INFO L130 PetriNetUnfolder]: 196/510 cut-off events. [2022-12-05 23:02:39,877 INFO L131 PetriNetUnfolder]: For 735/939 co-relation queries the response was YES. [2022-12-05 23:02:39,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 510 events. 196/510 cut-off events. For 735/939 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3097 event pairs, 45 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 1484. Up to 233 conditions per place. [2022-12-05 23:02:39,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 47 transitions, 283 flow [2022-12-05 23:02:39,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-05 23:02:39,888 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:02:39,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-05 23:02:39,889 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 283 flow [2022-12-05 23:02:39,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:39,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:39,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:02:39,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:02:39,890 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash -777387587, now seen corresponding path program 1 times [2022-12-05 23:02:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:39,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097306933] [2022-12-05 23:02:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:40,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097306933] [2022-12-05 23:02:40,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097306933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:02:40,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:02:40,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:02:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708083686] [2022-12-05 23:02:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:02:40,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:02:40,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:40,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:02:40,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:02:40,027 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:02:40,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 283 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:40,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:40,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:02:40,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:41,361 INFO L130 PetriNetUnfolder]: 14589/19864 cut-off events. [2022-12-05 23:02:41,362 INFO L131 PetriNetUnfolder]: For 28222/28222 co-relation queries the response was YES. [2022-12-05 23:02:41,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60004 conditions, 19864 events. 14589/19864 cut-off events. For 28222/28222 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 104341 event pairs, 1545 based on Foata normal form. 32/19896 useless extension candidates. Maximal degree in co-relation 59986. Up to 11096 conditions per place. [2022-12-05 23:02:41,472 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 68 selfloop transitions, 22 changer transitions 0/90 dead transitions. [2022-12-05 23:02:41,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 666 flow [2022-12-05 23:02:41,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:02:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:02:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-05 23:02:41,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-05 23:02:41,473 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 283 flow. Second operand 4 states and 68 transitions. [2022-12-05 23:02:41,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 666 flow [2022-12-05 23:02:41,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 90 transitions, 666 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:02:41,518 INFO L231 Difference]: Finished difference. Result has 55 places, 60 transitions, 512 flow [2022-12-05 23:02:41,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=512, PETRI_PLACES=55, PETRI_TRANSITIONS=60} [2022-12-05 23:02:41,520 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2022-12-05 23:02:41,520 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:41,520 INFO L89 Accepts]: Start accepts. Operand has 55 places, 60 transitions, 512 flow [2022-12-05 23:02:41,521 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:41,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:41,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 60 transitions, 512 flow [2022-12-05 23:02:41,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 60 transitions, 512 flow [2022-12-05 23:02:41,556 INFO L130 PetriNetUnfolder]: 173/469 cut-off events. [2022-12-05 23:02:41,557 INFO L131 PetriNetUnfolder]: For 1365/1668 co-relation queries the response was YES. [2022-12-05 23:02:41,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 469 events. 173/469 cut-off events. For 1365/1668 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2836 event pairs, 38 based on Foata normal form. 1/459 useless extension candidates. Maximal degree in co-relation 1676. Up to 210 conditions per place. [2022-12-05 23:02:41,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 60 transitions, 512 flow [2022-12-05 23:02:41,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 834 [2022-12-05 23:02:41,568 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:02:41,568 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-05 23:02:41,569 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 60 transitions, 512 flow [2022-12-05 23:02:41,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:41,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:41,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:02:41,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:02:41,569 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash 581247734, now seen corresponding path program 1 times [2022-12-05 23:02:41,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:41,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939055186] [2022-12-05 23:02:41,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:41,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:41,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939055186] [2022-12-05 23:02:41,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939055186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:02:41,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:02:41,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:02:41,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6174771] [2022-12-05 23:02:41,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:02:41,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:02:41,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:41,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:02:41,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:02:41,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:02:41,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 512 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:41,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:41,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:02:41,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:43,897 INFO L130 PetriNetUnfolder]: 19688/27036 cut-off events. [2022-12-05 23:02:43,897 INFO L131 PetriNetUnfolder]: For 71131/71131 co-relation queries the response was YES. [2022-12-05 23:02:43,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86812 conditions, 27036 events. 19688/27036 cut-off events. For 71131/71131 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 150630 event pairs, 3657 based on Foata normal form. 300/27336 useless extension candidates. Maximal degree in co-relation 86789. Up to 12108 conditions per place. [2022-12-05 23:02:44,022 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 66 selfloop transitions, 31 changer transitions 4/101 dead transitions. [2022-12-05 23:02:44,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 101 transitions, 886 flow [2022-12-05 23:02:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:02:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:02:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-05 23:02:44,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6517857142857143 [2022-12-05 23:02:44,024 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 512 flow. Second operand 4 states and 73 transitions. [2022-12-05 23:02:44,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 101 transitions, 886 flow [2022-12-05 23:02:44,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 886 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:02:44,117 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 692 flow [2022-12-05 23:02:44,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=692, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2022-12-05 23:02:44,118 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2022-12-05 23:02:44,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:44,118 INFO L89 Accepts]: Start accepts. Operand has 61 places, 63 transitions, 692 flow [2022-12-05 23:02:44,119 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:44,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:44,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 63 transitions, 692 flow [2022-12-05 23:02:44,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 63 transitions, 692 flow [2022-12-05 23:02:44,153 INFO L130 PetriNetUnfolder]: 160/507 cut-off events. [2022-12-05 23:02:44,154 INFO L131 PetriNetUnfolder]: For 2199/2545 co-relation queries the response was YES. [2022-12-05 23:02:44,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 507 events. 160/507 cut-off events. For 2199/2545 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3371 event pairs, 40 based on Foata normal form. 1/499 useless extension candidates. Maximal degree in co-relation 2031. Up to 214 conditions per place. [2022-12-05 23:02:44,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 63 transitions, 692 flow [2022-12-05 23:02:44,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 876 [2022-12-05 23:02:44,163 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:02:44,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-05 23:02:44,163 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 692 flow [2022-12-05 23:02:44,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:44,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:44,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:02:44,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:02:44,164 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:44,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1670885146, now seen corresponding path program 1 times [2022-12-05 23:02:44,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:44,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660288329] [2022-12-05 23:02:44,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:44,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:44,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:44,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660288329] [2022-12-05 23:02:44,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660288329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:02:44,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:02:44,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:02:44,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712492670] [2022-12-05 23:02:44,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:02:44,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:02:44,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:44,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:02:44,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:02:44,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 23:02:44,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 692 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:44,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:44,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 23:02:44,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:46,103 INFO L130 PetriNetUnfolder]: 11979/17756 cut-off events. [2022-12-05 23:02:46,103 INFO L131 PetriNetUnfolder]: For 54539/56237 co-relation queries the response was YES. [2022-12-05 23:02:46,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54747 conditions, 17756 events. 11979/17756 cut-off events. For 54539/56237 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 115845 event pairs, 2016 based on Foata normal form. 1838/19221 useless extension candidates. Maximal degree in co-relation 54719. Up to 11053 conditions per place. [2022-12-05 23:02:46,163 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 106 selfloop transitions, 10 changer transitions 10/150 dead transitions. [2022-12-05 23:02:46,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 150 transitions, 1737 flow [2022-12-05 23:02:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:02:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:02:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-05 23:02:46,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2022-12-05 23:02:46,165 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 692 flow. Second operand 5 states and 92 transitions. [2022-12-05 23:02:46,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 150 transitions, 1737 flow [2022-12-05 23:02:46,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 150 transitions, 1729 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-05 23:02:46,182 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 765 flow [2022-12-05 23:02:46,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=765, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2022-12-05 23:02:46,182 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2022-12-05 23:02:46,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:46,182 INFO L89 Accepts]: Start accepts. Operand has 68 places, 72 transitions, 765 flow [2022-12-05 23:02:46,183 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:46,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:46,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 72 transitions, 765 flow [2022-12-05 23:02:46,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 72 transitions, 765 flow [2022-12-05 23:02:46,338 INFO L130 PetriNetUnfolder]: 1144/2339 cut-off events. [2022-12-05 23:02:46,338 INFO L131 PetriNetUnfolder]: For 4599/5472 co-relation queries the response was YES. [2022-12-05 23:02:46,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7762 conditions, 2339 events. 1144/2339 cut-off events. For 4599/5472 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 19391 event pairs, 506 based on Foata normal form. 27/2148 useless extension candidates. Maximal degree in co-relation 7732. Up to 1518 conditions per place. [2022-12-05 23:02:46,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 72 transitions, 765 flow [2022-12-05 23:02:46,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 1336 [2022-12-05 23:02:46,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [504] L813-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= |v_P2Thread1of1ForFork3_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_9|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] [2022-12-05 23:02:46,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [441] L793-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_15| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_15|) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-05 23:02:46,495 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [512] L773-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res#1.base_7| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_99 (+ v_~__unbuffered_cnt~0_100 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_7|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] [2022-12-05 23:02:46,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [456] L852-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P3Thread1of1ForFork1_#res.base_11| 0) (= |v_P3Thread1of1ForFork1_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] [2022-12-05 23:02:46,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:02:46,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-05 23:02:46,565 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 775 flow [2022-12-05 23:02:46,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:46,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:46,565 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-05 23:02:46,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:02:46,565 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash 325954025, now seen corresponding path program 1 times [2022-12-05 23:02:46,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:46,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496116015] [2022-12-05 23:02:46,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:46,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:46,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:46,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496116015] [2022-12-05 23:02:46,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496116015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:02:46,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:02:46,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:02:46,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168310308] [2022-12-05 23:02:46,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:02:46,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:02:46,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:46,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:02:46,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:02:46,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2022-12-05 23:02:46,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:46,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:46,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2022-12-05 23:02:46,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:48,888 INFO L130 PetriNetUnfolder]: 15892/23799 cut-off events. [2022-12-05 23:02:48,888 INFO L131 PetriNetUnfolder]: For 93732/94403 co-relation queries the response was YES. [2022-12-05 23:02:48,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92860 conditions, 23799 events. 15892/23799 cut-off events. For 93732/94403 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 161065 event pairs, 7206 based on Foata normal form. 420/23790 useless extension candidates. Maximal degree in co-relation 92827. Up to 12104 conditions per place. [2022-12-05 23:02:48,974 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 67 selfloop transitions, 12 changer transitions 10/102 dead transitions. [2022-12-05 23:02:48,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 1146 flow [2022-12-05 23:02:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:02:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:02:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-05 23:02:48,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-05 23:02:48,976 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 775 flow. Second operand 3 states and 63 transitions. [2022-12-05 23:02:48,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 1146 flow [2022-12-05 23:02:49,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 102 transitions, 1121 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-05 23:02:49,036 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 739 flow [2022-12-05 23:02:49,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2022-12-05 23:02:49,037 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2022-12-05 23:02:49,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:49,037 INFO L89 Accepts]: Start accepts. Operand has 69 places, 67 transitions, 739 flow [2022-12-05 23:02:49,051 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:49,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:49,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 67 transitions, 739 flow [2022-12-05 23:02:49,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 67 transitions, 739 flow [2022-12-05 23:02:49,350 INFO L130 PetriNetUnfolder]: 1493/2965 cut-off events. [2022-12-05 23:02:49,350 INFO L131 PetriNetUnfolder]: For 5770/6682 co-relation queries the response was YES. [2022-12-05 23:02:49,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9585 conditions, 2965 events. 1493/2965 cut-off events. For 5770/6682 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 24730 event pairs, 697 based on Foata normal form. 8/2611 useless extension candidates. Maximal degree in co-relation 9554. Up to 2182 conditions per place. [2022-12-05 23:02:49,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 67 transitions, 739 flow [2022-12-05 23:02:49,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 1132 [2022-12-05 23:02:49,408 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:02:49,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 371 [2022-12-05 23:02:49,408 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 739 flow [2022-12-05 23:02:49,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:49,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:49,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:02:49,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:02:49,409 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1799410738, now seen corresponding path program 1 times [2022-12-05 23:02:49,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:49,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466390702] [2022-12-05 23:02:49,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:49,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:49,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466390702] [2022-12-05 23:02:49,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466390702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:02:49,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:02:49,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:02:49,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795646989] [2022-12-05 23:02:49,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:02:49,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:02:49,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:02:49,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:02:49,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2022-12-05 23:02:49,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 739 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:49,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:49,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2022-12-05 23:02:49,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:52,593 INFO L130 PetriNetUnfolder]: 22062/33158 cut-off events. [2022-12-05 23:02:52,594 INFO L131 PetriNetUnfolder]: For 126628/127547 co-relation queries the response was YES. [2022-12-05 23:02:52,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127308 conditions, 33158 events. 22062/33158 cut-off events. For 126628/127547 co-relation queries the response was YES. Maximal size of possible extension queue 1730. Compared 238942 event pairs, 4529 based on Foata normal form. 622/33316 useless extension candidates. Maximal degree in co-relation 127274. Up to 16270 conditions per place. [2022-12-05 23:02:52,718 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 82 selfloop transitions, 4 changer transitions 17/119 dead transitions. [2022-12-05 23:02:52,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 119 transitions, 1353 flow [2022-12-05 23:02:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:02:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:02:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-05 23:02:52,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.578125 [2022-12-05 23:02:52,719 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 739 flow. Second operand 4 states and 74 transitions. [2022-12-05 23:02:52,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 119 transitions, 1353 flow [2022-12-05 23:02:52,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 119 transitions, 1329 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 23:02:52,812 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 750 flow [2022-12-05 23:02:52,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=750, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2022-12-05 23:02:52,813 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places. [2022-12-05 23:02:52,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:52,814 INFO L89 Accepts]: Start accepts. Operand has 73 places, 68 transitions, 750 flow [2022-12-05 23:02:52,817 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:52,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:52,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 68 transitions, 750 flow [2022-12-05 23:02:52,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 68 transitions, 750 flow [2022-12-05 23:02:53,175 INFO L130 PetriNetUnfolder]: 2260/4399 cut-off events. [2022-12-05 23:02:53,175 INFO L131 PetriNetUnfolder]: For 8172/9910 co-relation queries the response was YES. [2022-12-05 23:02:53,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14104 conditions, 4399 events. 2260/4399 cut-off events. For 8172/9910 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 39153 event pairs, 1091 based on Foata normal form. 12/3836 useless extension candidates. Maximal degree in co-relation 14071. Up to 3349 conditions per place. [2022-12-05 23:02:53,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 68 transitions, 750 flow [2022-12-05 23:02:53,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 1150 [2022-12-05 23:02:53,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:02:53,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 548 [2022-12-05 23:02:53,361 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 759 flow [2022-12-05 23:02:53,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:53,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:53,361 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-05 23:02:53,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:02:53,362 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash 132255812, now seen corresponding path program 1 times [2022-12-05 23:02:53,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:53,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848596878] [2022-12-05 23:02:53,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:53,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:53,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:53,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848596878] [2022-12-05 23:02:53,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848596878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:02:53,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:02:53,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:02:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114720122] [2022-12-05 23:02:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:02:53,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:02:53,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:53,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:02:53,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:02:53,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-05 23:02:53,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 759 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-05 23:02:53,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:53,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-05 23:02:53,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:56,006 INFO L130 PetriNetUnfolder]: 16757/25844 cut-off events. [2022-12-05 23:02:56,006 INFO L131 PetriNetUnfolder]: For 81590/82657 co-relation queries the response was YES. [2022-12-05 23:02:56,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94493 conditions, 25844 events. 16757/25844 cut-off events. For 81590/82657 co-relation queries the response was YES. Maximal size of possible extension queue 1535. Compared 192537 event pairs, 1666 based on Foata normal form. 2388/27703 useless extension candidates. Maximal degree in co-relation 94457. Up to 10974 conditions per place. [2022-12-05 23:02:56,085 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 129 selfloop transitions, 18 changer transitions 14/179 dead transitions. [2022-12-05 23:02:56,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 179 transitions, 2195 flow [2022-12-05 23:02:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:02:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:02:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-05 23:02:56,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-05 23:02:56,087 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 759 flow. Second operand 6 states and 126 transitions. [2022-12-05 23:02:56,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 179 transitions, 2195 flow [2022-12-05 23:02:56,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 179 transitions, 2181 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:02:56,140 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 887 flow [2022-12-05 23:02:56,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=887, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2022-12-05 23:02:56,140 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2022-12-05 23:02:56,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:56,140 INFO L89 Accepts]: Start accepts. Operand has 80 places, 77 transitions, 887 flow [2022-12-05 23:02:56,141 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:56,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:56,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 77 transitions, 887 flow [2022-12-05 23:02:56,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 77 transitions, 887 flow [2022-12-05 23:02:56,371 INFO L130 PetriNetUnfolder]: 1841/3870 cut-off events. [2022-12-05 23:02:56,371 INFO L131 PetriNetUnfolder]: For 15546/21042 co-relation queries the response was YES. [2022-12-05 23:02:56,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18414 conditions, 3870 events. 1841/3870 cut-off events. For 15546/21042 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 35487 event pairs, 311 based on Foata normal form. 73/3603 useless extension candidates. Maximal degree in co-relation 18377. Up to 3120 conditions per place. [2022-12-05 23:02:56,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 77 transitions, 887 flow [2022-12-05 23:02:56,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 1520 [2022-12-05 23:02:56,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:02:56,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 575 [2022-12-05 23:02:56,715 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 879 flow [2022-12-05 23:02:56,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-05 23:02:56,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:02:56,715 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] [2022-12-05 23:02:56,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:02:56,715 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:02:56,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:02:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash 76676173, now seen corresponding path program 1 times [2022-12-05 23:02:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:02:56,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825448168] [2022-12-05 23:02:56,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:02:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:02:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:02:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:02:56,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:02:56,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825448168] [2022-12-05 23:02:56,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825448168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:02:56,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:02:56,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:02:56,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918780199] [2022-12-05 23:02:56,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:02:56,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:02:56,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:02:56,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:02:56,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:02:56,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-05 23:02:56,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 879 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:02:56,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:02:56,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-05 23:02:56,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:02:58,806 INFO L130 PetriNetUnfolder]: 11354/17806 cut-off events. [2022-12-05 23:02:58,806 INFO L131 PetriNetUnfolder]: For 80512/81211 co-relation queries the response was YES. [2022-12-05 23:02:58,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77788 conditions, 17806 events. 11354/17806 cut-off events. For 80512/81211 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 129019 event pairs, 1225 based on Foata normal form. 1106/18531 useless extension candidates. Maximal degree in co-relation 77748. Up to 7501 conditions per place. [2022-12-05 23:02:58,867 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 113 selfloop transitions, 23 changer transitions 65/215 dead transitions. [2022-12-05 23:02:58,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 215 transitions, 2649 flow [2022-12-05 23:02:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:02:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:02:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2022-12-05 23:02:58,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2022-12-05 23:02:58,868 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 879 flow. Second operand 8 states and 162 transitions. [2022-12-05 23:02:58,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 215 transitions, 2649 flow [2022-12-05 23:02:59,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 215 transitions, 2597 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-05 23:02:59,950 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 870 flow [2022-12-05 23:02:59,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=870, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2022-12-05 23:02:59,951 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 39 predicate places. [2022-12-05 23:02:59,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:02:59,951 INFO L89 Accepts]: Start accepts. Operand has 87 places, 76 transitions, 870 flow [2022-12-05 23:02:59,952 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:02:59,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:02:59,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 76 transitions, 870 flow [2022-12-05 23:02:59,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 76 transitions, 870 flow [2022-12-05 23:03:00,078 INFO L130 PetriNetUnfolder]: 764/2035 cut-off events. [2022-12-05 23:03:00,079 INFO L131 PetriNetUnfolder]: For 10232/11236 co-relation queries the response was YES. [2022-12-05 23:03:00,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10415 conditions, 2035 events. 764/2035 cut-off events. For 10232/11236 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 18487 event pairs, 55 based on Foata normal form. 26/1956 useless extension candidates. Maximal degree in co-relation 10376. Up to 1237 conditions per place. [2022-12-05 23:03:00,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 76 transitions, 870 flow [2022-12-05 23:03:00,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 1248 [2022-12-05 23:03:00,154 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:03:00,154 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-05 23:03:00,154 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 75 transitions, 860 flow [2022-12-05 23:03:00,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:03:00,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:03:00,155 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-05 23:03:00,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:03:00,155 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:03:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:03:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1022646516, now seen corresponding path program 1 times [2022-12-05 23:03:00,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:03:00,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516943534] [2022-12-05 23:03:00,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:03:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:03:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:03:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:03:00,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:03:00,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516943534] [2022-12-05 23:03:00,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516943534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:03:00,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:03:00,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:03:00,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334728088] [2022-12-05 23:03:00,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:03:00,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:03:00,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:03:00,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:03:00,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:03:00,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-05 23:03:00,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 75 transitions, 860 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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-05 23:03:00,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:03:00,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-05 23:03:00,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:03:03,677 INFO L130 PetriNetUnfolder]: 13980/23025 cut-off events. [2022-12-05 23:03:03,677 INFO L131 PetriNetUnfolder]: For 124966/125411 co-relation queries the response was YES. [2022-12-05 23:03:03,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105312 conditions, 23025 events. 13980/23025 cut-off events. For 124966/125411 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 187762 event pairs, 896 based on Foata normal form. 194/22992 useless extension candidates. Maximal degree in co-relation 105270. Up to 7266 conditions per place. [2022-12-05 23:03:03,747 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 151 selfloop transitions, 7 changer transitions 90/262 dead transitions. [2022-12-05 23:03:03,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 262 transitions, 3180 flow [2022-12-05 23:03:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:03:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:03:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2022-12-05 23:03:03,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6386554621848739 [2022-12-05 23:03:03,748 INFO L175 Difference]: Start difference. First operand has 87 places, 75 transitions, 860 flow. Second operand 7 states and 152 transitions. [2022-12-05 23:03:03,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 262 transitions, 3180 flow [2022-12-05 23:03:05,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 262 transitions, 2658 flow, removed 167 selfloop flow, removed 7 redundant places. [2022-12-05 23:03:05,150 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 802 flow [2022-12-05 23:03:05,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=802, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2022-12-05 23:03:05,150 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 42 predicate places. [2022-12-05 23:03:05,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:03:05,151 INFO L89 Accepts]: Start accepts. Operand has 90 places, 80 transitions, 802 flow [2022-12-05 23:03:05,151 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:03:05,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:03:05,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 80 transitions, 802 flow [2022-12-05 23:03:05,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 80 transitions, 802 flow [2022-12-05 23:03:05,415 INFO L130 PetriNetUnfolder]: 1435/3441 cut-off events. [2022-12-05 23:03:05,416 INFO L131 PetriNetUnfolder]: For 11567/12182 co-relation queries the response was YES. [2022-12-05 23:03:05,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13729 conditions, 3441 events. 1435/3441 cut-off events. For 11567/12182 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 32190 event pairs, 97 based on Foata normal form. 190/3412 useless extension candidates. Maximal degree in co-relation 13689. Up to 1151 conditions per place. [2022-12-05 23:03:05,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 80 transitions, 802 flow [2022-12-05 23:03:05,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 1244 [2022-12-05 23:03:05,463 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:03:05,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-05 23:03:05,464 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 80 transitions, 802 flow [2022-12-05 23:03:05,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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-05 23:03:05,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:03:05,464 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-05 23:03:05,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:03:05,464 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:03:05,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:03:05,464 INFO L85 PathProgramCache]: Analyzing trace with hash -322581830, now seen corresponding path program 2 times [2022-12-05 23:03:05,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:03:05,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138734975] [2022-12-05 23:03:05,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:03:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:03:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:03:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:03:05,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:03:05,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138734975] [2022-12-05 23:03:05,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138734975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:03:05,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:03:05,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:03:05,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55822531] [2022-12-05 23:03:05,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:03:05,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:03:05,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:03:05,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:03:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:03:05,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-05 23:03:05,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 80 transitions, 802 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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-05 23:03:05,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:03:05,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-05 23:03:05,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:03:07,338 INFO L130 PetriNetUnfolder]: 10238/16699 cut-off events. [2022-12-05 23:03:07,338 INFO L131 PetriNetUnfolder]: For 68029/68681 co-relation queries the response was YES. [2022-12-05 23:03:07,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72183 conditions, 16699 events. 10238/16699 cut-off events. For 68029/68681 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 127844 event pairs, 1101 based on Foata normal form. 618/16975 useless extension candidates. Maximal degree in co-relation 72145. Up to 4369 conditions per place. [2022-12-05 23:03:07,386 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 58 selfloop transitions, 17 changer transitions 131/210 dead transitions. [2022-12-05 23:03:07,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 210 transitions, 2431 flow [2022-12-05 23:03:07,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 23:03:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 23:03:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2022-12-05 23:03:07,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49117647058823527 [2022-12-05 23:03:07,387 INFO L175 Difference]: Start difference. First operand has 88 places, 80 transitions, 802 flow. Second operand 10 states and 167 transitions. [2022-12-05 23:03:07,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 210 transitions, 2431 flow [2022-12-05 23:03:08,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 210 transitions, 2382 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-05 23:03:08,006 INFO L231 Difference]: Finished difference. Result has 95 places, 42 transitions, 333 flow [2022-12-05 23:03:08,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=333, PETRI_PLACES=95, PETRI_TRANSITIONS=42} [2022-12-05 23:03:08,007 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 47 predicate places. [2022-12-05 23:03:08,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:03:08,007 INFO L89 Accepts]: Start accepts. Operand has 95 places, 42 transitions, 333 flow [2022-12-05 23:03:08,008 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:03:08,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:03:08,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 42 transitions, 333 flow [2022-12-05 23:03:08,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 42 transitions, 333 flow [2022-12-05 23:03:08,016 INFO L130 PetriNetUnfolder]: 34/104 cut-off events. [2022-12-05 23:03:08,016 INFO L131 PetriNetUnfolder]: For 202/213 co-relation queries the response was YES. [2022-12-05 23:03:08,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 104 events. 34/104 cut-off events. For 202/213 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 324 event pairs, 1 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 397. Up to 36 conditions per place. [2022-12-05 23:03:08,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 42 transitions, 333 flow [2022-12-05 23:03:08,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-05 23:03:08,939 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-05 23:03:08,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 933 [2022-12-05 23:03:08,940 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 35 transitions, 305 flow [2022-12-05 23:03:08,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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-05 23:03:08,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:03:08,940 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-05 23:03:08,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:03:08,941 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:03:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:03:08,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1177030181, now seen corresponding path program 1 times [2022-12-05 23:03:08,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:03:08,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660320326] [2022-12-05 23:03:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:03:08,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:03:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:03:09,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:03:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:03:09,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:03:09,110 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:03:09,110 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 23:03:09,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 23:03:09,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 23:03:09,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 23:03:09,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 23:03:09,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 23:03:09,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 23:03:09,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:03:09,113 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:03:09,116 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:03:09,116 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:03:09,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:03:09 BasicIcfg [2022-12-05 23:03:09,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:03:09,194 INFO L158 Benchmark]: Toolchain (without parser) took 42388.84ms. Allocated memory was 187.7MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 162.5MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-05 23:03:09,195 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 164.3MB in the beginning and 164.2MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:03:09,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.43ms. Allocated memory is still 187.7MB. Free memory was 162.0MB in the beginning and 133.7MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 23:03:09,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.60ms. Allocated memory is still 187.7MB. Free memory was 133.7MB in the beginning and 131.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:03:09,195 INFO L158 Benchmark]: Boogie Preprocessor took 20.89ms. Allocated memory is still 187.7MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:03:09,195 INFO L158 Benchmark]: RCFGBuilder took 624.61ms. Allocated memory is still 187.7MB. Free memory was 129.0MB in the beginning and 91.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-05 23:03:09,195 INFO L158 Benchmark]: TraceAbstraction took 41207.92ms. Allocated memory was 187.7MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 90.7MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-05 23:03:09,197 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 187.7MB. Free memory was 164.3MB in the beginning and 164.2MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 494.43ms. Allocated memory is still 187.7MB. Free memory was 162.0MB in the beginning and 133.7MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.60ms. Allocated memory is still 187.7MB. Free memory was 133.7MB in the beginning and 131.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.89ms. Allocated memory is still 187.7MB. Free memory was 131.1MB in the beginning and 129.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 624.61ms. Allocated memory is still 187.7MB. Free memory was 129.0MB in the beginning and 91.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 41207.92ms. Allocated memory was 187.7MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 90.7MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 139 PlacesBefore, 48 PlacesAfterwards, 128 TransitionsBefore, 36 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2473, independent: 2399, independent conditional: 2399, 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: 2473, independent: 2399, independent conditional: 0, independent unconditional: 2399, 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: 2473, independent: 2399, independent conditional: 0, independent unconditional: 2399, 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: 2473, independent: 2399, independent conditional: 0, independent unconditional: 2399, 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: 1984, independent: 1935, independent conditional: 0, independent unconditional: 1935, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1984, independent: 1912, independent conditional: 0, independent unconditional: 1912, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 197, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2473, independent: 464, independent conditional: 0, independent unconditional: 464, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 1984, unknown conditional: 0, unknown unconditional: 1984] , Statistics on independence cache: Total cache size (in pairs): 2955, Positive cache size: 2906, Positive conditional cache size: 0, Positive unconditional cache size: 2906, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, 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, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 152, independent conditional: 152, 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: 182, independent: 152, independent conditional: 20, independent unconditional: 132, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 152, independent conditional: 20, independent unconditional: 132, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 152, independent conditional: 20, independent unconditional: 132, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 168, independent: 143, independent conditional: 19, independent unconditional: 124, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 168, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 62, dependent conditional: 37, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 168, unknown conditional: 29, unknown unconditional: 139] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 143, Positive conditional cache size: 19, Positive unconditional cache size: 124, Negative cache size: 25, Negative conditional cache size: 10, Negative unconditional cache size: 15, 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, 41 PlacesBefore, 41 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 137, independent conditional: 137, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 137, independent conditional: 18, independent unconditional: 119, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 162, Positive conditional cache size: 19, Positive unconditional cache size: 143, Negative cache size: 31, Negative conditional cache size: 10, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, independent: 140, independent conditional: 140, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 161, independent: 140, independent conditional: 12, independent unconditional: 128, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 161, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 161, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 21, dependent conditional: 0, dependent unconditional: 21, 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: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 168, Positive conditional cache size: 19, Positive unconditional cache size: 149, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, independent: 202, independent conditional: 202, 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: 232, independent: 202, independent conditional: 42, independent unconditional: 160, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 232, independent: 202, independent conditional: 0, independent unconditional: 202, 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: 232, independent: 202, independent conditional: 0, independent unconditional: 202, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 232, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 168, Positive conditional cache size: 19, Positive unconditional cache size: 149, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 834 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 344, independent: 306, independent conditional: 306, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 344, independent: 306, independent conditional: 105, independent unconditional: 201, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 344, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 344, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 38, dependent conditional: 0, dependent unconditional: 38, 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: 344, independent: 305, independent conditional: 0, independent unconditional: 305, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 169, Positive conditional cache size: 19, Positive unconditional cache size: 150, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 876 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 317, independent: 274, independent conditional: 274, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 317, independent: 274, independent conditional: 101, independent unconditional: 173, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 317, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 317, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 43, dependent conditional: 0, dependent unconditional: 43, 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: 317, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 169, Positive conditional cache size: 19, Positive unconditional cache size: 150, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 101, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 68 PlacesBefore, 67 PlacesAfterwards, 72 TransitionsBefore, 71 TransitionsAfterwards, 1336 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 667, independent: 571, independent conditional: 571, independent unconditional: 0, dependent: 96, dependent conditional: 96, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 667, independent: 571, independent conditional: 379, independent unconditional: 192, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 667, independent: 571, independent conditional: 113, independent unconditional: 458, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 667, independent: 571, independent conditional: 113, independent unconditional: 458, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 11, independent conditional: 6, independent unconditional: 5, 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: 15, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 68, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 667, independent: 560, independent conditional: 107, independent unconditional: 453, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 15, unknown conditional: 6, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 189, Positive conditional cache size: 25, Positive unconditional cache size: 164, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 266, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 252, independent: 210, independent conditional: 210, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 252, independent: 210, independent conditional: 99, independent unconditional: 111, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 252, independent: 210, independent conditional: 10, independent unconditional: 200, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 252, independent: 210, independent conditional: 10, independent unconditional: 200, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 252, independent: 203, independent conditional: 10, independent unconditional: 193, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 196, Positive conditional cache size: 25, Positive unconditional cache size: 171, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 89, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 73 PlacesBefore, 73 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 1150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 478, independent: 404, independent conditional: 404, 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: 478, independent: 404, independent conditional: 218, independent unconditional: 186, 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: 478, independent: 404, independent conditional: 62, independent unconditional: 342, 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: 478, independent: 404, independent conditional: 62, independent unconditional: 342, 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: 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] , 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: 478, independent: 395, independent conditional: 62, independent unconditional: 333, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 244, Positive conditional cache size: 28, Positive unconditional cache size: 216, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 156, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 80 PlacesBefore, 80 PlacesAfterwards, 77 TransitionsBefore, 76 TransitionsAfterwards, 1520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 441, independent: 357, independent conditional: 357, independent unconditional: 0, dependent: 84, dependent conditional: 84, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 441, independent: 357, independent conditional: 199, independent unconditional: 158, dependent: 84, dependent conditional: 32, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 537, independent: 357, independent conditional: 111, independent unconditional: 246, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 537, independent: 357, independent conditional: 111, independent unconditional: 246, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 537, independent: 350, independent conditional: 106, independent unconditional: 244, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 12, unknown conditional: 5, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 251, Positive conditional cache size: 33, Positive unconditional cache size: 218, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 216, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 87 PlacesBefore, 87 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 1248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 379, independent: 297, independent conditional: 297, independent unconditional: 0, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 379, independent: 297, independent conditional: 165, independent unconditional: 132, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 379, independent: 297, independent conditional: 93, independent unconditional: 204, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 379, independent: 297, independent conditional: 93, independent unconditional: 204, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 379, independent: 291, independent conditional: 88, independent unconditional: 203, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 257, Positive conditional cache size: 38, Positive unconditional cache size: 219, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 42, independent conditional: 40, independent unconditional: 2, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 42, independent conditional: 40, independent unconditional: 2, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 39, independent conditional: 37, independent unconditional: 2, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 260, Positive conditional cache size: 41, Positive unconditional cache size: 219, Negative cache size: 49, Negative conditional cache size: 14, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 84 PlacesBefore, 77 PlacesAfterwards, 42 TransitionsBefore, 35 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 62, independent conditional: 51, independent unconditional: 11, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 62, independent conditional: 35, independent unconditional: 27, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 62, independent conditional: 35, independent unconditional: 27, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 51, independent conditional: 34, independent unconditional: 17, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 13, unknown conditional: 1, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 322, Positive conditional cache size: 45, Positive unconditional cache size: 277, Negative cache size: 51, Negative conditional cache size: 14, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1057; [L870] FCALL, FORK 0 pthread_create(&t1057, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1057, ((void *)0), P0, ((void *)0))=-4, t1057={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L871] 0 pthread_t t1058; [L872] FCALL, FORK 0 pthread_create(&t1058, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1058, ((void *)0), P1, ((void *)0))=-3, t1057={5:0}, t1058={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t1059; [L782] 2 x = 2 [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L874] FCALL, FORK 0 pthread_create(&t1059, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1059, ((void *)0), P2, ((void *)0))=-2, t1057={5:0}, t1058={6:0}, t1059={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L875] 0 pthread_t t1060; [L802] 3 y = 2 [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L876] FCALL, FORK 0 pthread_create(&t1060, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1060, ((void *)0), P3, ((void *)0))=-1, t1057={5:0}, t1058={6:0}, t1059={7:0}, t1060={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L822] 4 z = 1 [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 872]: 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: 870]: 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: 874]: 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, 170 locations, 7 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: 41.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 29.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 650 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 650 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1675 IncrementalHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 31 mSDtfsCounter, 1675 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=887occurred in iteration=10, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 1189 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-05 23:03:09,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...