/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:15:05,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:15:05,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:15:05,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:15:05,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:15:05,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:15:05,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:15:05,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:15:05,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:15:05,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:15:05,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:15:05,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:15:05,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:15:05,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:15:05,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:15:05,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:15:05,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:15:05,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:15:05,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:15:05,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:15:05,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:15:05,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:15:05,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:15:05,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:15:05,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:15:05,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:15:05,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:15:05,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:15:05,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:15:05,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:15:05,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:15:05,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:15:05,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:15:05,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:15:05,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:15:05,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:15:05,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:15:05,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:15:05,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:15:05,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:15:05,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:15:05,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:15:05,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:15:05,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:15:05,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:15:05,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:15:05,578 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:15:05,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:15:05,578 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:15:05,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:15:05,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:15:05,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:15:05,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:15:05,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:15:05,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:15:05,579 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:15:05,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:15:05,580 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:15:05,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:15:05,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:15:05,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:15:05,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:15:05,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:15:05,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:15:05,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:15:05,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:15:05,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:15:05,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:15:05,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:15:05,581 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:15:05,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:15:05,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:15:05,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:15:05,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:15:05,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:15:05,846 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:15:05,847 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-05 23:15:06,776 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:15:06,990 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:15:06,991 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:15:07,004 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f952623f9/c4817cb570524c4c823fd24065421273/FLAG6f2e7d650 [2022-12-05 23:15:07,020 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f952623f9/c4817cb570524c4c823fd24065421273 [2022-12-05 23:15:07,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:15:07,023 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:15:07,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:15:07,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:15:07,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:15:07,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593c1419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07, skipping insertion in model container [2022-12-05 23:15:07,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:15:07,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:15:07,188 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-05 23:15:07,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:15:07,347 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:15:07,359 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-05 23:15:07,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:15:07,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:15:07,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:15:07,432 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:15:07,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07 WrapperNode [2022-12-05 23:15:07,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:15:07,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:15:07,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:15:07,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:15:07,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,486 INFO L138 Inliner]: procedures = 177, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-12-05 23:15:07,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:15:07,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:15:07,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:15:07,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:15:07,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,521 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:15:07,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:15:07,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:15:07,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:15:07,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (1/1) ... [2022-12-05 23:15:07,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:15:07,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:15:07,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:15:07,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:15:07,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:15:07,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:15:07,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:15:07,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:15:07,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:15:07,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:15:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:15:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:15:07,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:15:07,604 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:15:07,747 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:15:07,748 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:15:07,901 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:15:07,906 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:15:07,906 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:15:07,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:15:07 BoogieIcfgContainer [2022-12-05 23:15:07,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:15:07,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:15:07,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:15:07,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:15:07,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:15:07" (1/3) ... [2022-12-05 23:15:07,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb7ae17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:15:07, skipping insertion in model container [2022-12-05 23:15:07,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:15:07" (2/3) ... [2022-12-05 23:15:07,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb7ae17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:15:07, skipping insertion in model container [2022-12-05 23:15:07,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:15:07" (3/3) ... [2022-12-05 23:15:07,913 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:15:07,926 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:15:07,926 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:15:07,926 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:15:08,002 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:15:08,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 98 transitions, 216 flow [2022-12-05 23:15:08,090 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-05 23:15:08,090 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:15:08,094 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-05 23:15:08,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 98 transitions, 216 flow [2022-12-05 23:15:08,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 80 transitions, 172 flow [2022-12-05 23:15:08,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:08,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 80 transitions, 172 flow [2022-12-05 23:15:08,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 80 transitions, 172 flow [2022-12-05 23:15:08,152 INFO L130 PetriNetUnfolder]: 1/80 cut-off events. [2022-12-05 23:15:08,152 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:15:08,153 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-05 23:15:08,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 80 transitions, 172 flow [2022-12-05 23:15:08,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 1542 [2022-12-05 23:15:10,540 INFO L203 LiptonReduction]: Total number of compositions: 60 [2022-12-05 23:15:10,552 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:15:10,556 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;@1ffdad3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:15:10,556 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:15:10,560 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:15:10,560 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:15:10,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:10,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:10,561 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-05 23:15:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1731683458, now seen corresponding path program 1 times [2022-12-05 23:15:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:10,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329980687] [2022-12-05 23:15:10,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:15:10,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:10,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329980687] [2022-12-05 23:15:10,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329980687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:10,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:10,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:15:10,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189964890] [2022-12-05 23:15:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:10,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:15:10,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:11,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:15:11,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:15:11,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:15:11,005 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-05 23:15:11,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:11,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:15:11,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:11,297 INFO L130 PetriNetUnfolder]: 2019/2943 cut-off events. [2022-12-05 23:15:11,297 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-05 23:15:11,302 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-05 23:15:11,311 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 30 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2022-12-05 23:15:11,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 169 flow [2022-12-05 23:15:11,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:15:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:15:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-05 23:15:11,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2022-12-05 23:15:11,320 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 54 flow. Second operand 3 states and 40 transitions. [2022-12-05 23:15:11,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 169 flow [2022-12-05 23:15:11,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 162 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:15:11,326 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 102 flow [2022-12-05 23:15:11,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-05 23:15:11,329 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2022-12-05 23:15:11,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:15:11,330 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 102 flow [2022-12-05 23:15:11,331 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:15:11,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:11,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 102 flow [2022-12-05 23:15:11,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 102 flow [2022-12-05 23:15:11,363 INFO L130 PetriNetUnfolder]: 148/340 cut-off events. [2022-12-05 23:15:11,363 INFO L131 PetriNetUnfolder]: For 35/51 co-relation queries the response was YES. [2022-12-05 23:15:11,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 340 events. 148/340 cut-off events. For 35/51 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1884 event pairs, 70 based on Foata normal form. 0/317 useless extension candidates. Maximal degree in co-relation 704. Up to 189 conditions per place. [2022-12-05 23:15:11,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 102 flow [2022-12-05 23:15:11,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-05 23:15:11,380 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:15:11,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-05 23:15:11,382 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 102 flow [2022-12-05 23:15:11,383 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-05 23:15:11,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:11,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:11,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:15:11,386 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-05 23:15:11,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:11,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2142579882, now seen corresponding path program 1 times [2022-12-05 23:15:11,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:11,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951968474] [2022-12-05 23:15:11,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:11,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:15:11,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:11,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951968474] [2022-12-05 23:15:11,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951968474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:11,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:11,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:15:11,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480255241] [2022-12-05 23:15:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:11,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:15:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:15:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:15:11,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:15:11,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 102 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-05 23:15:11,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:11,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:15:11,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:11,741 INFO L130 PetriNetUnfolder]: 1755/2600 cut-off events. [2022-12-05 23:15:11,742 INFO L131 PetriNetUnfolder]: For 1267/1268 co-relation queries the response was YES. [2022-12-05 23:15:11,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7018 conditions, 2600 events. 1755/2600 cut-off events. For 1267/1268 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12084 event pairs, 439 based on Foata normal form. 21/2620 useless extension candidates. Maximal degree in co-relation 7006. Up to 2131 conditions per place. [2022-12-05 23:15:11,754 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 34 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 23:15:11,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 242 flow [2022-12-05 23:15:11,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:15:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:15:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-05 23:15:11,755 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:15:11,756 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 102 flow. Second operand 3 states and 33 transitions. [2022-12-05 23:15:11,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 242 flow [2022-12-05 23:15:11,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:15:11,760 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 129 flow [2022-12-05 23:15:11,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2022-12-05 23:15:11,760 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2022-12-05 23:15:11,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:15:11,761 INFO L89 Accepts]: Start accepts. Operand has 34 places, 30 transitions, 129 flow [2022-12-05 23:15:11,761 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:15:11,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:11,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 30 transitions, 129 flow [2022-12-05 23:15:11,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 129 flow [2022-12-05 23:15:11,773 INFO L130 PetriNetUnfolder]: 105/252 cut-off events. [2022-12-05 23:15:11,773 INFO L131 PetriNetUnfolder]: For 44/100 co-relation queries the response was YES. [2022-12-05 23:15:11,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 252 events. 105/252 cut-off events. For 44/100 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1259 event pairs, 31 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 547. Up to 142 conditions per place. [2022-12-05 23:15:11,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 30 transitions, 129 flow [2022-12-05 23:15:11,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-05 23:15:11,777 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:15:11,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-05 23:15:11,778 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 129 flow [2022-12-05 23:15:11,778 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-05 23:15:11,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:11,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:11,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:15:11,779 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-05 23:15:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2142580688, now seen corresponding path program 1 times [2022-12-05 23:15:11,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:11,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306062085] [2022-12-05 23:15:11,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:11,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:15:11,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:11,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306062085] [2022-12-05 23:15:11,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306062085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:11,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:11,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:15:11,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793855301] [2022-12-05 23:15:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:11,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:15:11,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:11,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:15:11,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:15:11,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:15:11,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 129 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-05 23:15:11,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:11,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:15:11,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:12,002 INFO L130 PetriNetUnfolder]: 1458/2248 cut-off events. [2022-12-05 23:15:12,002 INFO L131 PetriNetUnfolder]: For 982/997 co-relation queries the response was YES. [2022-12-05 23:15:12,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5953 conditions, 2248 events. 1458/2248 cut-off events. For 982/997 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11207 event pairs, 537 based on Foata normal form. 43/2266 useless extension candidates. Maximal degree in co-relation 5940. Up to 1729 conditions per place. [2022-12-05 23:15:12,015 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 39 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-05 23:15:12,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 281 flow [2022-12-05 23:15:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:15:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:15:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 23:15:12,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-05 23:15:12,017 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 129 flow. Second operand 3 states and 38 transitions. [2022-12-05 23:15:12,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 281 flow [2022-12-05 23:15:12,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:15:12,018 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 135 flow [2022-12-05 23:15:12,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-05 23:15:12,019 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2022-12-05 23:15:12,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:15:12,019 INFO L89 Accepts]: Start accepts. Operand has 36 places, 30 transitions, 135 flow [2022-12-05 23:15:12,020 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:15:12,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:12,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 135 flow [2022-12-05 23:15:12,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 135 flow [2022-12-05 23:15:12,029 INFO L130 PetriNetUnfolder]: 89/225 cut-off events. [2022-12-05 23:15:12,030 INFO L131 PetriNetUnfolder]: For 85/125 co-relation queries the response was YES. [2022-12-05 23:15:12,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 225 events. 89/225 cut-off events. For 85/125 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1125 event pairs, 29 based on Foata normal form. 1/215 useless extension candidates. Maximal degree in co-relation 507. Up to 119 conditions per place. [2022-12-05 23:15:12,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 30 transitions, 135 flow [2022-12-05 23:15:12,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-05 23:15:12,032 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:15:12,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-05 23:15:12,033 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 135 flow [2022-12-05 23:15:12,033 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-05 23:15:12,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:12,034 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:12,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:15:12,034 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-05 23:15:12,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1995467944, now seen corresponding path program 1 times [2022-12-05 23:15:12,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:12,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563192440] [2022-12-05 23:15:12,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:12,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:15:12,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:12,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563192440] [2022-12-05 23:15:12,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563192440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:12,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:12,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:15:12,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377968830] [2022-12-05 23:15:12,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:12,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:15:12,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:12,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:15:12,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:15:12,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:15:12,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 135 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-05 23:15:12,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:12,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:15:12,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:12,334 INFO L130 PetriNetUnfolder]: 2482/3669 cut-off events. [2022-12-05 23:15:12,334 INFO L131 PetriNetUnfolder]: For 2019/2019 co-relation queries the response was YES. [2022-12-05 23:15:12,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10025 conditions, 3669 events. 2482/3669 cut-off events. For 2019/2019 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17925 event pairs, 423 based on Foata normal form. 84/3753 useless extension candidates. Maximal degree in co-relation 10010. Up to 1564 conditions per place. [2022-12-05 23:15:12,349 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 45 selfloop transitions, 11 changer transitions 10/66 dead transitions. [2022-12-05 23:15:12,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 66 transitions, 393 flow [2022-12-05 23:15:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:15:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:15:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-05 23:15:12,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-05 23:15:12,350 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 135 flow. Second operand 5 states and 56 transitions. [2022-12-05 23:15:12,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 66 transitions, 393 flow [2022-12-05 23:15:12,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 66 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:15:12,352 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 193 flow [2022-12-05 23:15:12,352 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-05 23:15:12,353 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2022-12-05 23:15:12,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:15:12,353 INFO L89 Accepts]: Start accepts. Operand has 41 places, 33 transitions, 193 flow [2022-12-05 23:15:12,353 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:15:12,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:12,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 193 flow [2022-12-05 23:15:12,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 193 flow [2022-12-05 23:15:12,366 INFO L130 PetriNetUnfolder]: 59/168 cut-off events. [2022-12-05 23:15:12,367 INFO L131 PetriNetUnfolder]: For 173/189 co-relation queries the response was YES. [2022-12-05 23:15:12,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 168 events. 59/168 cut-off events. For 173/189 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 780 event pairs, 13 based on Foata normal form. 1/167 useless extension candidates. Maximal degree in co-relation 499. Up to 86 conditions per place. [2022-12-05 23:15:12,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 193 flow [2022-12-05 23:15:12,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-05 23:15:12,374 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:15:12,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-05 23:15:12,375 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 193 flow [2022-12-05 23:15:12,375 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-05 23:15:12,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:12,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:12,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:15:12,376 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-05 23:15:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1995492124, now seen corresponding path program 2 times [2022-12-05 23:15:12,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:12,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615525695] [2022-12-05 23:15:12,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:12,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:12,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-05 23:15:12,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:12,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615525695] [2022-12-05 23:15:12,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615525695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:12,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:12,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:15:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367993768] [2022-12-05 23:15:12,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:12,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:15:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:12,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:15:12,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:15:12,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:15:12,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 193 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:15:12,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:12,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:15:12,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:12,579 INFO L130 PetriNetUnfolder]: 1297/1930 cut-off events. [2022-12-05 23:15:12,579 INFO L131 PetriNetUnfolder]: For 2432/2432 co-relation queries the response was YES. [2022-12-05 23:15:12,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6174 conditions, 1930 events. 1297/1930 cut-off events. For 2432/2432 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8703 event pairs, 211 based on Foata normal form. 14/1944 useless extension candidates. Maximal degree in co-relation 6156. Up to 1038 conditions per place. [2022-12-05 23:15:12,590 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 39 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2022-12-05 23:15:12,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 371 flow [2022-12-05 23:15:12,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:15:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:15:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-05 23:15:12,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-05 23:15:12,592 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 193 flow. Second operand 4 states and 43 transitions. [2022-12-05 23:15:12,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 371 flow [2022-12-05 23:15:12,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 353 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:15:12,598 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 261 flow [2022-12-05 23:15:12,598 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-05 23:15:12,599 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2022-12-05 23:15:12,599 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:15:12,599 INFO L89 Accepts]: Start accepts. Operand has 44 places, 36 transitions, 261 flow [2022-12-05 23:15:12,599 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:15:12,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:12,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 261 flow [2022-12-05 23:15:12,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 261 flow [2022-12-05 23:15:12,608 INFO L130 PetriNetUnfolder]: 52/153 cut-off events. [2022-12-05 23:15:12,608 INFO L131 PetriNetUnfolder]: For 272/289 co-relation queries the response was YES. [2022-12-05 23:15:12,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 153 events. 52/153 cut-off events. For 272/289 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 688 event pairs, 8 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 552. Up to 76 conditions per place. [2022-12-05 23:15:12,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 261 flow [2022-12-05 23:15:12,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-05 23:15:12,611 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:15:12,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-05 23:15:12,612 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 261 flow [2022-12-05 23:15:12,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:15:12,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:12,612 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:12,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:15:12,612 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-05 23:15:12,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:12,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1730623602, now seen corresponding path program 1 times [2022-12-05 23:15:12,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:12,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159953117] [2022-12-05 23:15:12,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:12,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:15:12,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:12,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159953117] [2022-12-05 23:15:12,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159953117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:12,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:12,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:15:12,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282711685] [2022-12-05 23:15:12,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:12,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:15:12,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:12,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:15:12,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:15:12,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:15:12,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 261 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-05 23:15:12,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:12,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:15:12,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:12,842 INFO L130 PetriNetUnfolder]: 1506/2281 cut-off events. [2022-12-05 23:15:12,843 INFO L131 PetriNetUnfolder]: For 4488/4488 co-relation queries the response was YES. [2022-12-05 23:15:12,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7756 conditions, 2281 events. 1506/2281 cut-off events. For 4488/4488 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10827 event pairs, 379 based on Foata normal form. 42/2323 useless extension candidates. Maximal degree in co-relation 7736. Up to 1106 conditions per place. [2022-12-05 23:15:12,855 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 40 selfloop transitions, 15 changer transitions 1/56 dead transitions. [2022-12-05 23:15:12,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 446 flow [2022-12-05 23:15:12,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:15:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:15:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-05 23:15:12,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-05 23:15:12,856 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 261 flow. Second operand 4 states and 45 transitions. [2022-12-05 23:15:12,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 446 flow [2022-12-05 23:15:12,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:15:12,863 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 335 flow [2022-12-05 23:15:12,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=335, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-05 23:15:12,863 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2022-12-05 23:15:12,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:15:12,864 INFO L89 Accepts]: Start accepts. Operand has 49 places, 37 transitions, 335 flow [2022-12-05 23:15:12,864 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:15:12,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:12,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 335 flow [2022-12-05 23:15:12,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 37 transitions, 335 flow [2022-12-05 23:15:12,873 INFO L130 PetriNetUnfolder]: 38/144 cut-off events. [2022-12-05 23:15:12,873 INFO L131 PetriNetUnfolder]: For 442/462 co-relation queries the response was YES. [2022-12-05 23:15:12,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 144 events. 38/144 cut-off events. For 442/462 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 672 event pairs, 2 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 594. Up to 65 conditions per place. [2022-12-05 23:15:12,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 37 transitions, 335 flow [2022-12-05 23:15:12,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-05 23:15:12,879 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:15:12,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-05 23:15:12,880 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 335 flow [2022-12-05 23:15:12,880 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-05 23:15:12,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:12,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:12,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:15:12,881 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-05 23:15:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1730589967, now seen corresponding path program 1 times [2022-12-05 23:15:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:12,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158040775] [2022-12-05 23:15:12,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:12,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:15:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:12,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158040775] [2022-12-05 23:15:12,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158040775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:12,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:12,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:15:12,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677144595] [2022-12-05 23:15:12,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:12,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:15:12,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:12,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:15:12,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:15:12,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:15:12,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 335 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-05 23:15:12,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:12,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:15:12,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:13,148 INFO L130 PetriNetUnfolder]: 1766/2756 cut-off events. [2022-12-05 23:15:13,149 INFO L131 PetriNetUnfolder]: For 7731/7735 co-relation queries the response was YES. [2022-12-05 23:15:13,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 2756 events. 1766/2756 cut-off events. For 7731/7735 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 14537 event pairs, 488 based on Foata normal form. 54/2789 useless extension candidates. Maximal degree in co-relation 9606. Up to 1398 conditions per place. [2022-12-05 23:15:13,162 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 42 selfloop transitions, 6 changer transitions 23/74 dead transitions. [2022-12-05 23:15:13,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 756 flow [2022-12-05 23:15:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:15:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:15:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 23:15:13,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-05 23:15:13,163 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 335 flow. Second operand 4 states and 48 transitions. [2022-12-05 23:15:13,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 756 flow [2022-12-05 23:15:13,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 714 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-05 23:15:13,183 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 331 flow [2022-12-05 23:15:13,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2022-12-05 23:15:13,183 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2022-12-05 23:15:13,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:15:13,183 INFO L89 Accepts]: Start accepts. Operand has 53 places, 36 transitions, 331 flow [2022-12-05 23:15:13,184 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:15:13,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:13,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 36 transitions, 331 flow [2022-12-05 23:15:13,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 36 transitions, 331 flow [2022-12-05 23:15:13,190 INFO L130 PetriNetUnfolder]: 12/80 cut-off events. [2022-12-05 23:15:13,191 INFO L131 PetriNetUnfolder]: For 318/318 co-relation queries the response was YES. [2022-12-05 23:15:13,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 80 events. 12/80 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 320 event pairs, 2 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 344. Up to 31 conditions per place. [2022-12-05 23:15:13,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 36 transitions, 331 flow [2022-12-05 23:15:13,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-05 23:15:13,193 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:15:13,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:15:13,193 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 331 flow [2022-12-05 23:15:13,193 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-05 23:15:13,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:13,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:13,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:15:13,194 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-05 23:15:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2128076253, now seen corresponding path program 1 times [2022-12-05 23:15:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:13,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928571542] [2022-12-05 23:15:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:13,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:15:13,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:13,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928571542] [2022-12-05 23:15:13,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928571542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:13,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:13,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:15:13,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599675277] [2022-12-05 23:15:13,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:13,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:15:13,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:13,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:15:13,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:15:13,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:15:13,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 331 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-05 23:15:13,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:13,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:15:13,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:13,393 INFO L130 PetriNetUnfolder]: 823/1393 cut-off events. [2022-12-05 23:15:13,393 INFO L131 PetriNetUnfolder]: For 5377/5462 co-relation queries the response was YES. [2022-12-05 23:15:13,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4993 conditions, 1393 events. 823/1393 cut-off events. For 5377/5462 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7494 event pairs, 287 based on Foata normal form. 60/1417 useless extension candidates. Maximal degree in co-relation 4966. Up to 918 conditions per place. [2022-12-05 23:15:13,399 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 55 selfloop transitions, 9 changer transitions 19/91 dead transitions. [2022-12-05 23:15:13,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 949 flow [2022-12-05 23:15:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:15:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:15:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-05 23:15:13,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.59 [2022-12-05 23:15:13,401 INFO L175 Difference]: Start difference. First operand has 53 places, 36 transitions, 331 flow. Second operand 5 states and 59 transitions. [2022-12-05 23:15:13,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 949 flow [2022-12-05 23:15:13,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 913 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-05 23:15:13,407 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 384 flow [2022-12-05 23:15:13,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=384, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2022-12-05 23:15:13,407 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2022-12-05 23:15:13,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:15:13,408 INFO L89 Accepts]: Start accepts. Operand has 58 places, 44 transitions, 384 flow [2022-12-05 23:15:13,408 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:15:13,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:13,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 44 transitions, 384 flow [2022-12-05 23:15:13,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 44 transitions, 384 flow [2022-12-05 23:15:13,450 INFO L130 PetriNetUnfolder]: 394/727 cut-off events. [2022-12-05 23:15:13,450 INFO L131 PetriNetUnfolder]: For 2099/2525 co-relation queries the response was YES. [2022-12-05 23:15:13,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2555 conditions, 727 events. 394/727 cut-off events. For 2099/2525 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 4342 event pairs, 188 based on Foata normal form. 2/631 useless extension candidates. Maximal degree in co-relation 2528. Up to 603 conditions per place. [2022-12-05 23:15:13,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 44 transitions, 384 flow [2022-12-05 23:15:13,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-05 23:15:13,462 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [268] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [293] L767-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_7| 0) (= |v_P3Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_167 (+ v_~__unbuffered_cnt~0_168 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_168} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_167} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-05 23:15:13,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [268] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [252] L740-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_92 1) v_~__unbuffered_cnt~0_91)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-05 23:15:13,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [268] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [255] L728-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= |v_P0Thread1of1ForFork3_#res.base_7| 0) (= v_~__unbuffered_cnt~0_111 (+ v_~__unbuffered_cnt~0_112 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-05 23:15:13,585 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:15:13,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-05 23:15:13,586 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 360 flow [2022-12-05 23:15:13,586 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-05 23:15:13,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:13,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:13,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:15:13,587 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-05 23:15:13,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash -87546109, now seen corresponding path program 1 times [2022-12-05 23:15:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:13,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039131100] [2022-12-05 23:15:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:13,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:15:13,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:13,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039131100] [2022-12-05 23:15:13,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039131100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:13,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:13,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:15:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130165613] [2022-12-05 23:15:13,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:13,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:15:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:13,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:15:13,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:15:13,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:15:13,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 360 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-05 23:15:13,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:13,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:15:13,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:13,780 INFO L130 PetriNetUnfolder]: 590/1039 cut-off events. [2022-12-05 23:15:13,780 INFO L131 PetriNetUnfolder]: For 4750/4978 co-relation queries the response was YES. [2022-12-05 23:15:13,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4836 conditions, 1039 events. 590/1039 cut-off events. For 4750/4978 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5503 event pairs, 62 based on Foata normal form. 63/1087 useless extension candidates. Maximal degree in co-relation 4806. Up to 726 conditions per place. [2022-12-05 23:15:13,788 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 62 selfloop transitions, 13 changer transitions 20/103 dead transitions. [2022-12-05 23:15:13,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 103 transitions, 1112 flow [2022-12-05 23:15:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:15:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:15:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-05 23:15:13,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2022-12-05 23:15:13,791 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 360 flow. Second operand 6 states and 71 transitions. [2022-12-05 23:15:13,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 103 transitions, 1112 flow [2022-12-05 23:15:13,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 1105 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:15:13,797 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 463 flow [2022-12-05 23:15:13,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2022-12-05 23:15:13,798 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2022-12-05 23:15:13,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:15:13,798 INFO L89 Accepts]: Start accepts. Operand has 62 places, 48 transitions, 463 flow [2022-12-05 23:15:13,799 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:15:13,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:13,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 48 transitions, 463 flow [2022-12-05 23:15:13,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 48 transitions, 463 flow [2022-12-05 23:15:13,830 INFO L130 PetriNetUnfolder]: 272/549 cut-off events. [2022-12-05 23:15:13,830 INFO L131 PetriNetUnfolder]: For 2344/3066 co-relation queries the response was YES. [2022-12-05 23:15:13,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 549 events. 272/549 cut-off events. For 2344/3066 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 3237 event pairs, 49 based on Foata normal form. 8/514 useless extension candidates. Maximal degree in co-relation 2717. Up to 472 conditions per place. [2022-12-05 23:15:13,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 48 transitions, 463 flow [2022-12-05 23:15:13,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-05 23:15:13,841 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [268] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [255] L728-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= |v_P0Thread1of1ForFork3_#res.base_7| 0) (= v_~__unbuffered_cnt~0_111 (+ v_~__unbuffered_cnt~0_112 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-05 23:15:13,865 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [268] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [252] L740-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_92 1) v_~__unbuffered_cnt~0_91)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-05 23:15:13,892 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [268] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_22)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [293] L767-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_7| 0) (= |v_P3Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_167 (+ v_~__unbuffered_cnt~0_168 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_168} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_167} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-05 23:15:13,970 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:15:13,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-05 23:15:13,971 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 425 flow [2022-12-05 23:15:13,971 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-05 23:15:13,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:13,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:13,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:15:13,971 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-05 23:15:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1581061520, now seen corresponding path program 1 times [2022-12-05 23:15:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050560380] [2022-12-05 23:15:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:14,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-05 23:15:14,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:14,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050560380] [2022-12-05 23:15:14,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050560380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:14,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:14,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:15:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075525853] [2022-12-05 23:15:14,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:14,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:15:14,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:14,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:15:14,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:15:14,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:15:14,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 425 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-05 23:15:14,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:14,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:15:14,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:14,170 INFO L130 PetriNetUnfolder]: 370/689 cut-off events. [2022-12-05 23:15:14,170 INFO L131 PetriNetUnfolder]: For 3740/3943 co-relation queries the response was YES. [2022-12-05 23:15:14,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3933 conditions, 689 events. 370/689 cut-off events. For 3740/3943 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3424 event pairs, 15 based on Foata normal form. 75/752 useless extension candidates. Maximal degree in co-relation 3900. Up to 470 conditions per place. [2022-12-05 23:15:14,174 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 58 selfloop transitions, 13 changer transitions 30/107 dead transitions. [2022-12-05 23:15:14,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 107 transitions, 1235 flow [2022-12-05 23:15:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:15:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:15:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-05 23:15:14,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5928571428571429 [2022-12-05 23:15:14,176 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 425 flow. Second operand 7 states and 83 transitions. [2022-12-05 23:15:14,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 107 transitions, 1235 flow [2022-12-05 23:15:14,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 107 transitions, 1173 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-05 23:15:14,186 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 446 flow [2022-12-05 23:15:14,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=446, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2022-12-05 23:15:14,187 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 32 predicate places. [2022-12-05 23:15:14,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:15:14,187 INFO L89 Accepts]: Start accepts. Operand has 65 places, 45 transitions, 446 flow [2022-12-05 23:15:14,190 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:15:14,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:14,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 45 transitions, 446 flow [2022-12-05 23:15:14,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 45 transitions, 446 flow [2022-12-05 23:15:14,204 INFO L130 PetriNetUnfolder]: 94/221 cut-off events. [2022-12-05 23:15:14,204 INFO L131 PetriNetUnfolder]: For 964/1127 co-relation queries the response was YES. [2022-12-05 23:15:14,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 221 events. 94/221 cut-off events. For 964/1127 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1020 event pairs, 6 based on Foata normal form. 14/216 useless extension candidates. Maximal degree in co-relation 1076. Up to 158 conditions per place. [2022-12-05 23:15:14,208 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 45 transitions, 446 flow [2022-12-05 23:15:14,208 INFO L188 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-05 23:15:14,208 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:15:14,209 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-05 23:15:14,209 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 446 flow [2022-12-05 23:15:14,209 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-05 23:15:14,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:14,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:14,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:15:14,209 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-05 23:15:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash -352775132, now seen corresponding path program 1 times [2022-12-05 23:15:14,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:14,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325212663] [2022-12-05 23:15:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:15:14,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:14,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325212663] [2022-12-05 23:15:14,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325212663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:14,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:14,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:15:14,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294765267] [2022-12-05 23:15:14,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:14,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:15:14,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:14,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:15:14,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:15:14,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:15:14,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 446 flow. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:15:14,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:14,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:15:14,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:14,391 INFO L130 PetriNetUnfolder]: 331/603 cut-off events. [2022-12-05 23:15:14,391 INFO L131 PetriNetUnfolder]: For 3372/3372 co-relation queries the response was YES. [2022-12-05 23:15:14,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3429 conditions, 603 events. 331/603 cut-off events. For 3372/3372 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2618 event pairs, 39 based on Foata normal form. 6/609 useless extension candidates. Maximal degree in co-relation 3395. Up to 293 conditions per place. [2022-12-05 23:15:14,394 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 48 selfloop transitions, 11 changer transitions 52/111 dead transitions. [2022-12-05 23:15:14,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 111 transitions, 1227 flow [2022-12-05 23:15:14,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:15:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:15:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-05 23:15:14,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-05 23:15:14,395 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 446 flow. Second operand 6 states and 56 transitions. [2022-12-05 23:15:14,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 111 transitions, 1227 flow [2022-12-05 23:15:14,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 111 transitions, 983 flow, removed 71 selfloop flow, removed 7 redundant places. [2022-12-05 23:15:14,404 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 329 flow [2022-12-05 23:15:14,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2022-12-05 23:15:14,404 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2022-12-05 23:15:14,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:15:14,405 INFO L89 Accepts]: Start accepts. Operand has 62 places, 39 transitions, 329 flow [2022-12-05 23:15:14,406 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:15:14,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:14,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 39 transitions, 329 flow [2022-12-05 23:15:14,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 39 transitions, 329 flow [2022-12-05 23:15:14,415 INFO L130 PetriNetUnfolder]: 57/154 cut-off events. [2022-12-05 23:15:14,415 INFO L131 PetriNetUnfolder]: For 376/418 co-relation queries the response was YES. [2022-12-05 23:15:14,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 154 events. 57/154 cut-off events. For 376/418 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 667 event pairs, 4 based on Foata normal form. 9/148 useless extension candidates. Maximal degree in co-relation 545. Up to 67 conditions per place. [2022-12-05 23:15:14,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 39 transitions, 329 flow [2022-12-05 23:15:14,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-05 23:15:14,493 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:15:14,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-05 23:15:14,494 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 37 transitions, 310 flow [2022-12-05 23:15:14,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:15:14,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:15:14,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:14,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:15:14,494 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-05 23:15:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:15:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash 13310941, now seen corresponding path program 1 times [2022-12-05 23:15:14,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:15:14,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822649616] [2022-12-05 23:15:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:15:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:15:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:15:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:15:14,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:15:14,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822649616] [2022-12-05 23:15:14,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822649616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:15:14,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:15:14,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:15:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777685387] [2022-12-05 23:15:14,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:15:14,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:15:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:15:14,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:15:14,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:15:14,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:15:14,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 37 transitions, 310 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-05 23:15:14,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:15:14,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:15:14,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:15:14,659 INFO L130 PetriNetUnfolder]: 127/243 cut-off events. [2022-12-05 23:15:14,660 INFO L131 PetriNetUnfolder]: For 964/1028 co-relation queries the response was YES. [2022-12-05 23:15:14,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 243 events. 127/243 cut-off events. For 964/1028 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 935 event pairs, 8 based on Foata normal form. 28/264 useless extension candidates. Maximal degree in co-relation 1123. Up to 83 conditions per place. [2022-12-05 23:15:14,661 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 0 selfloop transitions, 0 changer transitions 60/60 dead transitions. [2022-12-05 23:15:14,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 601 flow [2022-12-05 23:15:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:15:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:15:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-05 23:15:14,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-05 23:15:14,662 INFO L175 Difference]: Start difference. First operand has 59 places, 37 transitions, 310 flow. Second operand 6 states and 57 transitions. [2022-12-05 23:15:14,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 601 flow [2022-12-05 23:15:14,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 450 flow, removed 9 selfloop flow, removed 14 redundant places. [2022-12-05 23:15:14,664 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2022-12-05 23:15:14,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2022-12-05 23:15:14,666 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2022-12-05 23:15:14,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:15:14,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 0 transitions, 0 flow [2022-12-05 23:15:14,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:15:14,666 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:15:14,666 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:15:14,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-05 23:15:14,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:15:14,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:15:14,667 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:15:14,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-05 23:15:14,667 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:15:14,667 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-05 23:15:14,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:15:14,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-05 23:15:14,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:15:14,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:15:14,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-05 23:15:14,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:15:14,671 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:15:14,673 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:15:14,673 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:15:14,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:15:14 BasicIcfg [2022-12-05 23:15:14,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:15:14,676 INFO L158 Benchmark]: Toolchain (without parser) took 7653.47ms. Allocated memory was 222.3MB in the beginning and 351.3MB in the end (delta: 129.0MB). Free memory was 180.8MB in the beginning and 130.7MB in the end (delta: 50.1MB). Peak memory consumption was 179.6MB. Max. memory is 8.0GB. [2022-12-05 23:15:14,677 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 222.3MB. Free memory was 198.8MB in the beginning and 198.7MB in the end (delta: 80.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:15:14,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.27ms. Allocated memory is still 222.3MB. Free memory was 180.8MB in the beginning and 157.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-05 23:15:14,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.62ms. Allocated memory is still 222.3MB. Free memory was 157.2MB in the beginning and 155.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:15:14,677 INFO L158 Benchmark]: Boogie Preprocessor took 36.03ms. Allocated memory is still 222.3MB. Free memory was 155.1MB in the beginning and 153.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:15:14,677 INFO L158 Benchmark]: RCFGBuilder took 383.58ms. Allocated memory is still 222.3MB. Free memory was 153.5MB in the beginning and 138.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-05 23:15:14,678 INFO L158 Benchmark]: TraceAbstraction took 6766.96ms. Allocated memory was 222.3MB in the beginning and 351.3MB in the end (delta: 129.0MB). Free memory was 137.8MB in the beginning and 130.7MB in the end (delta: 7.1MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. [2022-12-05 23:15:14,679 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 222.3MB. Free memory was 198.8MB in the beginning and 198.7MB in the end (delta: 80.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 409.27ms. Allocated memory is still 222.3MB. Free memory was 180.8MB in the beginning and 157.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.62ms. Allocated memory is still 222.3MB. Free memory was 157.2MB in the beginning and 155.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.03ms. Allocated memory is still 222.3MB. Free memory was 155.1MB in the beginning and 153.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 383.58ms. Allocated memory is still 222.3MB. Free memory was 153.5MB in the beginning and 138.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 6766.96ms. Allocated memory was 222.3MB in the beginning and 351.3MB in the end (delta: 129.0MB). Free memory was 137.8MB in the beginning and 130.7MB in the end (delta: 7.1MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 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: 92, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 50, dependent conditional: 0, dependent unconditional: 50, 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.0s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 38, independent conditional: 7, independent unconditional: 31, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 38, independent conditional: 4, independent unconditional: 34, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 38, independent conditional: 4, independent unconditional: 34, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 15, independent conditional: 1, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 25, unknown conditional: 3, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 23, Positive conditional cache size: 3, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 59, independent conditional: 2, independent unconditional: 57, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 65, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 26, Positive conditional cache size: 3, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 53, independent conditional: 11, independent unconditional: 42, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 59, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 26, Positive conditional cache size: 3, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 65, independent conditional: 19, independent unconditional: 46, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 65, independent conditional: 2, independent unconditional: 63, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 65, independent conditional: 2, independent unconditional: 63, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 1, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 53, independent conditional: 1, independent unconditional: 52, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 13, unknown conditional: 1, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 38, Positive conditional cache size: 4, Positive unconditional cache size: 34, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 107, independent conditional: 35, independent unconditional: 72, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 107, independent conditional: 9, independent unconditional: 98, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, independent: 107, independent conditional: 9, independent unconditional: 98, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 118, independent: 103, independent conditional: 9, independent unconditional: 94, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 42, Positive conditional cache size: 4, Positive unconditional cache size: 38, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 145, independent conditional: 145, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 145, independent conditional: 51, independent unconditional: 94, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 145, independent conditional: 19, independent unconditional: 126, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 145, independent conditional: 19, independent unconditional: 126, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, independent: 137, independent conditional: 18, independent unconditional: 119, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 9, unknown conditional: 1, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 50, Positive conditional cache size: 5, Positive unconditional cache size: 45, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 133, independent conditional: 133, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 148, independent: 133, independent conditional: 50, independent unconditional: 83, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 148, independent: 133, independent conditional: 8, independent unconditional: 125, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 148, independent: 133, independent conditional: 8, independent unconditional: 125, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 148, independent: 133, independent conditional: 8, independent unconditional: 125, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 50, Positive conditional cache size: 5, Positive unconditional cache size: 45, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 58 PlacesBefore, 56 PlacesAfterwards, 44 TransitionsBefore, 40 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 102, independent conditional: 102, 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: 102, independent: 102, independent conditional: 102, 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: 102, independent: 102, independent conditional: 58, independent unconditional: 44, 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: 102, independent: 102, independent conditional: 58, independent unconditional: 44, 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: 27, independent: 27, independent conditional: 16, independent unconditional: 11, 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: 27, independent: 27, independent conditional: 0, independent unconditional: 27, 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: 102, independent: 75, independent conditional: 42, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 27, unknown conditional: 16, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 77, Positive conditional cache size: 21, Positive unconditional cache size: 56, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 62 PlacesBefore, 60 PlacesAfterwards, 48 TransitionsBefore, 44 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 92, independent conditional: 92, 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: 92, independent: 92, independent conditional: 92, 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: 92, independent: 92, independent conditional: 61, independent unconditional: 31, 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: 92, independent: 92, independent conditional: 61, independent unconditional: 31, 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: 23, independent: 23, independent conditional: 16, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 92, independent: 69, independent conditional: 45, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 23, unknown conditional: 16, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 100, Positive conditional cache size: 37, Positive unconditional cache size: 63, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 248 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): 104, Positive cache size: 100, Positive conditional cache size: 37, Positive unconditional cache size: 63, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 60 PlacesBefore, 59 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 22, independent unconditional: 2, 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: 24, independent: 24, independent conditional: 13, independent unconditional: 11, 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: 24, independent: 24, independent conditional: 13, independent unconditional: 11, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 24, independent: 20, independent conditional: 13, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 111, Positive conditional cache size: 39, Positive unconditional cache size: 72, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 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): 115, Positive cache size: 111, Positive conditional cache size: 39, Positive unconditional cache size: 72, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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: 6.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 327 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 726 IncrementalHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 17 mSDtfsCounter, 726 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=463occurred in iteration=9, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 664 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-05 23:15:14,709 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...