/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:30:49,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:30:49,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:30:49,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:30:49,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:30:49,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:30:49,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:30:49,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:30:49,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:30:49,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:30:49,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:30:49,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:30:49,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:30:49,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:30:49,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:30:49,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:30:49,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:30:49,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:30:49,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:30:49,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:30:49,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:30:49,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:30:49,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:30:49,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:30:49,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:30:49,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:30:49,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:30:49,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:30:49,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:30:49,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:30:49,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:30:49,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:30:49,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:30:49,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:30:49,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:30:49,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:30:49,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:30:49,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:30:49,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:30:49,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:30:49,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:30:49,676 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 14:30:49,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:30:49,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:30:49,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:30:49,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:30:49,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:30:49,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:30:49,698 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:30:49,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:30:49,699 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:30:49,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:30:49,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:30:49,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:30:49,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:30:49,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:30:49,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:30:49,700 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:30:49,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:30:49,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:30:49,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:30:49,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:30:49,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:30:49,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:30:49,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:30:49,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:30:49,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:30:49,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:30:49,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:30:49,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:30:49,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:30:49,702 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:30:49,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-12 14:30:50,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:30:50,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:30:50,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:30:50,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:30:50,058 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:30:50,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2022-12-12 14:30:51,281 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:30:51,558 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:30:51,558 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2022-12-12 14:30:51,580 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b1845e3/b07f6c31592547c38556ed20f9534469/FLAGad1f5cdbd [2022-12-12 14:30:51,596 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b1845e3/b07f6c31592547c38556ed20f9534469 [2022-12-12 14:30:51,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:30:51,599 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:30:51,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:30:51,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:30:51,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:30:51,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:30:51" (1/1) ... [2022-12-12 14:30:51,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519f49a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:51, skipping insertion in model container [2022-12-12 14:30:51,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:30:51" (1/1) ... [2022-12-12 14:30:51,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:30:51,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:30:51,805 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/mix020.opt.i[944,957] [2022-12-12 14:30:51,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:51,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:51,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:51,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:51,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:51,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:51,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:51,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:51,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:51,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:51,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:51,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:51,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:51,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:51,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:51,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:51,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:51,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:51,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:30:52,065 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:30:52,075 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/mix020.opt.i[944,957] [2022-12-12 14:30:52,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:30:52,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:30:52,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:30:52,181 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:30:52,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52 WrapperNode [2022-12-12 14:30:52,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:30:52,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:30:52,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:30:52,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:30:52,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (1/1) ... [2022-12-12 14:30:52,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (1/1) ... [2022-12-12 14:30:52,251 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-12-12 14:30:52,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:30:52,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:30:52,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:30:52,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:30:52,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (1/1) ... [2022-12-12 14:30:52,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (1/1) ... [2022-12-12 14:30:52,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (1/1) ... [2022-12-12 14:30:52,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (1/1) ... [2022-12-12 14:30:52,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (1/1) ... [2022-12-12 14:30:52,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (1/1) ... [2022-12-12 14:30:52,288 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (1/1) ... [2022-12-12 14:30:52,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (1/1) ... [2022-12-12 14:30:52,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:30:52,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:30:52,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:30:52,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:30:52,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (1/1) ... [2022-12-12 14:30:52,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:30:52,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:30:52,336 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 14:30:52,358 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 14:30:52,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:30:52,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:30:52,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:30:52,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:30:52,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:30:52,375 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:30:52,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:30:52,375 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:30:52,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:30:52,375 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:30:52,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:30:52,376 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 14:30:52,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 14:30:52,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:30:52,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:30:52,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:30:52,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:30:52,378 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 14:30:52,568 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:30:52,569 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:30:52,851 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:30:52,953 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:30:52,954 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:30:52,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:30:52 BoogieIcfgContainer [2022-12-12 14:30:52,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:30:52,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:30:52,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:30:52,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:30:52,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:30:51" (1/3) ... [2022-12-12 14:30:52,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e99624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:30:52, skipping insertion in model container [2022-12-12 14:30:52,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:30:52" (2/3) ... [2022-12-12 14:30:52,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e99624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:30:52, skipping insertion in model container [2022-12-12 14:30:52,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:30:52" (3/3) ... [2022-12-12 14:30:52,963 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.opt.i [2022-12-12 14:30:52,978 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:30:52,978 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:30:52,978 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:30:53,024 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:30:53,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2022-12-12 14:30:53,126 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-12 14:30:53,126 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:30:53,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-12 14:30:53,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2022-12-12 14:30:53,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2022-12-12 14:30:53,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:30:53,155 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-12 14:30:53,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2022-12-12 14:30:53,183 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-12 14:30:53,184 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:30:53,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-12 14:30:53,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-12 14:30:53,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 2718 [2022-12-12 14:30:58,569 INFO L241 LiptonReduction]: Total number of compositions: 100 [2022-12-12 14:30:58,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:30:58,588 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;@39c80fdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:30:58,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 14:30:58,594 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-12 14:30:58,595 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:30:58,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:30:58,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:30:58,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:30:58,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:30:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash -31270810, now seen corresponding path program 1 times [2022-12-12 14:30:58,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:30:58,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686881456] [2022-12-12 14:30:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:30:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:30:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:30:59,035 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 14:30:59,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:30:59,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686881456] [2022-12-12 14:30:59,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686881456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:30:59,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:30:59,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:30:59,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237032174] [2022-12-12 14:30:59,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:30:59,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:30:59,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:30:59,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:30:59,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:30:59,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 64 [2022-12-12 14:30:59,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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 14:30:59,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:30:59,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 64 [2022-12-12 14:30:59,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:04,115 INFO L130 PetriNetUnfolder]: 40551/58279 cut-off events. [2022-12-12 14:31:04,115 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-12 14:31:04,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112199 conditions, 58279 events. 40551/58279 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 3498. Compared 446478 event pairs, 5311 based on Foata normal form. 0/35872 useless extension candidates. Maximal degree in co-relation 112187. Up to 46041 conditions per place. [2022-12-12 14:31:04,340 INFO L137 encePairwiseOnDemand]: 60/64 looper letters, 37 selfloop transitions, 2 changer transitions 46/98 dead transitions. [2022-12-12 14:31:04,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 98 transitions, 378 flow [2022-12-12 14:31:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:31:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:31:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-12-12 14:31:04,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2022-12-12 14:31:04,353 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 140 flow. Second operand 3 states and 127 transitions. [2022-12-12 14:31:04,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 98 transitions, 378 flow [2022-12-12 14:31:04,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 98 transitions, 374 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-12 14:31:04,363 INFO L231 Difference]: Finished difference. Result has 73 places, 39 transitions, 90 flow [2022-12-12 14:31:04,364 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=73, PETRI_TRANSITIONS=39} [2022-12-12 14:31:04,368 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2022-12-12 14:31:04,368 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 39 transitions, 90 flow [2022-12-12 14:31:04,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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 14:31:04,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:04,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:04,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:31:04,369 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:04,370 INFO L85 PathProgramCache]: Analyzing trace with hash 13624052, now seen corresponding path program 1 times [2022-12-12 14:31:04,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:04,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470738819] [2022-12-12 14:31:04,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:04,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:04,664 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 14:31:04,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:04,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470738819] [2022-12-12 14:31:04,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470738819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:04,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:04,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:31:04,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595691511] [2022-12-12 14:31:04,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:04,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:31:04,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:04,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:31:04,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:31:04,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:31:04,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 14:31:04,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:04,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:31:04,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:06,751 INFO L130 PetriNetUnfolder]: 21274/30229 cut-off events. [2022-12-12 14:31:06,752 INFO L131 PetriNetUnfolder]: For 881/881 co-relation queries the response was YES. [2022-12-12 14:31:06,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60322 conditions, 30229 events. 21274/30229 cut-off events. For 881/881 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 186699 event pairs, 7533 based on Foata normal form. 0/23558 useless extension candidates. Maximal degree in co-relation 60312. Up to 19721 conditions per place. [2022-12-12 14:31:06,899 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 48 selfloop transitions, 7 changer transitions 2/66 dead transitions. [2022-12-12 14:31:06,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 266 flow [2022-12-12 14:31:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:31:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:31:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-12 14:31:06,902 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2022-12-12 14:31:06,902 INFO L175 Difference]: Start difference. First operand has 73 places, 39 transitions, 90 flow. Second operand 3 states and 85 transitions. [2022-12-12 14:31:06,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 266 flow [2022-12-12 14:31:06,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:31:06,930 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 138 flow [2022-12-12 14:31:06,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2022-12-12 14:31:06,931 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -25 predicate places. [2022-12-12 14:31:06,931 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 138 flow [2022-12-12 14:31:06,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 14:31:06,931 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:06,931 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:06,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:31:06,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash 422346190, now seen corresponding path program 1 times [2022-12-12 14:31:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:06,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81043314] [2022-12-12 14:31:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:06,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:07,143 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 14:31:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:07,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81043314] [2022-12-12 14:31:07,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81043314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:07,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:07,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:31:07,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476703585] [2022-12-12 14:31:07,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:07,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:31:07,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:07,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:31:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:31:07,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:31:07,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 138 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 14:31:07,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:07,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:31:07,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:08,448 INFO L130 PetriNetUnfolder]: 15746/22492 cut-off events. [2022-12-12 14:31:08,449 INFO L131 PetriNetUnfolder]: For 7614/7614 co-relation queries the response was YES. [2022-12-12 14:31:08,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52907 conditions, 22492 events. 15746/22492 cut-off events. For 7614/7614 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 131491 event pairs, 3991 based on Foata normal form. 230/18264 useless extension candidates. Maximal degree in co-relation 52895. Up to 11158 conditions per place. [2022-12-12 14:31:08,614 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 56 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2022-12-12 14:31:08,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 346 flow [2022-12-12 14:31:08,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:31:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:31:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-12 14:31:08,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-12 14:31:08,619 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 138 flow. Second operand 4 states and 96 transitions. [2022-12-12 14:31:08,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 346 flow [2022-12-12 14:31:08,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:31:08,666 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 182 flow [2022-12-12 14:31:08,666 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-12 14:31:08,667 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -22 predicate places. [2022-12-12 14:31:08,667 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 182 flow [2022-12-12 14:31:08,667 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 14:31:08,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:08,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:08,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:31:08,667 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash 127816821, now seen corresponding path program 1 times [2022-12-12 14:31:08,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:08,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968668834] [2022-12-12 14:31:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:08,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:08,929 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 14:31:08,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:08,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968668834] [2022-12-12 14:31:08,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968668834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:08,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:08,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:31:08,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521497595] [2022-12-12 14:31:08,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:08,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:31:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:08,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:31:08,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:31:08,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:31:08,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 14:31:08,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:08,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:31:08,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:10,385 INFO L130 PetriNetUnfolder]: 15396/22228 cut-off events. [2022-12-12 14:31:10,386 INFO L131 PetriNetUnfolder]: For 12737/12737 co-relation queries the response was YES. [2022-12-12 14:31:10,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54863 conditions, 22228 events. 15396/22228 cut-off events. For 12737/12737 co-relation queries the response was YES. Maximal size of possible extension queue 841. Compared 135644 event pairs, 2374 based on Foata normal form. 50/17895 useless extension candidates. Maximal degree in co-relation 54848. Up to 13760 conditions per place. [2022-12-12 14:31:10,508 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 63 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2022-12-12 14:31:10,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 464 flow [2022-12-12 14:31:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:31:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:31:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-12-12 14:31:10,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2022-12-12 14:31:10,511 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 182 flow. Second operand 4 states and 107 transitions. [2022-12-12 14:31:10,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 88 transitions, 464 flow [2022-12-12 14:31:10,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 88 transitions, 459 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:31:10,579 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 275 flow [2022-12-12 14:31:10,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2022-12-12 14:31:10,580 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -18 predicate places. [2022-12-12 14:31:10,580 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 275 flow [2022-12-12 14:31:10,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 14:31:10,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:10,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:10,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:31:10,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:10,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash -332560637, now seen corresponding path program 1 times [2022-12-12 14:31:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:10,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497800505] [2022-12-12 14:31:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:10,767 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 14:31:10,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:10,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497800505] [2022-12-12 14:31:10,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497800505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:10,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:10,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:31:10,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499173213] [2022-12-12 14:31:10,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:10,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:31:10,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:10,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:31:10,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:31:10,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:31:10,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:31:10,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:10,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:31:10,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:13,034 INFO L130 PetriNetUnfolder]: 25644/35525 cut-off events. [2022-12-12 14:31:13,034 INFO L131 PetriNetUnfolder]: For 26455/27275 co-relation queries the response was YES. [2022-12-12 14:31:13,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89707 conditions, 35525 events. 25644/35525 cut-off events. For 26455/27275 co-relation queries the response was YES. Maximal size of possible extension queue 1835. Compared 223593 event pairs, 8864 based on Foata normal form. 557/22984 useless extension candidates. Maximal degree in co-relation 89689. Up to 34372 conditions per place. [2022-12-12 14:31:13,568 INFO L137 encePairwiseOnDemand]: 50/64 looper letters, 56 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2022-12-12 14:31:13,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 537 flow [2022-12-12 14:31:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:31:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:31:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-12 14:31:13,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4322916666666667 [2022-12-12 14:31:13,571 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 275 flow. Second operand 3 states and 83 transitions. [2022-12-12 14:31:13,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 537 flow [2022-12-12 14:31:13,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 537 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-12 14:31:13,627 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 364 flow [2022-12-12 14:31:13,627 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2022-12-12 14:31:13,629 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -15 predicate places. [2022-12-12 14:31:13,629 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 364 flow [2022-12-12 14:31:13,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:31:13,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:13,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:13,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:31:13,630 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:13,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:13,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2021197630, now seen corresponding path program 1 times [2022-12-12 14:31:13,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:13,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893187354] [2022-12-12 14:31:13,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:13,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:13,781 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 14:31:13,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:13,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893187354] [2022-12-12 14:31:13,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893187354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:13,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:13,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:31:13,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724128614] [2022-12-12 14:31:13,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:13,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:31:13,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:13,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:31:13,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:31:13,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:31:13,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 14:31:13,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:13,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:31:13,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:17,151 INFO L130 PetriNetUnfolder]: 34230/48130 cut-off events. [2022-12-12 14:31:17,151 INFO L131 PetriNetUnfolder]: For 45394/46690 co-relation queries the response was YES. [2022-12-12 14:31:17,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146337 conditions, 48130 events. 34230/48130 cut-off events. For 45394/46690 co-relation queries the response was YES. Maximal size of possible extension queue 2167. Compared 316511 event pairs, 10178 based on Foata normal form. 867/37699 useless extension candidates. Maximal degree in co-relation 146316. Up to 29993 conditions per place. [2022-12-12 14:31:17,440 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 79 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2022-12-12 14:31:17,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 685 flow [2022-12-12 14:31:17,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:31:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:31:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-12-12 14:31:17,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2022-12-12 14:31:17,442 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 364 flow. Second operand 4 states and 101 transitions. [2022-12-12 14:31:17,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 685 flow [2022-12-12 14:31:17,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:31:17,565 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 385 flow [2022-12-12 14:31:17,566 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=385, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2022-12-12 14:31:17,566 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -12 predicate places. [2022-12-12 14:31:17,566 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 385 flow [2022-12-12 14:31:17,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 14:31:17,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:17,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:17,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:31:17,567 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:17,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2013818106, now seen corresponding path program 1 times [2022-12-12 14:31:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:17,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028751073] [2022-12-12 14:31:17,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:17,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:17,801 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 14:31:17,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:17,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028751073] [2022-12-12 14:31:17,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028751073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:17,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:17,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:31:17,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324803766] [2022-12-12 14:31:17,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:17,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:31:17,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:17,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:31:17,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:31:17,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:31:17,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:31:17,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:17,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:31:17,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:20,491 INFO L130 PetriNetUnfolder]: 23816/34755 cut-off events. [2022-12-12 14:31:20,491 INFO L131 PetriNetUnfolder]: For 29207/30258 co-relation queries the response was YES. [2022-12-12 14:31:20,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108500 conditions, 34755 events. 23816/34755 cut-off events. For 29207/30258 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 240378 event pairs, 4126 based on Foata normal form. 892/22676 useless extension candidates. Maximal degree in co-relation 108477. Up to 31159 conditions per place. [2022-12-12 14:31:20,674 INFO L137 encePairwiseOnDemand]: 50/64 looper letters, 68 selfloop transitions, 25 changer transitions 5/114 dead transitions. [2022-12-12 14:31:20,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 114 transitions, 841 flow [2022-12-12 14:31:20,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:31:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:31:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-12-12 14:31:20,675 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44921875 [2022-12-12 14:31:20,675 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 385 flow. Second operand 4 states and 115 transitions. [2022-12-12 14:31:20,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 114 transitions, 841 flow [2022-12-12 14:31:20,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 114 transitions, 776 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-12 14:31:20,714 INFO L231 Difference]: Finished difference. Result has 67 places, 77 transitions, 485 flow [2022-12-12 14:31:20,714 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=485, PETRI_PLACES=67, PETRI_TRANSITIONS=77} [2022-12-12 14:31:20,715 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -10 predicate places. [2022-12-12 14:31:20,715 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 77 transitions, 485 flow [2022-12-12 14:31:20,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:31:20,715 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:20,716 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 14:31:20,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:31:20,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:20,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:20,716 INFO L85 PathProgramCache]: Analyzing trace with hash -635999058, now seen corresponding path program 1 times [2022-12-12 14:31:20,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:20,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590890178] [2022-12-12 14:31:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:20,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:21,022 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 14:31:21,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:21,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590890178] [2022-12-12 14:31:21,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590890178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:21,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:21,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:31:21,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004428942] [2022-12-12 14:31:21,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:21,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:31:21,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:21,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:31:21,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:31:21,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:31:21,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 77 transitions, 485 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:31:21,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:21,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:31:21,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:22,565 INFO L130 PetriNetUnfolder]: 12777/19982 cut-off events. [2022-12-12 14:31:22,566 INFO L131 PetriNetUnfolder]: For 14082/16027 co-relation queries the response was YES. [2022-12-12 14:31:22,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76978 conditions, 19982 events. 12777/19982 cut-off events. For 14082/16027 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 145221 event pairs, 807 based on Foata normal form. 1482/13782 useless extension candidates. Maximal degree in co-relation 76954. Up to 12283 conditions per place. [2022-12-12 14:31:22,643 INFO L137 encePairwiseOnDemand]: 50/64 looper letters, 77 selfloop transitions, 37 changer transitions 5/135 dead transitions. [2022-12-12 14:31:22,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 135 transitions, 1030 flow [2022-12-12 14:31:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:31:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:31:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-12-12 14:31:22,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.453125 [2022-12-12 14:31:22,645 INFO L175 Difference]: Start difference. First operand has 67 places, 77 transitions, 485 flow. Second operand 5 states and 145 transitions. [2022-12-12 14:31:22,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 135 transitions, 1030 flow [2022-12-12 14:31:22,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 135 transitions, 970 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-12 14:31:22,673 INFO L231 Difference]: Finished difference. Result has 69 places, 88 transitions, 614 flow [2022-12-12 14:31:22,673 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=614, PETRI_PLACES=69, PETRI_TRANSITIONS=88} [2022-12-12 14:31:22,674 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -8 predicate places. [2022-12-12 14:31:22,674 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 88 transitions, 614 flow [2022-12-12 14:31:22,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:31:22,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:22,674 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 14:31:22,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:31:22,674 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:22,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1606613065, now seen corresponding path program 1 times [2022-12-12 14:31:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:22,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114363147] [2022-12-12 14:31:22,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:22,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:23,247 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 14:31:23,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:23,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114363147] [2022-12-12 14:31:23,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114363147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:23,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:23,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:31:23,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654900357] [2022-12-12 14:31:23,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:23,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:31:23,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:23,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:31:23,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:31:23,250 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:31:23,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 88 transitions, 614 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 14:31:23,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:23,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:31:23,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:25,364 INFO L130 PetriNetUnfolder]: 15153/24148 cut-off events. [2022-12-12 14:31:25,364 INFO L131 PetriNetUnfolder]: For 45135/51257 co-relation queries the response was YES. [2022-12-12 14:31:25,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102480 conditions, 24148 events. 15153/24148 cut-off events. For 45135/51257 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 180606 event pairs, 1009 based on Foata normal form. 1613/20743 useless extension candidates. Maximal degree in co-relation 102456. Up to 13238 conditions per place. [2022-12-12 14:31:25,495 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 202 selfloop transitions, 39 changer transitions 16/278 dead transitions. [2022-12-12 14:31:25,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 278 transitions, 2417 flow [2022-12-12 14:31:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 14:31:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 14:31:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2022-12-12 14:31:25,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2022-12-12 14:31:25,496 INFO L175 Difference]: Start difference. First operand has 69 places, 88 transitions, 614 flow. Second operand 9 states and 213 transitions. [2022-12-12 14:31:25,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 278 transitions, 2417 flow [2022-12-12 14:31:25,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 278 transitions, 2051 flow, removed 88 selfloop flow, removed 3 redundant places. [2022-12-12 14:31:25,879 INFO L231 Difference]: Finished difference. Result has 81 places, 117 transitions, 886 flow [2022-12-12 14:31:25,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=886, PETRI_PLACES=81, PETRI_TRANSITIONS=117} [2022-12-12 14:31:25,880 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2022-12-12 14:31:25,880 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 117 transitions, 886 flow [2022-12-12 14:31:25,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 14:31:25,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:25,880 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 14:31:25,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:31:25,880 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:25,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:25,881 INFO L85 PathProgramCache]: Analyzing trace with hash -445102687, now seen corresponding path program 2 times [2022-12-12 14:31:25,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:25,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369694822] [2022-12-12 14:31:25,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:25,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:26,070 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 14:31:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:26,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369694822] [2022-12-12 14:31:26,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369694822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:26,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:26,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:31:26,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354750910] [2022-12-12 14:31:26,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:26,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:31:26,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:26,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:31:26,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:31:26,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:31:26,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 117 transitions, 886 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 14:31:26,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:26,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:31:26,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:27,621 INFO L130 PetriNetUnfolder]: 11639/17743 cut-off events. [2022-12-12 14:31:27,621 INFO L131 PetriNetUnfolder]: For 31160/33139 co-relation queries the response was YES. [2022-12-12 14:31:27,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69027 conditions, 17743 events. 11639/17743 cut-off events. For 31160/33139 co-relation queries the response was YES. Maximal size of possible extension queue 1060. Compared 122768 event pairs, 193 based on Foata normal form. 1564/11583 useless extension candidates. Maximal degree in co-relation 68996. Up to 6885 conditions per place. [2022-12-12 14:31:27,703 INFO L137 encePairwiseOnDemand]: 50/64 looper letters, 99 selfloop transitions, 49 changer transitions 19/189 dead transitions. [2022-12-12 14:31:27,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 189 transitions, 1773 flow [2022-12-12 14:31:27,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:31:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:31:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2022-12-12 14:31:27,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4010416666666667 [2022-12-12 14:31:27,704 INFO L175 Difference]: Start difference. First operand has 81 places, 117 transitions, 886 flow. Second operand 6 states and 154 transitions. [2022-12-12 14:31:27,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 189 transitions, 1773 flow [2022-12-12 14:31:28,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 189 transitions, 1735 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-12 14:31:28,416 INFO L231 Difference]: Finished difference. Result has 86 places, 106 transitions, 864 flow [2022-12-12 14:31:28,416 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=86, PETRI_TRANSITIONS=106} [2022-12-12 14:31:28,417 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 9 predicate places. [2022-12-12 14:31:28,417 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 106 transitions, 864 flow [2022-12-12 14:31:28,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 14:31:28,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:28,417 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:28,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:31:28,417 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:28,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1083311016, now seen corresponding path program 1 times [2022-12-12 14:31:28,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:28,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396062660] [2022-12-12 14:31:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:28,685 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 14:31:28,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:28,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396062660] [2022-12-12 14:31:28,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396062660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:28,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:28,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:31:28,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110106764] [2022-12-12 14:31:28,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:28,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:31:28,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:28,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:31:28,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:31:28,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 14:31:28,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 106 transitions, 864 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:31:28,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:28,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 14:31:28,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:29,631 INFO L130 PetriNetUnfolder]: 5625/8959 cut-off events. [2022-12-12 14:31:29,632 INFO L131 PetriNetUnfolder]: For 25305/26936 co-relation queries the response was YES. [2022-12-12 14:31:29,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40868 conditions, 8959 events. 5625/8959 cut-off events. For 25305/26936 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 58038 event pairs, 629 based on Foata normal form. 603/7299 useless extension candidates. Maximal degree in co-relation 40835. Up to 4808 conditions per place. [2022-12-12 14:31:29,668 INFO L137 encePairwiseOnDemand]: 61/64 looper letters, 105 selfloop transitions, 3 changer transitions 46/185 dead transitions. [2022-12-12 14:31:29,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 185 transitions, 1785 flow [2022-12-12 14:31:29,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:31:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:31:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-12-12 14:31:29,677 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2022-12-12 14:31:29,677 INFO L175 Difference]: Start difference. First operand has 86 places, 106 transitions, 864 flow. Second operand 4 states and 105 transitions. [2022-12-12 14:31:29,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 185 transitions, 1785 flow [2022-12-12 14:31:29,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 185 transitions, 1463 flow, removed 64 selfloop flow, removed 7 redundant places. [2022-12-12 14:31:29,984 INFO L231 Difference]: Finished difference. Result has 84 places, 94 transitions, 590 flow [2022-12-12 14:31:29,985 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=590, PETRI_PLACES=84, PETRI_TRANSITIONS=94} [2022-12-12 14:31:29,985 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2022-12-12 14:31:29,985 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 94 transitions, 590 flow [2022-12-12 14:31:29,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:31:29,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:29,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:29,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:31:29,986 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:29,986 INFO L85 PathProgramCache]: Analyzing trace with hash -734441400, now seen corresponding path program 1 times [2022-12-12 14:31:29,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:29,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637066824] [2022-12-12 14:31:29,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:29,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:30,388 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 14:31:30,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:30,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637066824] [2022-12-12 14:31:30,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637066824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:30,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:30,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:31:30,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134502168] [2022-12-12 14:31:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:30,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:31:30,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:30,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:31:30,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:31:30,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 14:31:30,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 94 transitions, 590 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 14:31:30,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:30,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 14:31:30,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:31,244 INFO L130 PetriNetUnfolder]: 6698/10908 cut-off events. [2022-12-12 14:31:31,244 INFO L131 PetriNetUnfolder]: For 22285/23069 co-relation queries the response was YES. [2022-12-12 14:31:31,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41299 conditions, 10908 events. 6698/10908 cut-off events. For 22285/23069 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 75293 event pairs, 584 based on Foata normal form. 466/8594 useless extension candidates. Maximal degree in co-relation 41268. Up to 3921 conditions per place. [2022-12-12 14:31:31,288 INFO L137 encePairwiseOnDemand]: 59/64 looper letters, 57 selfloop transitions, 3 changer transitions 107/188 dead transitions. [2022-12-12 14:31:31,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 188 transitions, 1453 flow [2022-12-12 14:31:31,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:31:31,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:31:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2022-12-12 14:31:31,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35044642857142855 [2022-12-12 14:31:31,290 INFO L175 Difference]: Start difference. First operand has 84 places, 94 transitions, 590 flow. Second operand 7 states and 157 transitions. [2022-12-12 14:31:31,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 188 transitions, 1453 flow [2022-12-12 14:31:31,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 188 transitions, 1408 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-12 14:31:31,810 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 401 flow [2022-12-12 14:31:31,811 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=88, PETRI_TRANSITIONS=72} [2022-12-12 14:31:31,811 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 11 predicate places. [2022-12-12 14:31:31,811 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 401 flow [2022-12-12 14:31:31,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 14:31:31,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:31,812 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:31,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:31:31,812 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:31,812 INFO L85 PathProgramCache]: Analyzing trace with hash -978041570, now seen corresponding path program 2 times [2022-12-12 14:31:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:31,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747368827] [2022-12-12 14:31:31,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:31,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:31:32,980 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 14:31:32,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:31:32,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747368827] [2022-12-12 14:31:32,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747368827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:31:32,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:31:32,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:31:32,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340525867] [2022-12-12 14:31:32,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:31:32,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:31:32,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:31:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:31:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:31:32,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 14:31:32,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 401 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 14:31:32,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:31:32,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 14:31:32,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:31:33,408 INFO L130 PetriNetUnfolder]: 2299/3954 cut-off events. [2022-12-12 14:31:33,409 INFO L131 PetriNetUnfolder]: For 5900/6080 co-relation queries the response was YES. [2022-12-12 14:31:33,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14212 conditions, 3954 events. 2299/3954 cut-off events. For 5900/6080 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 25751 event pairs, 86 based on Foata normal form. 185/3037 useless extension candidates. Maximal degree in co-relation 14191. Up to 1523 conditions per place. [2022-12-12 14:31:33,424 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 68 selfloop transitions, 6 changer transitions 36/132 dead transitions. [2022-12-12 14:31:33,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 132 transitions, 968 flow [2022-12-12 14:31:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 14:31:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 14:31:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-12-12 14:31:33,426 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.287109375 [2022-12-12 14:31:33,426 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 401 flow. Second operand 8 states and 147 transitions. [2022-12-12 14:31:33,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 132 transitions, 968 flow [2022-12-12 14:31:33,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 132 transitions, 903 flow, removed 9 selfloop flow, removed 17 redundant places. [2022-12-12 14:31:33,542 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 376 flow [2022-12-12 14:31:33,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=376, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2022-12-12 14:31:33,542 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -7 predicate places. [2022-12-12 14:31:33,543 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 376 flow [2022-12-12 14:31:33,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 14:31:33,543 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:31:33,543 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:33,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 14:31:33,543 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:31:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:31:33,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1077932070, now seen corresponding path program 3 times [2022-12-12 14:31:33,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:31:33,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946304689] [2022-12-12 14:31:33,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:31:33,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:31:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:31:33,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:31:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:31:33,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:31:33,695 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:31:33,695 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 14:31:33,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 14:31:33,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 14:31:33,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 14:31:33,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 14:31:33,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 14:31:33,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 14:31:33,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 14:31:33,698 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:31:33,704 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:31:33,705 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:31:33,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:31:33 BasicIcfg [2022-12-12 14:31:33,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:31:33,794 INFO L158 Benchmark]: Toolchain (without parser) took 42195.22ms. Allocated memory was 178.3MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 144.8MB in the beginning and 5.1GB in the end (delta: -4.9GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-12 14:31:33,795 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 178.3MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:31:33,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.04ms. Allocated memory is still 178.3MB. Free memory was 144.8MB in the beginning and 116.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-12 14:31:33,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.60ms. Allocated memory is still 178.3MB. Free memory was 116.5MB in the beginning and 113.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:31:33,795 INFO L158 Benchmark]: Boogie Preprocessor took 40.18ms. Allocated memory is still 178.3MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:31:33,796 INFO L158 Benchmark]: RCFGBuilder took 663.41ms. Allocated memory is still 178.3MB. Free memory was 111.8MB in the beginning and 75.1MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-12 14:31:33,796 INFO L158 Benchmark]: TraceAbstraction took 40835.74ms. Allocated memory was 178.3MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 74.0MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-12 14:31:33,797 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.27ms. Allocated memory is still 178.3MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 579.04ms. Allocated memory is still 178.3MB. Free memory was 144.8MB in the beginning and 116.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.60ms. Allocated memory is still 178.3MB. Free memory was 116.5MB in the beginning and 113.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.18ms. Allocated memory is still 178.3MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 663.41ms. Allocated memory is still 178.3MB. Free memory was 111.8MB in the beginning and 75.1MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 40835.74ms. Allocated memory was 178.3MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 74.0MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 135 PlacesBefore, 77 PlacesAfterwards, 124 TransitionsBefore, 64 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 4196, independent unconditional: 0, dependent: 211, dependent conditional: 211, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 0, independent unconditional: 4196, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 0, independent unconditional: 4196, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 0, independent unconditional: 4196, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2392, independent: 2330, independent conditional: 0, independent unconditional: 2330, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2392, independent: 2295, independent conditional: 0, independent unconditional: 2295, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 330, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 287, dependent conditional: 0, dependent unconditional: 287, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4407, independent: 1866, independent conditional: 0, independent unconditional: 1866, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 2392, unknown conditional: 0, unknown unconditional: 2392] , Statistics on independence cache: Total cache size (in pairs): 4451, Positive cache size: 4389, Positive conditional cache size: 0, Positive unconditional cache size: 4389, Negative cache size: 62, Negative conditional cache size: 0, Negative unconditional cache size: 62, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t525; [L865] FCALL, FORK 0 pthread_create(&t525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t525, ((void *)0), P0, ((void *)0))=-4, t525={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L866] 0 pthread_t t526; [L867] FCALL, FORK 0 pthread_create(&t526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t526, ((void *)0), P1, ((void *)0))=-3, t525={5:0}, t526={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L868] 0 pthread_t t527; [L869] FCALL, FORK 0 pthread_create(&t527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t527, ((void *)0), P2, ((void *)0))=-2, t525={5:0}, t526={6:0}, t527={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L870] 0 pthread_t t528; [L871] FCALL, FORK 0 pthread_create(&t528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t528, ((void *)0), P3, ((void *)0))=-1, t525={5:0}, t526={6:0}, t527={7:0}, t528={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L767] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L770] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L782] 3 y = 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=50, weak$$choice2=255, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 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) [L790] 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)) [L791] 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)) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=0, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=0, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 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) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 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 [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 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=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, main$tmp_guard1=0, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: 871]: 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: 865]: 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: 869]: 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: 867]: 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 9 procedures, 162 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 539 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 539 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1522 IncrementalHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 24 mSDtfsCounter, 1522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=886occurred in iteration=9, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 1976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 14:31:33,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...