/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:43:29,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:43:29,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:43:29,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:43:29,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:43:29,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:43:29,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:43:29,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:43:29,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:43:29,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:43:29,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:43:29,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:43:29,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:43:29,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:43:29,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:43:29,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:43:29,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:43:29,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:43:29,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:43:29,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:43:29,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:43:29,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:43:29,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:43:29,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:43:29,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:43:29,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:43:29,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:43:29,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:43:29,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:43:29,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:43:29,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:43:29,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:43:29,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:43:29,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:43:29,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:43:29,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:43:29,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:43:29,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:43:29,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:43:29,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:43:29,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:43:29,560 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 21:43:29,587 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:43:29,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:43:29,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:43:29,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:43:29,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:43:29,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:43:29,589 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:43:29,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:43:29,590 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:43:29,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:43:29,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:43:29,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:43:29,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:43:29,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:43:29,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:43:29,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:43:29,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:43:29,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:43:29,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:43:29,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:43:29,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:43:29,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:43:29,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:43:29,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:43:29,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:43:29,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:43:29,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:43:29,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:43:29,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:43:29,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:43:29,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:43:29,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:43:29,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:43:29,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:43:29,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:43:29,855 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:43:29,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2022-12-12 21:43:30,915 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:43:31,263 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:43:31,264 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2022-12-12 21:43:31,310 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28075d70e/dc377c60425049cea1b377f13e467f5b/FLAG4ff7f3a81 [2022-12-12 21:43:31,321 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28075d70e/dc377c60425049cea1b377f13e467f5b [2022-12-12 21:43:31,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:43:31,325 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:43:31,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:43:31,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:43:31,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:43:31,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fbe6277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31, skipping insertion in model container [2022-12-12 21:43:31,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:43:31,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:43:31,510 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/safe027_power.opt.i[994,1007] [2022-12-12 21:43:31,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:43:31,726 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:43:31,737 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/safe027_power.opt.i[994,1007] [2022-12-12 21:43:31,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:43:31,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:43:31,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:43:31,838 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:43:31,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31 WrapperNode [2022-12-12 21:43:31,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:43:31,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:43:31,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:43:31,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:43:31,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,887 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2022-12-12 21:43:31,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:43:31,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:43:31,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:43:31,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:43:31,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,938 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:43:31,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:43:31,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:43:31,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:43:31,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (1/1) ... [2022-12-12 21:43:31,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:43:31,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:43:31,980 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 21:43:31,982 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 21:43:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 21:43:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:43:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:43:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:43:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:43:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:43:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:43:32,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:43:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:43:32,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:43:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:43:32,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:43:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 21:43:32,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 21:43:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:43:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:43:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:43:32,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:43:32,025 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 21:43:32,198 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:43:32,199 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:43:32,632 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:43:32,879 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:43:32,879 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:43:32,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:43:32 BoogieIcfgContainer [2022-12-12 21:43:32,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:43:32,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:43:32,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:43:32,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:43:32,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:43:31" (1/3) ... [2022-12-12 21:43:32,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56246f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:43:32, skipping insertion in model container [2022-12-12 21:43:32,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:43:31" (2/3) ... [2022-12-12 21:43:32,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56246f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:43:32, skipping insertion in model container [2022-12-12 21:43:32,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:43:32" (3/3) ... [2022-12-12 21:43:32,888 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2022-12-12 21:43:32,902 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:43:32,902 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:43:32,902 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:43:32,965 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:43:32,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2022-12-12 21:43:33,053 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2022-12-12 21:43:33,053 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:43:33,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-12 21:43:33,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2022-12-12 21:43:33,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2022-12-12 21:43:33,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:43:33,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2022-12-12 21:43:33,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2022-12-12 21:43:33,135 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2022-12-12 21:43:33,135 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:43:33,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-12 21:43:33,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2022-12-12 21:43:33,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 2664 [2022-12-12 21:43:44,388 INFO L241 LiptonReduction]: Total number of compositions: 119 [2022-12-12 21:43:44,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:43:44,410 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;@84f95a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:43:44,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 21:43:44,415 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-12 21:43:44,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:43:44,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:44,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 21:43:44,420 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:43:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash 955749799, now seen corresponding path program 1 times [2022-12-12 21:43:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:44,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454117841] [2022-12-12 21:43:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:44,793 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 21:43:44,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:44,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454117841] [2022-12-12 21:43:44,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454117841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:44,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:44,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:43:44,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763498105] [2022-12-12 21:43:44,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:44,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:43:44,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:43:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:43:44,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:43:44,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 74 transitions, 160 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 21:43:44,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:44,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:43:44,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:53,978 INFO L130 PetriNetUnfolder]: 57424/80529 cut-off events. [2022-12-12 21:43:53,978 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-12-12 21:43:54,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156682 conditions, 80529 events. 57424/80529 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 3923. Compared 572683 event pairs, 15118 based on Foata normal form. 0/50392 useless extension candidates. Maximal degree in co-relation 156670. Up to 63597 conditions per place. [2022-12-12 21:43:54,223 INFO L137 encePairwiseOnDemand]: 69/74 looper letters, 44 selfloop transitions, 2 changer transitions 64/122 dead transitions. [2022-12-12 21:43:54,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 122 transitions, 482 flow [2022-12-12 21:43:54,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:43:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:43:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-12-12 21:43:54,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6801801801801802 [2022-12-12 21:43:54,233 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 0 predicate places. [2022-12-12 21:43:54,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 122 transitions, 482 flow [2022-12-12 21:43:54,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 58 transitions, 226 flow [2022-12-12 21:43:54,315 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 58 transitions, 226 flow [2022-12-12 21:43:54,315 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 21:43:54,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:54,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:54,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:43:54,316 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:43:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2124037410, now seen corresponding path program 1 times [2022-12-12 21:43:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:54,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468359318] [2022-12-12 21:43:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:54,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:54,511 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 21:43:54,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:54,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468359318] [2022-12-12 21:43:54,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468359318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:54,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:54,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:43:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47375686] [2022-12-12 21:43:54,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:54,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:43:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:54,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:43:54,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:43:54,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:43:54,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:54,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:54,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:43:54,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:56,036 INFO L130 PetriNetUnfolder]: 7639/10989 cut-off events. [2022-12-12 21:43:56,036 INFO L131 PetriNetUnfolder]: For 154/166 co-relation queries the response was YES. [2022-12-12 21:43:56,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31958 conditions, 10989 events. 7639/10989 cut-off events. For 154/166 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 64873 event pairs, 392 based on Foata normal form. 126/9017 useless extension candidates. Maximal degree in co-relation 31943. Up to 9024 conditions per place. [2022-12-12 21:43:56,107 INFO L137 encePairwiseOnDemand]: 71/74 looper letters, 77 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2022-12-12 21:43:56,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 92 transitions, 537 flow [2022-12-12 21:43:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:43:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:43:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-12 21:43:56,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2022-12-12 21:43:56,110 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -30 predicate places. [2022-12-12 21:43:56,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 92 transitions, 537 flow [2022-12-12 21:43:56,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 92 transitions, 537 flow [2022-12-12 21:43:56,171 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 92 transitions, 537 flow [2022-12-12 21:43:56,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:43:56,171 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:56,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:56,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:43:56,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:43:56,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:56,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1420651035, now seen corresponding path program 1 times [2022-12-12 21:43:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:56,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103912391] [2022-12-12 21:43:56,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:56,325 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 21:43:56,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:56,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103912391] [2022-12-12 21:43:56,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103912391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:56,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:56,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:43:56,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543912636] [2022-12-12 21:43:56,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:56,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:43:56,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:56,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:43:56,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:43:56,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 74 [2022-12-12 21:43:56,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 92 transitions, 537 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 21:43:56,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:56,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 74 [2022-12-12 21:43:56,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:58,261 INFO L130 PetriNetUnfolder]: 12880/18417 cut-off events. [2022-12-12 21:43:58,261 INFO L131 PetriNetUnfolder]: For 606/606 co-relation queries the response was YES. [2022-12-12 21:43:58,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69530 conditions, 18417 events. 12880/18417 cut-off events. For 606/606 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 107134 event pairs, 500 based on Foata normal form. 600/15436 useless extension candidates. Maximal degree in co-relation 69512. Up to 15177 conditions per place. [2022-12-12 21:43:58,359 INFO L137 encePairwiseOnDemand]: 70/74 looper letters, 82 selfloop transitions, 5 changer transitions 65/162 dead transitions. [2022-12-12 21:43:58,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 162 transitions, 1251 flow [2022-12-12 21:43:58,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:43:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:43:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-12-12 21:43:58,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3581081081081081 [2022-12-12 21:43:58,361 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -27 predicate places. [2022-12-12 21:43:58,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 162 transitions, 1251 flow [2022-12-12 21:43:58,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 97 transitions, 722 flow [2022-12-12 21:43:58,415 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 97 transitions, 722 flow [2022-12-12 21:43:58,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 21:43:58,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:58,416 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:58,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:43:58,416 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:43:58,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:58,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1090602146, now seen corresponding path program 1 times [2022-12-12 21:43:58,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:58,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525993046] [2022-12-12 21:43:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:58,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:43:58,582 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 21:43:58,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:43:58,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525993046] [2022-12-12 21:43:58,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525993046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:43:58,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:43:58,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:43:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616738887] [2022-12-12 21:43:58,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:43:58,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:43:58,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:43:58,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:43:58,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:43:58,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:43:58,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 97 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 21:43:58,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:43:58,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:43:58,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:43:59,768 INFO L130 PetriNetUnfolder]: 6684/9535 cut-off events. [2022-12-12 21:43:59,768 INFO L131 PetriNetUnfolder]: For 423/423 co-relation queries the response was YES. [2022-12-12 21:43:59,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44591 conditions, 9535 events. 6684/9535 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 49667 event pairs, 300 based on Foata normal form. 80/7728 useless extension candidates. Maximal degree in co-relation 44570. Up to 7661 conditions per place. [2022-12-12 21:43:59,843 INFO L137 encePairwiseOnDemand]: 71/74 looper letters, 127 selfloop transitions, 7 changer transitions 0/147 dead transitions. [2022-12-12 21:43:59,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 147 transitions, 1396 flow [2022-12-12 21:43:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:43:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:43:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-12 21:43:59,846 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36036036036036034 [2022-12-12 21:43:59,847 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -26 predicate places. [2022-12-12 21:43:59,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 147 transitions, 1396 flow [2022-12-12 21:43:59,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 147 transitions, 1396 flow [2022-12-12 21:43:59,900 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 147 transitions, 1396 flow [2022-12-12 21:43:59,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 21:43:59,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:43:59,901 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:43:59,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:43:59,901 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:43:59,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:43:59,901 INFO L85 PathProgramCache]: Analyzing trace with hash 552587535, now seen corresponding path program 1 times [2022-12-12 21:43:59,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:43:59,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579801827] [2022-12-12 21:43:59,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:43:59,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:43:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:00,252 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 21:44:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:00,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579801827] [2022-12-12 21:44:00,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579801827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:00,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:00,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:44:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151244331] [2022-12-12 21:44:00,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:00,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:44:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:00,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:44:00,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:44:00,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 74 [2022-12-12 21:44:00,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 147 transitions, 1396 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:00,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:00,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 74 [2022-12-12 21:44:00,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:02,568 INFO L130 PetriNetUnfolder]: 16324/22334 cut-off events. [2022-12-12 21:44:02,568 INFO L131 PetriNetUnfolder]: For 19536/19539 co-relation queries the response was YES. [2022-12-12 21:44:02,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115632 conditions, 22334 events. 16324/22334 cut-off events. For 19536/19539 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 120718 event pairs, 3513 based on Foata normal form. 1305/19769 useless extension candidates. Maximal degree in co-relation 115608. Up to 17124 conditions per place. [2022-12-12 21:44:02,681 INFO L137 encePairwiseOnDemand]: 59/74 looper letters, 175 selfloop transitions, 53 changer transitions 192/429 dead transitions. [2022-12-12 21:44:02,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 429 transitions, 4972 flow [2022-12-12 21:44:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:44:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:44:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2022-12-12 21:44:02,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.372972972972973 [2022-12-12 21:44:02,682 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -22 predicate places. [2022-12-12 21:44:02,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 429 transitions, 4972 flow [2022-12-12 21:44:02,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 237 transitions, 2732 flow [2022-12-12 21:44:02,757 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 237 transitions, 2732 flow [2022-12-12 21:44:02,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:02,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:02,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:02,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:44:02,758 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:44:02,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:02,758 INFO L85 PathProgramCache]: Analyzing trace with hash 199355574, now seen corresponding path program 1 times [2022-12-12 21:44:02,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:02,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566439434] [2022-12-12 21:44:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:02,956 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 21:44:02,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:02,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566439434] [2022-12-12 21:44:02,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566439434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:02,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:02,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:44:02,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093416887] [2022-12-12 21:44:02,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:02,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:44:02,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:02,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:44:02,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:44:02,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 74 [2022-12-12 21:44:02,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 237 transitions, 2732 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 21:44:02,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:02,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 74 [2022-12-12 21:44:02,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:05,013 INFO L130 PetriNetUnfolder]: 11948/17040 cut-off events. [2022-12-12 21:44:05,013 INFO L131 PetriNetUnfolder]: For 13166/13188 co-relation queries the response was YES. [2022-12-12 21:44:05,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104883 conditions, 17040 events. 11948/17040 cut-off events. For 13166/13188 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 97516 event pairs, 1569 based on Foata normal form. 1240/15389 useless extension candidates. Maximal degree in co-relation 104856. Up to 16191 conditions per place. [2022-12-12 21:44:05,138 INFO L137 encePairwiseOnDemand]: 59/74 looper letters, 178 selfloop transitions, 99 changer transitions 148/434 dead transitions. [2022-12-12 21:44:05,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 434 transitions, 5853 flow [2022-12-12 21:44:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:44:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:44:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2022-12-12 21:44:05,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2022-12-12 21:44:05,142 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -19 predicate places. [2022-12-12 21:44:05,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 434 transitions, 5853 flow [2022-12-12 21:44:05,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 286 transitions, 3845 flow [2022-12-12 21:44:05,216 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 286 transitions, 3845 flow [2022-12-12 21:44:05,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 21:44:05,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:05,217 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:05,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:44:05,217 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:44:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1857105023, now seen corresponding path program 1 times [2022-12-12 21:44:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:05,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371780420] [2022-12-12 21:44:05,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:06,559 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 21:44:06,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:06,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371780420] [2022-12-12 21:44:06,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371780420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:06,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:06,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:44:06,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984085036] [2022-12-12 21:44:06,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:06,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:44:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:44:06,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:44:06,561 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:44:06,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 286 transitions, 3845 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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 21:44:06,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:06,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:44:06,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:08,345 INFO L130 PetriNetUnfolder]: 9996/14262 cut-off events. [2022-12-12 21:44:08,345 INFO L131 PetriNetUnfolder]: For 15035/15046 co-relation queries the response was YES. [2022-12-12 21:44:08,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99431 conditions, 14262 events. 9996/14262 cut-off events. For 15035/15046 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 78887 event pairs, 1574 based on Foata normal form. 41/12073 useless extension candidates. Maximal degree in co-relation 99401. Up to 13273 conditions per place. [2022-12-12 21:44:08,472 INFO L137 encePairwiseOnDemand]: 66/74 looper letters, 308 selfloop transitions, 63 changer transitions 0/392 dead transitions. [2022-12-12 21:44:08,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 392 transitions, 6077 flow [2022-12-12 21:44:08,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:44:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:44:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2022-12-12 21:44:08,474 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3474903474903475 [2022-12-12 21:44:08,475 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2022-12-12 21:44:08,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 392 transitions, 6077 flow [2022-12-12 21:44:08,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 392 transitions, 6077 flow [2022-12-12 21:44:08,557 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 392 transitions, 6077 flow [2022-12-12 21:44:08,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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 21:44:08,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:08,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:08,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:44:08,557 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:44:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash -313138521, now seen corresponding path program 2 times [2022-12-12 21:44:08,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:08,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452909732] [2022-12-12 21:44:08,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:08,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:09,957 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 21:44:09,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:09,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452909732] [2022-12-12 21:44:09,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452909732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:09,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:09,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:44:09,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631318704] [2022-12-12 21:44:09,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:09,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:44:09,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:09,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:44:09,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:44:09,960 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:44:09,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 392 transitions, 6077 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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 21:44:09,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:09,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:44:09,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:12,020 INFO L130 PetriNetUnfolder]: 11078/15806 cut-off events. [2022-12-12 21:44:12,021 INFO L131 PetriNetUnfolder]: For 21823/21830 co-relation queries the response was YES. [2022-12-12 21:44:12,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123172 conditions, 15806 events. 11078/15806 cut-off events. For 21823/21830 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 89189 event pairs, 1704 based on Foata normal form. 166/13514 useless extension candidates. Maximal degree in co-relation 123139. Up to 14786 conditions per place. [2022-12-12 21:44:12,145 INFO L137 encePairwiseOnDemand]: 65/74 looper letters, 412 selfloop transitions, 59 changer transitions 0/492 dead transitions. [2022-12-12 21:44:12,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 492 transitions, 8619 flow [2022-12-12 21:44:12,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:44:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:44:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2022-12-12 21:44:12,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2022-12-12 21:44:12,146 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2022-12-12 21:44:12,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 492 transitions, 8619 flow [2022-12-12 21:44:12,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 492 transitions, 8619 flow [2022-12-12 21:44:12,236 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 492 transitions, 8619 flow [2022-12-12 21:44:12,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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 21:44:12,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:12,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:12,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:44:12,237 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:44:12,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash -963087929, now seen corresponding path program 3 times [2022-12-12 21:44:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:12,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123435088] [2022-12-12 21:44:12,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:12,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:13,847 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 21:44:13,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:13,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123435088] [2022-12-12 21:44:13,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123435088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:13,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:13,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:44:13,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284030914] [2022-12-12 21:44:13,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:13,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:44:13,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:44:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:44:13,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:44:13,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 492 transitions, 8619 flow. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 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 21:44:13,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:13,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:44:13,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:16,351 INFO L130 PetriNetUnfolder]: 11506/16420 cut-off events. [2022-12-12 21:44:16,351 INFO L131 PetriNetUnfolder]: For 31137/31144 co-relation queries the response was YES. [2022-12-12 21:44:16,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141060 conditions, 16420 events. 11506/16420 cut-off events. For 31137/31144 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 93140 event pairs, 1708 based on Foata normal form. 58/13976 useless extension candidates. Maximal degree in co-relation 141024. Up to 15233 conditions per place. [2022-12-12 21:44:16,514 INFO L137 encePairwiseOnDemand]: 66/74 looper letters, 446 selfloop transitions, 139 changer transitions 0/606 dead transitions. [2022-12-12 21:44:16,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 606 transitions, 11850 flow [2022-12-12 21:44:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 21:44:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 21:44:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2022-12-12 21:44:16,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33183183183183185 [2022-12-12 21:44:16,517 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -2 predicate places. [2022-12-12 21:44:16,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 606 transitions, 11850 flow [2022-12-12 21:44:16,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 606 transitions, 11850 flow [2022-12-12 21:44:16,619 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 606 transitions, 11850 flow [2022-12-12 21:44:16,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 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 21:44:16,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:16,619 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 21:44:16,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:44:16,619 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:44:16,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:16,619 INFO L85 PathProgramCache]: Analyzing trace with hash 706367548, now seen corresponding path program 1 times [2022-12-12 21:44:16,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:16,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384356227] [2022-12-12 21:44:16,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:16,967 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 21:44:16,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:16,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384356227] [2022-12-12 21:44:16,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384356227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:16,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:16,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:44:16,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694666920] [2022-12-12 21:44:16,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:16,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:44:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:16,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:44:16,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:44:16,969 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 74 [2022-12-12 21:44:16,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 606 transitions, 11850 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 21:44:16,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:16,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 74 [2022-12-12 21:44:16,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:19,008 INFO L130 PetriNetUnfolder]: 8320/12676 cut-off events. [2022-12-12 21:44:19,009 INFO L131 PetriNetUnfolder]: For 32296/32329 co-relation queries the response was YES. [2022-12-12 21:44:19,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120886 conditions, 12676 events. 8320/12676 cut-off events. For 32296/32329 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 78381 event pairs, 322 based on Foata normal form. 1173/11887 useless extension candidates. Maximal degree in co-relation 120847. Up to 11660 conditions per place. [2022-12-12 21:44:19,090 INFO L137 encePairwiseOnDemand]: 59/74 looper letters, 331 selfloop transitions, 257 changer transitions 125/722 dead transitions. [2022-12-12 21:44:19,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 722 transitions, 15428 flow [2022-12-12 21:44:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:44:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:44:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2022-12-12 21:44:19,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3745173745173745 [2022-12-12 21:44:19,092 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 4 predicate places. [2022-12-12 21:44:19,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 722 transitions, 15428 flow [2022-12-12 21:44:19,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 597 transitions, 12790 flow [2022-12-12 21:44:19,152 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 597 transitions, 12790 flow [2022-12-12 21:44:19,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 21:44:19,152 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:19,152 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:19,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:44:19,153 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:44:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:19,153 INFO L85 PathProgramCache]: Analyzing trace with hash -82195150, now seen corresponding path program 1 times [2022-12-12 21:44:19,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:19,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936405490] [2022-12-12 21:44:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:19,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:20,297 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 21:44:20,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:20,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936405490] [2022-12-12 21:44:20,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936405490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:20,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:20,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:44:20,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945058180] [2022-12-12 21:44:20,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:20,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:44:20,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:44:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:44:20,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:44:20,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 597 transitions, 12790 flow. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 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 21:44:20,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:20,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:44:20,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:23,092 INFO L130 PetriNetUnfolder]: 10753/16369 cut-off events. [2022-12-12 21:44:23,092 INFO L131 PetriNetUnfolder]: For 68824/68867 co-relation queries the response was YES. [2022-12-12 21:44:23,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167224 conditions, 16369 events. 10753/16369 cut-off events. For 68824/68867 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 104850 event pairs, 521 based on Foata normal form. 61/13703 useless extension candidates. Maximal degree in co-relation 167182. Up to 14966 conditions per place. [2022-12-12 21:44:23,226 INFO L137 encePairwiseOnDemand]: 64/74 looper letters, 751 selfloop transitions, 179 changer transitions 0/955 dead transitions. [2022-12-12 21:44:23,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 955 transitions, 22565 flow [2022-12-12 21:44:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:44:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:44:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2022-12-12 21:44:23,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3530405405405405 [2022-12-12 21:44:23,228 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 9 predicate places. [2022-12-12 21:44:23,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 955 transitions, 22565 flow [2022-12-12 21:44:23,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 955 transitions, 22565 flow [2022-12-12 21:44:23,333 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 955 transitions, 22565 flow [2022-12-12 21:44:23,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 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 21:44:23,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:23,334 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:23,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:44:23,334 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:44:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1359731722, now seen corresponding path program 2 times [2022-12-12 21:44:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:23,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121759492] [2022-12-12 21:44:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:24,090 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 21:44:24,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:24,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121759492] [2022-12-12 21:44:24,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121759492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:24,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:24,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:44:24,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062023776] [2022-12-12 21:44:24,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:24,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:44:24,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:24,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:44:24,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:44:24,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:44:24,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 955 transitions, 22565 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 21:44:24,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:24,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:44:24,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:30,020 INFO L130 PetriNetUnfolder]: 20665/31228 cut-off events. [2022-12-12 21:44:30,021 INFO L131 PetriNetUnfolder]: For 138328/138446 co-relation queries the response was YES. [2022-12-12 21:44:30,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339998 conditions, 31228 events. 20665/31228 cut-off events. For 138328/138446 co-relation queries the response was YES. Maximal size of possible extension queue 1569. Compared 220419 event pairs, 1154 based on Foata normal form. 277/25796 useless extension candidates. Maximal degree in co-relation 339953. Up to 29023 conditions per place. [2022-12-12 21:44:30,264 INFO L137 encePairwiseOnDemand]: 63/74 looper letters, 1135 selfloop transitions, 213 changer transitions 174/1547 dead transitions. [2022-12-12 21:44:30,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 1547 transitions, 39817 flow [2022-12-12 21:44:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:44:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:44:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2022-12-12 21:44:30,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3803088803088803 [2022-12-12 21:44:30,266 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 15 predicate places. [2022-12-12 21:44:30,266 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 1547 transitions, 39817 flow [2022-12-12 21:44:30,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 1373 transitions, 35293 flow [2022-12-12 21:44:30,443 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 1373 transitions, 35293 flow [2022-12-12 21:44:30,443 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 21:44:30,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:30,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:30,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:44:30,444 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:44:30,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:30,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1973318990, now seen corresponding path program 3 times [2022-12-12 21:44:30,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:30,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275117381] [2022-12-12 21:44:30,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:30,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:31,684 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 21:44:31,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:31,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275117381] [2022-12-12 21:44:31,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275117381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:31,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:31,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:44:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741711273] [2022-12-12 21:44:31,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:31,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:44:31,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:31,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:44:31,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:44:31,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:44:31,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 1373 transitions, 35293 flow. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 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 21:44:31,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:31,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:44:31,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:39,414 INFO L130 PetriNetUnfolder]: 22541/34473 cut-off events. [2022-12-12 21:44:39,415 INFO L131 PetriNetUnfolder]: For 177638/177759 co-relation queries the response was YES. [2022-12-12 21:44:39,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401050 conditions, 34473 events. 22541/34473 cut-off events. For 177638/177759 co-relation queries the response was YES. Maximal size of possible extension queue 1732. Compared 251735 event pairs, 1378 based on Foata normal form. 278/28503 useless extension candidates. Maximal degree in co-relation 401002. Up to 31965 conditions per place. [2022-12-12 21:44:39,806 INFO L137 encePairwiseOnDemand]: 66/74 looper letters, 1248 selfloop transitions, 285 changer transitions 96/1654 dead transitions. [2022-12-12 21:44:39,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 1654 transitions, 45872 flow [2022-12-12 21:44:39,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:44:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:44:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2022-12-12 21:44:39,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36993243243243246 [2022-12-12 21:44:39,808 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 20 predicate places. [2022-12-12 21:44:39,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 1654 transitions, 45872 flow [2022-12-12 21:44:40,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 1558 transitions, 43184 flow [2022-12-12 21:44:40,016 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 1558 transitions, 43184 flow [2022-12-12 21:44:40,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 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 21:44:40,016 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:40,016 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:40,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:44:40,017 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:44:40,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:40,017 INFO L85 PathProgramCache]: Analyzing trace with hash 795012714, now seen corresponding path program 4 times [2022-12-12 21:44:40,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:40,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661641931] [2022-12-12 21:44:40,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:40,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:40,170 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 21:44:40,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:40,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661641931] [2022-12-12 21:44:40,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661641931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:40,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:40,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:44:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121008955] [2022-12-12 21:44:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:40,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:44:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:40,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:44:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:44:40,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 74 [2022-12-12 21:44:40,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 1558 transitions, 43184 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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 21:44:40,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:40,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 74 [2022-12-12 21:44:40,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:46,859 INFO L130 PetriNetUnfolder]: 16587/25836 cut-off events. [2022-12-12 21:44:46,859 INFO L131 PetriNetUnfolder]: For 169765/170080 co-relation queries the response was YES. [2022-12-12 21:44:46,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321918 conditions, 25836 events. 16587/25836 cut-off events. For 169765/170080 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 187440 event pairs, 437 based on Foata normal form. 2192/23049 useless extension candidates. Maximal degree in co-relation 321867. Up to 23721 conditions per place. [2022-12-12 21:44:47,063 INFO L137 encePairwiseOnDemand]: 59/74 looper letters, 673 selfloop transitions, 813 changer transitions 117/1612 dead transitions. [2022-12-12 21:44:47,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 1612 transitions, 47822 flow [2022-12-12 21:44:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:44:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:44:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2022-12-12 21:44:47,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30743243243243246 [2022-12-12 21:44:47,064 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 23 predicate places. [2022-12-12 21:44:47,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 1612 transitions, 47822 flow [2022-12-12 21:44:47,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 1495 transitions, 44389 flow [2022-12-12 21:44:47,225 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 1495 transitions, 44389 flow [2022-12-12 21:44:47,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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 21:44:47,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:47,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:47,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 21:44:47,226 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:44:47,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash 782664249, now seen corresponding path program 1 times [2022-12-12 21:44:47,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:47,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909347127] [2022-12-12 21:44:47,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:47,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:48,392 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 21:44:48,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:48,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909347127] [2022-12-12 21:44:48,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909347127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:48,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:48,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:44:48,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502556753] [2022-12-12 21:44:48,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:48,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:44:48,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:48,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:44:48,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:44:48,394 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:44:48,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 1495 transitions, 44389 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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 21:44:48,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:48,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:44:48,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:54,747 INFO L130 PetriNetUnfolder]: 17886/27098 cut-off events. [2022-12-12 21:44:54,748 INFO L131 PetriNetUnfolder]: For 223647/223878 co-relation queries the response was YES. [2022-12-12 21:44:54,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352648 conditions, 27098 events. 17886/27098 cut-off events. For 223647/223878 co-relation queries the response was YES. Maximal size of possible extension queue 1595. Compared 188864 event pairs, 432 based on Foata normal form. 86/21295 useless extension candidates. Maximal degree in co-relation 352594. Up to 24987 conditions per place. [2022-12-12 21:44:54,962 INFO L137 encePairwiseOnDemand]: 64/74 looper letters, 1212 selfloop transitions, 206 changer transitions 304/1747 dead transitions. [2022-12-12 21:44:54,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 1747 transitions, 55402 flow [2022-12-12 21:44:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:44:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:44:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2022-12-12 21:44:54,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3416988416988417 [2022-12-12 21:44:54,963 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 27 predicate places. [2022-12-12 21:44:54,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 1747 transitions, 55402 flow [2022-12-12 21:44:55,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 1443 transitions, 45647 flow [2022-12-12 21:44:55,125 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 1443 transitions, 45647 flow [2022-12-12 21:44:55,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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 21:44:55,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:55,126 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:55,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 21:44:55,126 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:44:55,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:55,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1076155384, now seen corresponding path program 1 times [2022-12-12 21:44:55,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:55,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369954761] [2022-12-12 21:44:55,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:55,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:56,785 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 21:44:56,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:56,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369954761] [2022-12-12 21:44:56,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369954761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:56,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:56,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 21:44:56,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205232598] [2022-12-12 21:44:56,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:56,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 21:44:56,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:56,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 21:44:56,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-12 21:44:56,786 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:44:56,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 1443 transitions, 45647 flow. Second operand has 11 states, 11 states have (on average 13.818181818181818) internal successors, (152), 11 states have internal predecessors, (152), 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 21:44:56,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:56,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:44:56,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:45:04,214 INFO L130 PetriNetUnfolder]: 19224/29780 cut-off events. [2022-12-12 21:45:04,214 INFO L131 PetriNetUnfolder]: For 259953/260172 co-relation queries the response was YES. [2022-12-12 21:45:04,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410407 conditions, 29780 events. 19224/29780 cut-off events. For 259953/260172 co-relation queries the response was YES. Maximal size of possible extension queue 1720. Compared 217730 event pairs, 390 based on Foata normal form. 86/23231 useless extension candidates. Maximal degree in co-relation 410350. Up to 27786 conditions per place. [2022-12-12 21:45:04,493 INFO L137 encePairwiseOnDemand]: 68/74 looper letters, 1430 selfloop transitions, 162 changer transitions 146/1763 dead transitions. [2022-12-12 21:45:04,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 1763 transitions, 59387 flow [2022-12-12 21:45:04,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:45:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:45:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2022-12-12 21:45:04,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32432432432432434 [2022-12-12 21:45:04,494 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 32 predicate places. [2022-12-12 21:45:04,494 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 1763 transitions, 59387 flow [2022-12-12 21:45:04,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 1617 transitions, 54408 flow [2022-12-12 21:45:04,795 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 1617 transitions, 54408 flow [2022-12-12 21:45:04,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.818181818181818) internal successors, (152), 11 states have internal predecessors, (152), 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 21:45:04,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:45:04,795 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:45:04,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 21:45:04,795 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:45:04,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:45:04,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1560702576, now seen corresponding path program 2 times [2022-12-12 21:45:04,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:45:04,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341468280] [2022-12-12 21:45:04,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:45:04,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:45:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:45:04,945 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 21:45:04,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:45:04,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341468280] [2022-12-12 21:45:04,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341468280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:45:04,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:45:04,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:45:04,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312965466] [2022-12-12 21:45:04,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:45:04,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:45:04,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:45:04,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:45:04,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:45:04,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 74 [2022-12-12 21:45:04,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 1617 transitions, 54408 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:45:04,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:45:04,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 74 [2022-12-12 21:45:04,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:45:16,453 INFO L130 PetriNetUnfolder]: 27131/41825 cut-off events. [2022-12-12 21:45:16,453 INFO L131 PetriNetUnfolder]: For 451078/451632 co-relation queries the response was YES. [2022-12-12 21:45:16,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616367 conditions, 41825 events. 27131/41825 cut-off events. For 451078/451632 co-relation queries the response was YES. Maximal size of possible extension queue 2564. Compared 321731 event pairs, 39 based on Foata normal form. 404/32705 useless extension candidates. Maximal degree in co-relation 616307. Up to 39788 conditions per place. [2022-12-12 21:45:16,784 INFO L137 encePairwiseOnDemand]: 71/74 looper letters, 1018 selfloop transitions, 20 changer transitions 1581/2641 dead transitions. [2022-12-12 21:45:16,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 2641 transitions, 94462 flow [2022-12-12 21:45:16,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:45:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:45:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-12 21:45:16,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3310810810810811 [2022-12-12 21:45:16,791 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 33 predicate places. [2022-12-12 21:45:16,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 2641 transitions, 94462 flow [2022-12-12 21:45:16,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 1060 transitions, 37588 flow [2022-12-12 21:45:16,956 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 1060 transitions, 37588 flow [2022-12-12 21:45:16,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:45:16,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:45:16,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:45:16,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-12 21:45:16,956 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:45:16,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:45:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash 765296531, now seen corresponding path program 1 times [2022-12-12 21:45:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:45:16,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306134982] [2022-12-12 21:45:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:45:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:45:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:45:18,850 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 21:45:18,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:45:18,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306134982] [2022-12-12 21:45:18,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306134982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:45:18,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:45:18,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 21:45:18,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524578153] [2022-12-12 21:45:18,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:45:18,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 21:45:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:45:18,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 21:45:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-12 21:45:18,851 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:45:18,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 1060 transitions, 37588 flow. Second operand has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 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 21:45:18,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:45:18,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:45:18,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:45:24,142 INFO L130 PetriNetUnfolder]: 13928/22275 cut-off events. [2022-12-12 21:45:24,143 INFO L131 PetriNetUnfolder]: For 226444/226444 co-relation queries the response was YES. [2022-12-12 21:45:24,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350808 conditions, 22275 events. 13928/22275 cut-off events. For 226444/226444 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 164947 event pairs, 47 based on Foata normal form. 81/17266 useless extension candidates. Maximal degree in co-relation 350745. Up to 21625 conditions per place. [2022-12-12 21:45:24,356 INFO L137 encePairwiseOnDemand]: 66/74 looper letters, 1120 selfloop transitions, 55 changer transitions 33/1231 dead transitions. [2022-12-12 21:45:24,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 1231 transitions, 46175 flow [2022-12-12 21:45:24,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:45:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:45:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2022-12-12 21:45:24,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3281853281853282 [2022-12-12 21:45:24,358 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 33 predicate places. [2022-12-12 21:45:24,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 1231 transitions, 46175 flow [2022-12-12 21:45:24,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 1198 transitions, 44921 flow [2022-12-12 21:45:24,656 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 1198 transitions, 44921 flow [2022-12-12 21:45:24,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 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 21:45:24,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:45:24,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:45:24,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-12 21:45:24,657 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:45:24,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:45:24,657 INFO L85 PathProgramCache]: Analyzing trace with hash -587536792, now seen corresponding path program 3 times [2022-12-12 21:45:24,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:45:24,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050667634] [2022-12-12 21:45:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:45:24,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:45:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:45:26,296 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 21:45:26,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:45:26,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050667634] [2022-12-12 21:45:26,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050667634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:45:26,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:45:26,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 21:45:26,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421322602] [2022-12-12 21:45:26,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:45:26,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 21:45:26,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:45:26,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 21:45:26,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-12 21:45:26,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:45:26,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 1198 transitions, 44921 flow. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 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 21:45:26,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:45:26,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:45:26,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:45:34,491 INFO L130 PetriNetUnfolder]: 19659/31473 cut-off events. [2022-12-12 21:45:34,491 INFO L131 PetriNetUnfolder]: For 332125/332125 co-relation queries the response was YES. [2022-12-12 21:45:34,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513217 conditions, 31473 events. 19659/31473 cut-off events. For 332125/332125 co-relation queries the response was YES. Maximal size of possible extension queue 2064. Compared 247406 event pairs, 45 based on Foata normal form. 162/24162 useless extension candidates. Maximal degree in co-relation 513151. Up to 30760 conditions per place. [2022-12-12 21:45:34,883 INFO L137 encePairwiseOnDemand]: 63/74 looper letters, 1305 selfloop transitions, 195 changer transitions 168/1691 dead transitions. [2022-12-12 21:45:34,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 1691 transitions, 67021 flow [2022-12-12 21:45:34,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 21:45:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 21:45:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2022-12-12 21:45:34,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33183183183183185 [2022-12-12 21:45:34,885 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 41 predicate places. [2022-12-12 21:45:34,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 1691 transitions, 67021 flow [2022-12-12 21:45:35,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 1523 transitions, 60298 flow [2022-12-12 21:45:35,104 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 1523 transitions, 60298 flow [2022-12-12 21:45:35,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 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 21:45:35,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:45:35,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:45:35,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-12 21:45:35,104 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:45:35,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:45:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash -929901488, now seen corresponding path program 4 times [2022-12-12 21:45:35,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:45:35,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085955217] [2022-12-12 21:45:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:45:35,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:45:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:45:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:45:36,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:45:36,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085955217] [2022-12-12 21:45:36,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085955217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:45:36,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:45:36,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 21:45:36,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522974407] [2022-12-12 21:45:36,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:45:36,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 21:45:36,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:45:36,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 21:45:36,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-12 21:45:36,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:45:36,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 1523 transitions, 60298 flow. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 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 21:45:36,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:45:36,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:45:36,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:45:45,555 INFO L130 PetriNetUnfolder]: 17839/28612 cut-off events. [2022-12-12 21:45:45,555 INFO L131 PetriNetUnfolder]: For 328449/328449 co-relation queries the response was YES. [2022-12-12 21:45:45,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488241 conditions, 28612 events. 17839/28612 cut-off events. For 328449/328449 co-relation queries the response was YES. Maximal size of possible extension queue 1900. Compared 222099 event pairs, 48 based on Foata normal form. 81/21943 useless extension candidates. Maximal degree in co-relation 488172. Up to 27938 conditions per place. [2022-12-12 21:45:45,870 INFO L137 encePairwiseOnDemand]: 64/74 looper letters, 1295 selfloop transitions, 142 changer transitions 149/1609 dead transitions. [2022-12-12 21:45:45,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 1609 transitions, 66916 flow [2022-12-12 21:45:45,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 21:45:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 21:45:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2022-12-12 21:45:45,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3138138138138138 [2022-12-12 21:45:45,872 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 49 predicate places. [2022-12-12 21:45:45,872 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 1609 transitions, 66916 flow [2022-12-12 21:45:46,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 1460 transitions, 60646 flow [2022-12-12 21:45:46,087 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 1460 transitions, 60646 flow [2022-12-12 21:45:46,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 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 21:45:46,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:45:46,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:45:46,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-12 21:45:46,088 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:45:46,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:45:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash 152901297, now seen corresponding path program 2 times [2022-12-12 21:45:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:45:46,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331923752] [2022-12-12 21:45:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:45:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:45:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:45:47,815 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 21:45:47,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:45:47,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331923752] [2022-12-12 21:45:47,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331923752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:45:47,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:45:47,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 21:45:47,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253351910] [2022-12-12 21:45:47,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:45:47,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 21:45:47,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:45:47,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 21:45:47,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-12 21:45:47,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-12 21:45:47,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 1460 transitions, 60646 flow. Second operand has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 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 21:45:47,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:45:47,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-12 21:45:47,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:45:58,880 INFO L130 PetriNetUnfolder]: 21662/35301 cut-off events. [2022-12-12 21:45:58,880 INFO L131 PetriNetUnfolder]: For 419495/419495 co-relation queries the response was YES. [2022-12-12 21:45:59,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631473 conditions, 35301 events. 21662/35301 cut-off events. For 419495/419495 co-relation queries the response was YES. Maximal size of possible extension queue 2245. Compared 288930 event pairs, 44 based on Foata normal form. 162/27039 useless extension candidates. Maximal degree in co-relation 631401. Up to 34604 conditions per place. [2022-12-12 21:45:59,255 INFO L137 encePairwiseOnDemand]: 65/74 looper letters, 1523 selfloop transitions, 248 changer transitions 119/1913 dead transitions. [2022-12-12 21:45:59,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 1913 transitions, 83452 flow [2022-12-12 21:45:59,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 21:45:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 21:45:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2022-12-12 21:45:59,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35435435435435436 [2022-12-12 21:45:59,257 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, 51 predicate places. [2022-12-12 21:45:59,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 1913 transitions, 83452 flow [2022-12-12 21:45:59,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 1794 transitions, 78207 flow [2022-12-12 21:45:59,523 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 1794 transitions, 78207 flow [2022-12-12 21:45:59,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 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 21:45:59,523 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:45:59,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:45:59,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-12 21:45:59,524 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:45:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:45:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash 890530257, now seen corresponding path program 3 times [2022-12-12 21:45:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:45:59,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491531384] [2022-12-12 21:45:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:45:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:45:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:45:59,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:45:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:45:59,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:45:59,640 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:45:59,640 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 21:45:59,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 21:45:59,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 21:45:59,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 21:45:59,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 21:45:59,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 21:45:59,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 21:45:59,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-12 21:45:59,645 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:45:59,649 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:45:59,649 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:45:59,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:45:59 BasicIcfg [2022-12-12 21:45:59,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:45:59,727 INFO L158 Benchmark]: Toolchain (without parser) took 148402.11ms. Allocated memory was 179.3MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 152.6MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-12 21:45:59,727 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory was 155.4MB in the beginning and 155.2MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:45:59,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.89ms. Allocated memory is still 179.3MB. Free memory was 152.1MB in the beginning and 122.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-12 21:45:59,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.51ms. Allocated memory is still 179.3MB. Free memory was 122.7MB in the beginning and 120.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:45:59,727 INFO L158 Benchmark]: Boogie Preprocessor took 55.62ms. Allocated memory is still 179.3MB. Free memory was 120.1MB in the beginning and 117.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:45:59,728 INFO L158 Benchmark]: RCFGBuilder took 934.97ms. Allocated memory was 179.3MB in the beginning and 245.4MB in the end (delta: 66.1MB). Free memory was 117.5MB in the beginning and 161.4MB in the end (delta: -43.9MB). Peak memory consumption was 39.0MB. Max. memory is 8.0GB. [2022-12-12 21:45:59,728 INFO L158 Benchmark]: TraceAbstraction took 146842.94ms. Allocated memory was 245.4MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 160.3MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-12 21:45:59,732 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.09ms. Allocated memory is still 179.3MB. Free memory was 155.4MB in the beginning and 155.2MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 514.89ms. Allocated memory is still 179.3MB. Free memory was 152.1MB in the beginning and 122.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.51ms. Allocated memory is still 179.3MB. Free memory was 122.7MB in the beginning and 120.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.62ms. Allocated memory is still 179.3MB. Free memory was 120.1MB in the beginning and 117.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 934.97ms. Allocated memory was 179.3MB in the beginning and 245.4MB in the end (delta: 66.1MB). Free memory was 117.5MB in the beginning and 161.4MB in the end (delta: -43.9MB). Peak memory consumption was 39.0MB. Max. memory is 8.0GB. * TraceAbstraction took 146842.94ms. Allocated memory was 245.4MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 160.3MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2s, 153 PlacesBefore, 86 PlacesAfterwards, 142 TransitionsBefore, 74 TransitionsAfterwards, 2664 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 52 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4554, independent: 4423, independent conditional: 4423, independent unconditional: 0, dependent: 131, dependent conditional: 131, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4554, independent: 4423, independent conditional: 0, independent unconditional: 4423, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4554, independent: 4423, independent conditional: 0, independent unconditional: 4423, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4554, independent: 4423, independent conditional: 0, independent unconditional: 4423, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2378, independent: 2323, independent conditional: 0, independent unconditional: 2323, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2378, independent: 2301, independent conditional: 0, independent unconditional: 2301, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 435, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 416, dependent conditional: 0, dependent unconditional: 416, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4554, independent: 2100, independent conditional: 0, independent unconditional: 2100, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 2378, unknown conditional: 0, unknown unconditional: 2378] , Statistics on independence cache: Total cache size (in pairs): 5078, Positive cache size: 5023, Positive conditional cache size: 0, Positive unconditional cache size: 5023, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2421, ((void *)0), P0, ((void *)0))=-3, t2421={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L886] 0 pthread_t t2422; [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2422, ((void *)0), P1, ((void *)0))=-2, t2421={7:0}, t2422={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L888] 0 pthread_t t2423; [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2423, ((void *)0), P2, ((void *)0))=-1, t2421={7:0}, t2422={8:0}, t2423={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L890] 0 pthread_t t2424; [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2424, ((void *)0), P3, ((void *)0))=0, t2421={7:0}, t2422={8:0}, t2423={9:0}, t2424={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] 2 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 \read(x) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 \read(x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L859] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L771] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 1 x$flush_delayed = weak$$choice2 [L774] EXPR 1 \read(x) [L774] 1 x$mem_tmp = x [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] EXPR 1 \read(x) [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L776] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L777] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L778] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L779] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L781] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 1 \read(x) [L782] 1 __unbuffered_p0_EBX = x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] EXPR 1 \read(x) [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] 1 x = x$flush_delayed ? x$mem_tmp : x [L784] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, 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$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, 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$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L852] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, 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, t2421={7:0}, t2422={8:0}, t2423={9:0}, t2424={5:0}, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L908] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: 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: 887]: 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: 885]: 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: 891]: 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: 889]: 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, 179 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 3.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 146.7s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 112.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1341 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1341 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 409 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5652 IncrementalHoareTripleChecker+Invalid, 6061 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 409 mSolverCounterUnsat, 1 mSDtfsCounter, 5652 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78207occurred in iteration=21, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 109416 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 8454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 21:45:59,750 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...