/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:30:29,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:30:29,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:30:29,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:30:29,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:30:29,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:30:29,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:30:29,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:30:29,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:30:29,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:30:29,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:30:29,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:30:29,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:30:29,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:30:29,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:30:29,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:30:29,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:30:29,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:30:29,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:30:29,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:30:29,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:30:29,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:30:29,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:30:29,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:30:29,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:30:29,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:30:29,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:30:29,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:30:29,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:30:29,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:30:29,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:30:29,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:30:29,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:30:29,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:30:29,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:30:29,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:30:29,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:30:29,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:30:29,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:30:29,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:30:29,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:30:29,750 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-SemanticLbe.epf [2022-12-12 18:30:29,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:30:29,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:30:29,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:30:29,780 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:30:29,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:30:29,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:30:29,781 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:30:29,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:30:29,781 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:30:29,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:30:29,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:30:29,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:30:29,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:30:29,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:30:29,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:30:29,782 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:30:29,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:30:29,783 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:30:29,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:30:29,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:30:29,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:30:29,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:30:29,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:30:29,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:30:29,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:30:29,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:30:29,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:30:29,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:30:29,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:30:29,784 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:30:29,784 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-12 18:30:30,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:30:30,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:30:30,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:30:30,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:30:30,082 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:30:30,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2022-12-12 18:30:31,064 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:30:31,277 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:30:31,277 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2022-12-12 18:30:31,286 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de14ab82/5b38c2f063384f5bb31a672b13d0a735/FLAGfe533dc88 [2022-12-12 18:30:31,296 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de14ab82/5b38c2f063384f5bb31a672b13d0a735 [2022-12-12 18:30:31,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:30:31,299 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:30:31,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:30:31,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:30:31,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:30:31,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3a07df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31, skipping insertion in model container [2022-12-12 18:30:31,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:30:31,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:30:31,507 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/mix002.oepc.i[945,958] [2022-12-12 18:30:31,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:30:31,722 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:30:31,730 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/mix002.oepc.i[945,958] [2022-12-12 18:30:31,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:30:31,813 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:30:31,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31 WrapperNode [2022-12-12 18:30:31,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:30:31,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:30:31,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:30:31,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:30:31,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,873 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-12-12 18:30:31,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:30:31,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:30:31,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:30:31,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:30:31,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,912 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:30:31,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:30:31,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:30:31,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:30:31,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (1/1) ... [2022-12-12 18:30:31,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:30:31,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:30:31,969 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-12 18:30:31,996 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-12 18:30:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:30:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:30:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:30:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:30:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:30:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:30:32,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:30:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:30:32,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:30:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:30:32,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:30:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:30:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:30:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:30:32,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:30:32,011 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:30:32,142 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:30:32,143 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:30:32,390 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:30:32,479 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:30:32,479 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:30:32,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:30:32 BoogieIcfgContainer [2022-12-12 18:30:32,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:30:32,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:30:32,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:30:32,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:30:32,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:30:31" (1/3) ... [2022-12-12 18:30:32,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1329da8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:30:32, skipping insertion in model container [2022-12-12 18:30:32,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:30:31" (2/3) ... [2022-12-12 18:30:32,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1329da8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:30:32, skipping insertion in model container [2022-12-12 18:30:32,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:30:32" (3/3) ... [2022-12-12 18:30:32,486 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-12-12 18:30:32,498 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:30:32,498 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:30:32,498 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:30:32,550 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:30:32,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-12-12 18:30:32,629 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-12 18:30:32,630 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:30:32,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-12 18:30:32,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-12-12 18:30:32,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-12-12 18:30:32,640 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:30:32,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2022-12-12 18:30:32,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2022-12-12 18:30:32,708 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-12 18:30:32,708 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:30:32,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-12 18:30:32,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2022-12-12 18:30:32,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 2348 [2022-12-12 18:30:36,622 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-12 18:30:36,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:30:36,669 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=PETRI_NET, 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;@757a5205, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:30:36,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 18:30:36,673 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-12 18:30:36,673 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:30:36,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:36,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 18:30:36,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:36,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash 529862, now seen corresponding path program 1 times [2022-12-12 18:30:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:36,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190767770] [2022-12-12 18:30:36,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:36,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:36,976 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-12 18:30:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:36,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190767770] [2022-12-12 18:30:36,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190767770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:36,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:36,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:30:36,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132216934] [2022-12-12 18:30:36,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:36,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:30:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:36,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:30:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:30:36,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 70 [2022-12-12 18:30:37,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:30:37,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:37,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 70 [2022-12-12 18:30:37,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:38,743 INFO L130 PetriNetUnfolder]: 13250/20252 cut-off events. [2022-12-12 18:30:38,744 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-12 18:30:38,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39096 conditions, 20252 events. 13250/20252 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 1198. Compared 143531 event pairs, 5692 based on Foata normal form. 0/12090 useless extension candidates. Maximal degree in co-relation 39085. Up to 16747 conditions per place. [2022-12-12 18:30:38,793 INFO L137 encePairwiseOnDemand]: 64/70 looper letters, 37 selfloop transitions, 3 changer transitions 59/112 dead transitions. [2022-12-12 18:30:38,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 112 transitions, 435 flow [2022-12-12 18:30:38,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:30:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:30:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2022-12-12 18:30:38,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2022-12-12 18:30:38,808 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 0 predicate places. [2022-12-12 18:30:38,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 112 transitions, 435 flow [2022-12-12 18:30:38,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 53 transitions, 201 flow [2022-12-12 18:30:38,834 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 53 transitions, 201 flow [2022-12-12 18:30:38,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:30:38,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:38,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:38,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:30:38,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:38,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1302352964, now seen corresponding path program 1 times [2022-12-12 18:30:38,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:38,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258322683] [2022-12-12 18:30:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:38,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:38,984 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-12 18:30:38,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:38,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258322683] [2022-12-12 18:30:38,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258322683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:38,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:38,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:30:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520791287] [2022-12-12 18:30:38,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:38,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:30:38,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:38,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:30:38,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:30:38,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2022-12-12 18:30:38,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 53 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-12 18:30:38,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:38,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2022-12-12 18:30:38,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:39,664 INFO L130 PetriNetUnfolder]: 4856/7315 cut-off events. [2022-12-12 18:30:39,665 INFO L131 PetriNetUnfolder]: For 718/718 co-relation queries the response was YES. [2022-12-12 18:30:39,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19804 conditions, 7315 events. 4856/7315 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 39484 event pairs, 2252 based on Foata normal form. 12/6233 useless extension candidates. Maximal degree in co-relation 19790. Up to 6780 conditions per place. [2022-12-12 18:30:39,697 INFO L137 encePairwiseOnDemand]: 65/70 looper letters, 59 selfloop transitions, 4 changer transitions 2/73 dead transitions. [2022-12-12 18:30:39,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 414 flow [2022-12-12 18:30:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:30:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:30:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-12 18:30:39,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3380952380952381 [2022-12-12 18:30:39,700 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2022-12-12 18:30:39,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 73 transitions, 414 flow [2022-12-12 18:30:39,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 71 transitions, 406 flow [2022-12-12 18:30:39,727 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 71 transitions, 406 flow [2022-12-12 18:30:39,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-12 18:30:39,727 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:39,727 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:39,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:30:39,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:39,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1725788390, now seen corresponding path program 1 times [2022-12-12 18:30:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:39,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387837186] [2022-12-12 18:30:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:39,896 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-12 18:30:39,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:39,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387837186] [2022-12-12 18:30:39,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387837186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:39,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:39,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:30:39,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064311291] [2022-12-12 18:30:39,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:39,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:30:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:39,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:30:39,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:30:39,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 70 [2022-12-12 18:30:39,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 71 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-12 18:30:39,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:39,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 70 [2022-12-12 18:30:39,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:40,375 INFO L130 PetriNetUnfolder]: 3571/5413 cut-off events. [2022-12-12 18:30:40,375 INFO L131 PetriNetUnfolder]: For 1376/1376 co-relation queries the response was YES. [2022-12-12 18:30:40,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19558 conditions, 5413 events. 3571/5413 cut-off events. For 1376/1376 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 28107 event pairs, 795 based on Foata normal form. 100/4669 useless extension candidates. Maximal degree in co-relation 19541. Up to 5035 conditions per place. [2022-12-12 18:30:40,402 INFO L137 encePairwiseOnDemand]: 67/70 looper letters, 73 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2022-12-12 18:30:40,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 88 transitions, 660 flow [2022-12-12 18:30:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:30:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:30:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-12 18:30:40,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-12 18:30:40,407 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2022-12-12 18:30:40,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 88 transitions, 660 flow [2022-12-12 18:30:40,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 88 transitions, 660 flow [2022-12-12 18:30:40,432 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 88 transitions, 660 flow [2022-12-12 18:30:40,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-12 18:30:40,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:40,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:40,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:30:40,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1747212676, now seen corresponding path program 1 times [2022-12-12 18:30:40,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:40,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117914819] [2022-12-12 18:30:40,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:40,544 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-12 18:30:40,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:40,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117914819] [2022-12-12 18:30:40,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117914819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:40,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:40,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:30:40,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263432236] [2022-12-12 18:30:40,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:40,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:30:40,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:40,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:30:40,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:30:40,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 70 [2022-12-12 18:30:40,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 88 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-12 18:30:40,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:40,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 70 [2022-12-12 18:30:40,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:40,934 INFO L130 PetriNetUnfolder]: 3357/5089 cut-off events. [2022-12-12 18:30:40,934 INFO L131 PetriNetUnfolder]: For 3892/3892 co-relation queries the response was YES. [2022-12-12 18:30:40,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22735 conditions, 5089 events. 3357/5089 cut-off events. For 3892/3892 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 26218 event pairs, 416 based on Foata normal form. 80/4361 useless extension candidates. Maximal degree in co-relation 22715. Up to 4741 conditions per place. [2022-12-12 18:30:40,960 INFO L137 encePairwiseOnDemand]: 67/70 looper letters, 99 selfloop transitions, 3 changer transitions 0/114 dead transitions. [2022-12-12 18:30:40,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 114 transitions, 1075 flow [2022-12-12 18:30:40,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:30:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:30:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-12 18:30:40,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-12 18:30:40,963 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -25 predicate places. [2022-12-12 18:30:40,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 114 transitions, 1075 flow [2022-12-12 18:30:40,985 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 114 transitions, 1075 flow [2022-12-12 18:30:40,985 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 114 transitions, 1075 flow [2022-12-12 18:30:40,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-12 18:30:40,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:40,985 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:40,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:30:40,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:40,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:40,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2033749487, now seen corresponding path program 1 times [2022-12-12 18:30:40,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:40,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485728847] [2022-12-12 18:30:40,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:40,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:41,056 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-12 18:30:41,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:41,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485728847] [2022-12-12 18:30:41,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485728847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:41,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:41,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:30:41,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472221153] [2022-12-12 18:30:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:41,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:30:41,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:41,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:30:41,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:30:41,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 70 [2022-12-12 18:30:41,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 114 transitions, 1075 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-12 18:30:41,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:41,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 70 [2022-12-12 18:30:41,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:41,419 INFO L130 PetriNetUnfolder]: 3162/4819 cut-off events. [2022-12-12 18:30:41,419 INFO L131 PetriNetUnfolder]: For 7188/7188 co-relation queries the response was YES. [2022-12-12 18:30:41,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25274 conditions, 4819 events. 3162/4819 cut-off events. For 7188/7188 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 24810 event pairs, 341 based on Foata normal form. 75/4141 useless extension candidates. Maximal degree in co-relation 25251. Up to 4471 conditions per place. [2022-12-12 18:30:41,444 INFO L137 encePairwiseOnDemand]: 67/70 looper letters, 114 selfloop transitions, 5 changer transitions 4/137 dead transitions. [2022-12-12 18:30:41,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 137 transitions, 1554 flow [2022-12-12 18:30:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:30:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:30:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-12 18:30:41,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2022-12-12 18:30:41,445 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -23 predicate places. [2022-12-12 18:30:41,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 137 transitions, 1554 flow [2022-12-12 18:30:41,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 133 transitions, 1506 flow [2022-12-12 18:30:41,465 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 133 transitions, 1506 flow [2022-12-12 18:30:41,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-12 18:30:41,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:41,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:41,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:30:41,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1848086719, now seen corresponding path program 1 times [2022-12-12 18:30:41,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:41,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478717210] [2022-12-12 18:30:41,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:41,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:41,569 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-12 18:30:41,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:41,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478717210] [2022-12-12 18:30:41,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478717210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:41,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:41,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:30:41,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759516892] [2022-12-12 18:30:41,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:41,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:30:41,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:41,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:30:41,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:30:41,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 70 [2022-12-12 18:30:41,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 133 transitions, 1506 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:30:41,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:41,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 70 [2022-12-12 18:30:41,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:42,036 INFO L130 PetriNetUnfolder]: 4004/6139 cut-off events. [2022-12-12 18:30:42,036 INFO L131 PetriNetUnfolder]: For 22804/22918 co-relation queries the response was YES. [2022-12-12 18:30:42,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36148 conditions, 6139 events. 4004/6139 cut-off events. For 22804/22918 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 34103 event pairs, 470 based on Foata normal form. 574/5945 useless extension candidates. Maximal degree in co-relation 36122. Up to 5452 conditions per place. [2022-12-12 18:30:42,063 INFO L137 encePairwiseOnDemand]: 58/70 looper letters, 190 selfloop transitions, 46 changer transitions 12/259 dead transitions. [2022-12-12 18:30:42,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 259 transitions, 3469 flow [2022-12-12 18:30:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:30:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:30:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-12-12 18:30:42,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3964285714285714 [2022-12-12 18:30:42,065 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -21 predicate places. [2022-12-12 18:30:42,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 259 transitions, 3469 flow [2022-12-12 18:30:42,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 247 transitions, 3301 flow [2022-12-12 18:30:42,089 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 247 transitions, 3301 flow [2022-12-12 18:30:42,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:30:42,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:42,090 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-12 18:30:42,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:30:42,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1235079858, now seen corresponding path program 1 times [2022-12-12 18:30:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:42,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571626227] [2022-12-12 18:30:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:42,186 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-12 18:30:42,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:42,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571626227] [2022-12-12 18:30:42,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571626227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:42,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:42,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:30:42,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972710809] [2022-12-12 18:30:42,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:42,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:30:42,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:42,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:30:42,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:30:42,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2022-12-12 18:30:42,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 247 transitions, 3301 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-12 18:30:42,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:42,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2022-12-12 18:30:42,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:42,916 INFO L130 PetriNetUnfolder]: 4721/7305 cut-off events. [2022-12-12 18:30:42,916 INFO L131 PetriNetUnfolder]: For 26809/27010 co-relation queries the response was YES. [2022-12-12 18:30:42,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49690 conditions, 7305 events. 4721/7305 cut-off events. For 26809/27010 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 42592 event pairs, 245 based on Foata normal form. 212/6548 useless extension candidates. Maximal degree in co-relation 49661. Up to 6450 conditions per place. [2022-12-12 18:30:42,960 INFO L137 encePairwiseOnDemand]: 63/70 looper letters, 310 selfloop transitions, 21 changer transitions 63/408 dead transitions. [2022-12-12 18:30:42,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 408 transitions, 6315 flow [2022-12-12 18:30:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:30:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:30:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2022-12-12 18:30:42,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-12 18:30:42,961 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -16 predicate places. [2022-12-12 18:30:42,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 408 transitions, 6315 flow [2022-12-12 18:30:42,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 345 transitions, 5301 flow [2022-12-12 18:30:42,998 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 345 transitions, 5301 flow [2022-12-12 18:30:42,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-12 18:30:42,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:42,998 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-12 18:30:42,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:30:42,998 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:42,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:42,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1574274548, now seen corresponding path program 2 times [2022-12-12 18:30:42,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:42,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043694482] [2022-12-12 18:30:42,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:42,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:43,142 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-12 18:30:43,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:43,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043694482] [2022-12-12 18:30:43,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043694482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:43,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:43,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:30:43,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765181537] [2022-12-12 18:30:43,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:43,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:30:43,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:43,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:30:43,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:30:43,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 70 [2022-12-12 18:30:43,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 345 transitions, 5301 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-12 18:30:43,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:43,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 70 [2022-12-12 18:30:43,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:43,772 INFO L130 PetriNetUnfolder]: 2382/4196 cut-off events. [2022-12-12 18:30:43,773 INFO L131 PetriNetUnfolder]: For 22014/22380 co-relation queries the response was YES. [2022-12-12 18:30:43,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32162 conditions, 4196 events. 2382/4196 cut-off events. For 22014/22380 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 26630 event pairs, 99 based on Foata normal form. 714/4387 useless extension candidates. Maximal degree in co-relation 32130. Up to 3707 conditions per place. [2022-12-12 18:30:43,816 INFO L137 encePairwiseOnDemand]: 58/70 looper letters, 188 selfloop transitions, 85 changer transitions 119/409 dead transitions. [2022-12-12 18:30:43,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 409 transitions, 7004 flow [2022-12-12 18:30:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:30:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:30:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2022-12-12 18:30:43,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40285714285714286 [2022-12-12 18:30:43,818 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -12 predicate places. [2022-12-12 18:30:43,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 409 transitions, 7004 flow [2022-12-12 18:30:43,837 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 290 transitions, 4934 flow [2022-12-12 18:30:43,838 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 290 transitions, 4934 flow [2022-12-12 18:30:43,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-12 18:30:43,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:43,838 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-12 18:30:43,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:30:43,838 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash -359163714, now seen corresponding path program 1 times [2022-12-12 18:30:43,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:43,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168124716] [2022-12-12 18:30:43,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:43,986 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-12 18:30:43,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:43,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168124716] [2022-12-12 18:30:43,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168124716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:43,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:43,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:30:43,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285689015] [2022-12-12 18:30:43,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:43,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:30:43,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:43,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:30:43,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:30:43,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 70 [2022-12-12 18:30:43,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 290 transitions, 4934 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-12 18:30:43,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:43,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 70 [2022-12-12 18:30:43,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:44,565 INFO L130 PetriNetUnfolder]: 2218/4211 cut-off events. [2022-12-12 18:30:44,565 INFO L131 PetriNetUnfolder]: For 15720/15841 co-relation queries the response was YES. [2022-12-12 18:30:44,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35851 conditions, 4211 events. 2218/4211 cut-off events. For 15720/15841 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 28979 event pairs, 2 based on Foata normal form. 128/3782 useless extension candidates. Maximal degree in co-relation 35816. Up to 3634 conditions per place. [2022-12-12 18:30:44,582 INFO L137 encePairwiseOnDemand]: 63/70 looper letters, 261 selfloop transitions, 21 changer transitions 156/455 dead transitions. [2022-12-12 18:30:44,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 455 transitions, 8670 flow [2022-12-12 18:30:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:30:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:30:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-12 18:30:44,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-12 18:30:44,584 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -7 predicate places. [2022-12-12 18:30:44,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 455 transitions, 8670 flow [2022-12-12 18:30:44,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 299 transitions, 5652 flow [2022-12-12 18:30:44,598 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 299 transitions, 5652 flow [2022-12-12 18:30:44,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-12 18:30:44,599 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:44,599 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-12 18:30:44,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:30:44,599 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:44,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1239261705, now seen corresponding path program 1 times [2022-12-12 18:30:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:44,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343120916] [2022-12-12 18:30:44,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:44,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:44,753 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-12 18:30:44,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:44,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343120916] [2022-12-12 18:30:44,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343120916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:44,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:44,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:30:44,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326545648] [2022-12-12 18:30:44,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:44,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:30:44,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:44,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:30:44,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:30:44,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 70 [2022-12-12 18:30:44,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 299 transitions, 5652 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-12 18:30:44,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:44,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 70 [2022-12-12 18:30:44,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:45,048 INFO L130 PetriNetUnfolder]: 1054/2121 cut-off events. [2022-12-12 18:30:45,049 INFO L131 PetriNetUnfolder]: For 11319/11517 co-relation queries the response was YES. [2022-12-12 18:30:45,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19897 conditions, 2121 events. 1054/2121 cut-off events. For 11319/11517 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 13119 event pairs, 2 based on Foata normal form. 271/2117 useless extension candidates. Maximal degree in co-relation 19859. Up to 1832 conditions per place. [2022-12-12 18:30:45,057 INFO L137 encePairwiseOnDemand]: 58/70 looper letters, 58 selfloop transitions, 49 changer transitions 179/294 dead transitions. [2022-12-12 18:30:45,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 294 transitions, 6106 flow [2022-12-12 18:30:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:30:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:30:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2022-12-12 18:30:45,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-12 18:30:45,062 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -2 predicate places. [2022-12-12 18:30:45,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 294 transitions, 6106 flow [2022-12-12 18:30:45,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 115 transitions, 2314 flow [2022-12-12 18:30:45,068 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 115 transitions, 2314 flow [2022-12-12 18:30:45,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-12 18:30:45,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:45,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:45,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:30:45,069 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:45,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1298250934, now seen corresponding path program 1 times [2022-12-12 18:30:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:45,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624359643] [2022-12-12 18:30:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:45,598 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-12 18:30:45,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:45,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624359643] [2022-12-12 18:30:45,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624359643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:45,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:45,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:30:45,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025570853] [2022-12-12 18:30:45,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:45,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:30:45,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:45,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:30:45,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:30:45,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 70 [2022-12-12 18:30:45,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 115 transitions, 2314 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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-12 18:30:45,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:45,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 70 [2022-12-12 18:30:45,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:45,842 INFO L130 PetriNetUnfolder]: 664/1341 cut-off events. [2022-12-12 18:30:45,843 INFO L131 PetriNetUnfolder]: For 8266/8286 co-relation queries the response was YES. [2022-12-12 18:30:45,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13883 conditions, 1341 events. 664/1341 cut-off events. For 8266/8286 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7367 event pairs, 2 based on Foata normal form. 35/1138 useless extension candidates. Maximal degree in co-relation 13842. Up to 1099 conditions per place. [2022-12-12 18:30:45,847 INFO L137 encePairwiseOnDemand]: 64/70 looper letters, 69 selfloop transitions, 6 changer transitions 84/174 dead transitions. [2022-12-12 18:30:45,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 174 transitions, 3941 flow [2022-12-12 18:30:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:30:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:30:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-12-12 18:30:45,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2897959183673469 [2022-12-12 18:30:45,849 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -1 predicate places. [2022-12-12 18:30:45,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 174 transitions, 3941 flow [2022-12-12 18:30:45,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 90 transitions, 1942 flow [2022-12-12 18:30:45,853 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 90 transitions, 1942 flow [2022-12-12 18:30:45,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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-12 18:30:45,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:45,853 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:45,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:30:45,854 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:45,854 INFO L85 PathProgramCache]: Analyzing trace with hash 689866452, now seen corresponding path program 2 times [2022-12-12 18:30:45,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:45,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642131645] [2022-12-12 18:30:45,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:45,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:30:45,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:30:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:30:45,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:30:45,988 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:30:45,989 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 18:30:45,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 18:30:45,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 18:30:45,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 18:30:45,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 18:30:45,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 18:30:45,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:30:45,992 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:45,998 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:30:45,998 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:30:46,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:30:46 BasicIcfg [2022-12-12 18:30:46,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:30:46,069 INFO L158 Benchmark]: Toolchain (without parser) took 14770.59ms. Allocated memory was 185.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 159.4MB in the beginning and 881.1MB in the end (delta: -721.7MB). Peak memory consumption was 860.6MB. Max. memory is 8.0GB. [2022-12-12 18:30:46,070 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:30:46,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.88ms. Allocated memory is still 185.6MB. Free memory was 159.4MB in the beginning and 132.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 18:30:46,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.88ms. Allocated memory is still 185.6MB. Free memory was 132.1MB in the beginning and 129.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:30:46,070 INFO L158 Benchmark]: Boogie Preprocessor took 41.35ms. Allocated memory is still 185.6MB. Free memory was 129.5MB in the beginning and 127.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:30:46,070 INFO L158 Benchmark]: RCFGBuilder took 565.13ms. Allocated memory is still 185.6MB. Free memory was 127.9MB in the beginning and 92.8MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-12 18:30:46,070 INFO L158 Benchmark]: TraceAbstraction took 13586.73ms. Allocated memory was 185.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 91.8MB in the beginning and 881.1MB in the end (delta: -789.3MB). Peak memory consumption was 793.5MB. Max. memory is 8.0GB. [2022-12-12 18:30:46,072 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.14ms. Allocated memory is still 185.6MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 513.88ms. Allocated memory is still 185.6MB. Free memory was 159.4MB in the beginning and 132.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.88ms. Allocated memory is still 185.6MB. Free memory was 132.1MB in the beginning and 129.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.35ms. Allocated memory is still 185.6MB. Free memory was 129.5MB in the beginning and 127.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 565.13ms. Allocated memory is still 185.6MB. Free memory was 127.9MB in the beginning and 92.8MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13586.73ms. Allocated memory was 185.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 91.8MB in the beginning and 881.1MB in the end (delta: -789.3MB). Peak memory consumption was 793.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 122 PlacesBefore, 79 PlacesAfterwards, 114 TransitionsBefore, 70 TransitionsAfterwards, 2348 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4045, independent: 3906, independent conditional: 3906, independent unconditional: 0, dependent: 139, dependent conditional: 139, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4045, independent: 3906, independent conditional: 0, independent unconditional: 3906, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4045, independent: 3906, independent conditional: 0, independent unconditional: 3906, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4045, independent: 3906, independent conditional: 0, independent unconditional: 3906, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2231, independent: 2186, independent conditional: 0, independent unconditional: 2186, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2231, independent: 2180, independent conditional: 0, independent unconditional: 2180, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 155, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4045, independent: 1720, independent conditional: 0, independent unconditional: 1720, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 2231, unknown conditional: 0, unknown unconditional: 2231] , Statistics on independence cache: Total cache size (in pairs): 4150, Positive cache size: 4105, Positive conditional cache size: 0, Positive unconditional cache size: 4105, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-1, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=0, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=1, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 856]: 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: 858]: 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, 148 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 461 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 961 IncrementalHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 18 mSDtfsCounter, 961 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5652occurred in iteration=9, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 12351 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-12 18:30:46,087 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...