/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:14:06,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:14:06,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:14:06,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:14:06,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:14:06,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:14:06,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:14:06,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:14:06,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:14:06,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:14:06,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:14:06,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:14:06,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:14:06,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:14:06,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:14:06,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:14:06,363 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:14:06,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:14:06,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:14:06,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:14:06,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:14:06,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:14:06,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:14:06,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:14:06,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:14:06,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:14:06,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:14:06,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:14:06,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:14:06,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:14:06,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:14:06,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:14:06,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:14:06,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:14:06,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:14:06,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:14:06,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:14:06,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:14:06,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:14:06,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:14:06,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:14:06,379 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-06 01:14:06,428 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:14:06,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:14:06,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:14:06,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:14:06,430 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:14:06,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:14:06,430 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:14:06,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:14:06,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:14:06,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:14:06,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:14:06,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:14:06,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:14:06,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:14:06,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:14:06,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:14:06,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:14:06,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:14:06,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:14:06,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:14:06,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:14:06,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:14:06,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:14:06,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:14:06,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:14:06,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:14:06,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:14:06,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:14:06,432 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 [2022-12-06 01:14:06,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:14:06,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:14:06,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:14:06,799 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:14:06,802 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:14:06,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:14:07,741 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:14:07,984 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:14:07,985 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:14:07,992 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854467b5a/db9d096c2d304adda085d26300e2648d/FLAG62bc052a9 [2022-12-06 01:14:08,009 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854467b5a/db9d096c2d304adda085d26300e2648d [2022-12-06 01:14:08,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:14:08,018 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:14:08,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:14:08,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:14:08,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:14:08,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177bd890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08, skipping insertion in model container [2022-12-06 01:14:08,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:14:08,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:14:08,146 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/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-06 01:14:08,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:14:08,278 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:14:08,288 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/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-06 01:14:08,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:08,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:08,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:14:08,365 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:14:08,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08 WrapperNode [2022-12-06 01:14:08,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:14:08,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:14:08,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:14:08,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:14:08,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,399 INFO L138 Inliner]: procedures = 177, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-12-06 01:14:08,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:14:08,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:14:08,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:14:08,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:14:08,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,415 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:14:08,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:14:08,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:14:08,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:14:08,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (1/1) ... [2022-12-06 01:14:08,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:14:08,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:14:08,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 01:14:08,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 01:14:08,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:14:08,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:14:08,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:14:08,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:14:08,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:14:08,501 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:14:08,501 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:14:08,501 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:14:08,501 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:14:08,501 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:14:08,501 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:14:08,501 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 01:14:08,501 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 01:14:08,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:14:08,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:14:08,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:14:08,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:14:08,503 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:14:08,588 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:14:08,589 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:14:08,750 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:14:08,759 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:14:08,759 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:14:08,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:14:08 BoogieIcfgContainer [2022-12-06 01:14:08,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:14:08,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:14:08,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:14:08,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:14:08,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:14:08" (1/3) ... [2022-12-06 01:14:08,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6477dd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:14:08, skipping insertion in model container [2022-12-06 01:14:08,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:08" (2/3) ... [2022-12-06 01:14:08,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6477dd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:14:08, skipping insertion in model container [2022-12-06 01:14:08,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:14:08" (3/3) ... [2022-12-06 01:14:08,770 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:14:08,784 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:14:08,785 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:14:08,785 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:14:08,883 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:14:08,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 98 transitions, 216 flow [2022-12-06 01:14:08,980 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-06 01:14:08,980 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:14:08,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-06 01:14:08,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 98 transitions, 216 flow [2022-12-06 01:14:08,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 80 transitions, 172 flow [2022-12-06 01:14:08,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:09,017 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 80 transitions, 172 flow [2022-12-06 01:14:09,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 80 transitions, 172 flow [2022-12-06 01:14:09,055 INFO L130 PetriNetUnfolder]: 1/80 cut-off events. [2022-12-06 01:14:09,055 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:14:09,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 80 events. 1/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 43 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 01:14:09,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 80 transitions, 172 flow [2022-12-06 01:14:09,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 1542 [2022-12-06 01:14:11,392 INFO L203 LiptonReduction]: Total number of compositions: 60 [2022-12-06 01:14:11,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:14:11,423 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;@9c6affe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:14:11,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 01:14:11,427 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 01:14:11,427 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:14:11,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:11,429 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:11,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:11,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1731683458, now seen corresponding path program 1 times [2022-12-06 01:14:11,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:11,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111913127] [2022-12-06 01:14:11,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:11,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:11,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111913127] [2022-12-06 01:14:11,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111913127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:11,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:11,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:14:11,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125199085] [2022-12-06 01:14:11,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:11,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:14:11,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:11,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:14:11,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:14:11,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:14:11,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:11,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:11,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:14:11,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:12,061 INFO L130 PetriNetUnfolder]: 2019/2943 cut-off events. [2022-12-06 01:14:12,061 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-06 01:14:12,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6086 conditions, 2943 events. 2019/2943 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13535 event pairs, 796 based on Foata normal form. 109/3052 useless extension candidates. Maximal degree in co-relation 6074. Up to 1819 conditions per place. [2022-12-06 01:14:12,075 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 30 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2022-12-06 01:14:12,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 169 flow [2022-12-06 01:14:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:14:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:14:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 01:14:12,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2022-12-06 01:14:12,085 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2022-12-06 01:14:12,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:12,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 37 transitions, 169 flow [2022-12-06 01:14:12,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 37 transitions, 169 flow [2022-12-06 01:14:12,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:12,180 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:14:12,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 01:14:12,181 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 169 flow [2022-12-06 01:14:12,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:12,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:12,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:12,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:14:12,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:12,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2142579882, now seen corresponding path program 1 times [2022-12-06 01:14:12,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:12,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625464582] [2022-12-06 01:14:12,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:12,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:12,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:12,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625464582] [2022-12-06 01:14:12,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625464582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:12,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:12,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:14:12,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259172597] [2022-12-06 01:14:12,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:12,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:14:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:12,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:14:12,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:14:12,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 01:14:12,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:12,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:12,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 01:14:12,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:12,476 INFO L130 PetriNetUnfolder]: 1875/2754 cut-off events. [2022-12-06 01:14:12,476 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-12-06 01:14:12,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8269 conditions, 2754 events. 1875/2754 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12677 event pairs, 144 based on Foata normal form. 42/2796 useless extension candidates. Maximal degree in co-relation 8254. Up to 2178 conditions per place. [2022-12-06 01:14:12,489 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 49 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2022-12-06 01:14:12,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 56 transitions, 359 flow [2022-12-06 01:14:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:14:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:14:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 01:14:12,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 01:14:12,491 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2022-12-06 01:14:12,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:12,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 56 transitions, 359 flow [2022-12-06 01:14:12,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 56 transitions, 359 flow [2022-12-06 01:14:12,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:12,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:14:12,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 01:14:12,572 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 56 transitions, 361 flow [2022-12-06 01:14:12,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:12,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:12,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:12,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:14:12,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2142580688, now seen corresponding path program 1 times [2022-12-06 01:14:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:12,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160862340] [2022-12-06 01:14:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:12,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160862340] [2022-12-06 01:14:12,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160862340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:12,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:12,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:14:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171371319] [2022-12-06 01:14:12,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:12,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:14:12,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:12,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:14:12,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:14:12,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 01:14:12,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 56 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:12,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:12,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 01:14:12,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:12,875 INFO L130 PetriNetUnfolder]: 1649/2488 cut-off events. [2022-12-06 01:14:12,875 INFO L131 PetriNetUnfolder]: For 1035/1035 co-relation queries the response was YES. [2022-12-06 01:14:12,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9592 conditions, 2488 events. 1649/2488 cut-off events. For 1035/1035 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11974 event pairs, 94 based on Foata normal form. 56/2544 useless extension candidates. Maximal degree in co-relation 9574. Up to 1912 conditions per place. [2022-12-06 01:14:12,890 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 77 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2022-12-06 01:14:12,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 88 transitions, 736 flow [2022-12-06 01:14:12,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:14:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:14:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 01:14:12,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-06 01:14:12,892 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2022-12-06 01:14:12,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:12,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 88 transitions, 736 flow [2022-12-06 01:14:12,905 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 88 transitions, 736 flow [2022-12-06 01:14:12,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:12,971 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:14:12,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 01:14:12,972 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 88 transitions, 740 flow [2022-12-06 01:14:12,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:12,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:12,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:12,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:14:12,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:12,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1995467944, now seen corresponding path program 1 times [2022-12-06 01:14:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:12,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640263639] [2022-12-06 01:14:12,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:13,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:13,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640263639] [2022-12-06 01:14:13,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640263639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:13,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:13,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:14:13,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812909709] [2022-12-06 01:14:13,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:13,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:14:13,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:13,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:14:13,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:14:13,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 01:14:13,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 88 transitions, 740 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:13,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:13,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 01:14:13,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:13,312 INFO L130 PetriNetUnfolder]: 2169/3356 cut-off events. [2022-12-06 01:14:13,313 INFO L131 PetriNetUnfolder]: For 1433/1433 co-relation queries the response was YES. [2022-12-06 01:14:13,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16233 conditions, 3356 events. 2169/3356 cut-off events. For 1433/1433 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 17944 event pairs, 92 based on Foata normal form. 168/3524 useless extension candidates. Maximal degree in co-relation 16212. Up to 2704 conditions per place. [2022-12-06 01:14:13,327 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 52 selfloop transitions, 11 changer transitions 47/110 dead transitions. [2022-12-06 01:14:13,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 110 transitions, 1122 flow [2022-12-06 01:14:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:14:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:14:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 01:14:13,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 01:14:13,329 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2022-12-06 01:14:13,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:13,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 110 transitions, 1122 flow [2022-12-06 01:14:13,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 110 transitions, 1122 flow [2022-12-06 01:14:13,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:13,345 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:13,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 01:14:13,345 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 110 transitions, 1122 flow [2022-12-06 01:14:13,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:13,346 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:13,346 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:13,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:14:13,346 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:13,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:13,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1995492124, now seen corresponding path program 2 times [2022-12-06 01:14:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:13,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222696441] [2022-12-06 01:14:13,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:13,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:13,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222696441] [2022-12-06 01:14:13,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222696441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:13,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:13,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:14:13,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042318285] [2022-12-06 01:14:13,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:13,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:14:13,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:13,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:14:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:14:13,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:14:13,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 110 transitions, 1122 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:13,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:13,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:14:13,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:13,661 INFO L130 PetriNetUnfolder]: 2096/3257 cut-off events. [2022-12-06 01:14:13,661 INFO L131 PetriNetUnfolder]: For 1388/1388 co-relation queries the response was YES. [2022-12-06 01:14:13,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19008 conditions, 3257 events. 2096/3257 cut-off events. For 1388/1388 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 17372 event pairs, 50 based on Foata normal form. 28/3285 useless extension candidates. Maximal degree in co-relation 18984. Up to 2611 conditions per place. [2022-12-06 01:14:13,678 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 65 selfloop transitions, 15 changer transitions 70/150 dead transitions. [2022-12-06 01:14:13,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 150 transitions, 1819 flow [2022-12-06 01:14:13,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:14:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:14:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 01:14:13,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-06 01:14:13,682 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2022-12-06 01:14:13,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:13,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 150 transitions, 1819 flow [2022-12-06 01:14:13,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 150 transitions, 1819 flow [2022-12-06 01:14:13,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:13,700 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:13,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 01:14:13,701 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 150 transitions, 1819 flow [2022-12-06 01:14:13,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:13,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:13,702 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:13,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:14:13,702 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:13,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1730623602, now seen corresponding path program 1 times [2022-12-06 01:14:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:13,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553530420] [2022-12-06 01:14:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:13,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:13,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553530420] [2022-12-06 01:14:13,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553530420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:13,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:13,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:14:13,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957082782] [2022-12-06 01:14:13,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:13,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:14:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:13,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:14:13,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:14:13,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:14:13,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 150 transitions, 1819 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:13,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:13,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:14:13,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:14,084 INFO L130 PetriNetUnfolder]: 2343/3742 cut-off events. [2022-12-06 01:14:14,084 INFO L131 PetriNetUnfolder]: For 1644/1644 co-relation queries the response was YES. [2022-12-06 01:14:14,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25577 conditions, 3742 events. 2343/3742 cut-off events. For 1644/1644 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 21447 event pairs, 30 based on Foata normal form. 84/3826 useless extension candidates. Maximal degree in co-relation 25550. Up to 3054 conditions per place. [2022-12-06 01:14:14,099 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 76 selfloop transitions, 16 changer transitions 83/175 dead transitions. [2022-12-06 01:14:14,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 175 transitions, 2461 flow [2022-12-06 01:14:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:14:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:14:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 01:14:14,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 01:14:14,103 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2022-12-06 01:14:14,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:14,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 175 transitions, 2461 flow [2022-12-06 01:14:14,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 175 transitions, 2461 flow [2022-12-06 01:14:14,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:14,124 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:14,124 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 01:14:14,124 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 175 transitions, 2461 flow [2022-12-06 01:14:14,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:14,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:14,125 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:14,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:14:14,125 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:14,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1730589967, now seen corresponding path program 1 times [2022-12-06 01:14:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:14,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294364480] [2022-12-06 01:14:14,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:14,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:14,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:14,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294364480] [2022-12-06 01:14:14,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294364480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:14,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:14,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:14:14,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493341890] [2022-12-06 01:14:14,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:14,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:14:14,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:14,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:14:14,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:14:14,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 01:14:14,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 175 transitions, 2461 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:14,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:14,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 01:14:14,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:14,689 INFO L130 PetriNetUnfolder]: 3282/5363 cut-off events. [2022-12-06 01:14:14,689 INFO L131 PetriNetUnfolder]: For 3422/3422 co-relation queries the response was YES. [2022-12-06 01:14:14,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41646 conditions, 5363 events. 3282/5363 cut-off events. For 3422/3422 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 34304 event pairs, 38 based on Foata normal form. 100/5463 useless extension candidates. Maximal degree in co-relation 41616. Up to 4485 conditions per place. [2022-12-06 01:14:14,708 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 72 selfloop transitions, 9 changer transitions 231/315 dead transitions. [2022-12-06 01:14:14,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 315 transitions, 5024 flow [2022-12-06 01:14:14,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:14:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:14:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 01:14:14,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 01:14:14,710 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2022-12-06 01:14:14,710 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:14,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 315 transitions, 5024 flow [2022-12-06 01:14:14,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 315 transitions, 5024 flow [2022-12-06 01:14:14,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:14,750 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:14,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 01:14:14,750 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 315 transitions, 5024 flow [2022-12-06 01:14:14,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:14,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:14,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:14,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:14:14,751 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:14,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2127951633, now seen corresponding path program 1 times [2022-12-06 01:14:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:14,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850966609] [2022-12-06 01:14:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:14,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:14,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:14,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850966609] [2022-12-06 01:14:14,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850966609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:14,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:14,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:14:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326163525] [2022-12-06 01:14:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:14,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:14:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:14:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:14:14,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 01:14:14,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 315 transitions, 5024 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:14,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:14,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 01:14:14,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:15,367 INFO L130 PetriNetUnfolder]: 3189/5251 cut-off events. [2022-12-06 01:14:15,368 INFO L131 PetriNetUnfolder]: For 6563/6563 co-relation queries the response was YES. [2022-12-06 01:14:15,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45221 conditions, 5251 events. 3189/5251 cut-off events. For 6563/6563 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 33506 event pairs, 68 based on Foata normal form. 45/5296 useless extension candidates. Maximal degree in co-relation 45188. Up to 4377 conditions per place. [2022-12-06 01:14:15,382 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 98 selfloop transitions, 27 changer transitions 826/959 dead transitions. [2022-12-06 01:14:15,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 959 transitions, 17265 flow [2022-12-06 01:14:15,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:14:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:14:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 01:14:15,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2022-12-06 01:14:15,385 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2022-12-06 01:14:15,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:15,386 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 959 transitions, 17265 flow [2022-12-06 01:14:15,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 959 transitions, 17265 flow [2022-12-06 01:14:15,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:15,461 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:15,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 01:14:15,461 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 959 transitions, 17265 flow [2022-12-06 01:14:15,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:15,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:15,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:15,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:14:15,462 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1154836651, now seen corresponding path program 1 times [2022-12-06 01:14:15,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:15,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588620133] [2022-12-06 01:14:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:15,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:15,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588620133] [2022-12-06 01:14:15,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588620133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:15,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:15,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:14:15,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103416149] [2022-12-06 01:14:15,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:15,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:14:15,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:15,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:14:15,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:14:15,518 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 01:14:15,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 959 transitions, 17265 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:15,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:15,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 01:14:15,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:16,284 INFO L130 PetriNetUnfolder]: 3103/5119 cut-off events. [2022-12-06 01:14:16,284 INFO L131 PetriNetUnfolder]: For 10989/10989 co-relation queries the response was YES. [2022-12-06 01:14:16,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48434 conditions, 5119 events. 3103/5119 cut-off events. For 10989/10989 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 32378 event pairs, 22 based on Foata normal form. 14/5133 useless extension candidates. Maximal degree in co-relation 48398. Up to 4254 conditions per place. [2022-12-06 01:14:16,302 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 109 selfloop transitions, 49 changer transitions 1117/1283 dead transitions. [2022-12-06 01:14:16,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 1283 transitions, 25658 flow [2022-12-06 01:14:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:14:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:14:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 01:14:16,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6625 [2022-12-06 01:14:16,304 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2022-12-06 01:14:16,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:16,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 1283 transitions, 25658 flow [2022-12-06 01:14:16,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 1283 transitions, 25658 flow [2022-12-06 01:14:16,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:16,389 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:16,390 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 01:14:16,390 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 1283 transitions, 25658 flow [2022-12-06 01:14:16,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:16,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:16,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:16,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:14:16,390 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1440198046, now seen corresponding path program 1 times [2022-12-06 01:14:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:16,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385599686] [2022-12-06 01:14:16,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:16,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:16,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:16,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385599686] [2022-12-06 01:14:16,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385599686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:16,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:16,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:14:16,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425293456] [2022-12-06 01:14:16,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:16,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:14:16,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:16,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:14:16,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:14:16,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 01:14:16,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 1283 transitions, 25658 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:16,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:16,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 01:14:16,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:17,327 INFO L130 PetriNetUnfolder]: 3066/5046 cut-off events. [2022-12-06 01:14:17,328 INFO L131 PetriNetUnfolder]: For 16467/16467 co-relation queries the response was YES. [2022-12-06 01:14:17,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52037 conditions, 5046 events. 3066/5046 cut-off events. For 16467/16467 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 31731 event pairs, 1 based on Foata normal form. 14/5060 useless extension candidates. Maximal degree in co-relation 51998. Up to 4187 conditions per place. [2022-12-06 01:14:17,343 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 92 selfloop transitions, 65 changer transitions 1312/1475 dead transitions. [2022-12-06 01:14:17,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 1475 transitions, 32407 flow [2022-12-06 01:14:17,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:14:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:14:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 01:14:17,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 01:14:17,344 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places. [2022-12-06 01:14:17,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:17,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 1475 transitions, 32407 flow [2022-12-06 01:14:17,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 1475 transitions, 32407 flow [2022-12-06 01:14:17,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:17,382 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:17,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 01:14:17,383 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 1475 transitions, 32407 flow [2022-12-06 01:14:17,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:17,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:17,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:17,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:14:17,383 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:17,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:17,384 INFO L85 PathProgramCache]: Analyzing trace with hash 14060514, now seen corresponding path program 1 times [2022-12-06 01:14:17,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:17,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233931462] [2022-12-06 01:14:17,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:17,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:17,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:17,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233931462] [2022-12-06 01:14:17,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233931462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:17,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:17,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:14:17,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522163229] [2022-12-06 01:14:17,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:17,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:14:17,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:17,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:14:17,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:14:17,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 01:14:17,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 1475 transitions, 32407 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:17,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:17,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 01:14:17,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:18,644 INFO L130 PetriNetUnfolder]: 3390/5645 cut-off events. [2022-12-06 01:14:18,645 INFO L131 PetriNetUnfolder]: For 24142/24142 co-relation queries the response was YES. [2022-12-06 01:14:18,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63519 conditions, 5645 events. 3390/5645 cut-off events. For 24142/24142 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 36913 event pairs, 14 based on Foata normal form. 6/5651 useless extension candidates. Maximal degree in co-relation 63477. Up to 4730 conditions per place. [2022-12-06 01:14:18,663 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 113 selfloop transitions, 5 changer transitions 1618/1739 dead transitions. [2022-12-06 01:14:18,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 1739 transitions, 41643 flow [2022-12-06 01:14:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:14:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:14:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 01:14:18,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47 [2022-12-06 01:14:18,665 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2022-12-06 01:14:18,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:18,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 1739 transitions, 41643 flow [2022-12-06 01:14:18,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 1739 transitions, 41643 flow [2022-12-06 01:14:18,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:18,729 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:18,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 01:14:18,729 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 1739 transitions, 41643 flow [2022-12-06 01:14:18,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:18,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:18,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:18,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:14:18,730 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 01:14:18,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:18,730 INFO L85 PathProgramCache]: Analyzing trace with hash 13310934, now seen corresponding path program 2 times [2022-12-06 01:14:18,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:18,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913390898] [2022-12-06 01:14:18,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:18,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:18,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:18,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913390898] [2022-12-06 01:14:18,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913390898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:18,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:18,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:14:18,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406936742] [2022-12-06 01:14:18,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:18,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:14:18,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:18,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:14:18,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:14:18,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 01:14:18,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 1739 transitions, 41643 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:18,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:18,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 01:14:18,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:20,371 INFO L130 PetriNetUnfolder]: 3390/5639 cut-off events. [2022-12-06 01:14:20,371 INFO L131 PetriNetUnfolder]: For 32920/32920 co-relation queries the response was YES. [2022-12-06 01:14:20,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68278 conditions, 5639 events. 3390/5639 cut-off events. For 32920/32920 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 36864 event pairs, 8 based on Foata normal form. 2/5641 useless extension candidates. Maximal degree in co-relation 68233. Up to 4725 conditions per place. [2022-12-06 01:14:20,390 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 0 selfloop transitions, 0 changer transitions 1738/1738 dead transitions. [2022-12-06 01:14:20,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 1738 transitions, 45033 flow [2022-12-06 01:14:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:14:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:14:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 01:14:20,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 01:14:20,391 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 38 predicate places. [2022-12-06 01:14:20,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:20,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 1738 transitions, 45033 flow [2022-12-06 01:14:20,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 1738 transitions, 45033 flow [2022-12-06 01:14:20,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:20,446 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:20,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 01:14:20,447 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 1738 transitions, 45033 flow [2022-12-06 01:14:20,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:20,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 01:14:20,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 01:14:20,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 01:14:20,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 01:14:20,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 01:14:20,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 01:14:20,450 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:20,452 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:14:20,452 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:14:20,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:14:20 BasicIcfg [2022-12-06 01:14:20,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:14:20,454 INFO L158 Benchmark]: Toolchain (without parser) took 12436.40ms. Allocated memory was 187.7MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 161.5MB in the beginning and 1.1GB in the end (delta: -909.9MB). Peak memory consumption was 707.9MB. Max. memory is 8.0GB. [2022-12-06 01:14:20,454 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 164.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:14:20,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.93ms. Allocated memory is still 187.7MB. Free memory was 161.0MB in the beginning and 137.3MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 01:14:20,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.31ms. Allocated memory is still 187.7MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:14:20,455 INFO L158 Benchmark]: Boogie Preprocessor took 18.25ms. Allocated memory is still 187.7MB. Free memory was 135.2MB in the beginning and 133.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 01:14:20,455 INFO L158 Benchmark]: RCFGBuilder took 343.32ms. Allocated memory is still 187.7MB. Free memory was 133.6MB in the beginning and 118.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 01:14:20,455 INFO L158 Benchmark]: TraceAbstraction took 11690.72ms. Allocated memory was 187.7MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 118.4MB in the beginning and 1.1GB in the end (delta: -953.0MB). Peak memory consumption was 664.9MB. Max. memory is 8.0GB. [2022-12-06 01:14:20,456 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.13ms. Allocated memory is still 187.7MB. Free memory is still 164.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 346.93ms. Allocated memory is still 187.7MB. Free memory was 161.0MB in the beginning and 137.3MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.31ms. Allocated memory is still 187.7MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.25ms. Allocated memory is still 187.7MB. Free memory was 135.2MB in the beginning and 133.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 343.32ms. Allocated memory is still 187.7MB. Free memory was 133.6MB in the beginning and 118.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11690.72ms. Allocated memory was 187.7MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 118.4MB in the beginning and 1.1GB in the end (delta: -953.0MB). Peak memory consumption was 664.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 92 PlacesBefore, 33 PlacesAfterwards, 80 TransitionsBefore, 21 TransitionsAfterwards, 1542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 60 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1079, independent: 1042, independent conditional: 1042, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1079, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1079, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1079, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 937, independent: 906, independent conditional: 0, independent unconditional: 906, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 937, independent: 883, independent conditional: 0, independent unconditional: 883, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1079, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 937, unknown conditional: 0, unknown unconditional: 937] , Statistics on independence cache: Total cache size (in pairs): 1482, Positive cache size: 1451, Positive conditional cache size: 0, Positive unconditional cache size: 1451, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 35 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 43 PlacesBefore, 43 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 46 PlacesBefore, 46 PlacesAfterwards, 150 TransitionsBefore, 150 TransitionsAfterwards, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 49 PlacesBefore, 49 PlacesAfterwards, 175 TransitionsBefore, 175 TransitionsAfterwards, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 52 PlacesBefore, 52 PlacesAfterwards, 315 TransitionsBefore, 315 TransitionsAfterwards, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 56 PlacesBefore, 56 PlacesAfterwards, 959 TransitionsBefore, 959 TransitionsAfterwards, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 59 PlacesBefore, 59 PlacesAfterwards, 1283 TransitionsBefore, 1283 TransitionsAfterwards, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 63 PlacesBefore, 63 PlacesAfterwards, 1475 TransitionsBefore, 1475 TransitionsAfterwards, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 1739 TransitionsBefore, 1739 TransitionsAfterwards, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 1738 TransitionsBefore, 1738 TransitionsAfterwards, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 127 locations, 5 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: 11.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 643 IncrementalHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 16 mSDtfsCounter, 643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45033occurred in iteration=12, InterpolantAutomatonStates: 51, 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.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 597 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:14:20,495 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...