/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 20:53:19,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 20:53:19,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 20:53:19,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 20:53:19,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 20:53:19,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 20:53:19,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 20:53:19,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 20:53:19,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 20:53:19,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 20:53:19,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 20:53:19,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 20:53:19,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 20:53:19,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 20:53:19,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 20:53:19,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 20:53:19,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 20:53:19,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 20:53:19,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 20:53:19,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 20:53:19,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 20:53:19,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 20:53:19,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 20:53:19,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 20:53:19,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 20:53:19,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 20:53:19,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 20:53:19,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 20:53:19,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 20:53:19,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 20:53:19,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 20:53:19,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 20:53:19,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 20:53:19,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 20:53:19,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 20:53:19,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 20:53:19,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 20:53:19,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 20:53:19,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 20:53:19,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 20:53:19,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 20:53:19,332 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-NoLbe.epf [2022-12-11 20:53:19,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 20:53:19,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 20:53:19,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 20:53:19,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 20:53:19,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 20:53:19,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 20:53:19,375 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 20:53:19,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 20:53:19,376 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 20:53:19,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 20:53:19,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 20:53:19,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 20:53:19,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 20:53:19,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 20:53:19,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 20:53:19,377 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 20:53:19,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 20:53:19,377 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 20:53:19,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 20:53:19,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 20:53:19,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 20:53:19,378 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 20:53:19,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 20:53:19,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:53:19,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 20:53:19,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 20:53:19,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 20:53:19,379 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 20:53:19,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 20:53:19,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 20:53:19,379 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 20:53:19,379 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 20:53:19,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 20:53:19,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 20:53:19,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 20:53:19,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 20:53:19,711 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 20:53:19,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2022-12-11 20:53:20,781 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 20:53:21,072 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 20:53:21,072 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2022-12-11 20:53:21,087 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0348722/98c8711a2c8d4f97abeee1c4ab3c34f3/FLAG978e2e3e9 [2022-12-11 20:53:21,116 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0348722/98c8711a2c8d4f97abeee1c4ab3c34f3 [2022-12-11 20:53:21,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 20:53:21,120 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 20:53:21,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 20:53:21,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 20:53:21,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 20:53:21,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a85b6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21, skipping insertion in model container [2022-12-11 20:53:21,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 20:53:21,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 20:53:21,387 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/mix014.opt.i[944,957] [2022-12-11 20:53:21,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:53:21,649 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 20:53:21,662 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/mix014.opt.i[944,957] [2022-12-11 20:53:21,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:53:21,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:53:21,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:53:21,764 INFO L208 MainTranslator]: Completed translation [2022-12-11 20:53:21,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21 WrapperNode [2022-12-11 20:53:21,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 20:53:21,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 20:53:21,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 20:53:21,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 20:53:21,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,795 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,822 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-11 20:53:21,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 20:53:21,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 20:53:21,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 20:53:21,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 20:53:21,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,858 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 20:53:21,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 20:53:21,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 20:53:21,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 20:53:21,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (1/1) ... [2022-12-11 20:53:21,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:53:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:53:21,893 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-11 20:53:21,899 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-11 20:53:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 20:53:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 20:53:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 20:53:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 20:53:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 20:53:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 20:53:21,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 20:53:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 20:53:21,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 20:53:21,929 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 20:53:21,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 20:53:21,929 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 20:53:21,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 20:53:21,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 20:53:21,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 20:53:21,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 20:53:21,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 20:53:21,932 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 20:53:22,119 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 20:53:22,124 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 20:53:22,439 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 20:53:22,584 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 20:53:22,584 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 20:53:22,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:53:22 BoogieIcfgContainer [2022-12-11 20:53:22,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 20:53:22,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 20:53:22,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 20:53:22,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 20:53:22,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 08:53:21" (1/3) ... [2022-12-11 20:53:22,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe075cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:53:22, skipping insertion in model container [2022-12-11 20:53:22,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:53:21" (2/3) ... [2022-12-11 20:53:22,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe075cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:53:22, skipping insertion in model container [2022-12-11 20:53:22,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:53:22" (3/3) ... [2022-12-11 20:53:22,597 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014.opt.i [2022-12-11 20:53:22,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 20:53:22,645 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 20:53:22,645 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 20:53:22,730 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 20:53:22,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-11 20:53:22,813 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-11 20:53:22,814 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:53:22,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 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/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-11 20:53:22,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-11 20:53:22,826 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-11 20:53:22,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 20:53:22,847 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;@af3e966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 20:53:22,847 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 20:53:22,877 INFO L130 PetriNetUnfolder]: 0/88 cut-off events. [2022-12-11 20:53:22,878 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:53:22,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:22,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:22,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:22,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1530790059, now seen corresponding path program 1 times [2022-12-11 20:53:22,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:22,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839255803] [2022-12-11 20:53:22,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:23,563 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-11 20:53:23,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:23,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839255803] [2022-12-11 20:53:23,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839255803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:23,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:23,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 20:53:23,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448527964] [2022-12-11 20:53:23,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:23,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 20:53:23,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:23,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 20:53:23,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 20:53:23,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 130 [2022-12-11 20:53:23,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-11 20:53:23,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:23,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 130 [2022-12-11 20:53:23,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:23,741 INFO L130 PetriNetUnfolder]: 14/165 cut-off events. [2022-12-11 20:53:23,742 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-11 20:53:23,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 165 events. 14/165 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 286 event pairs, 2 based on Foata normal form. 7/163 useless extension candidates. Maximal degree in co-relation 160. Up to 25 conditions per place. [2022-12-11 20:53:23,746 INFO L137 encePairwiseOnDemand]: 125/130 looper letters, 10 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2022-12-11 20:53:23,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 124 transitions, 284 flow [2022-12-11 20:53:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 20:53:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 20:53:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2022-12-11 20:53:23,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2022-12-11 20:53:23,770 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 0 predicate places. [2022-12-11 20:53:23,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 124 transitions, 284 flow [2022-12-11 20:53:23,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 124 transitions, 284 flow [2022-12-11 20:53:23,777 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 124 transitions, 284 flow [2022-12-11 20:53:23,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-11 20:53:23,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:23,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:23,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 20:53:23,779 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:23,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1633586134, now seen corresponding path program 1 times [2022-12-11 20:53:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:23,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276728620] [2022-12-11 20:53:23,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:23,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:24,288 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-11 20:53:24,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:24,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276728620] [2022-12-11 20:53:24,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276728620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:24,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:24,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:53:24,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830914135] [2022-12-11 20:53:24,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:24,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:53:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:24,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:53:24,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:53:24,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2022-12-11 20:53:24,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 124 transitions, 284 flow. Second operand has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 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-11 20:53:24,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:24,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2022-12-11 20:53:24,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:25,649 INFO L130 PetriNetUnfolder]: 2586/6074 cut-off events. [2022-12-11 20:53:25,649 INFO L131 PetriNetUnfolder]: For 1021/2184 co-relation queries the response was YES. [2022-12-11 20:53:25,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11170 conditions, 6074 events. 2586/6074 cut-off events. For 1021/2184 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 53831 event pairs, 344 based on Foata normal form. 2/5941 useless extension candidates. Maximal degree in co-relation 11105. Up to 1411 conditions per place. [2022-12-11 20:53:25,691 INFO L137 encePairwiseOnDemand]: 116/130 looper letters, 35 selfloop transitions, 10 changer transitions 90/219 dead transitions. [2022-12-11 20:53:25,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 219 transitions, 780 flow [2022-12-11 20:53:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:53:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:53:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1409 transitions. [2022-12-11 20:53:25,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8337278106508875 [2022-12-11 20:53:25,698 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 12 predicate places. [2022-12-11 20:53:25,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 219 transitions, 780 flow [2022-12-11 20:53:25,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 129 transitions, 394 flow [2022-12-11 20:53:25,717 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 129 transitions, 394 flow [2022-12-11 20:53:25,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 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-11 20:53:25,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:25,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:25,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 20:53:25,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:25,719 INFO L85 PathProgramCache]: Analyzing trace with hash 412014670, now seen corresponding path program 1 times [2022-12-11 20:53:25,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:25,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140687336] [2022-12-11 20:53:25,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:25,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:26,113 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-11 20:53:26,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:26,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140687336] [2022-12-11 20:53:26,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140687336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:26,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:26,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:53:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772508093] [2022-12-11 20:53:26,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:26,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:53:26,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:26,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:53:26,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:53:26,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2022-12-11 20:53:26,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 129 transitions, 394 flow. Second operand has 7 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 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-11 20:53:26,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:26,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2022-12-11 20:53:26,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:26,874 INFO L130 PetriNetUnfolder]: 1413/3202 cut-off events. [2022-12-11 20:53:26,874 INFO L131 PetriNetUnfolder]: For 1032/5639 co-relation queries the response was YES. [2022-12-11 20:53:26,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8350 conditions, 3202 events. 1413/3202 cut-off events. For 1032/5639 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 24187 event pairs, 158 based on Foata normal form. 74/3178 useless extension candidates. Maximal degree in co-relation 8276. Up to 1439 conditions per place. [2022-12-11 20:53:26,896 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 59 selfloop transitions, 13 changer transitions 73/229 dead transitions. [2022-12-11 20:53:26,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 229 transitions, 1188 flow [2022-12-11 20:53:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:53:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:53:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1393 transitions. [2022-12-11 20:53:26,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8242603550295858 [2022-12-11 20:53:26,904 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 3 predicate places. [2022-12-11 20:53:26,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 229 transitions, 1188 flow [2022-12-11 20:53:26,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 156 transitions, 702 flow [2022-12-11 20:53:26,933 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 156 transitions, 702 flow [2022-12-11 20:53:26,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 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-11 20:53:26,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:26,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:26,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 20:53:26,934 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash 939741541, now seen corresponding path program 1 times [2022-12-11 20:53:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:26,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020093414] [2022-12-11 20:53:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:26,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:27,233 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-11 20:53:27,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:27,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020093414] [2022-12-11 20:53:27,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020093414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:27,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:27,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:53:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308966493] [2022-12-11 20:53:27,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:27,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:53:27,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:27,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:53:27,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:53:27,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 130 [2022-12-11 20:53:27,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 156 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 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-11 20:53:27,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:27,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 130 [2022-12-11 20:53:27,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:29,676 INFO L130 PetriNetUnfolder]: 9984/17052 cut-off events. [2022-12-11 20:53:29,676 INFO L131 PetriNetUnfolder]: For 27538/30542 co-relation queries the response was YES. [2022-12-11 20:53:29,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48896 conditions, 17052 events. 9984/17052 cut-off events. For 27538/30542 co-relation queries the response was YES. Maximal size of possible extension queue 1248. Compared 141858 event pairs, 373 based on Foata normal form. 16/16104 useless extension candidates. Maximal degree in co-relation 48818. Up to 5555 conditions per place. [2022-12-11 20:53:29,838 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 168 selfloop transitions, 20 changer transitions 46/340 dead transitions. [2022-12-11 20:53:29,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 340 transitions, 2441 flow [2022-12-11 20:53:29,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 20:53:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 20:53:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1141 transitions. [2022-12-11 20:53:29,842 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8776923076923077 [2022-12-11 20:53:29,844 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 3 predicate places. [2022-12-11 20:53:29,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 340 transitions, 2441 flow [2022-12-11 20:53:29,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 294 transitions, 1993 flow [2022-12-11 20:53:29,913 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 294 transitions, 1993 flow [2022-12-11 20:53:29,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 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-11 20:53:29,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:29,914 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:29,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 20:53:29,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:29,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1948950592, now seen corresponding path program 1 times [2022-12-11 20:53:29,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:29,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406097248] [2022-12-11 20:53:29,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:29,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:30,225 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-11 20:53:30,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:30,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406097248] [2022-12-11 20:53:30,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406097248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:30,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:30,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:53:30,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767536982] [2022-12-11 20:53:30,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:30,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:53:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:30,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:53:30,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:53:30,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 130 [2022-12-11 20:53:30,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 294 transitions, 1993 flow. Second operand has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 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-11 20:53:30,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:30,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 130 [2022-12-11 20:53:30,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:32,498 INFO L130 PetriNetUnfolder]: 7956/15754 cut-off events. [2022-12-11 20:53:32,499 INFO L131 PetriNetUnfolder]: For 24084/31162 co-relation queries the response was YES. [2022-12-11 20:53:32,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52483 conditions, 15754 events. 7956/15754 cut-off events. For 24084/31162 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 152728 event pairs, 202 based on Foata normal form. 1579/16635 useless extension candidates. Maximal degree in co-relation 52401. Up to 5172 conditions per place. [2022-12-11 20:53:32,604 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 354 selfloop transitions, 50 changer transitions 22/532 dead transitions. [2022-12-11 20:53:32,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 532 transitions, 4910 flow [2022-12-11 20:53:32,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:53:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:53:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1487 transitions. [2022-12-11 20:53:32,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8798816568047337 [2022-12-11 20:53:32,609 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 15 predicate places. [2022-12-11 20:53:32,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 532 transitions, 4910 flow [2022-12-11 20:53:32,668 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 510 transitions, 4658 flow [2022-12-11 20:53:32,668 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 510 transitions, 4658 flow [2022-12-11 20:53:32,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 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-11 20:53:32,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:32,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:32,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 20:53:32,670 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:32,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:32,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1015583848, now seen corresponding path program 1 times [2022-12-11 20:53:32,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:32,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128490724] [2022-12-11 20:53:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:32,915 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-11 20:53:32,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:32,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128490724] [2022-12-11 20:53:32,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128490724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:32,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:32,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 20:53:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170382228] [2022-12-11 20:53:32,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:32,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 20:53:32,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 20:53:32,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 20:53:32,918 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 130 [2022-12-11 20:53:32,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 510 transitions, 4658 flow. Second operand has 8 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 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-11 20:53:32,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:32,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 130 [2022-12-11 20:53:32,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:35,333 INFO L130 PetriNetUnfolder]: 7076/14811 cut-off events. [2022-12-11 20:53:35,333 INFO L131 PetriNetUnfolder]: For 24447/30736 co-relation queries the response was YES. [2022-12-11 20:53:35,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58961 conditions, 14811 events. 7076/14811 cut-off events. For 24447/30736 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 149352 event pairs, 147 based on Foata normal form. 1373/15672 useless extension candidates. Maximal degree in co-relation 58875. Up to 4497 conditions per place. [2022-12-11 20:53:35,446 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 375 selfloop transitions, 100 changer transitions 128/709 dead transitions. [2022-12-11 20:53:35,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 709 transitions, 7808 flow [2022-12-11 20:53:35,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 20:53:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 20:53:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1830 transitions. [2022-12-11 20:53:35,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8798076923076923 [2022-12-11 20:53:35,455 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 30 predicate places. [2022-12-11 20:53:35,457 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 709 transitions, 7808 flow [2022-12-11 20:53:35,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 581 transitions, 6268 flow [2022-12-11 20:53:35,516 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 581 transitions, 6268 flow [2022-12-11 20:53:35,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 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-11 20:53:35,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:35,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:35,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 20:53:35,518 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:35,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:35,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1958809644, now seen corresponding path program 1 times [2022-12-11 20:53:35,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:35,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412087775] [2022-12-11 20:53:35,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:35,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:36,227 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-11 20:53:36,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:36,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412087775] [2022-12-11 20:53:36,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412087775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:36,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:36,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 20:53:36,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175658388] [2022-12-11 20:53:36,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:36,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 20:53:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:36,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 20:53:36,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-11 20:53:36,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 130 [2022-12-11 20:53:36,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 581 transitions, 6268 flow. Second operand has 10 states, 10 states have (on average 96.1) internal successors, (961), 10 states have internal predecessors, (961), 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-11 20:53:36,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:36,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 130 [2022-12-11 20:53:36,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:39,179 INFO L130 PetriNetUnfolder]: 10124/22045 cut-off events. [2022-12-11 20:53:39,179 INFO L131 PetriNetUnfolder]: For 51115/59292 co-relation queries the response was YES. [2022-12-11 20:53:39,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91871 conditions, 22045 events. 10124/22045 cut-off events. For 51115/59292 co-relation queries the response was YES. Maximal size of possible extension queue 1451. Compared 236610 event pairs, 123 based on Foata normal form. 636/22328 useless extension candidates. Maximal degree in co-relation 91771. Up to 6275 conditions per place. [2022-12-11 20:53:39,528 INFO L137 encePairwiseOnDemand]: 111/130 looper letters, 473 selfloop transitions, 381 changer transitions 121/1164 dead transitions. [2022-12-11 20:53:39,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1164 transitions, 15951 flow [2022-12-11 20:53:39,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 20:53:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 20:53:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1707 transitions. [2022-12-11 20:53:39,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7723981900452489 [2022-12-11 20:53:39,533 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 46 predicate places. [2022-12-11 20:53:39,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 1164 transitions, 15951 flow [2022-12-11 20:53:39,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 1043 transitions, 14223 flow [2022-12-11 20:53:39,615 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 1043 transitions, 14223 flow [2022-12-11 20:53:39,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.1) internal successors, (961), 10 states have internal predecessors, (961), 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-11 20:53:39,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:39,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:39,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 20:53:39,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:39,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:39,617 INFO L85 PathProgramCache]: Analyzing trace with hash 225882532, now seen corresponding path program 2 times [2022-12-11 20:53:39,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:39,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796168213] [2022-12-11 20:53:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:39,902 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-11 20:53:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:39,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796168213] [2022-12-11 20:53:39,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796168213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:39,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:39,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 20:53:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369858733] [2022-12-11 20:53:39,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:39,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 20:53:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:39,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 20:53:39,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 20:53:39,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2022-12-11 20:53:39,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 1043 transitions, 14223 flow. Second operand has 8 states, 8 states have (on average 100.375) internal successors, (803), 8 states have internal predecessors, (803), 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-11 20:53:39,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:39,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2022-12-11 20:53:39,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:42,617 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([383] L758-->L763: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][656], [70#L809true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 118#L763true, 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 5#L773true, 57#L3true, 208#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 277#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= ~a~0 0))), 74#L845true, 231#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 303#(and (= ~a~0 1) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 257#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 144#true]) [2022-12-11 20:53:42,618 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 20:53:42,618 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:53:42,618 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:53:42,618 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:53:42,818 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([383] L758-->L763: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][656], [P3Thread1of1ForFork2InUse, 70#L809true, P1Thread1of1ForFork3InUse, 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 118#L763true, P0Thread1of1ForFork1InUse, 87#L776true, P2Thread1of1ForFork0InUse, 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 57#L3true, 208#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 277#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= ~a~0 0))), 74#L845true, 231#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 303#(and (= ~a~0 1) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 257#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 144#true]) [2022-12-11 20:53:42,818 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:53:42,818 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:42,818 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:42,818 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:42,837 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([383] L758-->L763: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][656], [130#L3-1true, 70#L809true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork1InUse, 118#L763true, P2Thread1of1ForFork0InUse, 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 5#L773true, 208#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 277#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= ~a~0 0))), 74#L845true, 231#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 303#(and (= ~a~0 1) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 257#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 144#true]) [2022-12-11 20:53:42,837 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:53:42,837 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:42,837 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:42,837 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:43,121 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([383] L758-->L763: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][656], [130#L3-1true, P3Thread1of1ForFork2InUse, 70#L809true, P1Thread1of1ForFork3InUse, 118#L763true, 173#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork1InUse, 87#L776true, P2Thread1of1ForFork0InUse, 150#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 208#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 277#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= ~a~0 0))), 74#L845true, 231#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 303#(and (= ~a~0 1) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 257#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 144#true]) [2022-12-11 20:53:43,121 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 20:53:43,121 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:53:43,121 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:53:43,121 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:53:43,539 INFO L130 PetriNetUnfolder]: 12631/27963 cut-off events. [2022-12-11 20:53:43,539 INFO L131 PetriNetUnfolder]: For 84536/102475 co-relation queries the response was YES. [2022-12-11 20:53:43,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120773 conditions, 27963 events. 12631/27963 cut-off events. For 84536/102475 co-relation queries the response was YES. Maximal size of possible extension queue 2132. Compared 321037 event pairs, 128 based on Foata normal form. 2929/30412 useless extension candidates. Maximal degree in co-relation 120663. Up to 8968 conditions per place. [2022-12-11 20:53:43,758 INFO L137 encePairwiseOnDemand]: 113/130 looper letters, 597 selfloop transitions, 201 changer transitions 217/1208 dead transitions. [2022-12-11 20:53:43,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 1208 transitions, 18725 flow [2022-12-11 20:53:43,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 20:53:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 20:53:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 969 transitions. [2022-12-11 20:53:43,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8282051282051283 [2022-12-11 20:53:43,762 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 48 predicate places. [2022-12-11 20:53:43,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 1208 transitions, 18725 flow [2022-12-11 20:53:43,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 991 transitions, 14923 flow [2022-12-11 20:53:43,841 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 991 transitions, 14923 flow [2022-12-11 20:53:43,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.375) internal successors, (803), 8 states have internal predecessors, (803), 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-11 20:53:43,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:43,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:43,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 20:53:43,842 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:43,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2083749800, now seen corresponding path program 3 times [2022-12-11 20:53:43,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:43,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249122499] [2022-12-11 20:53:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:44,037 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-11 20:53:44,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:44,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249122499] [2022-12-11 20:53:44,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249122499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:44,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:44,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:53:44,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068269060] [2022-12-11 20:53:44,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:44,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:53:44,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:44,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:53:44,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:53:44,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 130 [2022-12-11 20:53:44,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 991 transitions, 14923 flow. Second operand has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 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-11 20:53:44,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:44,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 130 [2022-12-11 20:53:44,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:46,569 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L776-->L781: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][478], [60#L758true, 170#true, 132#L781true, 193#true, 229#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 70#L809true, P3Thread1of1ForFork2InUse, 312#true, P1Thread1of1ForFork3InUse, 100#L852true, P0Thread1of1ForFork1InUse, 267#(not (= ~a~0 0)), P2Thread1of1ForFork0InUse, 147#true, 255#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 31#L880true, 296#(= ~a~0 1), 144#true]) [2022-12-11 20:53:46,569 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 20:53:46,569 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:53:46,569 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:53:46,570 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:53:46,574 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L776-->L781: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][810], [60#L758true, 30#L855true, 170#true, 132#L781true, 193#true, 70#L809true, P3Thread1of1ForFork2InUse, 312#true, 213#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 267#(not (= ~a~0 0)), 237#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, 147#true, 296#(= ~a~0 1), 144#true, 92#L879true]) [2022-12-11 20:53:46,574 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 20:53:46,574 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:53:46,574 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:53:46,574 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:53:46,720 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L776-->L781: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][478], [60#L758true, 132#L781true, 170#true, 193#true, 229#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 70#L809true, P3Thread1of1ForFork2InUse, 312#true, P1Thread1of1ForFork3InUse, 100#L852true, P0Thread1of1ForFork1InUse, 267#(not (= ~a~0 0)), P2Thread1of1ForFork0InUse, 69#L2true, 147#true, 255#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 296#(= ~a~0 1), 144#true]) [2022-12-11 20:53:46,720 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:53:46,720 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:46,720 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:46,720 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:46,721 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L776-->L781: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][886], [60#L758true, 30#L855true, 170#true, 132#L781true, 193#true, 229#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 70#L809true, P3Thread1of1ForFork2InUse, 312#true, 259#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 267#(not (= ~a~0 0)), P2Thread1of1ForFork0InUse, 147#true, 31#L880true, 296#(= ~a~0 1), 144#true]) [2022-12-11 20:53:46,721 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:53:46,721 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:46,721 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:46,721 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:53:46,823 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L776-->L781: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][654], [60#L758true, 170#true, 132#L781true, 193#true, 70#L809true, P3Thread1of1ForFork2InUse, 312#true, P1Thread1of1ForFork3InUse, 100#L852true, P0Thread1of1ForFork1InUse, 267#(not (= ~a~0 0)), P2Thread1of1ForFork0InUse, 57#L3true, 147#true, 231#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 257#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 296#(= ~a~0 1), 144#true]) [2022-12-11 20:53:46,823 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 20:53:46,823 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:53:46,823 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:53:46,823 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:53:46,823 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L776-->L781: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][886], [60#L758true, 30#L855true, 170#true, 132#L781true, 193#true, 229#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 70#L809true, P3Thread1of1ForFork2InUse, 312#true, 259#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 267#(not (= ~a~0 0)), P2Thread1of1ForFork0InUse, 69#L2true, 147#true, 296#(= ~a~0 1), 144#true]) [2022-12-11 20:53:46,823 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 20:53:46,823 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:53:46,824 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:53:46,824 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:53:46,883 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L776-->L781: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][751], [60#L758true, 130#L3-1true, 132#L781true, 170#true, 70#L809true, P3Thread1of1ForFork2InUse, 312#true, P1Thread1of1ForFork3InUse, 100#L852true, P0Thread1of1ForFork1InUse, 267#(not (= ~a~0 0)), P2Thread1of1ForFork0InUse, 147#true, 231#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 257#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 198#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 296#(= ~a~0 1), 144#true]) [2022-12-11 20:53:46,884 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-11 20:53:46,884 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 20:53:46,884 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 20:53:46,884 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 20:53:46,884 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L776-->L781: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][1045], [60#L758true, 30#L855true, 132#L781true, 170#true, 193#true, 70#L809true, P3Thread1of1ForFork2InUse, 312#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 267#(not (= ~a~0 0)), P2Thread1of1ForFork0InUse, 57#L3true, 147#true, 231#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 296#(= ~a~0 1), 144#true, 261#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 20:53:46,884 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-11 20:53:46,884 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 20:53:46,884 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 20:53:46,884 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 20:53:46,929 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L776-->L781: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][1096], [60#L758true, 130#L3-1true, 30#L855true, 132#L781true, 170#true, 70#L809true, P3Thread1of1ForFork2InUse, 312#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 267#(not (= ~a~0 0)), P2Thread1of1ForFork0InUse, 147#true, 231#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 198#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 296#(= ~a~0 1), 144#true, 261#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 20:53:46,930 INFO L382 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-12-11 20:53:46,930 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-11 20:53:46,930 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-11 20:53:46,930 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-11 20:53:47,082 INFO L130 PetriNetUnfolder]: 10803/23930 cut-off events. [2022-12-11 20:53:47,082 INFO L131 PetriNetUnfolder]: For 116354/135702 co-relation queries the response was YES. [2022-12-11 20:53:47,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111371 conditions, 23930 events. 10803/23930 cut-off events. For 116354/135702 co-relation queries the response was YES. Maximal size of possible extension queue 1913. Compared 268922 event pairs, 154 based on Foata normal form. 1326/24729 useless extension candidates. Maximal degree in co-relation 111257. Up to 7653 conditions per place. [2022-12-11 20:53:47,514 INFO L137 encePairwiseOnDemand]: 124/130 looper letters, 616 selfloop transitions, 17 changer transitions 415/1254 dead transitions. [2022-12-11 20:53:47,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1254 transitions, 21633 flow [2022-12-11 20:53:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 20:53:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 20:53:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 680 transitions. [2022-12-11 20:53:47,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2022-12-11 20:53:47,530 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 50 predicate places. [2022-12-11 20:53:47,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 1254 transitions, 21633 flow [2022-12-11 20:53:47,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 839 transitions, 13617 flow [2022-12-11 20:53:47,587 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 839 transitions, 13617 flow [2022-12-11 20:53:47,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 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-11 20:53:47,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:47,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:47,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 20:53:47,588 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:47,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2064361186, now seen corresponding path program 4 times [2022-12-11 20:53:47,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:47,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763971498] [2022-12-11 20:53:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:47,831 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-11 20:53:47,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:47,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763971498] [2022-12-11 20:53:47,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763971498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:47,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:47,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 20:53:47,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120873491] [2022-12-11 20:53:47,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:47,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 20:53:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:47,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 20:53:47,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 20:53:47,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 130 [2022-12-11 20:53:47,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 839 transitions, 13617 flow. Second operand has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 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-11 20:53:47,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:47,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 130 [2022-12-11 20:53:47,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:50,760 INFO L130 PetriNetUnfolder]: 6699/16595 cut-off events. [2022-12-11 20:53:50,760 INFO L131 PetriNetUnfolder]: For 74260/93454 co-relation queries the response was YES. [2022-12-11 20:53:50,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84875 conditions, 16595 events. 6699/16595 cut-off events. For 74260/93454 co-relation queries the response was YES. Maximal size of possible extension queue 1314. Compared 191322 event pairs, 113 based on Foata normal form. 2315/18612 useless extension candidates. Maximal degree in co-relation 84757. Up to 4619 conditions per place. [2022-12-11 20:53:50,878 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 114 selfloop transitions, 67 changer transitions 574/847 dead transitions. [2022-12-11 20:53:50,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 847 transitions, 15093 flow [2022-12-11 20:53:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 20:53:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 20:53:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2130 transitions. [2022-12-11 20:53:50,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8623481781376519 [2022-12-11 20:53:50,883 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 65 predicate places. [2022-12-11 20:53:50,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 847 transitions, 15093 flow [2022-12-11 20:53:50,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 273 transitions, 3344 flow [2022-12-11 20:53:50,910 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 273 transitions, 3344 flow [2022-12-11 20:53:50,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 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-11 20:53:50,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:50,911 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:50,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 20:53:50,911 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:50,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1058553012, now seen corresponding path program 1 times [2022-12-11 20:53:50,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:50,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526238644] [2022-12-11 20:53:50,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:50,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:53:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:51,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526238644] [2022-12-11 20:53:51,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526238644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:51,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:51,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 20:53:51,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996858847] [2022-12-11 20:53:51,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:51,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 20:53:51,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:51,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 20:53:51,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-11 20:53:51,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 130 [2022-12-11 20:53:51,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 273 transitions, 3344 flow. Second operand has 13 states, 13 states have (on average 101.92307692307692) internal successors, (1325), 13 states have internal predecessors, (1325), 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-11 20:53:51,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:51,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 130 [2022-12-11 20:53:51,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:52,493 INFO L130 PetriNetUnfolder]: 2122/6375 cut-off events. [2022-12-11 20:53:52,494 INFO L131 PetriNetUnfolder]: For 31868/36529 co-relation queries the response was YES. [2022-12-11 20:53:52,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30485 conditions, 6375 events. 2122/6375 cut-off events. For 31868/36529 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 68689 event pairs, 47 based on Foata normal form. 271/6597 useless extension candidates. Maximal degree in co-relation 30356. Up to 2333 conditions per place. [2022-12-11 20:53:52,542 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 34 selfloop transitions, 5 changer transitions 192/327 dead transitions. [2022-12-11 20:53:52,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 327 transitions, 4791 flow [2022-12-11 20:53:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 20:53:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 20:53:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1242 transitions. [2022-12-11 20:53:52,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7961538461538461 [2022-12-11 20:53:52,545 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 56 predicate places. [2022-12-11 20:53:52,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 327 transitions, 4791 flow [2022-12-11 20:53:52,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 135 transitions, 1178 flow [2022-12-11 20:53:52,556 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 135 transitions, 1178 flow [2022-12-11 20:53:52,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 101.92307692307692) internal successors, (1325), 13 states have internal predecessors, (1325), 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-11 20:53:52,556 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:52,556 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:52,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 20:53:52,557 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:52,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash 661453122, now seen corresponding path program 2 times [2022-12-11 20:53:52,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:52,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644597624] [2022-12-11 20:53:52,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:53:53,854 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-11 20:53:53,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:53:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644597624] [2022-12-11 20:53:53,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644597624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:53:53,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:53:53,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 20:53:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3338797] [2022-12-11 20:53:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:53:53,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 20:53:53,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:53:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 20:53:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-11 20:53:53,856 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 130 [2022-12-11 20:53:53,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 135 transitions, 1178 flow. Second operand has 13 states, 13 states have (on average 101.92307692307692) internal successors, (1325), 13 states have internal predecessors, (1325), 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-11 20:53:53,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:53:53,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 130 [2022-12-11 20:53:53,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:53:54,118 INFO L130 PetriNetUnfolder]: 121/499 cut-off events. [2022-12-11 20:53:54,118 INFO L131 PetriNetUnfolder]: For 3239/3321 co-relation queries the response was YES. [2022-12-11 20:53:54,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 499 events. 121/499 cut-off events. For 3239/3321 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2734 event pairs, 0 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 2129. Up to 200 conditions per place. [2022-12-11 20:53:54,121 INFO L137 encePairwiseOnDemand]: 116/130 looper letters, 18 selfloop transitions, 12 changer transitions 17/143 dead transitions. [2022-12-11 20:53:54,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 143 transitions, 1424 flow [2022-12-11 20:53:54,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 20:53:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 20:53:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1432 transitions. [2022-12-11 20:53:54,123 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7868131868131868 [2022-12-11 20:53:54,123 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 43 predicate places. [2022-12-11 20:53:54,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 143 transitions, 1424 flow [2022-12-11 20:53:54,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 126 transitions, 1022 flow [2022-12-11 20:53:54,125 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 126 transitions, 1022 flow [2022-12-11 20:53:54,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 101.92307692307692) internal successors, (1325), 13 states have internal predecessors, (1325), 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-11 20:53:54,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:53:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:54,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 20:53:54,126 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:53:54,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:53:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash 335086172, now seen corresponding path program 3 times [2022-12-11 20:53:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:53:54,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378135025] [2022-12-11 20:53:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:53:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:53:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:53:54,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 20:53:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:53:54,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 20:53:54,252 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 20:53:54,253 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 20:53:54,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 20:53:54,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 20:53:54,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 20:53:54,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 20:53:54,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 20:53:54,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 20:53:54,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 20:53:54,259 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1] [2022-12-11 20:53:54,264 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 20:53:54,264 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 20:53:54,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 08:53:54 BasicIcfg [2022-12-11 20:53:54,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 20:53:54,385 INFO L158 Benchmark]: Toolchain (without parser) took 33264.93ms. Allocated memory was 178.3MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 153.9MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-11 20:53:54,385 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 20:53:54,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.55ms. Allocated memory is still 178.3MB. Free memory was 153.9MB in the beginning and 124.8MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-11 20:53:54,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.64ms. Allocated memory is still 178.3MB. Free memory was 124.8MB in the beginning and 122.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 20:53:54,386 INFO L158 Benchmark]: Boogie Preprocessor took 39.45ms. Allocated memory is still 178.3MB. Free memory was 122.2MB in the beginning and 120.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 20:53:54,386 INFO L158 Benchmark]: RCFGBuilder took 724.95ms. Allocated memory is still 178.3MB. Free memory was 120.1MB in the beginning and 83.9MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-11 20:53:54,386 INFO L158 Benchmark]: TraceAbstraction took 31794.13ms. Allocated memory was 178.3MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 82.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-12-11 20:53:54,387 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.13ms. Allocated memory is still 178.3MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 645.55ms. Allocated memory is still 178.3MB. Free memory was 153.9MB in the beginning and 124.8MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.64ms. Allocated memory is still 178.3MB. Free memory was 124.8MB in the beginning and 122.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.45ms. Allocated memory is still 178.3MB. Free memory was 122.2MB in the beginning and 120.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 724.95ms. Allocated memory is still 178.3MB. Free memory was 120.1MB in the beginning and 83.9MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 31794.13ms. Allocated memory was 178.3MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 82.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L745] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L747] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] 0 pthread_t t357; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t357={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] FCALL, FORK 0 pthread_create(&t357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t357, ((void *)0), P0, ((void *)0))=-3, t357={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t358; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t357={5:0}, t358={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L872] FCALL, FORK 0 pthread_create(&t358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t358, ((void *)0), P1, ((void *)0))=-2, t357={5:0}, t358={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t359; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t357={5:0}, t358={6:0}, t359={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L874] FCALL, FORK 0 pthread_create(&t359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t359, ((void *)0), P2, ((void *)0))=-1, t357={5:0}, t358={6:0}, t359={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t360; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] FCALL, FORK 0 pthread_create(&t360, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t360, ((void *)0), P3, ((void *)0))=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 872]: 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: 870]: 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: 874]: 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, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.5s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 31.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 24.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1025 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1025 mSDsluCounter, 1041 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 854 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1863 IncrementalHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 187 mSDtfsCounter, 1863 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14923occurred in iteration=8, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 32422 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1198 NumberOfCodeBlocks, 1198 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1085 ConstructedInterpolants, 0 QuantifiedInterpolants, 6211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-11 20:53:54,405 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...