/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/mix011_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:00:26,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:00:26,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:00:26,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:00:26,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:00:26,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:00:26,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:00:26,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:00:26,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:00:26,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:00:26,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:00:26,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:00:26,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:00:26,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:00:26,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:00:26,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:00:26,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:00:26,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:00:26,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:00:26,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:00:26,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:00:26,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:00:26,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:00:26,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:00:26,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:00:26,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:00:26,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:00:26,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:00:26,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:00:26,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:00:26,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:00:26,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:00:26,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:00:26,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:00:26,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:00:26,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:00:26,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:00:26,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:00:26,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:00:26,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:00:26,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:00:26,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 03:00:26,647 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:00:26,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:00:26,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:00:26,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:00:26,650 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:00:26,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:00:26,650 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:00:26,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:00:26,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:00:26,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:00:26,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:00:26,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:00:26,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:00:26,652 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:00:26,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:00:26,652 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:00:26,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:00:26,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:00:26,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:00:26,652 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:00:26,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:00:26,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:00:26,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:00:26,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:00:26,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:00:26,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:00:26,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:00:26,653 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:00:26,653 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-13 03:00:26,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:00:26,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:00:26,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:00:26,955 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:00:26,959 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:00:26,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2022-12-13 03:00:27,974 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:00:28,229 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:00:28,230 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2022-12-13 03:00:28,240 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0703236be/e210e11d525243f89064e43cca4095f1/FLAG8b78e0f5d [2022-12-13 03:00:28,253 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0703236be/e210e11d525243f89064e43cca4095f1 [2022-12-13 03:00:28,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:00:28,255 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:00:28,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:00:28,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:00:28,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:00:28,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f6b0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28, skipping insertion in model container [2022-12-13 03:00:28,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:00:28,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:00:28,457 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/mix011_tso.oepc.i[949,962] [2022-12-13 03:00:28,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:00:28,655 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:00:28,667 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/mix011_tso.oepc.i[949,962] [2022-12-13 03:00:28,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:00:28,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:00:28,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:00:28,761 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:00:28,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28 WrapperNode [2022-12-13 03:00:28,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:00:28,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:00:28,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:00:28,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:00:28,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,815 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-12-13 03:00:28,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:00:28,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:00:28,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:00:28,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:00:28,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,844 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:00:28,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:00:28,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:00:28,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:00:28,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (1/1) ... [2022-12-13 03:00:28,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:00:28,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:00:28,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:00:28,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:00:28,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:00:28,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:00:28,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:00:28,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:00:28,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:00:28,917 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:00:28,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:00:28,917 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:00:28,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:00:28,917 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:00:28,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:00:28,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:00:28,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:00:28,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:00:28,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:00:28,919 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:00:29,060 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:00:29,061 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:00:29,346 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:00:29,460 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:00:29,460 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:00:29,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:00:29 BoogieIcfgContainer [2022-12-13 03:00:29,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:00:29,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:00:29,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:00:29,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:00:29,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:00:28" (1/3) ... [2022-12-13 03:00:29,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593dfdff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:00:29, skipping insertion in model container [2022-12-13 03:00:29,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:28" (2/3) ... [2022-12-13 03:00:29,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593dfdff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:00:29, skipping insertion in model container [2022-12-13 03:00:29,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:00:29" (3/3) ... [2022-12-13 03:00:29,468 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2022-12-13 03:00:29,484 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:00:29,484 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 03:00:29,484 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:00:29,532 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:00:29,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-13 03:00:29,618 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-13 03:00:29,618 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:00:29,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 03:00:29,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-13 03:00:29,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-13 03:00:29,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:00:29,649 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-13 03:00:29,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2022-12-13 03:00:29,687 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-13 03:00:29,687 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:00:29,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 03:00:29,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-13 03:00:29,692 INFO L226 LiptonReduction]: Number of co-enabled transitions 2198 [2022-12-13 03:00:37,789 INFO L241 LiptonReduction]: Total number of compositions: 88 [2022-12-13 03:00:37,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:00:37,803 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;@7df0f984, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:00:37,803 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 03:00:37,806 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 03:00:37,806 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:00:37,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:00:37,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 03:00:37,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:00:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:00:37,810 INFO L85 PathProgramCache]: Analyzing trace with hash 481355517, now seen corresponding path program 1 times [2022-12-13 03:00:37,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:00:37,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425421522] [2022-12-13 03:00:37,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:00:37,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:00:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:00:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:00:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:00:38,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425421522] [2022-12-13 03:00:38,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425421522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:00:38,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:00:38,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:00:38,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009309185] [2022-12-13 03:00:38,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:00:38,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:00:38,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:00:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:00:38,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:00:38,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 63 [2022-12-13 03:00:38,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:38,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:00:38,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 63 [2022-12-13 03:00:38,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:00:39,731 INFO L130 PetriNetUnfolder]: 9643/15808 cut-off events. [2022-12-13 03:00:39,732 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-13 03:00:39,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29619 conditions, 15808 events. 9643/15808 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 126053 event pairs, 1048 based on Foata normal form. 0/9299 useless extension candidates. Maximal degree in co-relation 29608. Up to 11996 conditions per place. [2022-12-13 03:00:39,773 INFO L137 encePairwiseOnDemand]: 58/63 looper letters, 32 selfloop transitions, 3 changer transitions 52/100 dead transitions. [2022-12-13 03:00:39,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 386 flow [2022-12-13 03:00:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:00:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:00:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-12-13 03:00:39,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2022-12-13 03:00:39,784 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2022-12-13 03:00:39,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 100 transitions, 386 flow [2022-12-13 03:00:39,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 48 transitions, 178 flow [2022-12-13 03:00:39,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:00:39,868 INFO L89 Accepts]: Start accepts. Operand has 47 places, 48 transitions, 178 flow [2022-12-13 03:00:39,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:00:39,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:00:39,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 48 transitions, 178 flow [2022-12-13 03:00:39,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 48 transitions, 178 flow [2022-12-13 03:00:39,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 590 [2022-12-13 03:00:40,094 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:00:40,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-13 03:00:40,096 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 178 flow [2022-12-13 03:00:40,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:40,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:00:40,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:00:40,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:00:40,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:00:40,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:00:40,097 INFO L85 PathProgramCache]: Analyzing trace with hash -34534102, now seen corresponding path program 1 times [2022-12-13 03:00:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:00:40,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263578281] [2022-12-13 03:00:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:00:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:00:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:00:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:00:40,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:00:40,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263578281] [2022-12-13 03:00:40,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263578281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:00:40,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:00:40,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:00:40,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9866961] [2022-12-13 03:00:40,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:00:40,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:00:40,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:00:40,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:00:40,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:00:40,455 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 03:00:40,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:40,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:00:40,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 03:00:40,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:00:40,857 INFO L130 PetriNetUnfolder]: 2948/4448 cut-off events. [2022-12-13 03:00:40,857 INFO L131 PetriNetUnfolder]: For 787/787 co-relation queries the response was YES. [2022-12-13 03:00:40,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12227 conditions, 4448 events. 2948/4448 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 23079 event pairs, 478 based on Foata normal form. 126/3861 useless extension candidates. Maximal degree in co-relation 12213. Up to 3107 conditions per place. [2022-12-13 03:00:40,881 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 51 selfloop transitions, 2 changer transitions 1/62 dead transitions. [2022-12-13 03:00:40,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 339 flow [2022-12-13 03:00:40,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:00:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:00:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 03:00:40,883 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-13 03:00:40,884 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -24 predicate places. [2022-12-13 03:00:40,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 62 transitions, 339 flow [2022-12-13 03:00:40,904 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 61 transitions, 333 flow [2022-12-13 03:00:40,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:00:40,922 INFO L89 Accepts]: Start accepts. Operand has 48 places, 61 transitions, 333 flow [2022-12-13 03:00:40,923 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:00:40,923 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:00:40,923 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 61 transitions, 333 flow [2022-12-13 03:00:40,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 61 transitions, 333 flow [2022-12-13 03:00:40,926 INFO L226 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-13 03:00:41,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:00:41,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 890 [2022-12-13 03:00:41,812 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 61 transitions, 335 flow [2022-12-13 03:00:41,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:41,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:00:41,812 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:00:41,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:00:41,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:00:41,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:00:41,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1172458315, now seen corresponding path program 1 times [2022-12-13 03:00:41,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:00:41,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698827009] [2022-12-13 03:00:41,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:00:41,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:00:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:00:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:00:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:00:42,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698827009] [2022-12-13 03:00:42,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698827009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:00:42,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:00:42,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:00:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558561285] [2022-12-13 03:00:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:00:42,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:00:42,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:00:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:00:42,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:00:42,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2022-12-13 03:00:42,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 61 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:42,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:00:42,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2022-12-13 03:00:42,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:00:42,502 INFO L130 PetriNetUnfolder]: 2369/3724 cut-off events. [2022-12-13 03:00:42,502 INFO L131 PetriNetUnfolder]: For 687/687 co-relation queries the response was YES. [2022-12-13 03:00:42,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13547 conditions, 3724 events. 2369/3724 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 19077 event pairs, 185 based on Foata normal form. 120/3332 useless extension candidates. Maximal degree in co-relation 13530. Up to 2741 conditions per place. [2022-12-13 03:00:42,522 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 73 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2022-12-13 03:00:42,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 84 transitions, 615 flow [2022-12-13 03:00:42,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:00:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:00:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 03:00:42,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 03:00:42,523 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -23 predicate places. [2022-12-13 03:00:42,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 84 transitions, 615 flow [2022-12-13 03:00:42,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 84 transitions, 615 flow [2022-12-13 03:00:42,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:00:42,556 INFO L89 Accepts]: Start accepts. Operand has 50 places, 84 transitions, 615 flow [2022-12-13 03:00:42,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:00:42,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:00:42,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 84 transitions, 615 flow [2022-12-13 03:00:42,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 84 transitions, 615 flow [2022-12-13 03:00:42,558 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 03:00:42,562 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:00:42,562 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:00:42,562 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 84 transitions, 615 flow [2022-12-13 03:00:42,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:42,563 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:00:42,563 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:00:42,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:00:42,563 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:00:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:00:42,563 INFO L85 PathProgramCache]: Analyzing trace with hash -236105977, now seen corresponding path program 1 times [2022-12-13 03:00:42,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:00:42,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845371273] [2022-12-13 03:00:42,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:00:42,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:00:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:00:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:00:43,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:00:43,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845371273] [2022-12-13 03:00:43,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845371273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:00:43,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:00:43,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:00:43,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546485103] [2022-12-13 03:00:43,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:00:43,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:00:43,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:00:43,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:00:43,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:00:43,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2022-12-13 03:00:43,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 84 transitions, 615 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:43,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:00:43,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2022-12-13 03:00:43,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:00:43,588 INFO L130 PetriNetUnfolder]: 2864/4491 cut-off events. [2022-12-13 03:00:43,588 INFO L131 PetriNetUnfolder]: For 3193/3193 co-relation queries the response was YES. [2022-12-13 03:00:43,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19836 conditions, 4491 events. 2864/4491 cut-off events. For 3193/3193 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 24444 event pairs, 159 based on Foata normal form. 120/3976 useless extension candidates. Maximal degree in co-relation 19816. Up to 3331 conditions per place. [2022-12-13 03:00:43,607 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 94 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2022-12-13 03:00:43,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 121 transitions, 1117 flow [2022-12-13 03:00:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:00:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:00:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-13 03:00:43,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 03:00:43,610 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -20 predicate places. [2022-12-13 03:00:43,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 121 transitions, 1117 flow [2022-12-13 03:00:43,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 121 transitions, 1117 flow [2022-12-13 03:00:43,642 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:00:43,643 INFO L89 Accepts]: Start accepts. Operand has 53 places, 121 transitions, 1117 flow [2022-12-13 03:00:43,644 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:00:43,644 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:00:43,644 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 121 transitions, 1117 flow [2022-12-13 03:00:43,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 121 transitions, 1117 flow [2022-12-13 03:00:43,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-13 03:00:43,651 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:00:43,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 03:00:43,657 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 121 transitions, 1117 flow [2022-12-13 03:00:43,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:43,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:00:43,658 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:00:43,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:00:43,658 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:00:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:00:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1947849020, now seen corresponding path program 1 times [2022-12-13 03:00:43,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:00:43,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470837866] [2022-12-13 03:00:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:00:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:00:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:00:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:00:43,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:00:43,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470837866] [2022-12-13 03:00:43,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470837866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:00:43,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:00:43,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:00:43,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630497045] [2022-12-13 03:00:43,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:00:43,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:00:43,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:00:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:00:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:00:43,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 03:00:43,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 121 transitions, 1117 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:43,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:00:43,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 03:00:43,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:00:44,557 INFO L130 PetriNetUnfolder]: 3798/6073 cut-off events. [2022-12-13 03:00:44,557 INFO L131 PetriNetUnfolder]: For 3790/3790 co-relation queries the response was YES. [2022-12-13 03:00:44,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32701 conditions, 6073 events. 3798/6073 cut-off events. For 3790/3790 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 36009 event pairs, 144 based on Foata normal form. 228/5337 useless extension candidates. Maximal degree in co-relation 32678. Up to 4820 conditions per place. [2022-12-13 03:00:44,583 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 162 selfloop transitions, 15 changer transitions 29/214 dead transitions. [2022-12-13 03:00:44,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 214 transitions, 2425 flow [2022-12-13 03:00:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:00:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:00:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-12-13 03:00:44,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2022-12-13 03:00:44,585 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -15 predicate places. [2022-12-13 03:00:44,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 214 transitions, 2425 flow [2022-12-13 03:00:44,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 185 transitions, 2091 flow [2022-12-13 03:00:44,635 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:00:44,636 INFO L89 Accepts]: Start accepts. Operand has 58 places, 185 transitions, 2091 flow [2022-12-13 03:00:44,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:00:44,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:00:44,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 185 transitions, 2091 flow [2022-12-13 03:00:44,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 185 transitions, 2091 flow [2022-12-13 03:00:44,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 1022 [2022-12-13 03:00:44,646 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:00:44,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 03:00:44,647 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 185 transitions, 2091 flow [2022-12-13 03:00:44,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:44,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:00:44,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:00:44,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:00:44,647 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:00:44,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:00:44,648 INFO L85 PathProgramCache]: Analyzing trace with hash 282568178, now seen corresponding path program 1 times [2022-12-13 03:00:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:00:44,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952534829] [2022-12-13 03:00:44,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:00:44,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:00:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:00:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:00:44,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:00:44,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952534829] [2022-12-13 03:00:44,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952534829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:00:44,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:00:44,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:00:44,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758353318] [2022-12-13 03:00:44,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:00:44,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:00:44,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:00:44,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:00:44,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:00:44,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 03:00:44,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 185 transitions, 2091 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:44,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:00:44,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 03:00:44,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:00:45,287 INFO L130 PetriNetUnfolder]: 3242/5490 cut-off events. [2022-12-13 03:00:45,287 INFO L131 PetriNetUnfolder]: For 11485/11760 co-relation queries the response was YES. [2022-12-13 03:00:45,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32440 conditions, 5490 events. 3242/5490 cut-off events. For 11485/11760 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 35482 event pairs, 297 based on Foata normal form. 164/4840 useless extension candidates. Maximal degree in co-relation 32414. Up to 4259 conditions per place. [2022-12-13 03:00:45,313 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 162 selfloop transitions, 52 changer transitions 19/263 dead transitions. [2022-12-13 03:00:45,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 263 transitions, 3485 flow [2022-12-13 03:00:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:00:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:00:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 03:00:45,315 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-13 03:00:45,317 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2022-12-13 03:00:45,317 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 263 transitions, 3485 flow [2022-12-13 03:00:45,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 244 transitions, 3219 flow [2022-12-13 03:00:45,365 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:00:45,365 INFO L89 Accepts]: Start accepts. Operand has 60 places, 244 transitions, 3219 flow [2022-12-13 03:00:45,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:00:45,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:00:45,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 244 transitions, 3219 flow [2022-12-13 03:00:45,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 244 transitions, 3219 flow [2022-12-13 03:00:45,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 902 [2022-12-13 03:00:46,328 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:00:46,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 964 [2022-12-13 03:00:46,329 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 245 transitions, 3241 flow [2022-12-13 03:00:46,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:46,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:00:46,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:00:46,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:00:46,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:00:46,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:00:46,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2014502665, now seen corresponding path program 1 times [2022-12-13 03:00:46,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:00:46,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243422005] [2022-12-13 03:00:46,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:00:46,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:00:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:00:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:00:46,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:00:46,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243422005] [2022-12-13 03:00:46,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243422005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:00:46,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:00:46,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:00:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986795956] [2022-12-13 03:00:46,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:00:46,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:00:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:00:46,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:00:46,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:00:46,466 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2022-12-13 03:00:46,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 245 transitions, 3241 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:46,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:00:46,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2022-12-13 03:00:46,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:00:46,854 INFO L130 PetriNetUnfolder]: 1437/2697 cut-off events. [2022-12-13 03:00:46,854 INFO L131 PetriNetUnfolder]: For 8762/9141 co-relation queries the response was YES. [2022-12-13 03:00:46,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18158 conditions, 2697 events. 1437/2697 cut-off events. For 8762/9141 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16745 event pairs, 90 based on Foata normal form. 458/2785 useless extension candidates. Maximal degree in co-relation 18129. Up to 1989 conditions per place. [2022-12-13 03:00:46,872 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 137 selfloop transitions, 73 changer transitions 20/260 dead transitions. [2022-12-13 03:00:46,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 260 transitions, 3876 flow [2022-12-13 03:00:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:00:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:00:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-12-13 03:00:46,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7013888888888888 [2022-12-13 03:00:46,875 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2022-12-13 03:00:46,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 260 transitions, 3876 flow [2022-12-13 03:00:46,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 240 transitions, 3556 flow [2022-12-13 03:00:46,918 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:00:46,918 INFO L89 Accepts]: Start accepts. Operand has 62 places, 240 transitions, 3556 flow [2022-12-13 03:00:46,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:00:46,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:00:46,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 240 transitions, 3556 flow [2022-12-13 03:00:46,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 240 transitions, 3556 flow [2022-12-13 03:00:46,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 866 [2022-12-13 03:00:46,933 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:00:46,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 03:00:46,933 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 240 transitions, 3556 flow [2022-12-13 03:00:46,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:46,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:00:46,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:00:46,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:00:46,936 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:00:46,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:00:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash -557260801, now seen corresponding path program 1 times [2022-12-13 03:00:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:00:46,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113452930] [2022-12-13 03:00:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:00:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:00:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:00:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:00:47,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:00:47,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113452930] [2022-12-13 03:00:47,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113452930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:00:47,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:00:47,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:00:47,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099399745] [2022-12-13 03:00:47,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:00:47,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:00:47,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:00:47,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:00:47,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:00:47,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 03:00:47,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 240 transitions, 3556 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:47,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:00:47,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 03:00:47,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:00:47,383 INFO L130 PetriNetUnfolder]: 976/1812 cut-off events. [2022-12-13 03:00:47,383 INFO L131 PetriNetUnfolder]: For 7727/8056 co-relation queries the response was YES. [2022-12-13 03:00:47,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13488 conditions, 1812 events. 976/1812 cut-off events. For 7727/8056 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10209 event pairs, 19 based on Foata normal form. 291/1855 useless extension candidates. Maximal degree in co-relation 13456. Up to 1259 conditions per place. [2022-12-13 03:00:47,392 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 83 selfloop transitions, 56 changer transitions 81/237 dead transitions. [2022-12-13 03:00:47,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 237 transitions, 3922 flow [2022-12-13 03:00:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:00:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:00:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-13 03:00:47,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2022-12-13 03:00:47,394 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2022-12-13 03:00:47,394 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 237 transitions, 3922 flow [2022-12-13 03:00:47,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 156 transitions, 2582 flow [2022-12-13 03:00:47,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:00:47,412 INFO L89 Accepts]: Start accepts. Operand has 64 places, 156 transitions, 2582 flow [2022-12-13 03:00:47,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:00:47,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:00:47,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 156 transitions, 2582 flow [2022-12-13 03:00:47,417 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 156 transitions, 2582 flow [2022-12-13 03:00:47,417 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 03:00:48,896 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:00:48,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1485 [2022-12-13 03:00:48,897 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 155 transitions, 2564 flow [2022-12-13 03:00:48,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:48,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:00:48,898 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:00:48,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:00:48,898 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:00:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:00:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1331568610, now seen corresponding path program 1 times [2022-12-13 03:00:48,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:00:48,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180081904] [2022-12-13 03:00:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:00:48,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:00:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:00:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:00:49,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:00:49,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180081904] [2022-12-13 03:00:49,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180081904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:00:49,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:00:49,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:00:49,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626955376] [2022-12-13 03:00:49,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:00:49,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:00:49,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:00:49,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:00:49,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:00:49,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2022-12-13 03:00:49,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 155 transitions, 2564 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:49,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:00:49,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2022-12-13 03:00:49,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:00:49,230 INFO L130 PetriNetUnfolder]: 984/1726 cut-off events. [2022-12-13 03:00:49,230 INFO L131 PetriNetUnfolder]: For 8660/8787 co-relation queries the response was YES. [2022-12-13 03:00:49,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14639 conditions, 1726 events. 984/1726 cut-off events. For 8660/8787 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8908 event pairs, 13 based on Foata normal form. 45/1472 useless extension candidates. Maximal degree in co-relation 14604. Up to 1349 conditions per place. [2022-12-13 03:00:49,237 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 70 selfloop transitions, 4 changer transitions 135/225 dead transitions. [2022-12-13 03:00:49,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 225 transitions, 4232 flow [2022-12-13 03:00:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:00:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:00:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 03:00:49,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2022-12-13 03:00:49,239 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2022-12-13 03:00:49,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 225 transitions, 4232 flow [2022-12-13 03:00:49,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 90 transitions, 1611 flow [2022-12-13 03:00:49,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:00:49,256 INFO L89 Accepts]: Start accepts. Operand has 62 places, 90 transitions, 1611 flow [2022-12-13 03:00:49,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:00:49,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:00:49,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 90 transitions, 1611 flow [2022-12-13 03:00:49,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 90 transitions, 1611 flow [2022-12-13 03:00:49,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-13 03:00:49,320 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:00:49,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 03:00:49,321 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 90 transitions, 1611 flow [2022-12-13 03:00:49,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:49,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:00:49,322 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:00:49,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:00:49,322 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:00:49,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:00:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1441059838, now seen corresponding path program 1 times [2022-12-13 03:00:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:00:49,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672147748] [2022-12-13 03:00:49,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:00:49,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:00:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:00:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:00:49,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:00:49,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672147748] [2022-12-13 03:00:49,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672147748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:00:49,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:00:49,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:00:49,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864245583] [2022-12-13 03:00:49,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:00:49,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:00:49,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:00:49,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:00:49,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:00:49,957 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 03:00:49,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 90 transitions, 1611 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:49,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:00:49,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 03:00:49,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:00:50,127 INFO L130 PetriNetUnfolder]: 504/969 cut-off events. [2022-12-13 03:00:50,127 INFO L131 PetriNetUnfolder]: For 4709/4738 co-relation queries the response was YES. [2022-12-13 03:00:50,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9007 conditions, 969 events. 504/969 cut-off events. For 4709/4738 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5359 event pairs, 0 based on Foata normal form. 34/786 useless extension candidates. Maximal degree in co-relation 8969. Up to 848 conditions per place. [2022-12-13 03:00:50,132 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 71 selfloop transitions, 15 changer transitions 16/117 dead transitions. [2022-12-13 03:00:50,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 117 transitions, 2355 flow [2022-12-13 03:00:50,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:00:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:00:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-13 03:00:50,134 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2022-12-13 03:00:50,134 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2022-12-13 03:00:50,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 117 transitions, 2355 flow [2022-12-13 03:00:50,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 101 transitions, 2003 flow [2022-12-13 03:00:50,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:00:50,145 INFO L89 Accepts]: Start accepts. Operand has 66 places, 101 transitions, 2003 flow [2022-12-13 03:00:50,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:00:50,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:00:50,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 101 transitions, 2003 flow [2022-12-13 03:00:50,150 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 101 transitions, 2003 flow [2022-12-13 03:00:50,150 INFO L226 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-13 03:00:50,220 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:00:50,221 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 03:00:50,221 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 101 transitions, 2003 flow [2022-12-13 03:00:50,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:00:50,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:00:50,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:00:50,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:00:50,221 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 03:00:50,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:00:50,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1516061058, now seen corresponding path program 1 times [2022-12-13 03:00:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:00:50,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646749623] [2022-12-13 03:00:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:00:50,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:00:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:00:50,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 03:00:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:00:50,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 03:00:50,346 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 03:00:50,346 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 03:00:50,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 03:00:50,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 03:00:50,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 03:00:50,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 03:00:50,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 03:00:50,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:00:50,353 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:00:50,359 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:00:50,359 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:00:50,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:00:50 BasicIcfg [2022-12-13 03:00:50,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:00:50,426 INFO L158 Benchmark]: Toolchain (without parser) took 22170.80ms. Allocated memory was 182.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 157.6MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 313.7MB. Max. memory is 8.0GB. [2022-12-13 03:00:50,426 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:00:50,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.86ms. Allocated memory is still 182.5MB. Free memory was 157.1MB in the beginning and 130.3MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 03:00:50,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.29ms. Allocated memory is still 182.5MB. Free memory was 130.3MB in the beginning and 127.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:00:50,427 INFO L158 Benchmark]: Boogie Preprocessor took 43.13ms. Allocated memory is still 182.5MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:00:50,427 INFO L158 Benchmark]: RCFGBuilder took 602.65ms. Allocated memory is still 182.5MB. Free memory was 125.6MB in the beginning and 90.5MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-13 03:00:50,427 INFO L158 Benchmark]: TraceAbstraction took 20961.92ms. Allocated memory was 182.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 89.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 245.5MB. Max. memory is 8.0GB. [2022-12-13 03:00:50,428 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.12ms. Allocated memory is still 182.5MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 505.86ms. Allocated memory is still 182.5MB. Free memory was 157.1MB in the beginning and 130.3MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.29ms. Allocated memory is still 182.5MB. Free memory was 130.3MB in the beginning and 127.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.13ms. Allocated memory is still 182.5MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 602.65ms. Allocated memory is still 182.5MB. Free memory was 125.6MB in the beginning and 90.5MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 20961.92ms. Allocated memory was 182.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 89.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 245.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1s, 119 PlacesBefore, 73 PlacesAfterwards, 111 TransitionsBefore, 63 TransitionsAfterwards, 2198 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3371, independent: 3174, independent conditional: 3174, independent unconditional: 0, dependent: 197, dependent conditional: 197, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3371, independent: 3174, independent conditional: 0, independent unconditional: 3174, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3371, independent: 3174, independent conditional: 0, independent unconditional: 3174, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3371, independent: 3174, independent conditional: 0, independent unconditional: 3174, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2000, independent: 1922, independent conditional: 0, independent unconditional: 1922, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2000, independent: 1884, independent conditional: 0, independent unconditional: 1884, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 116, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 432, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 400, dependent conditional: 0, dependent unconditional: 400, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3371, independent: 1252, independent conditional: 0, independent unconditional: 1252, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 2000, unknown conditional: 0, unknown unconditional: 2000] , Statistics on independence cache: Total cache size (in pairs): 3477, Positive cache size: 3399, Positive conditional cache size: 0, Positive unconditional cache size: 3399, Negative cache size: 78, Negative conditional cache size: 0, Negative unconditional cache size: 78, 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.2s, 47 PlacesBefore, 47 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 590 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 81, independent: 69, independent conditional: 28, independent unconditional: 41, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, independent: 69, independent conditional: 16, independent unconditional: 53, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 69, independent conditional: 16, independent unconditional: 53, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, independent: 53, independent conditional: 11, independent unconditional: 42, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 34, dependent conditional: 20, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, independent: 16, independent conditional: 5, independent unconditional: 11, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 62, unknown conditional: 14, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 53, Positive conditional cache size: 11, Positive unconditional cache size: 42, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 48 PlacesBefore, 48 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 63, Positive conditional cache size: 11, Positive unconditional cache size: 52, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, 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, 50 PlacesBefore, 50 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 568 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): 72, Positive cache size: 63, Positive conditional cache size: 11, Positive unconditional cache size: 52, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, 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, 121 TransitionsBefore, 121 TransitionsAfterwards, 754 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): 72, Positive cache size: 63, Positive conditional cache size: 11, Positive unconditional cache size: 52, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, 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, 58 PlacesBefore, 58 PlacesAfterwards, 185 TransitionsBefore, 185 TransitionsAfterwards, 1022 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): 72, Positive cache size: 63, Positive conditional cache size: 11, Positive unconditional cache size: 52, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, 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: 1.0s, 60 PlacesBefore, 61 PlacesAfterwards, 244 TransitionsBefore, 245 TransitionsAfterwards, 902 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 64, Positive conditional cache size: 11, Positive unconditional cache size: 53, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 240 TransitionsBefore, 240 TransitionsAfterwards, 866 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): 73, Positive cache size: 64, Positive conditional cache size: 11, Positive unconditional cache size: 53, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, 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: 1.5s, 64 PlacesBefore, 63 PlacesAfterwards, 156 TransitionsBefore, 155 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 70, Positive conditional cache size: 15, Positive unconditional cache size: 55, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 62 PlacesBefore, 62 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 72, Positive conditional cache size: 15, Positive unconditional cache size: 57, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 66 PlacesBefore, 66 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 74, Positive conditional cache size: 15, Positive unconditional cache size: 59, Negative cache size: 9, Negative conditional cache size: 3, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299; [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299, ((void *)0), P0, ((void *)0))=-2, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t300; [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300, ((void *)0), P1, ((void *)0))=-1, t299={5:0}, t300={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t301; [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t301, ((void *)0), P2, ((void *)0))=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z [L810] 3 __unbuffered_p2_EBX = a [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L858] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L859] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L860] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L861] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L863] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 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: 20.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 751 IncrementalHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 21 mSDtfsCounter, 751 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3556occurred in iteration=7, InterpolantAutomatonStates: 40, 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, 2.5s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 1383 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 03:00:50,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...