/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:39:42,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:39:42,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:39:42,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:39:42,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:39:42,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:39:42,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:39:42,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:39:42,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:39:42,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:39:42,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:39:42,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:39:42,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:39:42,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:39:42,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:39:42,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:39:42,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:39:42,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:39:42,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:39:42,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:39:42,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:39:42,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:39:42,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:39:42,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:39:42,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:39:42,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:39:42,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:39:42,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:39:42,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:39:42,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:39:42,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:39:42,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:39:42,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:39:42,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:39:42,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:39:42,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:39:42,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:39:42,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:39:42,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:39:42,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:39:42,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:39:42,759 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:39:42,779 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:39:42,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:39:42,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:39:42,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:39:42,781 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:39:42,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:39:42,781 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:39:42,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:39:42,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:39:42,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:39:42,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:39:42,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:39:42,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:39:42,782 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:39:42,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:39:42,783 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:39:42,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:39:42,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:39:42,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:39:42,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:39:42,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:39:42,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:39:42,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:39:42,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:39:42,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:39:42,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:39:42,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:39:42,784 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:39:42,784 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:39:43,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:39:43,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:39:43,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:39:43,072 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:39:43,072 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:39:43,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i [2022-12-06 06:39:44,428 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:39:44,676 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:39:44,677 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i [2022-12-06 06:39:44,688 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3abdb9ee2/02cc051f009e467f95d9f78225ab8dcf/FLAGa0126c98f [2022-12-06 06:39:44,708 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3abdb9ee2/02cc051f009e467f95d9f78225ab8dcf [2022-12-06 06:39:44,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:39:44,711 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:39:44,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:39:44,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:39:44,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:39:44,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:39:44" (1/1) ... [2022-12-06 06:39:44,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4025922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:44, skipping insertion in model container [2022-12-06 06:39:44,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:39:44" (1/1) ... [2022-12-06 06:39:44,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:39:44,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:39:44,918 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/safe016_power.opt.i[951,964] [2022-12-06 06:39:45,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:39:45,099 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:39:45,107 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/safe016_power.opt.i[951,964] [2022-12-06 06:39:45,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:45,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:45,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:39:45,185 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:39:45,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45 WrapperNode [2022-12-06 06:39:45,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:39:45,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:39:45,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:39:45,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:39:45,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (1/1) ... [2022-12-06 06:39:45,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (1/1) ... [2022-12-06 06:39:45,224 INFO L138 Inliner]: procedures = 177, calls = 91, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 181 [2022-12-06 06:39:45,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:39:45,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:39:45,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:39:45,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:39:45,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (1/1) ... [2022-12-06 06:39:45,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (1/1) ... [2022-12-06 06:39:45,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (1/1) ... [2022-12-06 06:39:45,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (1/1) ... [2022-12-06 06:39:45,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (1/1) ... [2022-12-06 06:39:45,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (1/1) ... [2022-12-06 06:39:45,252 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (1/1) ... [2022-12-06 06:39:45,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (1/1) ... [2022-12-06 06:39:45,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:39:45,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:39:45,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:39:45,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:39:45,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (1/1) ... [2022-12-06 06:39:45,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:39:45,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:39:45,293 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-06 06:39:45,304 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-06 06:39:45,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:39:45,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:39:45,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:39:45,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:39:45,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:39:45,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:39:45,325 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:39:45,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:39:45,326 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:39:45,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:39:45,326 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:39:45,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:39:45,326 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:39:45,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:39:45,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:39:45,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:39:45,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:39:45,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:39:45,329 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:39:45,506 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:39:45,507 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:39:45,868 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:39:46,130 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:39:46,131 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:39:46,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:39:46 BoogieIcfgContainer [2022-12-06 06:39:46,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:39:46,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:39:46,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:39:46,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:39:46,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:39:44" (1/3) ... [2022-12-06 06:39:46,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ff9729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:39:46, skipping insertion in model container [2022-12-06 06:39:46,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:45" (2/3) ... [2022-12-06 06:39:46,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ff9729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:39:46, skipping insertion in model container [2022-12-06 06:39:46,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:39:46" (3/3) ... [2022-12-06 06:39:46,139 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.opt.i [2022-12-06 06:39:46,152 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:39:46,153 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:39:46,153 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:39:46,213 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:39:46,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2022-12-06 06:39:46,308 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2022-12-06 06:39:46,308 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:39:46,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-06 06:39:46,314 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2022-12-06 06:39:46,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 126 transitions, 264 flow [2022-12-06 06:39:46,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:46,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 126 transitions, 264 flow [2022-12-06 06:39:46,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 126 transitions, 264 flow [2022-12-06 06:39:46,381 INFO L130 PetriNetUnfolder]: 1/126 cut-off events. [2022-12-06 06:39:46,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:39:46,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 1/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 06:39:46,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 126 transitions, 264 flow [2022-12-06 06:39:46,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 1950 [2022-12-06 06:40:17,178 INFO L203 LiptonReduction]: Total number of compositions: 102 [2022-12-06 06:40:17,189 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:40:17,193 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=REPEATED_LIPTON_PN, 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;@5e3cc97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:40:17,193 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:40:17,197 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:40:17,197 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:40:17,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:17,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:17,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:17,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:17,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1715177841, now seen corresponding path program 1 times [2022-12-06 06:40:17,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:17,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254124828] [2022-12-06 06:40:17,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:17,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:17,377 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-06 06:40:17,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:17,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254124828] [2022-12-06 06:40:17,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254124828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:17,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:17,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:40:17,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948056896] [2022-12-06 06:40:17,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:17,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:40:17,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:17,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:40:17,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:40:17,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:40:17,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-06 06:40:17,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:17,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:40:17,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:18,088 INFO L130 PetriNetUnfolder]: 3159/4366 cut-off events. [2022-12-06 06:40:18,089 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-06 06:40:18,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8894 conditions, 4366 events. 3159/4366 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 19762 event pairs, 3159 based on Foata normal form. 0/4349 useless extension candidates. Maximal degree in co-relation 8882. Up to 4353 conditions per place. [2022-12-06 06:40:18,114 INFO L137 encePairwiseOnDemand]: 25/26 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-12-06 06:40:18,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 25 transitions, 108 flow [2022-12-06 06:40:18,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:40:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:40:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 28 transitions. [2022-12-06 06:40:18,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-06 06:40:18,124 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 2 states and 28 transitions. [2022-12-06 06:40:18,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 25 transitions, 108 flow [2022-12-06 06:40:18,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:40:18,129 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 58 flow [2022-12-06 06:40:18,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-06 06:40:18,134 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 06:40:18,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:18,135 INFO L89 Accepts]: Start accepts. Operand has 35 places, 25 transitions, 58 flow [2022-12-06 06:40:18,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:18,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:18,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 58 flow [2022-12-06 06:40:18,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 58 flow [2022-12-06 06:40:18,151 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 06:40:18,151 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:40:18,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 06:40:18,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 58 flow [2022-12-06 06:40:18,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 06:40:18,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:18,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 06:40:18,247 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 58 flow [2022-12-06 06:40:18,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-06 06:40:18,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:18,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:18,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:40:18,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:18,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:18,248 INFO L85 PathProgramCache]: Analyzing trace with hash -981517072, now seen corresponding path program 1 times [2022-12-06 06:40:18,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:18,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659414109] [2022-12-06 06:40:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:18,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:18,565 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-06 06:40:18,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:18,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659414109] [2022-12-06 06:40:18,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659414109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:18,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:18,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:40:18,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963272917] [2022-12-06 06:40:18,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:18,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:40:18,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:18,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:40:18,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:40:18,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 06:40:18,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 06:40:18,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:18,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 06:40:18,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:19,210 INFO L130 PetriNetUnfolder]: 2951/4317 cut-off events. [2022-12-06 06:40:19,211 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:40:19,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8569 conditions, 4317 events. 2951/4317 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22792 event pairs, 551 based on Foata normal form. 64/4377 useless extension candidates. Maximal degree in co-relation 8561. Up to 3423 conditions per place. [2022-12-06 06:40:19,233 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 38 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2022-12-06 06:40:19,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 178 flow [2022-12-06 06:40:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:40:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:40:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 06:40:19,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2022-12-06 06:40:19,238 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 58 flow. Second operand 3 states and 47 transitions. [2022-12-06 06:40:19,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 178 flow [2022-12-06 06:40:19,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:40:19,240 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 66 flow [2022-12-06 06:40:19,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-06 06:40:19,240 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2022-12-06 06:40:19,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:19,241 INFO L89 Accepts]: Start accepts. Operand has 37 places, 25 transitions, 66 flow [2022-12-06 06:40:19,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:19,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:19,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 66 flow [2022-12-06 06:40:19,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 66 flow [2022-12-06 06:40:19,247 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 06:40:19,247 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:40:19,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:40:19,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 66 flow [2022-12-06 06:40:19,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 06:40:19,249 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:19,250 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 06:40:19,251 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2022-12-06 06:40:19,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 06:40:19,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:19,251 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:19,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:40:19,251 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:19,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:19,252 INFO L85 PathProgramCache]: Analyzing trace with hash -362259229, now seen corresponding path program 1 times [2022-12-06 06:40:19,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:19,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013096487] [2022-12-06 06:40:19,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:19,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:19,467 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-06 06:40:19,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:19,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013096487] [2022-12-06 06:40:19,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013096487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:19,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:19,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:40:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647673742] [2022-12-06 06:40:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:19,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:40:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:19,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:40:19,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:40:19,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 06:40:19,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-06 06:40:19,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:19,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 06:40:19,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:20,125 INFO L130 PetriNetUnfolder]: 3661/5039 cut-off events. [2022-12-06 06:40:20,125 INFO L131 PetriNetUnfolder]: For 505/505 co-relation queries the response was YES. [2022-12-06 06:40:20,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11080 conditions, 5039 events. 3661/5039 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 22641 event pairs, 883 based on Foata normal form. 24/5062 useless extension candidates. Maximal degree in co-relation 11069. Up to 4495 conditions per place. [2022-12-06 06:40:20,151 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 34 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2022-12-06 06:40:20,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 171 flow [2022-12-06 06:40:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:40:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:40:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 06:40:20,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-06 06:40:20,154 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 3 states and 41 transitions. [2022-12-06 06:40:20,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 171 flow [2022-12-06 06:40:20,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:40:20,156 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 81 flow [2022-12-06 06:40:20,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-06 06:40:20,156 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2022-12-06 06:40:20,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:20,157 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 81 flow [2022-12-06 06:40:20,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:20,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:20,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 81 flow [2022-12-06 06:40:20,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 81 flow [2022-12-06 06:40:20,164 INFO L130 PetriNetUnfolder]: 3/35 cut-off events. [2022-12-06 06:40:20,164 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:40:20,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. [2022-12-06 06:40:20,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 81 flow [2022-12-06 06:40:20,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 06:40:20,168 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:20,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 06:40:20,169 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 81 flow [2022-12-06 06:40:20,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-06 06:40:20,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:20,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:20,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:40:20,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1526385407, now seen corresponding path program 1 times [2022-12-06 06:40:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:20,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689569228] [2022-12-06 06:40:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:20,351 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-06 06:40:20,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:20,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689569228] [2022-12-06 06:40:20,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689569228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:20,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:20,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:40:20,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509737159] [2022-12-06 06:40:20,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:20,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:40:20,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:20,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:40:20,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:40:20,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 06:40:20,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-06 06:40:20,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:20,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 06:40:20,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:21,338 INFO L130 PetriNetUnfolder]: 5485/7824 cut-off events. [2022-12-06 06:40:21,338 INFO L131 PetriNetUnfolder]: For 1548/1548 co-relation queries the response was YES. [2022-12-06 06:40:21,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17336 conditions, 7824 events. 5485/7824 cut-off events. For 1548/1548 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 40754 event pairs, 775 based on Foata normal form. 216/8039 useless extension candidates. Maximal degree in co-relation 17324. Up to 3631 conditions per place. [2022-12-06 06:40:21,374 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 44 selfloop transitions, 4 changer transitions 5/54 dead transitions. [2022-12-06 06:40:21,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 250 flow [2022-12-06 06:40:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:40:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:40:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 06:40:21,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-12-06 06:40:21,377 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 81 flow. Second operand 4 states and 58 transitions. [2022-12-06 06:40:21,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 250 flow [2022-12-06 06:40:21,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:40:21,381 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 91 flow [2022-12-06 06:40:21,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-06 06:40:21,382 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-06 06:40:21,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:21,382 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 91 flow [2022-12-06 06:40:21,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:21,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:21,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 91 flow [2022-12-06 06:40:21,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 27 transitions, 91 flow [2022-12-06 06:40:21,389 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 06:40:21,390 INFO L131 PetriNetUnfolder]: For 15/21 co-relation queries the response was YES. [2022-12-06 06:40:21,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 39 events. 3/39 cut-off events. For 15/21 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 89 event pairs, 1 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 66. Up to 10 conditions per place. [2022-12-06 06:40:21,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 27 transitions, 91 flow [2022-12-06 06:40:21,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 06:40:21,403 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:21,404 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:40:21,404 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 91 flow [2022-12-06 06:40:21,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-06 06:40:21,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:21,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:21,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:40:21,405 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:21,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1654848383, now seen corresponding path program 2 times [2022-12-06 06:40:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:21,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615665099] [2022-12-06 06:40:21,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:21,623 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-06 06:40:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615665099] [2022-12-06 06:40:21,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615665099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:21,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:21,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:40:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406457433] [2022-12-06 06:40:21,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:21,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:40:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:21,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:40:21,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:40:21,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 06:40:21,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 06:40:21,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:21,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 06:40:21,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:22,189 INFO L130 PetriNetUnfolder]: 2985/4256 cut-off events. [2022-12-06 06:40:22,189 INFO L131 PetriNetUnfolder]: For 1672/1672 co-relation queries the response was YES. [2022-12-06 06:40:22,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10064 conditions, 4256 events. 2985/4256 cut-off events. For 1672/1672 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20017 event pairs, 1350 based on Foata normal form. 36/4272 useless extension candidates. Maximal degree in co-relation 10050. Up to 3616 conditions per place. [2022-12-06 06:40:22,204 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 35 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-12-06 06:40:22,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 202 flow [2022-12-06 06:40:22,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:40:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:40:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 06:40:22,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 06:40:22,216 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 91 flow. Second operand 3 states and 43 transitions. [2022-12-06 06:40:22,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 202 flow [2022-12-06 06:40:22,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 185 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-06 06:40:22,219 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 87 flow [2022-12-06 06:40:22,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-06 06:40:22,220 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-12-06 06:40:22,220 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:22,220 INFO L89 Accepts]: Start accepts. Operand has 40 places, 27 transitions, 87 flow [2022-12-06 06:40:22,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:22,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:22,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 87 flow [2022-12-06 06:40:22,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 87 flow [2022-12-06 06:40:22,227 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 06:40:22,228 INFO L131 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2022-12-06 06:40:22,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 39 events. 3/39 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 90 event pairs, 1 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 64. Up to 10 conditions per place. [2022-12-06 06:40:22,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 87 flow [2022-12-06 06:40:22,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 06:40:22,277 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:22,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 06:40:22,278 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 87 flow [2022-12-06 06:40:22,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 06:40:22,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:22,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:22,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:40:22,279 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:22,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:22,279 INFO L85 PathProgramCache]: Analyzing trace with hash -239468274, now seen corresponding path program 1 times [2022-12-06 06:40:22,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:22,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246533421] [2022-12-06 06:40:22,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:22,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:22,495 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-06 06:40:22,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:22,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246533421] [2022-12-06 06:40:22,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246533421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:22,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:22,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:40:22,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703993979] [2022-12-06 06:40:22,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:22,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:40:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:22,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:40:22,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:40:22,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 06:40:22,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 06:40:22,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:22,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 06:40:22,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:23,478 INFO L130 PetriNetUnfolder]: 5848/8479 cut-off events. [2022-12-06 06:40:23,478 INFO L131 PetriNetUnfolder]: For 3028/3028 co-relation queries the response was YES. [2022-12-06 06:40:23,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18321 conditions, 8479 events. 5848/8479 cut-off events. For 3028/3028 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 47308 event pairs, 1873 based on Foata normal form. 360/8839 useless extension candidates. Maximal degree in co-relation 18308. Up to 3149 conditions per place. [2022-12-06 06:40:23,498 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 36 selfloop transitions, 3 changer transitions 26/66 dead transitions. [2022-12-06 06:40:23,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 302 flow [2022-12-06 06:40:23,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:40:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:40:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 06:40:23,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.576 [2022-12-06 06:40:23,499 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 87 flow. Second operand 5 states and 72 transitions. [2022-12-06 06:40:23,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 302 flow [2022-12-06 06:40:23,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:40:23,501 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 100 flow [2022-12-06 06:40:23,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2022-12-06 06:40:23,502 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2022-12-06 06:40:23,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:23,502 INFO L89 Accepts]: Start accepts. Operand has 45 places, 27 transitions, 100 flow [2022-12-06 06:40:23,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:23,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:23,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 27 transitions, 100 flow [2022-12-06 06:40:23,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 27 transitions, 100 flow [2022-12-06 06:40:23,509 INFO L130 PetriNetUnfolder]: 0/42 cut-off events. [2022-12-06 06:40:23,510 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-06 06:40:23,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 42 events. 0/42 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 117 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-12-06 06:40:23,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 27 transitions, 100 flow [2022-12-06 06:40:23,510 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 06:40:23,562 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] $Ultimate##0-->L837: Formula: (and (= v_~y~0_18 2) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~y~0=v_~y~0_18, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~y~0, P3Thread1of1ForFork2_~arg.base] and [821] $Ultimate##0-->L764: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_20 v_~__unbuffered_p0_EAX~0_18)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_20, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] [2022-12-06 06:40:23,590 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:40:23,591 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 06:40:23,591 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 103 flow [2022-12-06 06:40:23,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 06:40:23,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:23,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:23,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:40:23,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:23,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1708121201, now seen corresponding path program 1 times [2022-12-06 06:40:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:23,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712265025] [2022-12-06 06:40:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:24,968 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-06 06:40:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:24,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712265025] [2022-12-06 06:40:24,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712265025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:24,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:24,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:40:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653856904] [2022-12-06 06:40:24,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:24,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:40:24,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:24,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:40:24,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:40:24,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:40:24,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-06 06:40:24,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:24,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:40:24,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:25,754 INFO L130 PetriNetUnfolder]: 3702/5280 cut-off events. [2022-12-06 06:40:25,754 INFO L131 PetriNetUnfolder]: For 4063/4090 co-relation queries the response was YES. [2022-12-06 06:40:25,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12398 conditions, 5280 events. 3702/5280 cut-off events. For 4063/4090 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25599 event pairs, 1899 based on Foata normal form. 12/5265 useless extension candidates. Maximal degree in co-relation 12383. Up to 4918 conditions per place. [2022-12-06 06:40:25,775 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 44 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2022-12-06 06:40:25,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 280 flow [2022-12-06 06:40:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:40:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:40:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 06:40:25,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5288461538461539 [2022-12-06 06:40:25,776 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 103 flow. Second operand 4 states and 55 transitions. [2022-12-06 06:40:25,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 280 flow [2022-12-06 06:40:25,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 262 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 06:40:25,782 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 130 flow [2022-12-06 06:40:25,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-12-06 06:40:25,783 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2022-12-06 06:40:25,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:25,784 INFO L89 Accepts]: Start accepts. Operand has 45 places, 32 transitions, 130 flow [2022-12-06 06:40:25,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:25,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:25,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 130 flow [2022-12-06 06:40:25,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 32 transitions, 130 flow [2022-12-06 06:40:25,797 INFO L130 PetriNetUnfolder]: 5/63 cut-off events. [2022-12-06 06:40:25,797 INFO L131 PetriNetUnfolder]: For 46/48 co-relation queries the response was YES. [2022-12-06 06:40:25,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 63 events. 5/63 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 224 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 125. Up to 12 conditions per place. [2022-12-06 06:40:25,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 130 flow [2022-12-06 06:40:25,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 06:40:25,849 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:25,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 06:40:25,850 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 130 flow [2022-12-06 06:40:25,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-06 06:40:25,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:25,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:25,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:40:25,850 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:25,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:25,851 INFO L85 PathProgramCache]: Analyzing trace with hash -184462246, now seen corresponding path program 1 times [2022-12-06 06:40:25,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:25,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629111107] [2022-12-06 06:40:25,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:25,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:26,051 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-06 06:40:26,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:26,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629111107] [2022-12-06 06:40:26,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629111107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:26,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:26,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:40:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106983642] [2022-12-06 06:40:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:26,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:40:26,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:26,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:40:26,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:40:26,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:40:26,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-06 06:40:26,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:26,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:40:26,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:26,673 INFO L130 PetriNetUnfolder]: 3245/4786 cut-off events. [2022-12-06 06:40:26,674 INFO L131 PetriNetUnfolder]: For 2297/2336 co-relation queries the response was YES. [2022-12-06 06:40:26,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11494 conditions, 4786 events. 3245/4786 cut-off events. For 2297/2336 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 25812 event pairs, 565 based on Foata normal form. 386/5157 useless extension candidates. Maximal degree in co-relation 11478. Up to 3251 conditions per place. [2022-12-06 06:40:26,688 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 42 selfloop transitions, 5 changer transitions 33/85 dead transitions. [2022-12-06 06:40:26,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 475 flow [2022-12-06 06:40:26,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:40:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:40:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-06 06:40:26,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2022-12-06 06:40:26,689 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 130 flow. Second operand 5 states and 80 transitions. [2022-12-06 06:40:26,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 475 flow [2022-12-06 06:40:26,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 475 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:40:26,692 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 175 flow [2022-12-06 06:40:26,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2022-12-06 06:40:26,693 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-12-06 06:40:26,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:26,693 INFO L89 Accepts]: Start accepts. Operand has 52 places, 36 transitions, 175 flow [2022-12-06 06:40:26,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:26,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:26,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 36 transitions, 175 flow [2022-12-06 06:40:26,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 36 transitions, 175 flow [2022-12-06 06:40:26,739 INFO L130 PetriNetUnfolder]: 269/529 cut-off events. [2022-12-06 06:40:26,739 INFO L131 PetriNetUnfolder]: For 652/713 co-relation queries the response was YES. [2022-12-06 06:40:26,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 529 events. 269/529 cut-off events. For 652/713 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3060 event pairs, 127 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 1578. Up to 376 conditions per place. [2022-12-06 06:40:26,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 175 flow [2022-12-06 06:40:26,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 06:40:26,883 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:26,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 06:40:26,884 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 175 flow [2022-12-06 06:40:26,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-06 06:40:26,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:26,885 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:26,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:40:26,885 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1471321363, now seen corresponding path program 1 times [2022-12-06 06:40:26,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:26,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501949317] [2022-12-06 06:40:26,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:28,118 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-06 06:40:28,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:28,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501949317] [2022-12-06 06:40:28,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501949317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:28,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:28,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:40:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436231221] [2022-12-06 06:40:28,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:28,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:40:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:28,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:40:28,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:40:28,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:40:28,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-06 06:40:28,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:28,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:40:28,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:28,940 INFO L130 PetriNetUnfolder]: 4125/6113 cut-off events. [2022-12-06 06:40:28,941 INFO L131 PetriNetUnfolder]: For 7481/7540 co-relation queries the response was YES. [2022-12-06 06:40:28,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19520 conditions, 6113 events. 4125/6113 cut-off events. For 7481/7540 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 33538 event pairs, 1247 based on Foata normal form. 144/6252 useless extension candidates. Maximal degree in co-relation 19499. Up to 3079 conditions per place. [2022-12-06 06:40:28,963 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 49 selfloop transitions, 12 changer transitions 2/65 dead transitions. [2022-12-06 06:40:28,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 428 flow [2022-12-06 06:40:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:40:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:40:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 06:40:28,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-06 06:40:28,965 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 175 flow. Second operand 5 states and 55 transitions. [2022-12-06 06:40:28,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 428 flow [2022-12-06 06:40:28,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 410 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 06:40:28,984 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 240 flow [2022-12-06 06:40:28,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2022-12-06 06:40:28,985 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2022-12-06 06:40:28,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:28,985 INFO L89 Accepts]: Start accepts. Operand has 54 places, 42 transitions, 240 flow [2022-12-06 06:40:28,985 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:28,985 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:28,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 42 transitions, 240 flow [2022-12-06 06:40:28,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 42 transitions, 240 flow [2022-12-06 06:40:29,201 INFO L130 PetriNetUnfolder]: 1191/2272 cut-off events. [2022-12-06 06:40:29,202 INFO L131 PetriNetUnfolder]: For 2723/2958 co-relation queries the response was YES. [2022-12-06 06:40:29,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6392 conditions, 2272 events. 1191/2272 cut-off events. For 2723/2958 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 16560 event pairs, 560 based on Foata normal form. 3/2072 useless extension candidates. Maximal degree in co-relation 6372. Up to 1399 conditions per place. [2022-12-06 06:40:29,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 42 transitions, 240 flow [2022-12-06 06:40:29,225 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 06:40:29,228 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:29,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 06:40:29,229 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 240 flow [2022-12-06 06:40:29,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-06 06:40:29,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:29,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:29,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:40:29,229 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:29,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1991833667, now seen corresponding path program 1 times [2022-12-06 06:40:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:29,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164378485] [2022-12-06 06:40:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:29,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:29,422 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-06 06:40:29,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:29,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164378485] [2022-12-06 06:40:29,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164378485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:29,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:29,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:40:29,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437925655] [2022-12-06 06:40:29,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:29,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:40:29,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:40:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:40:29,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:40:29,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-06 06:40:29,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:29,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:40:29,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:30,073 INFO L130 PetriNetUnfolder]: 2886/4450 cut-off events. [2022-12-06 06:40:30,073 INFO L131 PetriNetUnfolder]: For 5467/5613 co-relation queries the response was YES. [2022-12-06 06:40:30,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16058 conditions, 4450 events. 2886/4450 cut-off events. For 5467/5613 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 25274 event pairs, 294 based on Foata normal form. 555/4995 useless extension candidates. Maximal degree in co-relation 16035. Up to 1987 conditions per place. [2022-12-06 06:40:30,091 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 68 selfloop transitions, 9 changer transitions 45/127 dead transitions. [2022-12-06 06:40:30,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 950 flow [2022-12-06 06:40:30,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:40:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:40:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-06 06:40:30,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2022-12-06 06:40:30,092 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 240 flow. Second operand 6 states and 95 transitions. [2022-12-06 06:40:30,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 950 flow [2022-12-06 06:40:30,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 915 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 06:40:30,101 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 301 flow [2022-12-06 06:40:30,101 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2022-12-06 06:40:30,101 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2022-12-06 06:40:30,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:30,102 INFO L89 Accepts]: Start accepts. Operand has 60 places, 46 transitions, 301 flow [2022-12-06 06:40:30,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:30,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:30,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 46 transitions, 301 flow [2022-12-06 06:40:30,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 46 transitions, 301 flow [2022-12-06 06:40:30,262 INFO L130 PetriNetUnfolder]: 680/1469 cut-off events. [2022-12-06 06:40:30,263 INFO L131 PetriNetUnfolder]: For 3700/4213 co-relation queries the response was YES. [2022-12-06 06:40:30,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5760 conditions, 1469 events. 680/1469 cut-off events. For 3700/4213 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10491 event pairs, 257 based on Foata normal form. 39/1429 useless extension candidates. Maximal degree in co-relation 5736. Up to 832 conditions per place. [2022-12-06 06:40:30,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 46 transitions, 301 flow [2022-12-06 06:40:30,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-06 06:40:30,276 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:30,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 06:40:30,276 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 301 flow [2022-12-06 06:40:30,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-06 06:40:30,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:30,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:30,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:40:30,277 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:30,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:30,277 INFO L85 PathProgramCache]: Analyzing trace with hash -891639121, now seen corresponding path program 1 times [2022-12-06 06:40:30,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:30,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504746749] [2022-12-06 06:40:30,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:30,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:30,505 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-06 06:40:30,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:30,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504746749] [2022-12-06 06:40:30,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504746749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:30,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:30,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:40:30,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736110597] [2022-12-06 06:40:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:30,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:40:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:30,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:40:30,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:40:30,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:40:30,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:40:30,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:30,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:40:30,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:30,948 INFO L130 PetriNetUnfolder]: 1586/2533 cut-off events. [2022-12-06 06:40:30,948 INFO L131 PetriNetUnfolder]: For 4689/4757 co-relation queries the response was YES. [2022-12-06 06:40:30,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10626 conditions, 2533 events. 1586/2533 cut-off events. For 4689/4757 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13417 event pairs, 181 based on Foata normal form. 245/2768 useless extension candidates. Maximal degree in co-relation 10599. Up to 1168 conditions per place. [2022-12-06 06:40:30,959 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 71 selfloop transitions, 13 changer transitions 40/129 dead transitions. [2022-12-06 06:40:30,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 129 transitions, 1025 flow [2022-12-06 06:40:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:40:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:40:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 06:40:30,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5824175824175825 [2022-12-06 06:40:30,961 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 301 flow. Second operand 7 states and 106 transitions. [2022-12-06 06:40:30,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 129 transitions, 1025 flow [2022-12-06 06:40:30,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 129 transitions, 954 flow, removed 27 selfloop flow, removed 5 redundant places. [2022-12-06 06:40:30,989 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 340 flow [2022-12-06 06:40:30,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2022-12-06 06:40:30,990 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2022-12-06 06:40:30,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:30,990 INFO L89 Accepts]: Start accepts. Operand has 62 places, 49 transitions, 340 flow [2022-12-06 06:40:30,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:30,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:30,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 49 transitions, 340 flow [2022-12-06 06:40:30,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 49 transitions, 340 flow [2022-12-06 06:40:31,088 INFO L130 PetriNetUnfolder]: 404/907 cut-off events. [2022-12-06 06:40:31,088 INFO L131 PetriNetUnfolder]: For 2255/2506 co-relation queries the response was YES. [2022-12-06 06:40:31,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3232 conditions, 907 events. 404/907 cut-off events. For 2255/2506 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5908 event pairs, 131 based on Foata normal form. 51/904 useless extension candidates. Maximal degree in co-relation 3208. Up to 388 conditions per place. [2022-12-06 06:40:31,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 49 transitions, 340 flow [2022-12-06 06:40:31,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 06:40:31,095 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:40:31,096 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 06:40:31,096 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 340 flow [2022-12-06 06:40:31,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:40:31,096 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:31,096 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:31,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:40:31,096 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:31,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:31,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1313689727, now seen corresponding path program 1 times [2022-12-06 06:40:31,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:31,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446592267] [2022-12-06 06:40:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:31,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:40:31,364 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-06 06:40:31,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:40:31,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446592267] [2022-12-06 06:40:31,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446592267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:40:31,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:40:31,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:40:31,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960241155] [2022-12-06 06:40:31,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:40:31,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:40:31,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:40:31,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:40:31,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:40:31,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:40:31,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 340 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-06 06:40:31,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:40:31,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:40:31,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:40:31,735 INFO L130 PetriNetUnfolder]: 1212/1918 cut-off events. [2022-12-06 06:40:31,735 INFO L131 PetriNetUnfolder]: For 3363/3412 co-relation queries the response was YES. [2022-12-06 06:40:31,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7729 conditions, 1918 events. 1212/1918 cut-off events. For 3363/3412 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9605 event pairs, 172 based on Foata normal form. 80/1986 useless extension candidates. Maximal degree in co-relation 7702. Up to 924 conditions per place. [2022-12-06 06:40:31,743 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 48 selfloop transitions, 17 changer transitions 40/107 dead transitions. [2022-12-06 06:40:31,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 857 flow [2022-12-06 06:40:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:40:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:40:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-06 06:40:31,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 06:40:31,745 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 340 flow. Second operand 8 states and 96 transitions. [2022-12-06 06:40:31,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 857 flow [2022-12-06 06:40:31,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 768 flow, removed 26 selfloop flow, removed 7 redundant places. [2022-12-06 06:40:31,770 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 274 flow [2022-12-06 06:40:31,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=274, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2022-12-06 06:40:31,772 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2022-12-06 06:40:31,772 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:40:31,772 INFO L89 Accepts]: Start accepts. Operand has 63 places, 41 transitions, 274 flow [2022-12-06 06:40:31,775 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:40:31,775 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:40:31,775 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 41 transitions, 274 flow [2022-12-06 06:40:31,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 41 transitions, 274 flow [2022-12-06 06:40:31,795 INFO L130 PetriNetUnfolder]: 76/178 cut-off events. [2022-12-06 06:40:31,795 INFO L131 PetriNetUnfolder]: For 219/232 co-relation queries the response was YES. [2022-12-06 06:40:31,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 178 events. 76/178 cut-off events. For 219/232 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 704 event pairs, 26 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 564. Up to 58 conditions per place. [2022-12-06 06:40:31,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 41 transitions, 274 flow [2022-12-06 06:40:31,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 06:40:37,457 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [905] $Ultimate##0-->L766: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= |v_#memory_int_967| (store |v_#memory_int_968| |v_~#x~0.base_454| (store (select |v_#memory_int_968| |v_~#x~0.base_454|) |v_~#x~0.offset_454| 1))) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y~0_88 v_~__unbuffered_p0_EAX~0_77)) InVars {~#x~0.offset=|v_~#x~0.offset_454|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, #memory_int=|v_#memory_int_968|, ~#x~0.base=|v_~#x~0.base_454|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_88} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~#x~0.offset=|v_~#x~0.offset_454|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, #memory_int=|v_#memory_int_967|, ~#x~0.base=|v_~#x~0.base_454|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_88, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, #memory_int, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [885] $Ultimate##0-->L783: Formula: (and (= (store |v_#memory_int_540| |v_~#x~0.base_298| (store (select |v_#memory_int_540| |v_~#x~0.base_298|) |v_~#x~0.offset_298| 2)) |v_#memory_int_539|) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_298|, #memory_int=|v_#memory_int_540|, ~#x~0.base=|v_~#x~0.base_298|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_298|, #memory_int=|v_#memory_int_539|, ~#x~0.base=|v_~#x~0.base_298|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, #memory_int] [2022-12-06 06:40:37,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [905] $Ultimate##0-->L766: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= |v_#memory_int_967| (store |v_#memory_int_968| |v_~#x~0.base_454| (store (select |v_#memory_int_968| |v_~#x~0.base_454|) |v_~#x~0.offset_454| 1))) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y~0_88 v_~__unbuffered_p0_EAX~0_77)) InVars {~#x~0.offset=|v_~#x~0.offset_454|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, #memory_int=|v_#memory_int_968|, ~#x~0.base=|v_~#x~0.base_454|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_88} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~#x~0.offset=|v_~#x~0.offset_454|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, #memory_int=|v_#memory_int_967|, ~#x~0.base=|v_~#x~0.base_454|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_88, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, #memory_int, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [786] L837-->L844: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd4~0_30 256) 0))) (let ((.cse8 (not .cse6)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_272 256) 0))) (.cse7 (= (mod v_~x$w_buff0_used~0_273 256) 0)) (.cse1 (= (mod v_~x$w_buff1_used~0_260 256) 0)) (.cse0 (= 0 (mod v_~x$r_buff1_thd4~0_30 256)))) (let ((.cse2 (select |v_#memory_int_267| |v_~#x~0.base_184|)) (.cse3 (not .cse0)) (.cse4 (not .cse1)) (.cse9 (not .cse7)) (.cse11 (and .cse8 .cse10))) (and (let ((.cse5 (= |v_P3_#t~mem28_34| |v_P3Thread1of1ForFork2_#t~mem28_1|))) (or (and (or (and (= |v_P3_#t~ite29_29| |v_P3_#t~mem28_34|) (or .cse0 .cse1) (= (select .cse2 |v_~#x~0.offset_184|) |v_P3_#t~mem28_34|)) (and (= |v_P3_#t~ite29_29| v_~x$w_buff1~0_114) .cse3 .cse4 .cse5)) (or .cse6 .cse7) (= |v_P3_#t~ite29_29| |v_P3_#t~ite30_29|)) (and (= |v_P3Thread1of1ForFork2_#t~ite29_1| |v_P3_#t~ite29_29|) .cse8 (= |v_P3_#t~ite30_29| v_~x$w_buff0~0_84) .cse5 .cse9))) (= v_~x$r_buff1_thd4~0_29 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_259 256) 0))) (and (not (= (mod v_~x$r_buff0_thd4~0_29 256) 0)) .cse10)) 0 v_~x$r_buff1_thd4~0_30)) (= (store |v_#memory_int_267| |v_~#x~0.base_184| (store .cse2 |v_~#x~0.offset_184| |v_P3_#t~ite30_29|)) |v_#memory_int_266|) (= (ite (or .cse11 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_260) v_~x$w_buff1_used~0_259) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_273) v_~x$w_buff0_used~0_272) (= (ite .cse11 0 v_~x$r_buff0_thd4~0_30) v_~x$r_buff0_thd4~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_84, P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_1|, P3Thread1of1ForFork2_#t~mem28=|v_P3Thread1of1ForFork2_#t~mem28_1|, ~#x~0.offset=|v_~#x~0.offset_184|, ~x$w_buff1~0=v_~x$w_buff1~0_114, #memory_int=|v_#memory_int_267|, ~#x~0.base=|v_~#x~0.base_184|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_30, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_30, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_84, ~#x~0.offset=|v_~#x~0.offset_184|, ~x$w_buff1~0=v_~x$w_buff1~0_114, #memory_int=|v_#memory_int_266|, ~#x~0.base=|v_~#x~0.base_184|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_259, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_29, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_29, P3Thread1of1ForFork2_#t~ite30=|v_P3Thread1of1ForFork2_#t~ite30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_272} AuxVars[|v_P3_#t~ite30_29|, |v_P3_#t~mem28_34|, |v_P3_#t~ite29_29|] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~mem28, #memory_int, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite30, ~x$w_buff0_used~0] [2022-12-06 06:40:37,827 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [905] $Ultimate##0-->L766: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= |v_#memory_int_967| (store |v_#memory_int_968| |v_~#x~0.base_454| (store (select |v_#memory_int_968| |v_~#x~0.base_454|) |v_~#x~0.offset_454| 1))) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y~0_88 v_~__unbuffered_p0_EAX~0_77)) InVars {~#x~0.offset=|v_~#x~0.offset_454|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, #memory_int=|v_#memory_int_968|, ~#x~0.base=|v_~#x~0.base_454|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_88} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~#x~0.offset=|v_~#x~0.offset_454|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, #memory_int=|v_#memory_int_967|, ~#x~0.base=|v_~#x~0.base_454|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_88, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, #memory_int, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [780] L820-->L827: Formula: (let ((.cse2 (= (mod v_~x$r_buff0_thd3~0_117 256) 0))) (let ((.cse1 (= (mod v_~x$w_buff0_used~0_309 256) 0)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_308 256) 0))) (.cse10 (not .cse2)) (.cse6 (= (mod v_~x$w_buff1_used~0_300 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd3~0_115 256) 0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse0 (and .cse11 .cse10)) (.cse9 (not .cse1)) (.cse8 (select |v_#memory_int_317| |v_~#x~0.base_218|))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_117) v_~x$r_buff0_thd3~0_116) (let ((.cse3 (= |v_P2Thread1of1ForFork0_#t~mem25_1| |v_P2_#t~mem25_32|))) (or (and (or .cse1 .cse2) (= |v_P2_#t~ite26_29| |v_P2_#t~ite27_25|) (or (and .cse3 .cse4 (= |v_P2_#t~ite26_29| v_~x$w_buff1~0_148) .cse5) (and (= |v_P2_#t~ite26_29| |v_P2_#t~mem25_32|) (or .cse6 .cse7) (= (select .cse8 |v_~#x~0.offset_218|) |v_P2_#t~mem25_32|)))) (and (= |v_P2_#t~ite27_25| v_~x$w_buff0~0_114) .cse3 .cse9 (= |v_P2_#t~ite26_29| |v_P2Thread1of1ForFork0_#t~ite26_1|) .cse10))) (= v_~x$r_buff1_thd3~0_114 (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_299 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_116 256) 0)) .cse11)) 0 v_~x$r_buff1_thd3~0_115)) (= v_~x$w_buff1_used~0_299 (ite (or (and .cse4 .cse5) .cse0) 0 v_~x$w_buff1_used~0_300)) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_309) v_~x$w_buff0_used~0_308) (= (store |v_#memory_int_317| |v_~#x~0.base_218| (store .cse8 |v_~#x~0.offset_218| |v_P2_#t~ite27_25|)) |v_#memory_int_316|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_114, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_218|, ~x$w_buff1~0=v_~x$w_buff1~0_148, #memory_int=|v_#memory_int_317|, ~#x~0.base=|v_~#x~0.base_218|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_300, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_1|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_309} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_114, P2Thread1of1ForFork0_#t~ite27=|v_P2Thread1of1ForFork0_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_218|, ~x$w_buff1~0=v_~x$w_buff1~0_148, #memory_int=|v_#memory_int_316|, ~#x~0.base=|v_~#x~0.base_218|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_114, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_299, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_116, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_308} AuxVars[|v_P2_#t~mem25_32|, |v_P2_#t~ite26_29|, |v_P2_#t~ite27_25|] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem25, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 06:40:39,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] $Ultimate##0-->L837: Formula: (and (= v_~y~0_18 2) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~y~0=v_~y~0_18, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~y~0, P3Thread1of1ForFork2_~arg.base] and [910] $Ultimate##0-->L844: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd4~0_102 256) 0))) (let ((.cse4 (= (mod v_~x$r_buff1_thd4~0_100 256) 0)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_794 256) 0))) (.cse8 (not .cse6)) (.cse5 (= (mod v_~x$w_buff0_used~0_795 256) 0)) (.cse3 (= (mod v_~x$w_buff1_used~0_779 256) 0))) (let ((.cse1 (not .cse3)) (.cse7 (not .cse5)) (.cse9 (and .cse10 .cse8)) (.cse2 (not .cse4))) (and (= (store |v_#memory_int_1002| |v_~#x~0.base_468| (store (select |v_#memory_int_1002| |v_~#x~0.base_468|) |v_~#x~0.offset_468| |v_P3_#t~ite30_61|)) |v_#memory_int_1000|) (let ((.cse0 (= |v_P3Thread1of1ForFork2_#t~mem28_58| |v_P3_#t~mem28_66|))) (or (and (or (and .cse0 .cse1 .cse2 (= |v_P3_#t~ite29_61| v_~x$w_buff1~0_442)) (and (= |v_P3_#t~ite29_61| |v_P3_#t~mem28_66|) (or .cse3 .cse4) (= |v_P3_#t~mem28_66| 1))) (= |v_P3_#t~ite29_61| |v_P3_#t~ite30_61|) (or .cse5 .cse6)) (and .cse0 (= |v_P3_#t~ite29_61| |v_P3Thread1of1ForFork2_#t~ite29_58|) .cse7 .cse8 (= |v_P3_#t~ite30_61| v_~x$w_buff0~0_392)))) (= v_P0Thread1of1ForFork1_~arg.offset_27 |v_P0Thread1of1ForFork1_#in~arg.offset_27|) (= v_~y~0_98 v_~__unbuffered_p0_EAX~0_87) (= (ite (or (and .cse1 .cse2) .cse9) 0 v_~x$w_buff1_used~0_779) v_~x$w_buff1_used~0_778) (= v_~x$w_buff0_used~0_794 (ite (and .cse7 .cse8) 0 v_~x$w_buff0_used~0_795)) (= v_~x$r_buff0_thd4~0_101 (ite .cse9 0 v_~x$r_buff0_thd4~0_102)) (= v_~x$r_buff1_thd4~0_99 (ite (or (and .cse10 (not (= (mod v_~x$r_buff0_thd4~0_101 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_778 256) 0)))) 0 v_~x$r_buff1_thd4~0_100)) (= |v_P0Thread1of1ForFork1_#in~arg.base_27| v_P0Thread1of1ForFork1_~arg.base_27))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_392, ~#x~0.offset=|v_~#x~0.offset_468|, ~x$w_buff1~0=v_~x$w_buff1~0_442, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_779, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_102, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_58|, P3Thread1of1ForFork2_#t~mem28=|v_P3Thread1of1ForFork2_#t~mem28_58|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, #memory_int=|v_#memory_int_1002|, ~#x~0.base=|v_~#x~0.base_468|, ~y~0=v_~y~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ~#x~0.offset=|v_~#x~0.offset_468|, ~x$w_buff1~0=v_~x$w_buff1~0_442, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_778, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_101, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_99, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_794, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_87, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, #memory_int=|v_#memory_int_1000|, ~#x~0.base=|v_~#x~0.base_468|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_27, ~y~0=v_~y~0_98, P3Thread1of1ForFork2_#t~ite30=|v_P3Thread1of1ForFork2_#t~ite30_31|} AuxVars[|v_P3_#t~ite29_61|, |v_P3_#t~ite30_61|, |v_P3_#t~mem28_66|] AssignedVars[~__unbuffered_p0_EAX~0, P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~mem28, #memory_int, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff0_thd4~0, ~x$r_buff1_thd4~0, P0Thread1of1ForFork1_~arg.base, P3Thread1of1ForFork2_#t~ite30, ~x$w_buff0_used~0] [2022-12-06 06:40:39,490 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:40:39,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7719 [2022-12-06 06:40:39,491 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 280 flow [2022-12-06 06:40:39,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-06 06:40:39,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:40:39,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:39,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:40:39,491 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:40:39,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:40:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2079019178, now seen corresponding path program 1 times [2022-12-06 06:40:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:40:39,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942851822] [2022-12-06 06:40:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:40:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:40:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:40:39,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:40:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:40:39,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:40:39,690 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:40:39,690 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:40:39,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 06:40:39,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:40:39,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:40:39,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 06:40:39,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:40:39,692 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:40:39,695 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:40:39,695 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:40:39,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:40:39 BasicIcfg [2022-12-06 06:40:39,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:40:39,789 INFO L158 Benchmark]: Toolchain (without parser) took 55077.91ms. Allocated memory was 196.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 170.8MB in the beginning and 1.1GB in the end (delta: -880.2MB). Peak memory consumption was 136.3MB. Max. memory is 8.0GB. [2022-12-06 06:40:39,789 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:40:39,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.98ms. Allocated memory is still 196.1MB. Free memory was 170.8MB in the beginning and 141.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 06:40:39,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.78ms. Allocated memory is still 196.1MB. Free memory was 141.0MB in the beginning and 138.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:40:39,789 INFO L158 Benchmark]: Boogie Preprocessor took 45.37ms. Allocated memory is still 196.1MB. Free memory was 138.3MB in the beginning and 135.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:40:39,789 INFO L158 Benchmark]: RCFGBuilder took 862.13ms. Allocated memory is still 196.1MB. Free memory was 135.7MB in the beginning and 122.3MB in the end (delta: 13.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2022-12-06 06:40:39,790 INFO L158 Benchmark]: TraceAbstraction took 53653.63ms. Allocated memory was 196.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 121.7MB in the beginning and 1.1GB in the end (delta: -929.3MB). Peak memory consumption was 87.3MB. Max. memory is 8.0GB. [2022-12-06 06:40:39,790 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.98ms. Allocated memory is still 196.1MB. Free memory was 170.8MB in the beginning and 141.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.78ms. Allocated memory is still 196.1MB. Free memory was 141.0MB in the beginning and 138.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.37ms. Allocated memory is still 196.1MB. Free memory was 138.3MB in the beginning and 135.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 862.13ms. Allocated memory is still 196.1MB. Free memory was 135.7MB in the beginning and 122.3MB in the end (delta: 13.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 53653.63ms. Allocated memory was 196.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 121.7MB in the beginning and 1.1GB in the end (delta: -929.3MB). Peak memory consumption was 87.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.8s, 138 PlacesBefore, 38 PlacesAfterwards, 126 TransitionsBefore, 26 TransitionsAfterwards, 1950 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 102 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1250, independent: 1168, independent conditional: 1168, independent unconditional: 0, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1250, independent: 1168, independent conditional: 0, independent unconditional: 1168, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1250, independent: 1168, independent conditional: 0, independent unconditional: 1168, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1250, independent: 1168, independent conditional: 0, independent unconditional: 1168, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1045, independent: 1002, independent conditional: 0, independent unconditional: 1002, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1045, independent: 979, independent conditional: 0, independent unconditional: 979, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 579, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 560, dependent conditional: 0, dependent unconditional: 560, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1250, independent: 166, independent conditional: 0, independent unconditional: 166, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 1045, unknown conditional: 0, unknown unconditional: 1045] , Statistics on independence cache: Total cache size (in pairs): 1485, Positive cache size: 1442, Positive conditional cache size: 0, Positive unconditional cache size: 1442, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 89, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 89, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 89, unknown conditional: 0, unknown unconditional: 89] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 60, independent conditional: 14, independent unconditional: 46, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 64, independent conditional: 4, independent unconditional: 60, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 74, independent conditional: 38, independent unconditional: 36, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 73, independent: 52, independent conditional: 30, independent unconditional: 22, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 68, independent conditional: 12, independent unconditional: 56, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 45 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 35, independent conditional: 15, independent unconditional: 20, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 35, independent conditional: 14, independent unconditional: 21, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 35, independent conditional: 14, independent unconditional: 21, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 28, independent conditional: 7, independent unconditional: 21, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 87, Positive conditional cache size: 7, Positive unconditional cache size: 80, Negative cache size: 41, Negative conditional cache size: 4, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 30, independent conditional: 17, independent unconditional: 13, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 30, independent conditional: 17, independent unconditional: 13, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 30, independent conditional: 17, independent unconditional: 13, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 135, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 24, independent conditional: 14, independent unconditional: 10, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 14, unknown conditional: 3, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 93, Positive conditional cache size: 10, Positive unconditional cache size: 83, Negative cache size: 49, Negative conditional cache size: 4, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 95, Positive conditional cache size: 12, Positive unconditional cache size: 83, Negative cache size: 49, Negative conditional cache size: 4, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 95, Positive conditional cache size: 12, Positive unconditional cache size: 83, Negative cache size: 49, Negative conditional cache size: 4, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 95, Positive conditional cache size: 12, Positive unconditional cache size: 83, Negative cache size: 49, Negative conditional cache size: 4, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 61 PlacesBefore, 56 PlacesAfterwards, 41 TransitionsBefore, 36 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 38, independent conditional: 12, independent unconditional: 26, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 38, independent conditional: 12, independent unconditional: 26, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, independent: 35, independent conditional: 10, independent unconditional: 25, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 119, Positive conditional cache size: 14, Positive unconditional cache size: 105, Negative cache size: 50, Negative conditional cache size: 5, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff0_thd4; [L744] 0 _Bool x$r_buff1_thd0; [L745] 0 _Bool x$r_buff1_thd1; [L746] 0 _Bool x$r_buff1_thd2; [L747] 0 _Bool x$r_buff1_thd3; [L748] 0 _Bool x$r_buff1_thd4; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2149; [L862] FCALL, FORK 0 pthread_create(&t2149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2149, ((void *)0), P0, ((void *)0))=-1, t2149={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2150; [L864] FCALL, FORK 0 pthread_create(&t2150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2150, ((void *)0), P1, ((void *)0))=0, t2149={7:0}, t2150={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L865] 0 pthread_t t2151; [L866] FCALL, FORK 0 pthread_create(&t2151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2151, ((void *)0), P2, ((void *)0))=1, t2149={7:0}, t2150={8:0}, t2151={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L867] 0 pthread_t t2152; [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 x$flush_delayed = weak$$choice2 [L803] EXPR 3 \read(x) [L803] 3 x$mem_tmp = x [L804] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L805] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L805] EXPR 3 \read(x) [L805] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L805] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L806] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L807] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L808] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L809] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L810] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L811] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L812] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L813] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L814] EXPR 3 \read(x) [L814] 3 __unbuffered_p2_EAX = x [L815] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L815] 3 x = x$flush_delayed ? x$mem_tmp : x [L816] 3 x$flush_delayed = (_Bool)0 [L819] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L822] EXPR 3 \read(x) [L822] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L823] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L824] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L825] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L826] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L868] FCALL, FORK 0 pthread_create(&t2152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2152, ((void *)0), P3, ((void *)0))=2, t2149={7:0}, t2150={8:0}, t2151={9:0}, t2152={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L836] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L839] EXPR 4 \read(x) [L839] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L841] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L842] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L843] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 __unbuffered_p0_EAX = y [L766] 1 x = 1 [L783] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 \read(x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 \read(x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L874] EXPR 0 \read(x) [L874] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L875] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L876] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L877] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L878] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L881] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L882] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L883] 0 x$flush_delayed = weak$$choice2 [L884] EXPR 0 \read(x) [L884] 0 x$mem_tmp = x [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] EXPR 0 \read(x) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L886] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L887] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L888] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L889] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L890] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L891] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L892] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L893] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L893] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L893] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L893] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L894] EXPR 0 \read(x) [L894] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L895] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L895] 0 x = x$flush_delayed ? x$mem_tmp : x [L896] 0 x$flush_delayed = (_Bool)0 [L898] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 866]: 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: 868]: 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: 864]: 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: 862]: 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, 177 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 53.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 31.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 350 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 969 IncrementalHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 4 mSDtfsCounter, 969 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=11, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 1023 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-06 06:40:39,830 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...