/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:04:07,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:04:07,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:04:07,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:04:07,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:04:07,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:04:07,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:04:07,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:04:07,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:04:07,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:04:07,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:04:07,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:04:07,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:04:07,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:04:07,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:04:07,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:04:07,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:04:07,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:04:07,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:04:07,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:04:07,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:04:07,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:04:07,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:04:07,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:04:07,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:04:07,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:04:07,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:04:07,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:04:07,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:04:07,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:04:07,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:04:07,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:04:07,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:04:07,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:04:07,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:04:07,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:04:07,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:04:07,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:04:07,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:04:07,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:04:07,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:04:07,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 01:04:07,551 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:04:07,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:04:07,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:04:07,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:04:07,552 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:04:07,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:04:07,552 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:04:07,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:04:07,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:04:07,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:04:07,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:04:07,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:04:07,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:04:07,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:04:07,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:04:07,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:04:07,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:04:07,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:04:07,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:04:07,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:04:07,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:04:07,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:04:07,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:04:07,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:04:07,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:04:07,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:04:07,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:04:07,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:04:07,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:04:07,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:04:07,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:04:07,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:04:07,949 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:04:07,949 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:04:07,950 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2022-12-06 01:04:09,187 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:04:09,439 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:04:09,439 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2022-12-06 01:04:09,449 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddaa71ef7/8b842aa3360f4e42bb364558f8339c28/FLAGc2f2c6b5e [2022-12-06 01:04:09,461 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddaa71ef7/8b842aa3360f4e42bb364558f8339c28 [2022-12-06 01:04:09,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:04:09,463 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:04:09,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:04:09,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:04:09,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:04:09,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:09,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33e23594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09, skipping insertion in model container [2022-12-06 01:04:09,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:09,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:04:09,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:04:09,638 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/mix027_tso.i[944,957] [2022-12-06 01:04:09,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:04:09,853 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:04:09,862 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/mix027_tso.i[944,957] [2022-12-06 01:04:09,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:04:09,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:04:09,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:04:09,934 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:04:09,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09 WrapperNode [2022-12-06 01:04:09,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:04:09,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:04:09,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:04:09,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:04:09,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:09,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:10,003 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-06 01:04:10,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:04:10,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:04:10,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:04:10,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:04:10,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:10,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:10,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:10,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:10,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:10,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:10,035 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:10,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:10,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:04:10,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:04:10,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:04:10,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:04:10,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (1/1) ... [2022-12-06 01:04:10,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:04:10,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:04:10,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 01:04:10,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 01:04:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:04:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:04:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:04:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:04:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:04:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:04:10,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:04:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:04:10,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:04:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:04:10,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:04:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 01:04:10,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 01:04:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:04:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:04:10,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:04:10,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:04:10,115 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:04:10,280 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:04:10,282 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:04:10,624 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:04:10,819 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:04:10,820 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:04:10,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:04:10 BoogieIcfgContainer [2022-12-06 01:04:10,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:04:10,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:04:10,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:04:10,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:04:10,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:04:09" (1/3) ... [2022-12-06 01:04:10,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1168b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:04:10, skipping insertion in model container [2022-12-06 01:04:10,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:04:09" (2/3) ... [2022-12-06 01:04:10,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1168b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:04:10, skipping insertion in model container [2022-12-06 01:04:10,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:04:10" (3/3) ... [2022-12-06 01:04:10,827 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2022-12-06 01:04:10,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:04:10,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 01:04:10,849 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:04:10,907 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:04:10,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 01:04:11,020 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 01:04:11,020 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:04:11,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 01:04:11,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 01:04:11,036 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-06 01:04:11,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:11,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 01:04:11,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-06 01:04:11,100 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 01:04:11,102 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:04:11,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 01:04:11,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 01:04:11,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 3150 [2022-12-06 01:04:15,892 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 01:04:15,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:04:15,907 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;@ff65bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:04:15,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 01:04:15,909 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-06 01:04:15,909 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:04:15,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:15,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 01:04:15,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash 517742367, now seen corresponding path program 1 times [2022-12-06 01:04:15,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:15,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162384790] [2022-12-06 01:04:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:15,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:16,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:16,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162384790] [2022-12-06 01:04:16,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162384790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:16,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:16,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:04:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946913815] [2022-12-06 01:04:16,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:16,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:04:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:16,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:04:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:04:16,253 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2022-12-06 01:04:16,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:16,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:16,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2022-12-06 01:04:16,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:17,046 INFO L130 PetriNetUnfolder]: 4863/6818 cut-off events. [2022-12-06 01:04:17,047 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 01:04:17,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13642 conditions, 6818 events. 4863/6818 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 35218 event pairs, 1800 based on Foata normal form. 0/6157 useless extension candidates. Maximal degree in co-relation 13630. Up to 5308 conditions per place. [2022-12-06 01:04:17,076 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 37 selfloop transitions, 2 changer transitions 8/52 dead transitions. [2022-12-06 01:04:17,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 216 flow [2022-12-06 01:04:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:04:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:04:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 01:04:17,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-06 01:04:17,088 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2022-12-06 01:04:17,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:17,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 52 transitions, 216 flow [2022-12-06 01:04:17,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 52 transitions, 216 flow [2022-12-06 01:04:17,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 01:04:17,863 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 01:04:17,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 777 [2022-12-06 01:04:17,865 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 47 transitions, 206 flow [2022-12-06 01:04:17,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:17,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:17,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:17,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:04:17,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash 721542979, now seen corresponding path program 1 times [2022-12-06 01:04:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:17,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778976205] [2022-12-06 01:04:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:17,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:18,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:18,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778976205] [2022-12-06 01:04:18,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778976205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:18,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:18,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:04:18,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321346669] [2022-12-06 01:04:18,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:18,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:04:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:18,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:04:18,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:04:18,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:18,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 47 transitions, 206 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:18,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:18,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:18,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:19,067 INFO L130 PetriNetUnfolder]: 6861/9514 cut-off events. [2022-12-06 01:04:19,067 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-12-06 01:04:19,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28775 conditions, 9514 events. 6861/9514 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 46774 event pairs, 264 based on Foata normal form. 0/8802 useless extension candidates. Maximal degree in co-relation 28760. Up to 7680 conditions per place. [2022-12-06 01:04:19,106 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 70 selfloop transitions, 17 changer transitions 24/111 dead transitions. [2022-12-06 01:04:19,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 111 transitions, 696 flow [2022-12-06 01:04:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:04:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:04:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 01:04:19,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 01:04:19,109 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2022-12-06 01:04:19,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:19,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 111 transitions, 696 flow [2022-12-06 01:04:19,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 111 transitions, 696 flow [2022-12-06 01:04:19,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:19,148 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:19,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 01:04:19,149 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 111 transitions, 696 flow [2022-12-06 01:04:19,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:19,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:19,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:19,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:04:19,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:19,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash 892996751, now seen corresponding path program 1 times [2022-12-06 01:04:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:19,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689149472] [2022-12-06 01:04:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:19,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:19,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:19,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689149472] [2022-12-06 01:04:19,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689149472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:19,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:19,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:04:19,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022520074] [2022-12-06 01:04:19,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:19,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:04:19,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:19,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:04:19,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:04:19,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:19,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 111 transitions, 696 flow. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:19,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:19,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:19,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:20,264 INFO L130 PetriNetUnfolder]: 6493/9018 cut-off events. [2022-12-06 01:04:20,265 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-06 01:04:20,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36306 conditions, 9018 events. 6493/9018 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 43870 event pairs, 168 based on Foata normal form. 0/8402 useless extension candidates. Maximal degree in co-relation 36288. Up to 7284 conditions per place. [2022-12-06 01:04:20,297 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 116 selfloop transitions, 5 changer transitions 36/157 dead transitions. [2022-12-06 01:04:20,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 157 transitions, 1286 flow [2022-12-06 01:04:20,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:04:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:04:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 01:04:20,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-06 01:04:20,299 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2022-12-06 01:04:20,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:20,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 157 transitions, 1286 flow [2022-12-06 01:04:20,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 157 transitions, 1286 flow [2022-12-06 01:04:20,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:20,328 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:20,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 01:04:20,329 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 157 transitions, 1286 flow [2022-12-06 01:04:20,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:20,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:20,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:20,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:04:20,329 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:20,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:20,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1913098371, now seen corresponding path program 1 times [2022-12-06 01:04:20,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:20,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049488463] [2022-12-06 01:04:20,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:20,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:20,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:20,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049488463] [2022-12-06 01:04:20,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049488463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:20,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:20,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:04:20,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089535972] [2022-12-06 01:04:20,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:20,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:04:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:20,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:04:20,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:04:20,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:20,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 157 transitions, 1286 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:20,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:20,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:20,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:21,753 INFO L130 PetriNetUnfolder]: 6425/8926 cut-off events. [2022-12-06 01:04:21,754 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-06 01:04:21,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44865 conditions, 8926 events. 6425/8926 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 43358 event pairs, 106 based on Foata normal form. 0/8326 useless extension candidates. Maximal degree in co-relation 44844. Up to 8222 conditions per place. [2022-12-06 01:04:21,800 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 150 selfloop transitions, 11 changer transitions 53/214 dead transitions. [2022-12-06 01:04:21,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 214 transitions, 2182 flow [2022-12-06 01:04:21,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:04:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:04:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 01:04:21,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 01:04:21,804 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2022-12-06 01:04:21,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:21,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 214 transitions, 2182 flow [2022-12-06 01:04:21,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 214 transitions, 2182 flow [2022-12-06 01:04:21,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:21,858 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:21,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 01:04:21,865 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 214 transitions, 2182 flow [2022-12-06 01:04:21,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:21,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:21,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:21,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:04:21,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:21,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash -821883016, now seen corresponding path program 1 times [2022-12-06 01:04:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:21,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742921825] [2022-12-06 01:04:21,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:22,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:22,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742921825] [2022-12-06 01:04:22,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742921825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:22,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:22,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:04:22,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950256956] [2022-12-06 01:04:22,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:22,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:04:22,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:22,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:04:22,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:04:22,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:22,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 214 transitions, 2182 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:22,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:22,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:22,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:23,708 INFO L130 PetriNetUnfolder]: 6925/9618 cut-off events. [2022-12-06 01:04:23,709 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-06 01:04:23,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57944 conditions, 9618 events. 6925/9618 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 47220 event pairs, 110 based on Foata normal form. 0/8994 useless extension candidates. Maximal degree in co-relation 57920. Up to 8914 conditions per place. [2022-12-06 01:04:23,752 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 182 selfloop transitions, 27 changer transitions 92/301 dead transitions. [2022-12-06 01:04:23,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 301 transitions, 3663 flow [2022-12-06 01:04:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:04:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:04:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 01:04:23,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2022-12-06 01:04:23,758 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2022-12-06 01:04:23,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:23,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 301 transitions, 3663 flow [2022-12-06 01:04:23,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 301 transitions, 3663 flow [2022-12-06 01:04:23,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:23,808 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:23,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 01:04:23,810 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 301 transitions, 3663 flow [2022-12-06 01:04:23,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:23,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:23,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:23,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:04:23,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash -293027181, now seen corresponding path program 1 times [2022-12-06 01:04:23,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:23,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426751194] [2022-12-06 01:04:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:24,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:24,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426751194] [2022-12-06 01:04:24,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426751194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:24,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:24,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:04:24,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391750994] [2022-12-06 01:04:24,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:24,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:04:24,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:24,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:04:24,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:04:24,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:24,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 301 transitions, 3663 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:24,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:24,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:24,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:25,561 INFO L130 PetriNetUnfolder]: 8073/11230 cut-off events. [2022-12-06 01:04:25,561 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 01:04:25,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78847 conditions, 11230 events. 8073/11230 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 57010 event pairs, 46 based on Foata normal form. 0/10522 useless extension candidates. Maximal degree in co-relation 78820. Up to 10444 conditions per place. [2022-12-06 01:04:25,619 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 272 selfloop transitions, 91 changer transitions 181/544 dead transitions. [2022-12-06 01:04:25,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 544 transitions, 7700 flow [2022-12-06 01:04:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:04:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:04:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-06 01:04:25,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6866666666666666 [2022-12-06 01:04:25,623 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2022-12-06 01:04:25,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:25,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 544 transitions, 7700 flow [2022-12-06 01:04:25,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 544 transitions, 7700 flow [2022-12-06 01:04:25,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:25,695 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:25,696 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 01:04:25,696 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 544 transitions, 7700 flow [2022-12-06 01:04:25,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:25,696 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:25,696 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:25,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:04:25,696 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2025953789, now seen corresponding path program 2 times [2022-12-06 01:04:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:25,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579293399] [2022-12-06 01:04:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:25,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:25,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:25,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579293399] [2022-12-06 01:04:25,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579293399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:25,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:25,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:04:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694533849] [2022-12-06 01:04:25,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:25,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:04:25,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:04:25,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:04:25,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:25,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 544 transitions, 7700 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:25,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:25,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:25,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:28,181 INFO L130 PetriNetUnfolder]: 9801/13702 cut-off events. [2022-12-06 01:04:28,181 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-12-06 01:04:28,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109854 conditions, 13702 events. 9801/13702 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 72391 event pairs, 50 based on Foata normal form. 0/12866 useless extension candidates. Maximal degree in co-relation 109824. Up to 12856 conditions per place. [2022-12-06 01:04:28,225 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 178 selfloop transitions, 5 changer transitions 447/630 dead transitions. [2022-12-06 01:04:28,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 630 transitions, 10164 flow [2022-12-06 01:04:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:04:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:04:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 01:04:28,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 01:04:28,227 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2022-12-06 01:04:28,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:28,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 630 transitions, 10164 flow [2022-12-06 01:04:28,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 630 transitions, 10164 flow [2022-12-06 01:04:28,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:28,358 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:28,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-06 01:04:28,359 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 630 transitions, 10164 flow [2022-12-06 01:04:28,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:28,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:28,359 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:28,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:04:28,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1425629365, now seen corresponding path program 1 times [2022-12-06 01:04:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:28,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288926864] [2022-12-06 01:04:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:28,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:28,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288926864] [2022-12-06 01:04:28,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288926864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:28,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:28,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:04:28,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859240096] [2022-12-06 01:04:28,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:28,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:04:28,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:28,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:04:28,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:04:28,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:28,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 630 transitions, 10164 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:28,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:28,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:28,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:29,945 INFO L130 PetriNetUnfolder]: 7386/10626 cut-off events. [2022-12-06 01:04:29,946 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 01:04:29,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95873 conditions, 10626 events. 7386/10626 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 57222 event pairs, 58 based on Foata normal form. 0/9956 useless extension candidates. Maximal degree in co-relation 95840. Up to 10122 conditions per place. [2022-12-06 01:04:30,002 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 237 selfloop transitions, 41 changer transitions 605/883 dead transitions. [2022-12-06 01:04:30,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 883 transitions, 16029 flow [2022-12-06 01:04:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:04:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:04:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 01:04:30,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 01:04:30,004 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2022-12-06 01:04:30,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:30,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 883 transitions, 16029 flow [2022-12-06 01:04:30,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 883 transitions, 16029 flow [2022-12-06 01:04:30,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:30,073 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:30,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 01:04:30,075 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 883 transitions, 16029 flow [2022-12-06 01:04:30,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:30,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:30,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:30,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:04:30,075 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:30,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:30,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1308494593, now seen corresponding path program 1 times [2022-12-06 01:04:30,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:30,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195609610] [2022-12-06 01:04:30,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:30,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:30,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:30,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195609610] [2022-12-06 01:04:30,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195609610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:30,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:30,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:04:30,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531637547] [2022-12-06 01:04:30,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:30,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:04:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:30,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:04:30,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:04:30,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:30,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 883 transitions, 16029 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:30,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:30,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:30,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:31,564 INFO L130 PetriNetUnfolder]: 4700/6960 cut-off events. [2022-12-06 01:04:31,564 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 01:04:31,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69840 conditions, 6960 events. 4700/6960 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 36346 event pairs, 19 based on Foata normal form. 0/6589 useless extension candidates. Maximal degree in co-relation 69804. Up to 6619 conditions per place. [2022-12-06 01:04:31,595 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 248 selfloop transitions, 77 changer transitions 660/985 dead transitions. [2022-12-06 01:04:31,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 985 transitions, 19859 flow [2022-12-06 01:04:31,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:04:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:04:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 01:04:31,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2022-12-06 01:04:31,597 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2022-12-06 01:04:31,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:31,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 985 transitions, 19859 flow [2022-12-06 01:04:31,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 985 transitions, 19859 flow [2022-12-06 01:04:31,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:31,686 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:31,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 01:04:31,687 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 985 transitions, 19859 flow [2022-12-06 01:04:31,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:31,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:31,687 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:31,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:04:31,687 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:31,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:31,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1133166521, now seen corresponding path program 1 times [2022-12-06 01:04:31,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:31,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302538989] [2022-12-06 01:04:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:31,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:31,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:31,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302538989] [2022-12-06 01:04:31,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302538989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:31,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:31,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:04:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895147062] [2022-12-06 01:04:31,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:31,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:04:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:31,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:04:31,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:04:31,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:31,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 985 transitions, 19859 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:31,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:31,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:31,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:33,046 INFO L130 PetriNetUnfolder]: 3710/5439 cut-off events. [2022-12-06 01:04:33,048 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-12-06 01:04:33,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60070 conditions, 5439 events. 3710/5439 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 26631 event pairs, 10 based on Foata normal form. 0/5268 useless extension candidates. Maximal degree in co-relation 60031. Up to 5117 conditions per place. [2022-12-06 01:04:33,066 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 227 selfloop transitions, 97 changer transitions 642/966 dead transitions. [2022-12-06 01:04:33,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 966 transitions, 21417 flow [2022-12-06 01:04:33,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:04:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:04:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-06 01:04:33,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-06 01:04:33,069 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2022-12-06 01:04:33,071 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:33,071 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 966 transitions, 21417 flow [2022-12-06 01:04:33,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 966 transitions, 21417 flow [2022-12-06 01:04:33,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:33,113 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:33,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 01:04:33,114 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 966 transitions, 21417 flow [2022-12-06 01:04:33,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:33,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:33,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:33,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:04:33,114 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:33,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:33,115 INFO L85 PathProgramCache]: Analyzing trace with hash -614226087, now seen corresponding path program 1 times [2022-12-06 01:04:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:33,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419500720] [2022-12-06 01:04:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:33,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:33,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419500720] [2022-12-06 01:04:33,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419500720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:33,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:33,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:04:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416676815] [2022-12-06 01:04:33,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:33,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:04:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:33,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:04:33,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:04:33,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:33,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 966 transitions, 21417 flow. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:33,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:33,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:33,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:34,913 INFO L130 PetriNetUnfolder]: 4911/7303 cut-off events. [2022-12-06 01:04:34,914 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-12-06 01:04:34,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87942 conditions, 7303 events. 4911/7303 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 38785 event pairs, 11 based on Foata normal form. 0/7062 useless extension candidates. Maximal degree in co-relation 87900. Up to 6981 conditions per place. [2022-12-06 01:04:34,943 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 275 selfloop transitions, 89 changer transitions 1228/1592 dead transitions. [2022-12-06 01:04:34,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 1592 transitions, 38454 flow [2022-12-06 01:04:34,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:04:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:04:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-06 01:04:34,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5611111111111111 [2022-12-06 01:04:34,944 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2022-12-06 01:04:34,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:34,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 1592 transitions, 38454 flow [2022-12-06 01:04:35,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 1592 transitions, 38454 flow [2022-12-06 01:04:35,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:35,088 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:35,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-06 01:04:35,089 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 1592 transitions, 38454 flow [2022-12-06 01:04:35,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:35,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:35,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:35,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:04:35,089 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1482638245, now seen corresponding path program 2 times [2022-12-06 01:04:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:35,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610602436] [2022-12-06 01:04:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:35,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:35,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:35,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610602436] [2022-12-06 01:04:35,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610602436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:35,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:35,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:04:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405245723] [2022-12-06 01:04:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:35,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:04:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:35,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:04:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:04:35,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:35,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 1592 transitions, 38454 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:35,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:35,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:35,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:37,269 INFO L130 PetriNetUnfolder]: 4705/6897 cut-off events. [2022-12-06 01:04:37,269 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-12-06 01:04:37,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89968 conditions, 6897 events. 4705/6897 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 35793 event pairs, 0 based on Foata normal form. 0/6746 useless extension candidates. Maximal degree in co-relation 89923. Up to 6575 conditions per place. [2022-12-06 01:04:37,289 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 123 selfloop transitions, 83 changer transitions 1334/1540 dead transitions. [2022-12-06 01:04:37,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 1540 transitions, 40286 flow [2022-12-06 01:04:37,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:04:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:04:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-06 01:04:37,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2022-12-06 01:04:37,292 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2022-12-06 01:04:37,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:37,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 1540 transitions, 40286 flow [2022-12-06 01:04:37,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 1540 transitions, 40286 flow [2022-12-06 01:04:37,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:37,357 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:37,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 01:04:37,358 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 1540 transitions, 40286 flow [2022-12-06 01:04:37,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:37,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:37,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:37,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 01:04:37,358 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:37,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1232894669, now seen corresponding path program 1 times [2022-12-06 01:04:37,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:37,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248806531] [2022-12-06 01:04:37,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:37,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:38,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:38,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248806531] [2022-12-06 01:04:38,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248806531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:38,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:38,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:04:38,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065807397] [2022-12-06 01:04:38,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:38,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:04:38,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:38,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:04:38,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:04:38,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:38,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 1540 transitions, 40286 flow. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:38,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:38,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:38,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:41,304 INFO L130 PetriNetUnfolder]: 6731/9998 cut-off events. [2022-12-06 01:04:41,304 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-12-06 01:04:41,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140328 conditions, 9998 events. 6731/9998 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 56980 event pairs, 0 based on Foata normal form. 0/9812 useless extension candidates. Maximal degree in co-relation 140280. Up to 9676 conditions per place. [2022-12-06 01:04:41,348 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 256 selfloop transitions, 30 changer transitions 2191/2477 dead transitions. [2022-12-06 01:04:41,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 2477 transitions, 69692 flow [2022-12-06 01:04:41,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:04:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:04:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-12-06 01:04:41,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2022-12-06 01:04:41,373 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2022-12-06 01:04:41,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:41,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 2477 transitions, 69692 flow [2022-12-06 01:04:41,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 2477 transitions, 69692 flow [2022-12-06 01:04:41,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:41,492 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:41,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 01:04:41,493 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 2477 transitions, 69692 flow [2022-12-06 01:04:41,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:41,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:41,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:41,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 01:04:41,493 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1997749177, now seen corresponding path program 2 times [2022-12-06 01:04:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:41,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813595325] [2022-12-06 01:04:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:41,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:41,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:41,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813595325] [2022-12-06 01:04:41,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813595325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:41,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:41,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:04:41,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600609220] [2022-12-06 01:04:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:41,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:04:41,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:41,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:04:41,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:04:41,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 01:04:41,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 2477 transitions, 69692 flow. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:41,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:41,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 01:04:41,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:46,914 INFO L130 PetriNetUnfolder]: 8228/12313 cut-off events. [2022-12-06 01:04:46,914 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-12-06 01:04:46,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185052 conditions, 12313 events. 8228/12313 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 73960 event pairs, 0 based on Foata normal form. 0/12119 useless extension candidates. Maximal degree in co-relation 185001. Up to 11947 conditions per place. [2022-12-06 01:04:46,955 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 0 selfloop transitions, 0 changer transitions 3195/3195 dead transitions. [2022-12-06 01:04:46,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 3195 transitions, 96186 flow [2022-12-06 01:04:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:04:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:04:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 01:04:46,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 01:04:46,958 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 39 predicate places. [2022-12-06 01:04:46,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:46,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 3195 transitions, 96186 flow [2022-12-06 01:04:47,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 3195 transitions, 96186 flow [2022-12-06 01:04:47,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:47,083 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:47,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 01:04:47,084 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 3195 transitions, 96186 flow [2022-12-06 01:04:47,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:47,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 01:04:47,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 01:04:47,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 01:04:47,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 01:04:47,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 01:04:47,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 01:04:47,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 01:04:47,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 01:04:47,091 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:47,094 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:04:47,094 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:04:47,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:04:47 BasicIcfg [2022-12-06 01:04:47,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:04:47,100 INFO L158 Benchmark]: Toolchain (without parser) took 37636.61ms. Allocated memory was 181.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 155.0MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-06 01:04:47,100 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 157.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:04:47,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.60ms. Allocated memory is still 181.4MB. Free memory was 155.0MB in the beginning and 126.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 01:04:47,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.78ms. Allocated memory is still 181.4MB. Free memory was 126.1MB in the beginning and 123.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:04:47,101 INFO L158 Benchmark]: Boogie Preprocessor took 33.96ms. Allocated memory is still 181.4MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:04:47,101 INFO L158 Benchmark]: RCFGBuilder took 770.83ms. Allocated memory is still 181.4MB. Free memory was 121.5MB in the beginning and 131.0MB in the end (delta: -9.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 01:04:47,101 INFO L158 Benchmark]: TraceAbstraction took 36276.74ms. Allocated memory was 181.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 130.5MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-06 01:04:47,102 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 157.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 470.60ms. Allocated memory is still 181.4MB. Free memory was 155.0MB in the beginning and 126.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.78ms. Allocated memory is still 181.4MB. Free memory was 126.1MB in the beginning and 123.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.96ms. Allocated memory is still 181.4MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 770.83ms. Allocated memory is still 181.4MB. Free memory was 121.5MB in the beginning and 131.0MB in the end (delta: -9.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 36276.74ms. Allocated memory was 181.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 130.5MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 137 PlacesBefore, 47 PlacesAfterwards, 126 TransitionsBefore, 35 TransitionsAfterwards, 3150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2112, independent: 2038, independent conditional: 2038, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2112, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2112, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2112, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1800, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1800, independent: 1723, independent conditional: 0, independent unconditional: 1723, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 248, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2112, independent: 286, independent conditional: 0, independent unconditional: 286, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 1800, unknown conditional: 0, unknown unconditional: 1800] , Statistics on independence cache: Total cache size (in pairs): 2526, Positive cache size: 2478, Positive conditional cache size: 0, Positive unconditional cache size: 2478, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 47 PlacesBefore, 42 PlacesAfterwards, 52 TransitionsBefore, 47 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 157 TransitionsBefore, 157 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 214 TransitionsBefore, 214 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 301 TransitionsBefore, 301 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 544 TransitionsBefore, 544 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 630 TransitionsBefore, 630 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 883 TransitionsBefore, 883 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 985 TransitionsBefore, 985 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 966 TransitionsBefore, 966 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 1592 TransitionsBefore, 1592 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 1540 TransitionsBefore, 1540 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 2477 TransitionsBefore, 2477 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 3195 TransitionsBefore, 3195 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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, 167 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 733 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1627 IncrementalHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 0 mSDtfsCounter, 1627 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96186occurred in iteration=14, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 1965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:04:47,138 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...