/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.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:30:29,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:30:29,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:30:29,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:30:29,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:30:29,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:30:29,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:30:29,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:30:29,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:30:29,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:30:29,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:30:29,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:30:29,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:30:29,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:30:29,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:30:29,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:30:29,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:30:29,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:30:29,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:30:29,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:30:29,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:30:29,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:30:29,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:30:29,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:30:29,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:30:29,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:30:29,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:30:29,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:30:29,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:30:29,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:30:29,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:30:29,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:30:29,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:30:29,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:30:29,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:30:29,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:30:29,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:30:29,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:30:29,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:30:29,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:30:29,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:30:29,807 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,822 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:30:29,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:30:29,823 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:30:29,823 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:30:29,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:30:29,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:30:29,824 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:30:29,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:30:29,824 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:30:29,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:30:29,825 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:30:29,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:30:29,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:30:29,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:30:29,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:30:29,825 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:30:29,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:30:29,825 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:30:29,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:30:29,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:30:29,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:30:29,826 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:30:29,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:30:29,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:30:29,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:30:29,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:30:29,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:30:29,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:30:29,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:30:29,827 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:30:29,827 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,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:30:30,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:30:30,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:30:30,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:30:30,071 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:30:30,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2022-12-12 18:30:30,914 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:30:31,139 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:30:31,140 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2022-12-12 18:30:31,161 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/975c1a84a/e2cc5b3f9b3748c688d05d4e9912c29d/FLAG2384abeab [2022-12-12 18:30:31,176 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/975c1a84a/e2cc5b3f9b3748c688d05d4e9912c29d [2022-12-12 18:30:31,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:30:31,179 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:30:31,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:30:31,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:30:31,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:30:31,182 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,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7118142b 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,183 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,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:30:31,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:30:31,360 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.opt.i[944,957] [2022-12-12 18:30:31,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:30:31,556 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:30:31,566 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.opt.i[944,957] [2022-12-12 18:30:31,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:30:31,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:30:31,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:30:31,656 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:30:31,657 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,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:30:31,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:30:31,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:30:31,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:30:31,663 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,691 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,724 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-12-12 18:30:31,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:30:31,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:30:31,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:30:31,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:30:31,732 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,733 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,742 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,742 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,753 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,754 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,755 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,756 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,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:30:31,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:30:31,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:30:31,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:30:31,759 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,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:30:31,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:30:31,794 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,828 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:31,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:30:31,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:30:31,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:30:31,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:30:31,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:30:31,842 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:30:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:30:31,842 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:30:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:30:31,842 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:30:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:30:31,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:30:31,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:30:31,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:30:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:30:31,844 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:31,953 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:30:31,954 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:30:32,248 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:30:32,347 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:30:32,347 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:30:32,350 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,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:30:32,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:30:32,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:30:32,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:30:32,354 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,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44786372 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,355 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,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44786372 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,355 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,356 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2022-12-12 18:30:32,369 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:30:32,369 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:30:32,369 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:30:32,416 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:30:32,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-12-12 18:30:32,486 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-12 18:30:32,486 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:30:32,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 18:30:32,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-12-12 18:30:32,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-12-12 18:30:32,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:30:32,508 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-12 18:30:32,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-12-12 18:30:32,545 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-12 18:30:32,545 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:30:32,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 18:30:32,548 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-12 18:30:32,548 INFO L226 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-12 18:30:36,679 INFO L241 LiptonReduction]: Total number of compositions: 90 [2022-12-12 18:30:36,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:30:36,706 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;@64f41d06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:30:36,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 18:30:36,716 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-12 18:30:36,716 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:30:36,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:36,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:36,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash -673775528, now seen corresponding path program 1 times [2022-12-12 18:30:36,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:36,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570607243] [2022-12-12 18:30:36,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:36,999 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,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:37,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570607243] [2022-12-12 18:30:37,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570607243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:37,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:37,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:30:37,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305316490] [2022-12-12 18:30:37,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:37,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:30:37,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:37,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:30:37,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:30:37,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2022-12-12 18:30:37,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:30:37,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:37,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2022-12-12 18:30:37,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:38,148 INFO L130 PetriNetUnfolder]: 9064/14202 cut-off events. [2022-12-12 18:30:38,148 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-12 18:30:38,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27144 conditions, 14202 events. 9064/14202 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 107814 event pairs, 1064 based on Foata normal form. 0/8135 useless extension candidates. Maximal degree in co-relation 27133. Up to 11126 conditions per place. [2022-12-12 18:30:38,197 INFO L137 encePairwiseOnDemand]: 53/57 looper letters, 31 selfloop transitions, 2 changer transitions 42/87 dead transitions. [2022-12-12 18:30:38,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 333 flow [2022-12-12 18:30:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:30:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:30:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-12-12 18:30:38,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-12 18:30:38,209 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places. [2022-12-12 18:30:38,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 87 transitions, 333 flow [2022-12-12 18:30:38,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 45 transitions, 165 flow [2022-12-12 18:30:38,227 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 165 flow [2022-12-12 18:30:38,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:30:38,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:38,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:38,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:30:38,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:38,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:38,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1041793488, now seen corresponding path program 1 times [2022-12-12 18:30:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:38,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976874610] [2022-12-12 18:30:38,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:38,429 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,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:38,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976874610] [2022-12-12 18:30:38,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976874610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:38,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:38,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:30:38,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168926881] [2022-12-12 18:30:38,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:38,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:30:38,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:38,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:30:38,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:30:38,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 18:30:38,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:38,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 18:30:38,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:38,929 INFO L130 PetriNetUnfolder]: 3570/5402 cut-off events. [2022-12-12 18:30:38,929 INFO L131 PetriNetUnfolder]: For 556/556 co-relation queries the response was YES. [2022-12-12 18:30:38,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14561 conditions, 5402 events. 3570/5402 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 28364 event pairs, 515 based on Foata normal form. 12/4501 useless extension candidates. Maximal degree in co-relation 14547. Up to 4974 conditions per place. [2022-12-12 18:30:38,950 INFO L137 encePairwiseOnDemand]: 52/57 looper letters, 51 selfloop transitions, 4 changer transitions 2/64 dead transitions. [2022-12-12 18:30:38,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 355 flow [2022-12-12 18:30:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:30:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:30:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-12 18:30:38,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-12 18:30:38,952 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2022-12-12 18:30:38,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 64 transitions, 355 flow [2022-12-12 18:30:38,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 62 transitions, 347 flow [2022-12-12 18:30:38,968 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 62 transitions, 347 flow [2022-12-12 18:30:38,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:38,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:38,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:30:38,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash 378318524, now seen corresponding path program 1 times [2022-12-12 18:30:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:38,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792544956] [2022-12-12 18:30:38,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:38,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:39,057 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,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:39,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792544956] [2022-12-12 18:30:39,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792544956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:39,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:39,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:30:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368062128] [2022-12-12 18:30:39,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:39,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:30:39,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:39,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:30:39,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:30:39,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 18:30:39,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 62 transitions, 347 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:39,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 18:30:39,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:39,339 INFO L130 PetriNetUnfolder]: 2591/4005 cut-off events. [2022-12-12 18:30:39,339 INFO L131 PetriNetUnfolder]: For 490/490 co-relation queries the response was YES. [2022-12-12 18:30:39,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14765 conditions, 4005 events. 2591/4005 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20544 event pairs, 370 based on Foata normal form. 86/3391 useless extension candidates. Maximal degree in co-relation 14748. Up to 3647 conditions per place. [2022-12-12 18:30:39,361 INFO L137 encePairwiseOnDemand]: 54/57 looper letters, 72 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2022-12-12 18:30:39,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 614 flow [2022-12-12 18:30:39,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:30:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:30:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-12 18:30:39,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3742690058479532 [2022-12-12 18:30:39,365 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2022-12-12 18:30:39,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 82 transitions, 614 flow [2022-12-12 18:30:39,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 82 transitions, 614 flow [2022-12-12 18:30:39,382 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 82 transitions, 614 flow [2022-12-12 18:30:39,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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,383 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:39,383 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:39,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:30:39,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:39,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:39,383 INFO L85 PathProgramCache]: Analyzing trace with hash -978980345, now seen corresponding path program 1 times [2022-12-12 18:30:39,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:39,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749183492] [2022-12-12 18:30:39,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:39,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:39,501 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,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:39,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749183492] [2022-12-12 18:30:39,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749183492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:39,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:39,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:30:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646562728] [2022-12-12 18:30:39,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:39,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:30:39,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:39,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:30:39,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:30:39,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 18:30:39,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 82 transitions, 614 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:39,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 18:30:39,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:39,760 INFO L130 PetriNetUnfolder]: 2372/3693 cut-off events. [2022-12-12 18:30:39,760 INFO L131 PetriNetUnfolder]: For 466/466 co-relation queries the response was YES. [2022-12-12 18:30:39,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17050 conditions, 3693 events. 2372/3693 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 18869 event pairs, 283 based on Foata normal form. 84/3138 useless extension candidates. Maximal degree in co-relation 17030. Up to 3344 conditions per place. [2022-12-12 18:30:39,775 INFO L137 encePairwiseOnDemand]: 54/57 looper letters, 92 selfloop transitions, 4 changer transitions 5/108 dead transitions. [2022-12-12 18:30:39,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 1021 flow [2022-12-12 18:30:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:30:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:30:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-12 18:30:39,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38011695906432746 [2022-12-12 18:30:39,780 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2022-12-12 18:30:39,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 108 transitions, 1021 flow [2022-12-12 18:30:39,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 103 transitions, 971 flow [2022-12-12 18:30:39,793 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 103 transitions, 971 flow [2022-12-12 18:30:39,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:39,793 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:39,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:30:39,793 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:39,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:39,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1330828933, now seen corresponding path program 1 times [2022-12-12 18:30:39,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:39,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118094313] [2022-12-12 18:30:39,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:39,883 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,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:39,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118094313] [2022-12-12 18:30:39,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118094313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:39,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:39,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:30:39,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146055668] [2022-12-12 18:30:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:39,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:30:39,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:39,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:30:39,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:30:39,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 18:30:39,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 103 transitions, 971 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:30:39,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:39,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 18:30:39,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:40,153 INFO L130 PetriNetUnfolder]: 1971/3065 cut-off events. [2022-12-12 18:30:40,153 INFO L131 PetriNetUnfolder]: For 391/391 co-relation queries the response was YES. [2022-12-12 18:30:40,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17058 conditions, 3065 events. 1971/3065 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14921 event pairs, 83 based on Foata normal form. 32/2655 useless extension candidates. Maximal degree in co-relation 17035. Up to 2817 conditions per place. [2022-12-12 18:30:40,171 INFO L137 encePairwiseOnDemand]: 54/57 looper letters, 112 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2022-12-12 18:30:40,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 124 transitions, 1407 flow [2022-12-12 18:30:40,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:30:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:30:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-12 18:30:40,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34502923976608185 [2022-12-12 18:30:40,173 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -15 predicate places. [2022-12-12 18:30:40,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 124 transitions, 1407 flow [2022-12-12 18:30:40,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 124 transitions, 1407 flow [2022-12-12 18:30:40,190 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 124 transitions, 1407 flow [2022-12-12 18:30:40,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:30:40,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:40,190 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:40,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:30:40,190 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash -515686080, now seen corresponding path program 1 times [2022-12-12 18:30:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:40,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622114775] [2022-12-12 18:30:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:40,311 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,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:40,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622114775] [2022-12-12 18:30:40,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622114775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:40,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:40,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:30:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106252687] [2022-12-12 18:30:40,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:40,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:30:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:40,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:30:40,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:30:40,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 57 [2022-12-12 18:30:40,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 124 transitions, 1407 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:40,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 57 [2022-12-12 18:30:40,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:40,634 INFO L130 PetriNetUnfolder]: 2377/3654 cut-off events. [2022-12-12 18:30:40,634 INFO L131 PetriNetUnfolder]: For 5278/5303 co-relation queries the response was YES. [2022-12-12 18:30:40,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22319 conditions, 3654 events. 2377/3654 cut-off events. For 5278/5303 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 18201 event pairs, 275 based on Foata normal form. 90/3269 useless extension candidates. Maximal degree in co-relation 22293. Up to 3157 conditions per place. [2022-12-12 18:30:40,655 INFO L137 encePairwiseOnDemand]: 46/57 looper letters, 118 selfloop transitions, 36 changer transitions 0/174 dead transitions. [2022-12-12 18:30:40,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 174 transitions, 2297 flow [2022-12-12 18:30:40,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:30:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:30:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-12 18:30:40,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4152046783625731 [2022-12-12 18:30:40,657 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -13 predicate places. [2022-12-12 18:30:40,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 174 transitions, 2297 flow [2022-12-12 18:30:40,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 174 transitions, 2297 flow [2022-12-12 18:30:40,673 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 174 transitions, 2297 flow [2022-12-12 18:30:40,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:40,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:40,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:30:40,674 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:40,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:40,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1255879013, now seen corresponding path program 1 times [2022-12-12 18:30:40,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:40,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258109475] [2022-12-12 18:30:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:40,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:41,110 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,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:41,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258109475] [2022-12-12 18:30:41,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258109475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:41,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:41,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 18:30:41,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396897625] [2022-12-12 18:30:41,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:41,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 18:30:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 18:30:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-12 18:30:41,112 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 18:30:41,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 174 transitions, 2297 flow. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:41,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 18:30:41,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:41,812 INFO L130 PetriNetUnfolder]: 3547/5464 cut-off events. [2022-12-12 18:30:41,813 INFO L131 PetriNetUnfolder]: For 10376/10428 co-relation queries the response was YES. [2022-12-12 18:30:41,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38152 conditions, 5464 events. 3547/5464 cut-off events. For 10376/10428 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 29891 event pairs, 322 based on Foata normal form. 128/4823 useless extension candidates. Maximal degree in co-relation 38123. Up to 4705 conditions per place. [2022-12-12 18:30:41,835 INFO L137 encePairwiseOnDemand]: 47/57 looper letters, 188 selfloop transitions, 36 changer transitions 123/357 dead transitions. [2022-12-12 18:30:41,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 357 transitions, 5505 flow [2022-12-12 18:30:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 18:30:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 18:30:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 210 transitions. [2022-12-12 18:30:41,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2834008097165992 [2022-12-12 18:30:41,837 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2022-12-12 18:30:41,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 357 transitions, 5505 flow [2022-12-12 18:30:41,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 234 transitions, 3563 flow [2022-12-12 18:30:41,855 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 234 transitions, 3563 flow [2022-12-12 18:30:41,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:41,856 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:41,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:30:41,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:41,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash -362102369, now seen corresponding path program 2 times [2022-12-12 18:30:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:41,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906378411] [2022-12-12 18:30:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:41,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:41,962 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,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:41,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906378411] [2022-12-12 18:30:41,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906378411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:41,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:41,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:30:41,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062838479] [2022-12-12 18:30:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:41,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:30:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:41,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:30:41,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:30:41,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 57 [2022-12-12 18:30:41,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 234 transitions, 3563 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:41,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 57 [2022-12-12 18:30:41,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:42,192 INFO L130 PetriNetUnfolder]: 1239/2141 cut-off events. [2022-12-12 18:30:42,192 INFO L131 PetriNetUnfolder]: For 6247/6368 co-relation queries the response was YES. [2022-12-12 18:30:42,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16862 conditions, 2141 events. 1239/2141 cut-off events. For 6247/6368 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11254 event pairs, 70 based on Foata normal form. 255/2118 useless extension candidates. Maximal degree in co-relation 16830. Up to 1838 conditions per place. [2022-12-12 18:30:42,202 INFO L137 encePairwiseOnDemand]: 46/57 looper letters, 131 selfloop transitions, 69 changer transitions 0/230 dead transitions. [2022-12-12 18:30:42,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 230 transitions, 3866 flow [2022-12-12 18:30:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:30:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:30:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-12-12 18:30:42,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42543859649122806 [2022-12-12 18:30:42,204 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -2 predicate places. [2022-12-12 18:30:42,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 230 transitions, 3866 flow [2022-12-12 18:30:42,211 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 230 transitions, 3866 flow [2022-12-12 18:30:42,211 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 230 transitions, 3866 flow [2022-12-12 18:30:42,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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:42,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:42,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:42,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:30:42,212 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:42,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:42,212 INFO L85 PathProgramCache]: Analyzing trace with hash -438764580, now seen corresponding path program 1 times [2022-12-12 18:30:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:42,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789730283] [2022-12-12 18:30:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:42,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:42,322 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,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:42,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789730283] [2022-12-12 18:30:42,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789730283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:42,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:42,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:30:42,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001575063] [2022-12-12 18:30:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:42,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:30:42,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:42,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:30:42,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:30:42,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 57 [2022-12-12 18:30:42,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 230 transitions, 3866 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:42,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 57 [2022-12-12 18:30:42,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:42,494 INFO L130 PetriNetUnfolder]: 777/1382 cut-off events. [2022-12-12 18:30:42,494 INFO L131 PetriNetUnfolder]: For 5184/5307 co-relation queries the response was YES. [2022-12-12 18:30:42,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11946 conditions, 1382 events. 777/1382 cut-off events. For 5184/5307 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6683 event pairs, 6 based on Foata normal form. 195/1381 useless extension candidates. Maximal degree in co-relation 11911. Up to 1160 conditions per place. [2022-12-12 18:30:42,502 INFO L137 encePairwiseOnDemand]: 46/57 looper letters, 114 selfloop transitions, 78 changer transitions 0/222 dead transitions. [2022-12-12 18:30:42,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 222 transitions, 4106 flow [2022-12-12 18:30:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:30:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:30:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-12 18:30:42,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3719298245614035 [2022-12-12 18:30:42,503 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2022-12-12 18:30:42,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 222 transitions, 4106 flow [2022-12-12 18:30:42,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 222 transitions, 4106 flow [2022-12-12 18:30:42,510 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 222 transitions, 4106 flow [2022-12-12 18:30:42,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:42,510 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] [2022-12-12 18:30:42,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:30:42,510 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:42,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:42,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1182602844, now seen corresponding path program 1 times [2022-12-12 18:30:42,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:42,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139002556] [2022-12-12 18:30:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:42,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:42,656 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,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:42,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139002556] [2022-12-12 18:30:42,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139002556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:42,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:42,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:30:42,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201190931] [2022-12-12 18:30:42,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:42,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:30:42,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:42,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:30:42,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:30:42,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 18:30:42,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 222 transitions, 4106 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:42,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 18:30:42,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:42,928 INFO L130 PetriNetUnfolder]: 1070/1928 cut-off events. [2022-12-12 18:30:42,928 INFO L131 PetriNetUnfolder]: For 7061/7160 co-relation queries the response was YES. [2022-12-12 18:30:42,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18203 conditions, 1928 events. 1070/1928 cut-off events. For 7061/7160 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10565 event pairs, 0 based on Foata normal form. 47/1670 useless extension candidates. Maximal degree in co-relation 18165. Up to 1617 conditions per place. [2022-12-12 18:30:42,940 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 254 selfloop transitions, 45 changer transitions 26/338 dead transitions. [2022-12-12 18:30:42,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 338 transitions, 6998 flow [2022-12-12 18:30:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:30:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:30:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-12 18:30:42,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36140350877192984 [2022-12-12 18:30:42,942 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, 6 predicate places. [2022-12-12 18:30:42,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 338 transitions, 6998 flow [2022-12-12 18:30:42,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 312 transitions, 6423 flow [2022-12-12 18:30:42,954 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 312 transitions, 6423 flow [2022-12-12 18:30:42,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:42,954 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] [2022-12-12 18:30:42,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:30:42,954 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:42,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash -832169960, now seen corresponding path program 1 times [2022-12-12 18:30:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:42,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988027382] [2022-12-12 18:30:42,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:42,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:43,095 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,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:43,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988027382] [2022-12-12 18:30:43,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988027382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:43,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:43,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:30:43,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624232230] [2022-12-12 18:30:43,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:43,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:30:43,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:43,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:30:43,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:30:43,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 18:30:43,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 312 transitions, 6423 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:43,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 18:30:43,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:43,435 INFO L130 PetriNetUnfolder]: 1217/2234 cut-off events. [2022-12-12 18:30:43,435 INFO L131 PetriNetUnfolder]: For 8775/8957 co-relation queries the response was YES. [2022-12-12 18:30:43,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22543 conditions, 2234 events. 1217/2234 cut-off events. For 8775/8957 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13117 event pairs, 5 based on Foata normal form. 55/1920 useless extension candidates. Maximal degree in co-relation 22502. Up to 1838 conditions per place. [2022-12-12 18:30:43,446 INFO L137 encePairwiseOnDemand]: 50/57 looper letters, 113 selfloop transitions, 11 changer transitions 231/367 dead transitions. [2022-12-12 18:30:43,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 367 transitions, 8309 flow [2022-12-12 18:30:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:30:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:30:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-12 18:30:43,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3304093567251462 [2022-12-12 18:30:43,448 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, 11 predicate places. [2022-12-12 18:30:43,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 367 transitions, 8309 flow [2022-12-12 18:30:43,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 136 transitions, 2979 flow [2022-12-12 18:30:43,455 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 136 transitions, 2979 flow [2022-12-12 18:30:43,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:43,456 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] [2022-12-12 18:30:43,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:30:43,456 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:43,456 INFO L85 PathProgramCache]: Analyzing trace with hash -920774456, now seen corresponding path program 2 times [2022-12-12 18:30:43,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:43,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825546144] [2022-12-12 18:30:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:43,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:43,575 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,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:43,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825546144] [2022-12-12 18:30:43,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825546144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:43,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:43,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:30:43,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723474842] [2022-12-12 18:30:43,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:43,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:30:43,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:43,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:30:43,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:30:43,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 18:30:43,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 136 transitions, 2979 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:43,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:43,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 18:30:43,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:43,742 INFO L130 PetriNetUnfolder]: 608/1207 cut-off events. [2022-12-12 18:30:43,742 INFO L131 PetriNetUnfolder]: For 5267/5401 co-relation queries the response was YES. [2022-12-12 18:30:43,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13399 conditions, 1207 events. 608/1207 cut-off events. For 5267/5401 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6838 event pairs, 0 based on Foata normal form. 44/1014 useless extension candidates. Maximal degree in co-relation 13355. Up to 997 conditions per place. [2022-12-12 18:30:43,747 INFO L137 encePairwiseOnDemand]: 50/57 looper letters, 115 selfloop transitions, 22 changer transitions 46/195 dead transitions. [2022-12-12 18:30:43,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 195 transitions, 4729 flow [2022-12-12 18:30:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:30:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:30:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-12 18:30:43,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3157894736842105 [2022-12-12 18:30:43,749 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places. [2022-12-12 18:30:43,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 195 transitions, 4729 flow [2022-12-12 18:30:43,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 149 transitions, 3527 flow [2022-12-12 18:30:43,754 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 149 transitions, 3527 flow [2022-12-12 18:30:43,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:43,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:43,754 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] [2022-12-12 18:30:43,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:30:43,754 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:43,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:43,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2054467440, now seen corresponding path program 3 times [2022-12-12 18:30:43,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:43,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783830434] [2022-12-12 18:30:43,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:43,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:43,876 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,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:43,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783830434] [2022-12-12 18:30:43,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783830434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:43,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:43,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:30:43,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804898042] [2022-12-12 18:30:43,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:43,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:30:43,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:30:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:30:43,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 18:30:43,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 149 transitions, 3527 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:43,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 18:30:43,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:44,064 INFO L130 PetriNetUnfolder]: 562/1209 cut-off events. [2022-12-12 18:30:44,064 INFO L131 PetriNetUnfolder]: For 6235/6501 co-relation queries the response was YES. [2022-12-12 18:30:44,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14038 conditions, 1209 events. 562/1209 cut-off events. For 6235/6501 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7584 event pairs, 0 based on Foata normal form. 51/1023 useless extension candidates. Maximal degree in co-relation 13991. Up to 1019 conditions per place. [2022-12-12 18:30:44,068 INFO L137 encePairwiseOnDemand]: 51/57 looper letters, 65 selfloop transitions, 5 changer transitions 94/175 dead transitions. [2022-12-12 18:30:44,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 175 transitions, 4529 flow [2022-12-12 18:30:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:30:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:30:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-12 18:30:44,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28654970760233917 [2022-12-12 18:30:44,070 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, 15 predicate places. [2022-12-12 18:30:44,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 175 transitions, 4529 flow [2022-12-12 18:30:44,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 81 transitions, 2013 flow [2022-12-12 18:30:44,072 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 2013 flow [2022-12-12 18:30:44,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:44,073 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] [2022-12-12 18:30:44,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 18:30:44,073 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:44,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1546913726, now seen corresponding path program 4 times [2022-12-12 18:30:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:44,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356054921] [2022-12-12 18:30:44,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:44,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:30:44,715 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,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:30:44,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356054921] [2022-12-12 18:30:44,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356054921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:30:44,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:30:44,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:30:44,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442846017] [2022-12-12 18:30:44,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:30:44,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:30:44,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:30:44,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:30:44,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:30:44,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 57 [2022-12-12 18:30:44,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 2013 flow. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:30:44,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 57 [2022-12-12 18:30:44,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:30:44,938 INFO L130 PetriNetUnfolder]: 330/770 cut-off events. [2022-12-12 18:30:44,938 INFO L131 PetriNetUnfolder]: For 5168/5241 co-relation queries the response was YES. [2022-12-12 18:30:44,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9698 conditions, 770 events. 330/770 cut-off events. For 5168/5241 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4558 event pairs, 0 based on Foata normal form. 31/634 useless extension candidates. Maximal degree in co-relation 9648. Up to 703 conditions per place. [2022-12-12 18:30:44,941 INFO L137 encePairwiseOnDemand]: 50/57 looper letters, 42 selfloop transitions, 7 changer transitions 55/118 dead transitions. [2022-12-12 18:30:44,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 118 transitions, 3255 flow [2022-12-12 18:30:44,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 18:30:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 18:30:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2022-12-12 18:30:44,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2741228070175439 [2022-12-12 18:30:44,942 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, 14 predicate places. [2022-12-12 18:30:44,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 118 transitions, 3255 flow [2022-12-12 18:30:44,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 63 transitions, 1633 flow [2022-12-12 18:30:44,945 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 1633 flow [2022-12-12 18:30:44,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:30:44,945 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] [2022-12-12 18:30:44,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 18:30:44,945 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:30:44,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:30:44,946 INFO L85 PathProgramCache]: Analyzing trace with hash -198005390, now seen corresponding path program 5 times [2022-12-12 18:30:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:30:44,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595779342] [2022-12-12 18:30:44,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:30:44,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:30:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:30:44,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:30:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:30:45,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:30:45,014 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:30:45,014 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 18:30:45,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 18:30:45,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 18:30:45,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 18:30:45,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 18:30:45,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 18:30:45,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 18:30:45,016 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:30:45,020 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:30:45,020 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:30:45,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:30:45 BasicIcfg [2022-12-12 18:30:45,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:30:45,088 INFO L158 Benchmark]: Toolchain (without parser) took 13904.63ms. Allocated memory was 195.0MB in the beginning and 1.1GB in the end (delta: 865.1MB). Free memory was 169.2MB in the beginning and 445.4MB in the end (delta: -276.2MB). Peak memory consumption was 589.9MB. Max. memory is 8.0GB. [2022-12-12 18:30:45,088 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:30:45,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.64ms. Allocated memory is still 195.0MB. Free memory was 169.2MB in the beginning and 140.9MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-12 18:30:45,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.35ms. Allocated memory is still 195.0MB. Free memory was 140.9MB in the beginning and 138.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 18:30:45,089 INFO L158 Benchmark]: Boogie Preprocessor took 33.67ms. Allocated memory is still 195.0MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:30:45,089 INFO L158 Benchmark]: RCFGBuilder took 591.63ms. Allocated memory is still 195.0MB. Free memory was 136.2MB in the beginning and 99.0MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-12 18:30:45,089 INFO L158 Benchmark]: TraceAbstraction took 12730.74ms. Allocated memory was 195.0MB in the beginning and 1.1GB in the end (delta: 865.1MB). Free memory was 97.9MB in the beginning and 445.4MB in the end (delta: -347.5MB). Peak memory consumption was 518.6MB. Max. memory is 8.0GB. [2022-12-12 18:30:45,091 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.11ms. Allocated memory is still 195.0MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 477.64ms. Allocated memory is still 195.0MB. Free memory was 169.2MB in the beginning and 140.9MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.35ms. Allocated memory is still 195.0MB. Free memory was 140.9MB in the beginning and 138.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.67ms. Allocated memory is still 195.0MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 591.63ms. Allocated memory is still 195.0MB. Free memory was 136.2MB in the beginning and 99.0MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12730.74ms. Allocated memory was 195.0MB in the beginning and 1.1GB in the end (delta: 865.1MB). Free memory was 97.9MB in the beginning and 445.4MB in the end (delta: -347.5MB). Peak memory consumption was 518.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 120 PlacesBefore, 67 PlacesAfterwards, 112 TransitionsBefore, 57 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 43 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3905, independent: 3734, independent conditional: 3734, independent unconditional: 0, dependent: 171, dependent conditional: 171, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3905, independent: 3734, independent conditional: 0, independent unconditional: 3734, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3905, independent: 3734, independent conditional: 0, independent unconditional: 3734, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3905, independent: 3734, independent conditional: 0, independent unconditional: 3734, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2052, independent: 1978, independent conditional: 0, independent unconditional: 1978, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2052, independent: 1947, independent conditional: 0, independent unconditional: 1947, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 245, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3905, independent: 1756, independent conditional: 0, independent unconditional: 1756, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 2052, unknown conditional: 0, unknown unconditional: 2052] , Statistics on independence cache: Total cache size (in pairs): 3488, Positive cache size: 3414, Positive conditional cache size: 0, Positive unconditional cache size: 3414, Negative cache size: 74, Negative conditional cache size: 0, Negative unconditional cache size: 74, 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 main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41, ((void *)0), P0, ((void *)0))=-1, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42, ((void *)0), P1, ((void *)0))=0, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43, ((void *)0), P2, ((void *)0))=1, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_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, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 a = 1 [L756] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$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=1, 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=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 3 __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, 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=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 __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, 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=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 2 __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, 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=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] 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) [L878] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 863]: 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: 861]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 438 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1318 IncrementalHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 46 mSDtfsCounter, 1318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6423occurred in iteration=10, InterpolantAutomatonStates: 70, 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, 14 MinimizatonAttempts, 13413 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 1822 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:30:45,132 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...