/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:26:11,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:26:11,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:26:12,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:26:12,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:26:12,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:26:12,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:26:12,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:26:12,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:26:12,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:26:12,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:26:12,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:26:12,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:26:12,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:26:12,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:26:12,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:26:12,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:26:12,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:26:12,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:26:12,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:26:12,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:26:12,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:26:12,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:26:12,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:26:12,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:26:12,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:26:12,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:26:12,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:26:12,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:26:12,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:26:12,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:26:12,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:26:12,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:26:12,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:26:12,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:26:12,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:26:12,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:26:12,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:26:12,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:26:12,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:26:12,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:26:12,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 14:26:12,081 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:26:12,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:26:12,082 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:26:12,082 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:26:12,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:26:12,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:26:12,084 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:26:12,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:26:12,084 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:26:12,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:26:12,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:26:12,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:26:12,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:26:12,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:26:12,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:26:12,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:26:12,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:26:12,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:26:12,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:26:12,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:26:12,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:26:12,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:26:12,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:26:12,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:26:12,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:26:12,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:26:12,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:26:12,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:26:12,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:26:12,086 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:26:12,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-12 14:26:12,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:26:12,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:26:12,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:26:12,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:26:12,425 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:26:12,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2022-12-12 14:26:13,439 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:26:13,718 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:26:13,718 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2022-12-12 14:26:13,733 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94fdc511a/67f651e768664f30a047c802a7e9e192/FLAG150715e45 [2022-12-12 14:26:13,743 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94fdc511a/67f651e768664f30a047c802a7e9e192 [2022-12-12 14:26:13,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:26:13,746 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:26:13,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:26:13,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:26:13,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:26:13,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:26:13" (1/1) ... [2022-12-12 14:26:13,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bccb134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:13, skipping insertion in model container [2022-12-12 14:26:13,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:26:13" (1/1) ... [2022-12-12 14:26:13,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:26:13,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:26:13,954 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/mix005_tso.oepc.i[949,962] [2022-12-12 14:26:14,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:26:14,156 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:26:14,166 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/mix005_tso.oepc.i[949,962] [2022-12-12 14:26:14,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:26:14,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:26:14,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:26:14,254 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:26:14,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14 WrapperNode [2022-12-12 14:26:14,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:26:14,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:26:14,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:26:14,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:26:14,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (1/1) ... [2022-12-12 14:26:14,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (1/1) ... [2022-12-12 14:26:14,299 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-12-12 14:26:14,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:26:14,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:26:14,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:26:14,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:26:14,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (1/1) ... [2022-12-12 14:26:14,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (1/1) ... [2022-12-12 14:26:14,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (1/1) ... [2022-12-12 14:26:14,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (1/1) ... [2022-12-12 14:26:14,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (1/1) ... [2022-12-12 14:26:14,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (1/1) ... [2022-12-12 14:26:14,321 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (1/1) ... [2022-12-12 14:26:14,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (1/1) ... [2022-12-12 14:26:14,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:26:14,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:26:14,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:26:14,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:26:14,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (1/1) ... [2022-12-12 14:26:14,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:26:14,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:26:14,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 14:26:14,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 14:26:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:26:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:26:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:26:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:26:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:26:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:26:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:26:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:26:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:26:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:26:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:26:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 14:26:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 14:26:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:26:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:26:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:26:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:26:14,400 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:26:14,496 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:26:14,497 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:26:14,856 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:26:15,023 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:26:15,023 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:26:15,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:26:15 BoogieIcfgContainer [2022-12-12 14:26:15,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:26:15,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:26:15,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:26:15,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:26:15,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:26:13" (1/3) ... [2022-12-12 14:26:15,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f6733e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:26:15, skipping insertion in model container [2022-12-12 14:26:15,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:26:14" (2/3) ... [2022-12-12 14:26:15,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f6733e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:26:15, skipping insertion in model container [2022-12-12 14:26:15,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:26:15" (3/3) ... [2022-12-12 14:26:15,038 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2022-12-12 14:26:15,051 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:26:15,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:26:15,052 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:26:15,121 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:26:15,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-12-12 14:26:15,220 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-12 14:26:15,221 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:26:15,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-12 14:26:15,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-12-12 14:26:15,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-12-12 14:26:15,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:26:15,244 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-12 14:26:15,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-12-12 14:26:15,287 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-12 14:26:15,287 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:26:15,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-12 14:26:15,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-12 14:26:15,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 3272 [2022-12-12 14:26:24,806 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-12 14:26:24,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:26:24,832 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@612d4aff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:26:24,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 14:26:24,837 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-12 14:26:24,838 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:26:24,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:24,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 14:26:24,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:24,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:24,843 INFO L85 PathProgramCache]: Analyzing trace with hash 555940396, now seen corresponding path program 1 times [2022-12-12 14:26:24,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:24,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240018853] [2022-12-12 14:26:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:25,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:25,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240018853] [2022-12-12 14:26:25,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240018853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:25,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:25,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:26:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873796769] [2022-12-12 14:26:25,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:25,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:26:25,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:25,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:26:25,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:26:25,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 78 [2022-12-12 14:26:25,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:25,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:25,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 78 [2022-12-12 14:26:25,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:26:33,511 INFO L130 PetriNetUnfolder]: 57424/81629 cut-off events. [2022-12-12 14:26:33,512 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-12 14:26:33,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157782 conditions, 81629 events. 57424/81629 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 4074. Compared 598895 event pairs, 22678 based on Foata normal form. 0/51066 useless extension candidates. Maximal degree in co-relation 157770. Up to 63597 conditions per place. [2022-12-12 14:26:33,852 INFO L137 encePairwiseOnDemand]: 74/78 looper letters, 44 selfloop transitions, 2 changer transitions 64/127 dead transitions. [2022-12-12 14:26:33,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 127 transitions, 492 flow [2022-12-12 14:26:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:26:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:26:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2022-12-12 14:26:33,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7008547008547008 [2022-12-12 14:26:33,863 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 168 flow. Second operand 3 states and 164 transitions. [2022-12-12 14:26:33,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 127 transitions, 492 flow [2022-12-12 14:26:33,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 127 transitions, 486 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-12 14:26:33,868 INFO L231 Difference]: Finished difference. Result has 87 places, 44 transitions, 100 flow [2022-12-12 14:26:33,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=87, PETRI_TRANSITIONS=44} [2022-12-12 14:26:33,872 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -4 predicate places. [2022-12-12 14:26:33,872 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 44 transitions, 100 flow [2022-12-12 14:26:33,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:33,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:33,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:26:33,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:26:33,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash -77521807, now seen corresponding path program 1 times [2022-12-12 14:26:33,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:33,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446951709] [2022-12-12 14:26:33,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:33,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:34,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446951709] [2022-12-12 14:26:34,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446951709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:34,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:34,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:26:34,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903027186] [2022-12-12 14:26:34,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:34,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:26:34,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:34,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:26:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:26:34,328 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 14:26:34,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 44 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:34,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:34,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 14:26:34,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:26:36,419 INFO L130 PetriNetUnfolder]: 21719/30070 cut-off events. [2022-12-12 14:26:36,419 INFO L131 PetriNetUnfolder]: For 1185/1185 co-relation queries the response was YES. [2022-12-12 14:26:36,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60712 conditions, 30070 events. 21719/30070 cut-off events. For 1185/1185 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 165750 event pairs, 6479 based on Foata normal form. 504/26180 useless extension candidates. Maximal degree in co-relation 60702. Up to 21289 conditions per place. [2022-12-12 14:26:36,548 INFO L137 encePairwiseOnDemand]: 75/78 looper letters, 49 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2022-12-12 14:26:36,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 240 flow [2022-12-12 14:26:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:26:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:26:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-12 14:26:36,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36324786324786323 [2022-12-12 14:26:36,550 INFO L175 Difference]: Start difference. First operand has 87 places, 44 transitions, 100 flow. Second operand 3 states and 85 transitions. [2022-12-12 14:26:36,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 240 flow [2022-12-12 14:26:36,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:26:36,553 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 104 flow [2022-12-12 14:26:36,553 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-12 14:26:36,553 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -35 predicate places. [2022-12-12 14:26:36,553 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 104 flow [2022-12-12 14:26:36,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:36,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:36,554 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:26:36,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:26:36,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:36,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:36,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1481430612, now seen corresponding path program 1 times [2022-12-12 14:26:36,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:36,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29939980] [2022-12-12 14:26:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:36,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:36,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29939980] [2022-12-12 14:26:36,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29939980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:36,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:36,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:26:36,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638264890] [2022-12-12 14:26:36,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:36,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:26:36,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:36,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:26:36,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:26:36,803 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 14:26:36,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:36,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:36,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 14:26:36,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:26:38,639 INFO L130 PetriNetUnfolder]: 20471/28462 cut-off events. [2022-12-12 14:26:38,640 INFO L131 PetriNetUnfolder]: For 1800/1800 co-relation queries the response was YES. [2022-12-12 14:26:38,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58721 conditions, 28462 events. 20471/28462 cut-off events. For 1800/1800 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 160973 event pairs, 5231 based on Foata normal form. 360/24620 useless extension candidates. Maximal degree in co-relation 58710. Up to 21001 conditions per place. [2022-12-12 14:26:38,838 INFO L137 encePairwiseOnDemand]: 75/78 looper letters, 51 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2022-12-12 14:26:38,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 255 flow [2022-12-12 14:26:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:26:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:26:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-12-12 14:26:38,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2022-12-12 14:26:38,840 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 104 flow. Second operand 3 states and 87 transitions. [2022-12-12 14:26:38,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 255 flow [2022-12-12 14:26:38,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:26:38,875 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 108 flow [2022-12-12 14:26:38,876 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2022-12-12 14:26:38,877 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -34 predicate places. [2022-12-12 14:26:38,877 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 108 flow [2022-12-12 14:26:38,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:38,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:38,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:26:38,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:26:38,878 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1552848944, now seen corresponding path program 1 times [2022-12-12 14:26:38,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:38,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906884827] [2022-12-12 14:26:38,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:38,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:39,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:39,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906884827] [2022-12-12 14:26:39,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906884827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:39,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:39,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:26:39,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971034439] [2022-12-12 14:26:39,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:39,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:26:39,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:39,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:26:39,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:26:39,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 14:26:39,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:39,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:39,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 14:26:39,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:26:40,667 INFO L130 PetriNetUnfolder]: 8756/12628 cut-off events. [2022-12-12 14:26:40,667 INFO L131 PetriNetUnfolder]: For 1439/1446 co-relation queries the response was YES. [2022-12-12 14:26:40,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25751 conditions, 12628 events. 8756/12628 cut-off events. For 1439/1446 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 73320 event pairs, 5085 based on Foata normal form. 34/10292 useless extension candidates. Maximal degree in co-relation 25739. Up to 11353 conditions per place. [2022-12-12 14:26:40,739 INFO L137 encePairwiseOnDemand]: 74/78 looper letters, 44 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-12-12 14:26:40,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 246 flow [2022-12-12 14:26:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:26:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:26:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2022-12-12 14:26:40,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2022-12-12 14:26:40,742 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 108 flow. Second operand 3 states and 96 transitions. [2022-12-12 14:26:40,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 246 flow [2022-12-12 14:26:40,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:26:40,745 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 123 flow [2022-12-12 14:26:40,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-12-12 14:26:40,747 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -33 predicate places. [2022-12-12 14:26:40,748 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 123 flow [2022-12-12 14:26:40,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:40,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:40,748 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:26:40,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:26:40,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash 847200368, now seen corresponding path program 1 times [2022-12-12 14:26:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:40,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943699413] [2022-12-12 14:26:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:40,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:41,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:41,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943699413] [2022-12-12 14:26:41,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943699413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:41,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:41,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:26:41,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715764951] [2022-12-12 14:26:41,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:41,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:26:41,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:41,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:26:41,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:26:41,267 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 14:26:41,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:41,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:41,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 14:26:41,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:26:42,325 INFO L130 PetriNetUnfolder]: 9182/13637 cut-off events. [2022-12-12 14:26:42,325 INFO L131 PetriNetUnfolder]: For 3405/3421 co-relation queries the response was YES. [2022-12-12 14:26:42,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29191 conditions, 13637 events. 9182/13637 cut-off events. For 3405/3421 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 87868 event pairs, 1920 based on Foata normal form. 42/11232 useless extension candidates. Maximal degree in co-relation 29178. Up to 11338 conditions per place. [2022-12-12 14:26:42,412 INFO L137 encePairwiseOnDemand]: 71/78 looper letters, 57 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2022-12-12 14:26:42,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 331 flow [2022-12-12 14:26:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:26:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:26:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-12-12 14:26:42,415 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41346153846153844 [2022-12-12 14:26:42,415 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 123 flow. Second operand 4 states and 129 transitions. [2022-12-12 14:26:42,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 331 flow [2022-12-12 14:26:42,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:26:42,420 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 159 flow [2022-12-12 14:26:42,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2022-12-12 14:26:42,422 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -30 predicate places. [2022-12-12 14:26:42,422 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 159 flow [2022-12-12 14:26:42,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:42,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:42,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:26:42,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:26:42,423 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:42,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash 56823979, now seen corresponding path program 1 times [2022-12-12 14:26:42,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:42,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978395164] [2022-12-12 14:26:42,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:42,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:42,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:42,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978395164] [2022-12-12 14:26:42,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978395164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:42,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:42,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:26:42,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281945646] [2022-12-12 14:26:42,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:42,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:26:42,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:42,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:26:42,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:26:42,651 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 14:26:42,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:42,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:42,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 14:26:42,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:26:43,747 INFO L130 PetriNetUnfolder]: 9411/14064 cut-off events. [2022-12-12 14:26:43,747 INFO L131 PetriNetUnfolder]: For 7791/8066 co-relation queries the response was YES. [2022-12-12 14:26:43,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33272 conditions, 14064 events. 9411/14064 cut-off events. For 7791/8066 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 91030 event pairs, 1224 based on Foata normal form. 64/11598 useless extension candidates. Maximal degree in co-relation 33257. Up to 10656 conditions per place. [2022-12-12 14:26:43,814 INFO L137 encePairwiseOnDemand]: 70/78 looper letters, 62 selfloop transitions, 9 changer transitions 0/87 dead transitions. [2022-12-12 14:26:43,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 87 transitions, 403 flow [2022-12-12 14:26:43,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:26:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:26:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-12-12 14:26:43,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4198717948717949 [2022-12-12 14:26:43,816 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 159 flow. Second operand 4 states and 131 transitions. [2022-12-12 14:26:43,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 87 transitions, 403 flow [2022-12-12 14:26:43,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 392 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 14:26:43,819 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 198 flow [2022-12-12 14:26:43,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2022-12-12 14:26:43,820 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -28 predicate places. [2022-12-12 14:26:43,820 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 198 flow [2022-12-12 14:26:43,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:43,820 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:43,820 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:26:43,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:26:43,820 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:43,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash -338511205, now seen corresponding path program 2 times [2022-12-12 14:26:43,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:43,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442640614] [2022-12-12 14:26:43,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:44,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:44,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442640614] [2022-12-12 14:26:44,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442640614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:44,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:44,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:26:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262057104] [2022-12-12 14:26:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:44,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:26:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:44,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:26:44,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:26:44,069 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 14:26:44,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:44,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:44,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 14:26:44,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:26:44,957 INFO L130 PetriNetUnfolder]: 9203/13696 cut-off events. [2022-12-12 14:26:44,958 INFO L131 PetriNetUnfolder]: For 13023/13588 co-relation queries the response was YES. [2022-12-12 14:26:44,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35608 conditions, 13696 events. 9203/13696 cut-off events. For 13023/13588 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 87504 event pairs, 1245 based on Foata normal form. 136/11350 useless extension candidates. Maximal degree in co-relation 35592. Up to 10592 conditions per place. [2022-12-12 14:26:45,033 INFO L137 encePairwiseOnDemand]: 70/78 looper letters, 61 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2022-12-12 14:26:45,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 422 flow [2022-12-12 14:26:45,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:26:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:26:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-12-12 14:26:45,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-12 14:26:45,035 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 198 flow. Second operand 4 states and 130 transitions. [2022-12-12 14:26:45,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 422 flow [2022-12-12 14:26:45,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 412 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-12 14:26:45,042 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 216 flow [2022-12-12 14:26:45,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2022-12-12 14:26:45,042 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -25 predicate places. [2022-12-12 14:26:45,042 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 216 flow [2022-12-12 14:26:45,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:45,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:45,043 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:26:45,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:26:45,043 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:45,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1762552509, now seen corresponding path program 1 times [2022-12-12 14:26:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:45,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809829264] [2022-12-12 14:26:45,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:45,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:45,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809829264] [2022-12-12 14:26:45,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809829264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:45,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:45,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:26:45,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407628065] [2022-12-12 14:26:45,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:45,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:26:45,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:45,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:26:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:26:45,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 14:26:45,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:45,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:45,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 14:26:45,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:26:46,460 INFO L130 PetriNetUnfolder]: 9480/14037 cut-off events. [2022-12-12 14:26:46,460 INFO L131 PetriNetUnfolder]: For 16659/17375 co-relation queries the response was YES. [2022-12-12 14:26:46,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37685 conditions, 14037 events. 9480/14037 cut-off events. For 16659/17375 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 89044 event pairs, 1423 based on Foata normal form. 112/11635 useless extension candidates. Maximal degree in co-relation 37667. Up to 10736 conditions per place. [2022-12-12 14:26:46,557 INFO L137 encePairwiseOnDemand]: 69/78 looper letters, 72 selfloop transitions, 14 changer transitions 0/102 dead transitions. [2022-12-12 14:26:46,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 102 transitions, 522 flow [2022-12-12 14:26:46,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:26:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:26:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2022-12-12 14:26:46,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2022-12-12 14:26:46,559 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 216 flow. Second operand 5 states and 162 transitions. [2022-12-12 14:26:46,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 102 transitions, 522 flow [2022-12-12 14:26:46,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 102 transitions, 504 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:26:46,565 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 268 flow [2022-12-12 14:26:46,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2022-12-12 14:26:46,566 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -23 predicate places. [2022-12-12 14:26:46,566 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 268 flow [2022-12-12 14:26:46,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:46,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:46,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:26:46,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:26:46,566 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:46,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:46,567 INFO L85 PathProgramCache]: Analyzing trace with hash -331449441, now seen corresponding path program 2 times [2022-12-12 14:26:46,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:46,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422848080] [2022-12-12 14:26:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:46,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:46,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:46,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422848080] [2022-12-12 14:26:46,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422848080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:46,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:46,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:26:46,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051509489] [2022-12-12 14:26:46,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:46,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:26:46,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:26:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:26:46,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 14:26:46,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:46,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:46,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 14:26:46,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:26:48,057 INFO L130 PetriNetUnfolder]: 10666/15668 cut-off events. [2022-12-12 14:26:48,057 INFO L131 PetriNetUnfolder]: For 27814/28796 co-relation queries the response was YES. [2022-12-12 14:26:48,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46475 conditions, 15668 events. 10666/15668 cut-off events. For 27814/28796 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 99628 event pairs, 1772 based on Foata normal form. 208/13111 useless extension candidates. Maximal degree in co-relation 46456. Up to 10361 conditions per place. [2022-12-12 14:26:48,197 INFO L137 encePairwiseOnDemand]: 69/78 looper letters, 83 selfloop transitions, 27 changer transitions 0/126 dead transitions. [2022-12-12 14:26:48,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 126 transitions, 706 flow [2022-12-12 14:26:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:26:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:26:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2022-12-12 14:26:48,199 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4252136752136752 [2022-12-12 14:26:48,199 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 268 flow. Second operand 6 states and 199 transitions. [2022-12-12 14:26:48,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 126 transitions, 706 flow [2022-12-12 14:26:48,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 126 transitions, 670 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-12 14:26:48,210 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 392 flow [2022-12-12 14:26:48,210 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=392, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2022-12-12 14:26:48,211 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -19 predicate places. [2022-12-12 14:26:48,211 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 392 flow [2022-12-12 14:26:48,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:48,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:48,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:26:48,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:26:48,211 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:48,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash 792946791, now seen corresponding path program 1 times [2022-12-12 14:26:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:48,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542765531] [2022-12-12 14:26:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:48,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:48,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542765531] [2022-12-12 14:26:48,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542765531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:48,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:48,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:26:48,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347359119] [2022-12-12 14:26:48,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:48,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:26:48,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:48,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:26:48,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:26:48,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 78 [2022-12-12 14:26:48,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:48,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:48,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 78 [2022-12-12 14:26:48,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:26:52,115 INFO L130 PetriNetUnfolder]: 39092/54337 cut-off events. [2022-12-12 14:26:52,116 INFO L131 PetriNetUnfolder]: For 147326/147326 co-relation queries the response was YES. [2022-12-12 14:26:52,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176864 conditions, 54337 events. 39092/54337 cut-off events. For 147326/147326 co-relation queries the response was YES. Maximal size of possible extension queue 1635. Compared 342638 event pairs, 3603 based on Foata normal form. 588/46751 useless extension candidates. Maximal degree in co-relation 176843. Up to 27998 conditions per place. [2022-12-12 14:26:52,448 INFO L137 encePairwiseOnDemand]: 69/78 looper letters, 127 selfloop transitions, 17 changer transitions 25/180 dead transitions. [2022-12-12 14:26:52,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 180 transitions, 1391 flow [2022-12-12 14:26:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:26:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:26:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2022-12-12 14:26:52,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-12 14:26:52,450 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 392 flow. Second operand 6 states and 169 transitions. [2022-12-12 14:26:52,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 180 transitions, 1391 flow [2022-12-12 14:26:52,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 180 transitions, 1312 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-12 14:26:52,533 INFO L231 Difference]: Finished difference. Result has 79 places, 84 transitions, 543 flow [2022-12-12 14:26:52,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=543, PETRI_PLACES=79, PETRI_TRANSITIONS=84} [2022-12-12 14:26:52,535 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -12 predicate places. [2022-12-12 14:26:52,535 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 84 transitions, 543 flow [2022-12-12 14:26:52,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:52,535 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:52,535 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:26:52,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:26:52,535 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:52,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash -73277725, now seen corresponding path program 2 times [2022-12-12 14:26:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:52,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912137464] [2022-12-12 14:26:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:52,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:52,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912137464] [2022-12-12 14:26:52,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912137464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:52,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:52,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:26:52,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975122877] [2022-12-12 14:26:52,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:52,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:26:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:52,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:26:52,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:26:52,863 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 78 [2022-12-12 14:26:52,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:52,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:52,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 78 [2022-12-12 14:26:52,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:26:58,029 INFO L130 PetriNetUnfolder]: 34443/48504 cut-off events. [2022-12-12 14:26:58,029 INFO L131 PetriNetUnfolder]: For 203875/205762 co-relation queries the response was YES. [2022-12-12 14:26:58,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175142 conditions, 48504 events. 34443/48504 cut-off events. For 203875/205762 co-relation queries the response was YES. Maximal size of possible extension queue 2079. Compared 323235 event pairs, 10716 based on Foata normal form. 826/32961 useless extension candidates. Maximal degree in co-relation 175116. Up to 45466 conditions per place. [2022-12-12 14:26:58,364 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 94 selfloop transitions, 13 changer transitions 0/126 dead transitions. [2022-12-12 14:26:58,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 126 transitions, 981 flow [2022-12-12 14:26:58,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:26:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:26:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-12-12 14:26:58,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41452991452991456 [2022-12-12 14:26:58,366 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 543 flow. Second operand 3 states and 97 transitions. [2022-12-12 14:26:58,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 126 transitions, 981 flow [2022-12-12 14:26:58,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 126 transitions, 981 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-12 14:26:58,409 INFO L231 Difference]: Finished difference. Result has 82 places, 92 transitions, 590 flow [2022-12-12 14:26:58,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=82, PETRI_TRANSITIONS=92} [2022-12-12 14:26:58,410 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -9 predicate places. [2022-12-12 14:26:58,410 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 92 transitions, 590 flow [2022-12-12 14:26:58,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:58,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:26:58,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:26:58,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:26:58,411 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:26:58,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:26:58,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1654151018, now seen corresponding path program 1 times [2022-12-12 14:26:58,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:26:58,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700690424] [2022-12-12 14:26:58,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:26:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:26:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:26:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:26:58,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:26:58,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700690424] [2022-12-12 14:26:58,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700690424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:26:58,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:26:58,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:26:58,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430666044] [2022-12-12 14:26:58,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:26:58,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:26:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:26:58,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:26:58,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:26:58,536 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 78 [2022-12-12 14:26:58,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 92 transitions, 590 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:26:58,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:26:58,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 78 [2022-12-12 14:26:58,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:27:02,628 INFO L130 PetriNetUnfolder]: 22872/33945 cut-off events. [2022-12-12 14:27:02,630 INFO L131 PetriNetUnfolder]: For 131997/133969 co-relation queries the response was YES. [2022-12-12 14:27:02,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140915 conditions, 33945 events. 22872/33945 cut-off events. For 131997/133969 co-relation queries the response was YES. Maximal size of possible extension queue 1629. Compared 238594 event pairs, 3723 based on Foata normal form. 1338/24086 useless extension candidates. Maximal degree in co-relation 140886. Up to 27154 conditions per place. [2022-12-12 14:27:02,867 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 114 selfloop transitions, 25 changer transitions 4/162 dead transitions. [2022-12-12 14:27:02,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 162 transitions, 1348 flow [2022-12-12 14:27:02,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:27:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:27:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-12-12 14:27:02,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2022-12-12 14:27:02,869 INFO L175 Difference]: Start difference. First operand has 82 places, 92 transitions, 590 flow. Second operand 4 states and 134 transitions. [2022-12-12 14:27:02,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 162 transitions, 1348 flow [2022-12-12 14:27:02,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 162 transitions, 1335 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:27:02,935 INFO L231 Difference]: Finished difference. Result has 85 places, 104 transitions, 725 flow [2022-12-12 14:27:02,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=725, PETRI_PLACES=85, PETRI_TRANSITIONS=104} [2022-12-12 14:27:02,936 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2022-12-12 14:27:02,936 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 104 transitions, 725 flow [2022-12-12 14:27:02,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:27:02,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:27:02,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:27:02,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:27:02,937 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:27:02,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:27:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash -29291516, now seen corresponding path program 1 times [2022-12-12 14:27:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:27:02,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807190826] [2022-12-12 14:27:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:27:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:27:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:27:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:27:03,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:27:03,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807190826] [2022-12-12 14:27:03,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807190826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:27:03,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:27:03,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:27:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377807444] [2022-12-12 14:27:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:27:03,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:27:03,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:27:03,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:27:03,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:27:03,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 78 [2022-12-12 14:27:03,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 104 transitions, 725 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:27:03,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:27:03,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 78 [2022-12-12 14:27:03,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:27:09,234 INFO L130 PetriNetUnfolder]: 36592/56218 cut-off events. [2022-12-12 14:27:09,235 INFO L131 PetriNetUnfolder]: For 215752/224544 co-relation queries the response was YES. [2022-12-12 14:27:09,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252149 conditions, 56218 events. 36592/56218 cut-off events. For 215752/224544 co-relation queries the response was YES. Maximal size of possible extension queue 3133. Compared 454630 event pairs, 4033 based on Foata normal form. 2739/47985 useless extension candidates. Maximal degree in co-relation 252118. Up to 30505 conditions per place. [2022-12-12 14:27:09,803 INFO L137 encePairwiseOnDemand]: 75/78 looper letters, 177 selfloop transitions, 2 changer transitions 3/209 dead transitions. [2022-12-12 14:27:09,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 209 transitions, 1904 flow [2022-12-12 14:27:09,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:27:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:27:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-12-12 14:27:09,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2022-12-12 14:27:09,811 INFO L175 Difference]: Start difference. First operand has 85 places, 104 transitions, 725 flow. Second operand 4 states and 122 transitions. [2022-12-12 14:27:09,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 209 transitions, 1904 flow [2022-12-12 14:27:09,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 209 transitions, 1798 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-12 14:27:09,862 INFO L231 Difference]: Finished difference. Result has 88 places, 105 transitions, 688 flow [2022-12-12 14:27:09,862 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=688, PETRI_PLACES=88, PETRI_TRANSITIONS=105} [2022-12-12 14:27:09,863 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -3 predicate places. [2022-12-12 14:27:09,863 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 105 transitions, 688 flow [2022-12-12 14:27:09,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:27:09,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:27:09,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:27:09,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 14:27:09,864 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:27:09,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:27:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1289749284, now seen corresponding path program 2 times [2022-12-12 14:27:09,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:27:09,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975948591] [2022-12-12 14:27:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:27:09,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:27:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:27:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:27:10,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:27:10,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975948591] [2022-12-12 14:27:10,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975948591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:27:10,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:27:10,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:27:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982843344] [2022-12-12 14:27:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:27:10,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:27:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:27:10,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:27:10,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:27:10,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 78 [2022-12-12 14:27:10,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 105 transitions, 688 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:27:10,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:27:10,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 78 [2022-12-12 14:27:10,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:27:14,140 INFO L130 PetriNetUnfolder]: 20176/31717 cut-off events. [2022-12-12 14:27:14,140 INFO L131 PetriNetUnfolder]: For 119781/121244 co-relation queries the response was YES. [2022-12-12 14:27:14,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140991 conditions, 31717 events. 20176/31717 cut-off events. For 119781/121244 co-relation queries the response was YES. Maximal size of possible extension queue 1551. Compared 242729 event pairs, 1309 based on Foata normal form. 2629/22947 useless extension candidates. Maximal degree in co-relation 140959. Up to 15526 conditions per place. [2022-12-12 14:27:14,387 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 120 selfloop transitions, 37 changer transitions 7/183 dead transitions. [2022-12-12 14:27:14,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 183 transitions, 1567 flow [2022-12-12 14:27:14,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:27:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:27:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2022-12-12 14:27:14,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-12 14:27:14,389 INFO L175 Difference]: Start difference. First operand has 88 places, 105 transitions, 688 flow. Second operand 5 states and 169 transitions. [2022-12-12 14:27:14,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 183 transitions, 1567 flow [2022-12-12 14:27:14,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 183 transitions, 1563 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:27:14,453 INFO L231 Difference]: Finished difference. Result has 92 places, 113 transitions, 850 flow [2022-12-12 14:27:14,453 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=850, PETRI_PLACES=92, PETRI_TRANSITIONS=113} [2022-12-12 14:27:14,453 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2022-12-12 14:27:14,453 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 113 transitions, 850 flow [2022-12-12 14:27:14,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:27:14,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:27:14,453 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:27:14,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 14:27:14,454 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:27:14,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:27:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1080998999, now seen corresponding path program 1 times [2022-12-12 14:27:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:27:14,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041309709] [2022-12-12 14:27:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:27:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:27:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:27:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:27:15,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:27:15,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041309709] [2022-12-12 14:27:15,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041309709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:27:15,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:27:15,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:27:15,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783710998] [2022-12-12 14:27:15,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:27:15,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:27:15,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:27:15,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:27:15,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:27:15,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 78 [2022-12-12 14:27:15,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 113 transitions, 850 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:27:15,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:27:15,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 78 [2022-12-12 14:27:15,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:27:17,812 INFO L130 PetriNetUnfolder]: 15373/23401 cut-off events. [2022-12-12 14:27:17,813 INFO L131 PetriNetUnfolder]: For 76928/78287 co-relation queries the response was YES. [2022-12-12 14:27:17,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115955 conditions, 23401 events. 15373/23401 cut-off events. For 76928/78287 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 163438 event pairs, 426 based on Foata normal form. 1823/15982 useless extension candidates. Maximal degree in co-relation 115921. Up to 11071 conditions per place. [2022-12-12 14:27:17,981 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 72 selfloop transitions, 49 changer transitions 44/182 dead transitions. [2022-12-12 14:27:17,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 182 transitions, 1680 flow [2022-12-12 14:27:17,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:27:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:27:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2022-12-12 14:27:17,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-12 14:27:17,983 INFO L175 Difference]: Start difference. First operand has 92 places, 113 transitions, 850 flow. Second operand 6 states and 182 transitions. [2022-12-12 14:27:17,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 182 transitions, 1680 flow [2022-12-12 14:27:19,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 182 transitions, 1484 flow, removed 60 selfloop flow, removed 6 redundant places. [2022-12-12 14:27:19,809 INFO L231 Difference]: Finished difference. Result has 92 places, 102 transitions, 729 flow [2022-12-12 14:27:19,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=729, PETRI_PLACES=92, PETRI_TRANSITIONS=102} [2022-12-12 14:27:19,809 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2022-12-12 14:27:19,809 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 102 transitions, 729 flow [2022-12-12 14:27:19,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:27:19,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:27:19,810 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:27:19,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 14:27:19,810 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:27:19,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:27:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1922925479, now seen corresponding path program 1 times [2022-12-12 14:27:19,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:27:19,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842845631] [2022-12-12 14:27:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:27:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:27:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:27:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:27:19,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:27:19,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842845631] [2022-12-12 14:27:19,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842845631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:27:19,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:27:19,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:27:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20326253] [2022-12-12 14:27:19,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:27:19,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:27:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:27:19,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:27:19,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:27:19,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-12 14:27:19,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 102 transitions, 729 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:27:19,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:27:19,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-12 14:27:19,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:27:21,678 INFO L130 PetriNetUnfolder]: 12288/19793 cut-off events. [2022-12-12 14:27:21,678 INFO L131 PetriNetUnfolder]: For 59122/61626 co-relation queries the response was YES. [2022-12-12 14:27:21,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89258 conditions, 19793 events. 12288/19793 cut-off events. For 59122/61626 co-relation queries the response was YES. Maximal size of possible extension queue 1229. Compared 146656 event pairs, 1502 based on Foata normal form. 1090/15996 useless extension candidates. Maximal degree in co-relation 89226. Up to 8278 conditions per place. [2022-12-12 14:27:21,750 INFO L137 encePairwiseOnDemand]: 75/78 looper letters, 101 selfloop transitions, 2 changer transitions 57/190 dead transitions. [2022-12-12 14:27:21,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 190 transitions, 1725 flow [2022-12-12 14:27:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:27:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:27:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-12-12 14:27:21,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2022-12-12 14:27:21,751 INFO L175 Difference]: Start difference. First operand has 92 places, 102 transitions, 729 flow. Second operand 4 states and 128 transitions. [2022-12-12 14:27:21,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 190 transitions, 1725 flow [2022-12-12 14:27:23,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 190 transitions, 1451 flow, removed 61 selfloop flow, removed 5 redundant places. [2022-12-12 14:27:23,388 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 495 flow [2022-12-12 14:27:23,389 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=495, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2022-12-12 14:27:23,390 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -1 predicate places. [2022-12-12 14:27:23,390 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 495 flow [2022-12-12 14:27:23,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:27:23,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:27:23,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:27:23,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 14:27:23,390 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:27:23,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:27:23,391 INFO L85 PathProgramCache]: Analyzing trace with hash 379426206, now seen corresponding path program 1 times [2022-12-12 14:27:23,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:27:23,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132481948] [2022-12-12 14:27:23,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:27:23,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:27:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:27:23,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:27:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:27:23,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:27:23,490 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:27:23,491 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 14:27:23,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 14:27:23,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 14:27:23,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 14:27:23,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 14:27:23,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 14:27:23,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 14:27:23,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-12 14:27:23,492 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:27:23,496 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:27:23,496 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:27:23,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:27:23 BasicIcfg [2022-12-12 14:27:23,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:27:23,579 INFO L158 Benchmark]: Toolchain (without parser) took 69833.10ms. Allocated memory was 202.4MB in the beginning and 7.0GB in the end (delta: 6.7GB). Free memory was 177.2MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-12 14:27:23,579 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory was 179.0MB in the beginning and 178.9MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:27:23,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.59ms. Allocated memory is still 202.4MB. Free memory was 176.7MB in the beginning and 148.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-12 14:27:23,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.78ms. Allocated memory is still 202.4MB. Free memory was 148.4MB in the beginning and 145.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 14:27:23,580 INFO L158 Benchmark]: Boogie Preprocessor took 25.49ms. Allocated memory is still 202.4MB. Free memory was 145.8MB in the beginning and 143.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:27:23,580 INFO L158 Benchmark]: RCFGBuilder took 702.01ms. Allocated memory is still 202.4MB. Free memory was 143.7MB in the beginning and 104.4MB in the end (delta: 39.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-12 14:27:23,580 INFO L158 Benchmark]: TraceAbstraction took 68548.41ms. Allocated memory was 202.4MB in the beginning and 7.0GB in the end (delta: 6.7GB). Free memory was 103.3MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-12 14:27:23,581 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 202.4MB. Free memory was 179.0MB in the beginning and 178.9MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 508.59ms. Allocated memory is still 202.4MB. Free memory was 176.7MB in the beginning and 148.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.78ms. Allocated memory is still 202.4MB. Free memory was 148.4MB in the beginning and 145.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.49ms. Allocated memory is still 202.4MB. Free memory was 145.8MB in the beginning and 143.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 702.01ms. Allocated memory is still 202.4MB. Free memory was 143.7MB in the beginning and 104.4MB in the end (delta: 39.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 68548.41ms. Allocated memory was 202.4MB in the beginning and 7.0GB in the end (delta: 6.7GB). Free memory was 103.3MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5s, 140 PlacesBefore, 91 PlacesAfterwards, 129 TransitionsBefore, 78 TransitionsAfterwards, 3272 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5917, independent: 5698, independent conditional: 5698, independent unconditional: 0, dependent: 219, dependent conditional: 219, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5917, independent: 5698, independent conditional: 0, independent unconditional: 5698, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5917, independent: 5698, independent conditional: 0, independent unconditional: 5698, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5917, independent: 5698, independent conditional: 0, independent unconditional: 5698, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3125, independent: 3047, independent conditional: 0, independent unconditional: 3047, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3125, independent: 3023, independent conditional: 0, independent unconditional: 3023, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 102, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 549, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 505, dependent conditional: 0, dependent unconditional: 505, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5917, independent: 2651, independent conditional: 0, independent unconditional: 2651, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 3125, unknown conditional: 0, unknown unconditional: 3125] , Statistics on independence cache: Total cache size (in pairs): 5223, Positive cache size: 5145, Positive conditional cache size: 0, Positive unconditional cache size: 5145, Negative cache size: 78, Negative conditional cache size: 0, Negative unconditional cache size: 78, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=-1, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x=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, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=0, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x=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, z=0] [L862] 0 pthread_t t147; [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=1, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t148; [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=2, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 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) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 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 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 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) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 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 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] 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) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 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 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 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 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 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) [L883] 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)) [L884] 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)) [L885] 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)) [L886] 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)) [L887] 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)) [L888] 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)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 68.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 53.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 670 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 670 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1726 IncrementalHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 32 mSDtfsCounter, 1726 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=850occurred in iteration=14, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 2330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 14:27:23,603 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...