/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 --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:09:34,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:09:34,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:09:34,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:09:34,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:09:34,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:09:34,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:09:34,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:09:34,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:09:34,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:09:34,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:09:34,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:09:34,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:09:34,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:09:34,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:09:34,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:09:34,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:09:34,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:09:34,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:09:34,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:09:34,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:09:34,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:09:34,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:09:34,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:09:34,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:09:34,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:09:34,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:09:34,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:09:34,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:09:34,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:09:34,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:09:34,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:09:34,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:09:34,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:09:34,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:09:34,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:09:34,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:09:34,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:09:34,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:09:34,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:09:34,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:09:34,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 06:09:34,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:09:34,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:09:34,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:09:34,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:09:34,161 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:09:34,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:09:34,161 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:09:34,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:09:34,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:09:34,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:09:34,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:09:34,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:09:34,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:09:34,163 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:09:34,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:09:34,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:09:34,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:09:34,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:09:34,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:09:34,163 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:09:34,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:09:34,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:09:34,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:09:34,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:09:34,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:09:34,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:09:34,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:09:34,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:09:34,164 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:09:34,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:09:34,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:09:34,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:09:34,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:09:34,470 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:09:34,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2022-12-13 06:09:35,547 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:09:35,828 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:09:35,829 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2022-12-13 06:09:35,854 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a03ac33/dbe27614a1ed4755868ab6afb1dcf878/FLAGe7a1c2de1 [2022-12-13 06:09:35,867 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a03ac33/dbe27614a1ed4755868ab6afb1dcf878 [2022-12-13 06:09:35,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:09:35,870 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:09:35,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:09:35,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:09:35,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:09:35,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:09:35" (1/1) ... [2022-12-13 06:09:35,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5118577a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:35, skipping insertion in model container [2022-12-13 06:09:35,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:09:35" (1/1) ... [2022-12-13 06:09:35,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:09:35,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:09:36,081 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/mix017.oepc.i[945,958] [2022-12-13 06:09:36,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:09:36,307 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:09:36,317 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/mix017.oepc.i[945,958] [2022-12-13 06:09:36,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:09:36,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:09:36,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:09:36,414 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:09:36,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36 WrapperNode [2022-12-13 06:09:36,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:09:36,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:09:36,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:09:36,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:09:36,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,477 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-13 06:09:36,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:09:36,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:09:36,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:09:36,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:09:36,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,497 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:09:36,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:09:36,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:09:36,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:09:36,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (1/1) ... [2022-12-13 06:09:36,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:09:36,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:09:36,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 06:09:36,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 06:09:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:09:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:09:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:09:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:09:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:09:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:09:36,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:09:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:09:36,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:09:36,571 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 06:09:36,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 06:09:36,571 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 06:09:36,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 06:09:36,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:09:36,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:09:36,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:09:36,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:09:36,572 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:09:36,683 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:09:36,685 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:09:37,014 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:09:37,184 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:09:37,184 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:09:37,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:09:37 BoogieIcfgContainer [2022-12-13 06:09:37,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:09:37,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:09:37,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:09:37,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:09:37,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:09:35" (1/3) ... [2022-12-13 06:09:37,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bca0322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:09:37, skipping insertion in model container [2022-12-13 06:09:37,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:09:36" (2/3) ... [2022-12-13 06:09:37,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bca0322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:09:37, skipping insertion in model container [2022-12-13 06:09:37,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:09:37" (3/3) ... [2022-12-13 06:09:37,197 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017.oepc.i [2022-12-13 06:09:37,212 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:09:37,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 06:09:37,212 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:09:37,278 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:09:37,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-13 06:09:37,389 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-13 06:09:37,390 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:09:37,397 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 88. Up to 2 conditions per place. [2022-12-13 06:09:37,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-13 06:09:37,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-13 06:09:37,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:37,419 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-13 06:09:37,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-13 06:09:37,455 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-13 06:09:37,455 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:09:37,456 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 88. Up to 2 conditions per place. [2022-12-13 06:09:37,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-13 06:09:37,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 3164 [2022-12-13 06:09:42,696 INFO L241 LiptonReduction]: Total number of compositions: 100 [2022-12-13 06:09:42,709 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:09:42,714 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;@7579a496, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:09:42,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 06:09:42,716 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-13 06:09:42,716 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:09:42,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:42,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 06:09:42,717 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-13 06:09:42,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:42,721 INFO L85 PathProgramCache]: Analyzing trace with hash 570603, now seen corresponding path program 1 times [2022-12-13 06:09:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:42,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637766896] [2022-12-13 06:09:42,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:42,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:09:42,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:42,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637766896] [2022-12-13 06:09:42,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637766896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:42,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:42,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:09:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541368426] [2022-12-13 06:09:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:42,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:09:42,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:43,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:09:43,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:09:43,015 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 82 [2022-12-13 06:09:43,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:09:43,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:43,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 82 [2022-12-13 06:09:43,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:09:50,356 INFO L130 PetriNetUnfolder]: 66790/97256 cut-off events. [2022-12-13 06:09:50,356 INFO L131 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2022-12-13 06:09:50,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185545 conditions, 97256 events. 66790/97256 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 4532. Compared 791823 event pairs, 9970 based on Foata normal form. 0/63205 useless extension candidates. Maximal degree in co-relation 185533. Up to 73765 conditions per place. [2022-12-13 06:09:50,659 INFO L137 encePairwiseOnDemand]: 78/82 looper letters, 48 selfloop transitions, 2 changer transitions 71/137 dead transitions. [2022-12-13 06:09:50,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 137 transitions, 535 flow [2022-12-13 06:09:50,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:09:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:09:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-12-13 06:09:50,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2022-12-13 06:09:50,673 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2022-12-13 06:09:50,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 137 transitions, 535 flow [2022-12-13 06:09:50,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 66 transitions, 253 flow [2022-12-13 06:09:51,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:09:51,447 INFO L89 Accepts]: Start accepts. Operand has 59 places, 66 transitions, 253 flow [2022-12-13 06:09:51,451 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:09:51,451 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:09:51,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 66 transitions, 253 flow [2022-12-13 06:09:51,457 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 66 transitions, 253 flow [2022-12-13 06:09:51,457 INFO L226 LiptonReduction]: Number of co-enabled transitions 1066 [2022-12-13 06:09:59,282 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:09:59,284 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7838 [2022-12-13 06:09:59,284 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 66 transitions, 253 flow [2022-12-13 06:09:59,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:09:59,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:09:59,285 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:09:59,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:09:59,285 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-13 06:09:59,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:09:59,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1983366052, now seen corresponding path program 1 times [2022-12-13 06:09:59,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:09:59,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166130819] [2022-12-13 06:09:59,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:09:59,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:09:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:09:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:09:59,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:09:59,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166130819] [2022-12-13 06:09:59,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166130819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:09:59,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:09:59,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:09:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365248256] [2022-12-13 06:09:59,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:09:59,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:09:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:09:59,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:09:59,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:09:59,466 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 06:09:59,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 66 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:09:59,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:09:59,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 06:09:59,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:10:01,799 INFO L130 PetriNetUnfolder]: 25015/34673 cut-off events. [2022-12-13 06:10:01,799 INFO L131 PetriNetUnfolder]: For 3460/3460 co-relation queries the response was YES. [2022-12-13 06:10:01,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94768 conditions, 34673 events. 25015/34673 cut-off events. For 3460/3460 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 197930 event pairs, 13255 based on Foata normal form. 16/29587 useless extension candidates. Maximal degree in co-relation 94753. Up to 32837 conditions per place. [2022-12-13 06:10:02,058 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 74 selfloop transitions, 5 changer transitions 2/92 dead transitions. [2022-12-13 06:10:02,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 524 flow [2022-12-13 06:10:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:10:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:10:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 06:10:02,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 06:10:02,060 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -34 predicate places. [2022-12-13 06:10:02,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 92 transitions, 524 flow [2022-12-13 06:10:02,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 90 transitions, 516 flow [2022-12-13 06:10:02,417 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:10:02,417 INFO L89 Accepts]: Start accepts. Operand has 60 places, 90 transitions, 516 flow [2022-12-13 06:10:02,418 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:10:02,418 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:10:02,418 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 90 transitions, 516 flow [2022-12-13 06:10:02,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 90 transitions, 516 flow [2022-12-13 06:10:02,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 900 [2022-12-13 06:10:03,032 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:10:03,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 616 [2022-12-13 06:10:03,034 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 90 transitions, 518 flow [2022-12-13 06:10:03,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:03,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:10:03,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:03,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:10:03,036 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-13 06:10:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:10:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash 950740768, now seen corresponding path program 1 times [2022-12-13 06:10:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:10:03,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383036870] [2022-12-13 06:10:03,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:10:03,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:10:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:10:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:10:03,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:10:03,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383036870] [2022-12-13 06:10:03,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383036870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:10:03,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:10:03,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:10:03,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117403946] [2022-12-13 06:10:03,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:10:03,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:10:03,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:10:03,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:10:03,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:10:03,255 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 06:10:03,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 90 transitions, 518 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:03,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:10:03,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 06:10:03,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:10:05,204 INFO L130 PetriNetUnfolder]: 18491/25755 cut-off events. [2022-12-13 06:10:05,205 INFO L131 PetriNetUnfolder]: For 2802/2802 co-relation queries the response was YES. [2022-12-13 06:10:05,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97439 conditions, 25755 events. 18491/25755 cut-off events. For 2802/2802 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 143097 event pairs, 2405 based on Foata normal form. 416/22257 useless extension candidates. Maximal degree in co-relation 97421. Up to 24433 conditions per place. [2022-12-13 06:10:05,650 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 103 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2022-12-13 06:10:05,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 117 transitions, 888 flow [2022-12-13 06:10:05,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:10:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:10:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 06:10:05,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 06:10:05,652 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -33 predicate places. [2022-12-13 06:10:05,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 117 transitions, 888 flow [2022-12-13 06:10:05,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 117 transitions, 888 flow [2022-12-13 06:10:05,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:10:05,883 INFO L89 Accepts]: Start accepts. Operand has 62 places, 117 transitions, 888 flow [2022-12-13 06:10:05,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:10:05,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:10:05,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 117 transitions, 888 flow [2022-12-13 06:10:05,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 117 transitions, 888 flow [2022-12-13 06:10:05,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 1130 [2022-12-13 06:10:05,894 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:10:05,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 06:10:05,895 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 117 transitions, 888 flow [2022-12-13 06:10:05,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:05,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:10:05,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:05,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:10:05,896 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-13 06:10:05,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:10:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash 949952438, now seen corresponding path program 1 times [2022-12-13 06:10:05,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:10:05,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215250867] [2022-12-13 06:10:05,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:10:05,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:10:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:10:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:10:06,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:10:06,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215250867] [2022-12-13 06:10:06,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215250867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:10:06,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:10:06,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:10:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400694250] [2022-12-13 06:10:06,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:10:06,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:10:06,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:10:06,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:10:06,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:10:06,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 06:10:06,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 117 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:06,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:10:06,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 06:10:06,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:10:08,878 INFO L130 PetriNetUnfolder]: 29283/39564 cut-off events. [2022-12-13 06:10:08,878 INFO L131 PetriNetUnfolder]: For 31606/32040 co-relation queries the response was YES. [2022-12-13 06:10:08,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177343 conditions, 39564 events. 29283/39564 cut-off events. For 31606/32040 co-relation queries the response was YES. Maximal size of possible extension queue 1301. Compared 217908 event pairs, 4233 based on Foata normal form. 360/34500 useless extension candidates. Maximal degree in co-relation 177322. Up to 35189 conditions per place. [2022-12-13 06:10:09,165 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 134 selfloop transitions, 29 changer transitions 0/179 dead transitions. [2022-12-13 06:10:09,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 179 transitions, 1701 flow [2022-12-13 06:10:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:10:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:10:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-12-13 06:10:09,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2022-12-13 06:10:09,167 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -31 predicate places. [2022-12-13 06:10:09,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 179 transitions, 1701 flow [2022-12-13 06:10:09,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 179 transitions, 1701 flow [2022-12-13 06:10:09,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:10:09,589 INFO L89 Accepts]: Start accepts. Operand has 64 places, 179 transitions, 1701 flow [2022-12-13 06:10:09,590 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:10:09,590 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:10:09,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 179 transitions, 1701 flow [2022-12-13 06:10:09,594 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 179 transitions, 1701 flow [2022-12-13 06:10:09,594 INFO L226 LiptonReduction]: Number of co-enabled transitions 1236 [2022-12-13 06:10:09,611 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:10:09,612 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 06:10:09,612 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 179 transitions, 1701 flow [2022-12-13 06:10:09,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:09,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:10:09,612 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:09,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:10:09,613 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-13 06:10:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:10:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1876050780, now seen corresponding path program 1 times [2022-12-13 06:10:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:10:09,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864484547] [2022-12-13 06:10:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:10:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:10:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:10:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:10:09,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:10:09,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864484547] [2022-12-13 06:10:09,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864484547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:10:09,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:10:09,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:10:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652398499] [2022-12-13 06:10:09,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:10:09,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:10:09,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:10:09,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:10:09,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:10:09,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 06:10:09,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 179 transitions, 1701 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:09,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:10:09,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 06:10:09,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:10:12,312 INFO L130 PetriNetUnfolder]: 18475/26305 cut-off events. [2022-12-13 06:10:12,312 INFO L131 PetriNetUnfolder]: For 30497/31660 co-relation queries the response was YES. [2022-12-13 06:10:12,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142441 conditions, 26305 events. 18475/26305 cut-off events. For 30497/31660 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 155104 event pairs, 1547 based on Foata normal form. 1441/24172 useless extension candidates. Maximal degree in co-relation 142417. Up to 23035 conditions per place. [2022-12-13 06:10:12,504 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 160 selfloop transitions, 57 changer transitions 0/233 dead transitions. [2022-12-13 06:10:12,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 233 transitions, 2660 flow [2022-12-13 06:10:12,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:10:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:10:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-12-13 06:10:12,506 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-13 06:10:12,507 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -28 predicate places. [2022-12-13 06:10:12,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 233 transitions, 2660 flow [2022-12-13 06:10:12,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 233 transitions, 2660 flow [2022-12-13 06:10:12,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:10:12,765 INFO L89 Accepts]: Start accepts. Operand has 67 places, 233 transitions, 2660 flow [2022-12-13 06:10:12,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:10:12,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:10:12,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 233 transitions, 2660 flow [2022-12-13 06:10:12,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 233 transitions, 2660 flow [2022-12-13 06:10:12,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 1518 [2022-12-13 06:10:12,783 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:10:12,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 06:10:12,784 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 233 transitions, 2660 flow [2022-12-13 06:10:12,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:12,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:10:12,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:12,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:10:12,784 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-13 06:10:12,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:10:12,785 INFO L85 PathProgramCache]: Analyzing trace with hash 467331882, now seen corresponding path program 1 times [2022-12-13 06:10:12,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:10:12,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090754216] [2022-12-13 06:10:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:10:12,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:10:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:10:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:10:13,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:10:13,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090754216] [2022-12-13 06:10:13,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090754216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:10:13,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:10:13,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:10:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650685779] [2022-12-13 06:10:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:10:13,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:10:13,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:10:13,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:10:13,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:10:13,071 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 06:10:13,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 233 transitions, 2660 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:13,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:10:13,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 06:10:13,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:10:14,379 INFO L130 PetriNetUnfolder]: 10471/15601 cut-off events. [2022-12-13 06:10:14,379 INFO L131 PetriNetUnfolder]: For 28032/29254 co-relation queries the response was YES. [2022-12-13 06:10:14,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98789 conditions, 15601 events. 10471/15601 cut-off events. For 28032/29254 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 92200 event pairs, 372 based on Foata normal form. 1530/14886 useless extension candidates. Maximal degree in co-relation 98762. Up to 13460 conditions per place. [2022-12-13 06:10:14,484 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 158 selfloop transitions, 81 changer transitions 0/255 dead transitions. [2022-12-13 06:10:14,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 255 transitions, 3381 flow [2022-12-13 06:10:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:10:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:10:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2022-12-13 06:10:14,486 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.759090909090909 [2022-12-13 06:10:14,486 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -24 predicate places. [2022-12-13 06:10:14,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 255 transitions, 3381 flow [2022-12-13 06:10:14,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 255 transitions, 3381 flow [2022-12-13 06:10:14,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:10:14,652 INFO L89 Accepts]: Start accepts. Operand has 71 places, 255 transitions, 3381 flow [2022-12-13 06:10:14,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:10:14,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:10:14,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 255 transitions, 3381 flow [2022-12-13 06:10:14,659 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 255 transitions, 3381 flow [2022-12-13 06:10:14,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 1534 [2022-12-13 06:10:14,665 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:10:14,666 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 06:10:14,666 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 255 transitions, 3381 flow [2022-12-13 06:10:14,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:14,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:10:14,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:14,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:10:14,666 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-13 06:10:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:10:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1750311427, now seen corresponding path program 1 times [2022-12-13 06:10:14,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:10:14,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521455336] [2022-12-13 06:10:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:10:14,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:10:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:10:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:10:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:10:14,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521455336] [2022-12-13 06:10:14,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521455336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:10:14,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:10:14,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:10:14,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172458661] [2022-12-13 06:10:14,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:10:14,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:10:14,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:10:14,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:10:14,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:10:14,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 06:10:14,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 255 transitions, 3381 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:14,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:10:14,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 06:10:14,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:10:17,243 INFO L130 PetriNetUnfolder]: 16656/24967 cut-off events. [2022-12-13 06:10:17,243 INFO L131 PetriNetUnfolder]: For 49351/50400 co-relation queries the response was YES. [2022-12-13 06:10:17,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178493 conditions, 24967 events. 16656/24967 cut-off events. For 49351/50400 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 161157 event pairs, 504 based on Foata normal form. 482/21611 useless extension candidates. Maximal degree in co-relation 178463. Up to 21361 conditions per place. [2022-12-13 06:10:17,398 INFO L137 encePairwiseOnDemand]: 36/44 looper letters, 322 selfloop transitions, 22 changer transitions 118/485 dead transitions. [2022-12-13 06:10:17,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 485 transitions, 7491 flow [2022-12-13 06:10:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:10:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:10:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2022-12-13 06:10:17,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6439393939393939 [2022-12-13 06:10:17,400 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -19 predicate places. [2022-12-13 06:10:17,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 485 transitions, 7491 flow [2022-12-13 06:10:17,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 367 transitions, 5630 flow [2022-12-13 06:10:17,679 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:10:17,679 INFO L89 Accepts]: Start accepts. Operand has 76 places, 367 transitions, 5630 flow [2022-12-13 06:10:17,680 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:10:17,681 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:10:17,681 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 367 transitions, 5630 flow [2022-12-13 06:10:17,692 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 367 transitions, 5630 flow [2022-12-13 06:10:17,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-13 06:10:17,700 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:10:17,701 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 06:10:17,702 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 367 transitions, 5630 flow [2022-12-13 06:10:17,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:17,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:10:17,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:17,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:10:17,702 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-13 06:10:17,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:10:17,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1133522942, now seen corresponding path program 1 times [2022-12-13 06:10:17,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:10:17,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539442885] [2022-12-13 06:10:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:10:17,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:10:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:10:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:10:18,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:10:18,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539442885] [2022-12-13 06:10:18,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539442885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:10:18,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:10:18,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:10:18,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503750296] [2022-12-13 06:10:18,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:10:18,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:10:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:10:18,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:10:18,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:10:18,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2022-12-13 06:10:18,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 367 transitions, 5630 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:18,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:10:18,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2022-12-13 06:10:18,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:10:20,941 INFO L130 PetriNetUnfolder]: 13633/21730 cut-off events. [2022-12-13 06:10:20,941 INFO L131 PetriNetUnfolder]: For 54432/55247 co-relation queries the response was YES. [2022-12-13 06:10:20,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171515 conditions, 21730 events. 13633/21730 cut-off events. For 54432/55247 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 153685 event pairs, 661 based on Foata normal form. 455/18618 useless extension candidates. Maximal degree in co-relation 171482. Up to 18853 conditions per place. [2022-12-13 06:10:21,085 INFO L137 encePairwiseOnDemand]: 36/44 looper letters, 443 selfloop transitions, 46 changer transitions 120/646 dead transitions. [2022-12-13 06:10:21,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 646 transitions, 11354 flow [2022-12-13 06:10:21,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:10:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:10:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2022-12-13 06:10:21,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7402597402597403 [2022-12-13 06:10:21,087 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -13 predicate places. [2022-12-13 06:10:21,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 646 transitions, 11354 flow [2022-12-13 06:10:21,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 526 transitions, 9194 flow [2022-12-13 06:10:21,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:10:21,345 INFO L89 Accepts]: Start accepts. Operand has 80 places, 526 transitions, 9194 flow [2022-12-13 06:10:21,347 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:10:21,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:10:21,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 526 transitions, 9194 flow [2022-12-13 06:10:21,369 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 526 transitions, 9194 flow [2022-12-13 06:10:21,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 2514 [2022-12-13 06:10:21,378 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:10:21,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 06:10:21,379 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 526 transitions, 9194 flow [2022-12-13 06:10:21,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:21,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:10:21,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:21,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:10:21,379 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-13 06:10:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:10:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1062700503, now seen corresponding path program 1 times [2022-12-13 06:10:21,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:10:21,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776646564] [2022-12-13 06:10:21,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:10:21,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:10:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:10:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:10:21,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:10:21,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776646564] [2022-12-13 06:10:21,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776646564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:10:21,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:10:21,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:10:21,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728918799] [2022-12-13 06:10:21,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:10:21,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:10:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:10:21,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:10:21,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:10:21,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 06:10:21,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 526 transitions, 9194 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:21,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:10:21,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 06:10:21,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:10:25,041 INFO L130 PetriNetUnfolder]: 15372/25330 cut-off events. [2022-12-13 06:10:25,041 INFO L131 PetriNetUnfolder]: For 75547/77045 co-relation queries the response was YES. [2022-12-13 06:10:25,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221803 conditions, 25330 events. 15372/25330 cut-off events. For 75547/77045 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 193830 event pairs, 676 based on Foata normal form. 585/21706 useless extension candidates. Maximal degree in co-relation 221767. Up to 22046 conditions per place. [2022-12-13 06:10:25,200 INFO L137 encePairwiseOnDemand]: 37/44 looper letters, 678 selfloop transitions, 34 changer transitions 248/983 dead transitions. [2022-12-13 06:10:25,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 983 transitions, 19230 flow [2022-12-13 06:10:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:10:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:10:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2022-12-13 06:10:25,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2022-12-13 06:10:25,202 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -10 predicate places. [2022-12-13 06:10:25,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 983 transitions, 19230 flow [2022-12-13 06:10:25,391 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 735 transitions, 14300 flow [2022-12-13 06:10:25,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:10:25,605 INFO L89 Accepts]: Start accepts. Operand has 85 places, 735 transitions, 14300 flow [2022-12-13 06:10:25,608 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:10:25,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:10:25,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 735 transitions, 14300 flow [2022-12-13 06:10:25,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 735 transitions, 14300 flow [2022-12-13 06:10:25,649 INFO L226 LiptonReduction]: Number of co-enabled transitions 3226 [2022-12-13 06:10:25,656 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:10:25,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 06:10:25,657 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 735 transitions, 14300 flow [2022-12-13 06:10:25,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:25,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:10:25,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:25,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:10:25,658 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-13 06:10:25,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:10:25,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1136708217, now seen corresponding path program 2 times [2022-12-13 06:10:25,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:10:25,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739059663] [2022-12-13 06:10:25,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:10:25,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:10:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:10:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:10:25,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:10:25,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739059663] [2022-12-13 06:10:25,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739059663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:10:25,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:10:25,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:10:25,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306214743] [2022-12-13 06:10:25,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:10:25,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:10:25,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:10:25,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:10:25,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:10:25,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 06:10:25,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 735 transitions, 14300 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:25,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:10:25,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 06:10:25,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:10:27,753 INFO L130 PetriNetUnfolder]: 8668/13421 cut-off events. [2022-12-13 06:10:27,753 INFO L131 PetriNetUnfolder]: For 64661/66674 co-relation queries the response was YES. [2022-12-13 06:10:27,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129110 conditions, 13421 events. 8668/13421 cut-off events. For 64661/66674 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 83796 event pairs, 182 based on Foata normal form. 1096/12234 useless extension candidates. Maximal degree in co-relation 129071. Up to 11324 conditions per place. [2022-12-13 06:10:27,833 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 234 selfloop transitions, 189 changer transitions 279/718 dead transitions. [2022-12-13 06:10:27,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 718 transitions, 15338 flow [2022-12-13 06:10:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:10:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:10:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2022-12-13 06:10:27,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2022-12-13 06:10:27,835 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2022-12-13 06:10:27,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 718 transitions, 15338 flow [2022-12-13 06:10:27,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 439 transitions, 9323 flow [2022-12-13 06:10:28,016 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:10:28,016 INFO L89 Accepts]: Start accepts. Operand has 86 places, 439 transitions, 9323 flow [2022-12-13 06:10:28,019 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:10:28,019 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:10:28,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 439 transitions, 9323 flow [2022-12-13 06:10:28,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 439 transitions, 9323 flow [2022-12-13 06:10:28,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 2030 [2022-12-13 06:10:28,549 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:10:28,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 533 [2022-12-13 06:10:28,550 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 437 transitions, 9279 flow [2022-12-13 06:10:28,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:28,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:10:28,550 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:28,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 06:10:28,550 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-13 06:10:28,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:10:28,550 INFO L85 PathProgramCache]: Analyzing trace with hash 934690079, now seen corresponding path program 1 times [2022-12-13 06:10:28,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:10:28,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421999794] [2022-12-13 06:10:28,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:10:28,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:10:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:10:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:10:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:10:28,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421999794] [2022-12-13 06:10:28,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421999794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:10:28,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:10:28,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:10:28,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812743124] [2022-12-13 06:10:28,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:10:28,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:10:28,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:10:28,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:10:28,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:10:28,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2022-12-13 06:10:28,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 437 transitions, 9279 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:28,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:10:28,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2022-12-13 06:10:28,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:10:30,468 INFO L130 PetriNetUnfolder]: 9273/13814 cut-off events. [2022-12-13 06:10:30,468 INFO L131 PetriNetUnfolder]: For 78212/79114 co-relation queries the response was YES. [2022-12-13 06:10:30,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144587 conditions, 13814 events. 9273/13814 cut-off events. For 78212/79114 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 82334 event pairs, 12 based on Foata normal form. 164/11279 useless extension candidates. Maximal degree in co-relation 144545. Up to 12107 conditions per place. [2022-12-13 06:10:30,534 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 292 selfloop transitions, 6 changer transitions 473/796 dead transitions. [2022-12-13 06:10:30,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 796 transitions, 18735 flow [2022-12-13 06:10:30,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:10:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:10:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-12-13 06:10:30,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2022-12-13 06:10:30,536 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -8 predicate places. [2022-12-13 06:10:30,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 796 transitions, 18735 flow [2022-12-13 06:10:30,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 323 transitions, 7453 flow [2022-12-13 06:10:30,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:10:30,705 INFO L89 Accepts]: Start accepts. Operand has 85 places, 323 transitions, 7453 flow [2022-12-13 06:10:30,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:10:30,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:10:30,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 323 transitions, 7453 flow [2022-12-13 06:10:30,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 323 transitions, 7453 flow [2022-12-13 06:10:30,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 1110 [2022-12-13 06:10:30,756 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:10:30,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 06:10:30,757 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 323 transitions, 7453 flow [2022-12-13 06:10:30,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:30,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:10:30,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:30,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 06:10:30,758 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-13 06:10:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:10:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1937106535, now seen corresponding path program 1 times [2022-12-13 06:10:30,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:10:30,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350467210] [2022-12-13 06:10:30,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:10:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:10:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:10:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:10:31,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:10:31,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350467210] [2022-12-13 06:10:31,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350467210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:10:31,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:10:31,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:10:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357240544] [2022-12-13 06:10:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:10:31,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 06:10:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:10:31,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 06:10:31,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 06:10:31,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2022-12-13 06:10:31,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 323 transitions, 7453 flow. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:31,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:10:31,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2022-12-13 06:10:31,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:10:32,507 INFO L130 PetriNetUnfolder]: 4991/7562 cut-off events. [2022-12-13 06:10:32,507 INFO L131 PetriNetUnfolder]: For 53233/53756 co-relation queries the response was YES. [2022-12-13 06:10:32,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84767 conditions, 7562 events. 4991/7562 cut-off events. For 53233/53756 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 41512 event pairs, 0 based on Foata normal form. 107/6006 useless extension candidates. Maximal degree in co-relation 84722. Up to 6966 conditions per place. [2022-12-13 06:10:32,548 INFO L137 encePairwiseOnDemand]: 36/41 looper letters, 195 selfloop transitions, 10 changer transitions 201/431 dead transitions. [2022-12-13 06:10:32,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 431 transitions, 10876 flow [2022-12-13 06:10:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:10:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:10:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2022-12-13 06:10:32,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5975609756097561 [2022-12-13 06:10:32,551 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2022-12-13 06:10:32,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 431 transitions, 10876 flow [2022-12-13 06:10:32,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 230 transitions, 5605 flow [2022-12-13 06:10:32,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:10:32,718 INFO L89 Accepts]: Start accepts. Operand has 88 places, 230 transitions, 5605 flow [2022-12-13 06:10:32,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:10:32,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:10:32,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 230 transitions, 5605 flow [2022-12-13 06:10:32,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 230 transitions, 5605 flow [2022-12-13 06:10:32,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-13 06:10:32,765 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:10:32,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 06:10:32,766 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 230 transitions, 5605 flow [2022-12-13 06:10:32,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:10:32,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:10:32,766 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:32,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 06:10:32,766 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-13 06:10:32,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:10:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2131469176, now seen corresponding path program 1 times [2022-12-13 06:10:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:10:32,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836383091] [2022-12-13 06:10:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:10:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:10:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:10:32,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 06:10:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:10:32,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 06:10:32,912 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 06:10:32,913 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 06:10:32,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 06:10:32,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 06:10:32,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 06:10:32,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 06:10:32,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 06:10:32,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 06:10:32,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 06:10:32,915 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:10:32,920 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:10:32,920 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:10:33,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:10:33 BasicIcfg [2022-12-13 06:10:33,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:10:33,032 INFO L158 Benchmark]: Toolchain (without parser) took 57161.98ms. Allocated memory was 223.3MB in the beginning and 6.2GB in the end (delta: 5.9GB). Free memory was 199.7MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-13 06:10:33,032 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 223.3MB. Free memory is still 200.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:10:33,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.08ms. Allocated memory is still 223.3MB. Free memory was 199.2MB in the beginning and 171.4MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 06:10:33,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.54ms. Allocated memory is still 223.3MB. Free memory was 171.4MB in the beginning and 168.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 06:10:33,032 INFO L158 Benchmark]: Boogie Preprocessor took 23.10ms. Allocated memory is still 223.3MB. Free memory was 168.8MB in the beginning and 166.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:10:33,032 INFO L158 Benchmark]: RCFGBuilder took 684.54ms. Allocated memory is still 223.3MB. Free memory was 166.7MB in the beginning and 127.9MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-13 06:10:33,033 INFO L158 Benchmark]: TraceAbstraction took 55843.21ms. Allocated memory was 223.3MB in the beginning and 6.2GB in the end (delta: 5.9GB). Free memory was 126.3MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-13 06:10:33,034 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.16ms. Allocated memory is still 223.3MB. Free memory is still 200.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 545.08ms. Allocated memory is still 223.3MB. Free memory was 199.2MB in the beginning and 171.4MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.54ms. Allocated memory is still 223.3MB. Free memory was 171.4MB in the beginning and 168.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.10ms. Allocated memory is still 223.3MB. Free memory was 168.8MB in the beginning and 166.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 684.54ms. Allocated memory is still 223.3MB. Free memory was 166.7MB in the beginning and 127.9MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 55843.21ms. Allocated memory was 223.3MB in the beginning and 6.2GB in the end (delta: 5.9GB). Free memory was 126.3MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 139 PlacesBefore, 95 PlacesAfterwards, 128 TransitionsBefore, 82 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4763, independent: 4548, independent conditional: 4548, independent unconditional: 0, dependent: 215, dependent conditional: 215, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4763, independent: 4548, independent conditional: 0, independent unconditional: 4548, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4763, independent: 4548, independent conditional: 0, independent unconditional: 4548, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4763, independent: 4548, independent conditional: 0, independent unconditional: 4548, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2727, independent: 2656, independent conditional: 0, independent unconditional: 2656, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2727, independent: 2641, independent conditional: 0, independent unconditional: 2641, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 289, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4763, independent: 1892, independent conditional: 0, independent unconditional: 1892, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 2727, unknown conditional: 0, unknown unconditional: 2727] , Statistics on independence cache: Total cache size (in pairs): 5089, Positive cache size: 5018, Positive conditional cache size: 0, Positive unconditional cache size: 5018, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, 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: 7.8s, 59 PlacesBefore, 59 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 1066 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 88, independent conditional: 28, independent unconditional: 60, dependent: 11, dependent conditional: 10, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 88, independent conditional: 8, independent unconditional: 80, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 88, independent conditional: 8, independent unconditional: 80, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, independent: 36, independent conditional: 4, independent unconditional: 32, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 52, independent conditional: 4, independent unconditional: 48, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 43, unknown conditional: 4, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 36, Positive conditional cache size: 4, Positive unconditional cache size: 32, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 60 PlacesBefore, 60 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 900 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 4, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 1130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 4, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 179 TransitionsBefore, 179 TransitionsAfterwards, 1236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 4, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 233 TransitionsBefore, 233 TransitionsAfterwards, 1518 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 4, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 255 TransitionsBefore, 255 TransitionsAfterwards, 1534 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 4, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 367 TransitionsBefore, 367 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 4, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 526 TransitionsBefore, 526 TransitionsAfterwards, 2514 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 4, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 735 TransitionsBefore, 735 TransitionsAfterwards, 3226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 4, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 86 PlacesBefore, 84 PlacesAfterwards, 439 TransitionsBefore, 437 TransitionsAfterwards, 2030 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 4, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 323 TransitionsBefore, 323 TransitionsAfterwards, 1110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 11, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 55, Positive conditional cache size: 12, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 230 TransitionsBefore, 230 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 55, Positive conditional cache size: 12, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L868] 0 pthread_t t433; [L869] FCALL, FORK 0 pthread_create(&t433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t433, ((void *)0), P0, ((void *)0))=-3, t433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t434; [L871] FCALL, FORK 0 pthread_create(&t434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t434, ((void *)0), P1, ((void *)0))=-2, t433={5:0}, t434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t435; [L873] FCALL, FORK 0 pthread_create(&t435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t435, ((void *)0), P2, ((void *)0))=-1, t433={5:0}, t434={6:0}, t435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] 0 pthread_t t436; [L875] FCALL, FORK 0 pthread_create(&t436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t436, ((void *)0), P3, ((void *)0))=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L810] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L827] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 a$flush_delayed = weak$$choice2 [L833] 4 a$mem_tmp = a [L834] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EBX = a [L842] 4 a = a$flush_delayed ? a$mem_tmp : a [L843] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L846] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L853] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L877] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L879] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L879] RET 0 assume_abort_if_not(main$tmp_guard0) [L881] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, 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: 871]: 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: 875]: 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: 873]: 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: 869]: 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, 169 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: 55.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 33.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 558 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 558 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1846 IncrementalHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 24 mSDtfsCounter, 1846 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14300occurred in iteration=9, InterpolantAutomatonStates: 56, 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.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 06:10:33,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...