/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:55:37,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:55:37,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:55:37,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:55:37,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:55:37,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:55:37,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:55:37,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:55:37,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:55:37,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:55:37,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:55:37,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:55:37,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:55:37,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:55:37,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:55:37,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:55:37,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:55:37,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:55:37,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:55:37,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:55:37,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:55:37,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:55:37,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:55:37,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:55:37,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:55:37,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:55:37,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:55:37,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:55:37,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:55:37,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:55:37,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:55:37,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:55:37,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:55:37,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:55:37,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:55:37,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:55:37,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:55:37,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:55:37,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:55:37,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:55:37,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:55:37,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:55:37,206 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:55:37,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:55:37,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:55:37,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:55:37,209 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:55:37,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:55:37,209 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:55:37,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:55:37,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:55:37,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:55:37,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:55:37,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:55:37,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:55:37,211 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:55:37,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:55:37,211 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:55:37,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:55:37,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:55:37,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:55:37,211 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:55:37,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:55:37,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:55:37,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:55:37,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:55:37,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:55:37,212 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:55:37,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:55:37,212 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:55:37,213 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-13 11:55:37,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:55:37,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:55:37,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:55:37,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:55:37,519 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:55:37,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-12-13 11:55:38,674 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:55:38,891 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:55:38,891 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-12-13 11:55:38,907 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9e3b33a/e547c3eef5c6494ca96645488fdac101/FLAG3e12c5e5b [2022-12-13 11:55:38,935 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9e3b33a/e547c3eef5c6494ca96645488fdac101 [2022-12-13 11:55:38,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:55:38,938 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:55:38,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:55:38,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:55:38,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:55:38,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:55:38" (1/1) ... [2022-12-13 11:55:38,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614f3974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:38, skipping insertion in model container [2022-12-13 11:55:38,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:55:38" (1/1) ... [2022-12-13 11:55:38,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:55:38,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:55:39,121 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/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-12-13 11:55:39,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:55:39,298 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:55:39,306 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/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-12-13 11:55:39,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:55:39,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:55:39,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:55:39,388 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:55:39,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39 WrapperNode [2022-12-13 11:55:39,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:55:39,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:55:39,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:55:39,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:55:39,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (1/1) ... [2022-12-13 11:55:39,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (1/1) ... [2022-12-13 11:55:39,433 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 11:55:39,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:55:39,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:55:39,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:55:39,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:55:39,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (1/1) ... [2022-12-13 11:55:39,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (1/1) ... [2022-12-13 11:55:39,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (1/1) ... [2022-12-13 11:55:39,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (1/1) ... [2022-12-13 11:55:39,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (1/1) ... [2022-12-13 11:55:39,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (1/1) ... [2022-12-13 11:55:39,456 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (1/1) ... [2022-12-13 11:55:39,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (1/1) ... [2022-12-13 11:55:39,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:55:39,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:55:39,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:55:39,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:55:39,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (1/1) ... [2022-12-13 11:55:39,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:55:39,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:55:39,483 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-13 11:55:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:55:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:55:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:55:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:55:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:55:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:55:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:55:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:55:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:55:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:55:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:55:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:55:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:55:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:55:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:55:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:55:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:55:39,559 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:55:39,532 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-13 11:55:39,716 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:55:39,718 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:55:39,980 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:55:40,074 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:55:40,074 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:55:40,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:55:40 BoogieIcfgContainer [2022-12-13 11:55:40,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:55:40,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:55:40,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:55:40,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:55:40,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:55:38" (1/3) ... [2022-12-13 11:55:40,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50086cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:55:40, skipping insertion in model container [2022-12-13 11:55:40,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:55:39" (2/3) ... [2022-12-13 11:55:40,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50086cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:55:40, skipping insertion in model container [2022-12-13 11:55:40,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:55:40" (3/3) ... [2022-12-13 11:55:40,081 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2022-12-13 11:55:40,095 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:55:40,095 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:55:40,095 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:55:40,160 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:55:40,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2022-12-13 11:55:40,215 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 11:55:40,216 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:55:40,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-13 11:55:40,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 126 transitions, 272 flow [2022-12-13 11:55:40,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 256 flow [2022-12-13 11:55:40,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:40,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 122 transitions, 256 flow [2022-12-13 11:55:40,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 122 transitions, 256 flow [2022-12-13 11:55:40,293 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 11:55:40,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:55:40,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-13 11:55:40,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 122 transitions, 256 flow [2022-12-13 11:55:40,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 2620 [2022-12-13 11:55:44,256 INFO L241 LiptonReduction]: Total number of compositions: 96 [2022-12-13 11:55:44,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:55:44,284 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41fc4520, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:55:44,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 11:55:44,301 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 11:55:44,302 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:55:44,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:44,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:55:44,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:44,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:44,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1819043418, now seen corresponding path program 1 times [2022-12-13 11:55:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:44,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435837862] [2022-12-13 11:55:44,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:44,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:44,655 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-13 11:55:44,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:44,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435837862] [2022-12-13 11:55:44,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435837862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:44,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:44,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:55:44,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412158990] [2022-12-13 11:55:44,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:44,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:55:44,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:44,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:55:44,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:55:44,683 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 65 [2022-12-13 11:55:44,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:55:44,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:44,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 65 [2022-12-13 11:55:44,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:47,605 INFO L130 PetriNetUnfolder]: 32263/47327 cut-off events. [2022-12-13 11:55:47,606 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-13 11:55:47,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90399 conditions, 47327 events. 32263/47327 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 3046. Compared 372237 event pairs, 5127 based on Foata normal form. 0/29432 useless extension candidates. Maximal degree in co-relation 90387. Up to 35457 conditions per place. [2022-12-13 11:55:47,845 INFO L137 encePairwiseOnDemand]: 59/65 looper letters, 36 selfloop transitions, 2 changer transitions 45/96 dead transitions. [2022-12-13 11:55:47,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 96 transitions, 368 flow [2022-12-13 11:55:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:55:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:55:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-12-13 11:55:47,857 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2022-12-13 11:55:47,859 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 142 flow. Second operand 3 states and 131 transitions. [2022-12-13 11:55:47,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 96 transitions, 368 flow [2022-12-13 11:55:47,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 96 transitions, 364 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:55:47,864 INFO L231 Difference]: Finished difference. Result has 72 places, 38 transitions, 88 flow [2022-12-13 11:55:47,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=72, PETRI_TRANSITIONS=38} [2022-12-13 11:55:47,868 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -4 predicate places. [2022-12-13 11:55:47,868 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:47,868 INFO L89 Accepts]: Start accepts. Operand has 72 places, 38 transitions, 88 flow [2022-12-13 11:55:47,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:47,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:47,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 38 transitions, 88 flow [2022-12-13 11:55:47,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 38 transitions, 88 flow [2022-12-13 11:55:47,876 INFO L130 PetriNetUnfolder]: 0/38 cut-off events. [2022-12-13 11:55:47,876 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:55:47,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 87 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:55:47,879 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 38 transitions, 88 flow [2022-12-13 11:55:47,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 862 [2022-12-13 11:55:47,988 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:47,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 11:55:47,989 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2022-12-13 11:55:47,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:55:47,989 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:47,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:55:47,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:55:47,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:47,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:47,990 INFO L85 PathProgramCache]: Analyzing trace with hash -48989299, now seen corresponding path program 1 times [2022-12-13 11:55:47,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:47,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607539260] [2022-12-13 11:55:47,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:47,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:48,108 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-13 11:55:48,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:48,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607539260] [2022-12-13 11:55:48,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607539260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:48,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:48,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:55:48,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95625877] [2022-12-13 11:55:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:48,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:55:48,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:48,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:55:48,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:55:48,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 11:55:48,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:55:48,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:48,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 11:55:48,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:49,664 INFO L130 PetriNetUnfolder]: 18209/26016 cut-off events. [2022-12-13 11:55:49,665 INFO L131 PetriNetUnfolder]: For 890/890 co-relation queries the response was YES. [2022-12-13 11:55:49,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52056 conditions, 26016 events. 18209/26016 cut-off events. For 890/890 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 161435 event pairs, 6562 based on Foata normal form. 0/20118 useless extension candidates. Maximal degree in co-relation 52046. Up to 16641 conditions per place. [2022-12-13 11:55:49,763 INFO L137 encePairwiseOnDemand]: 31/38 looper letters, 45 selfloop transitions, 6 changer transitions 2/62 dead transitions. [2022-12-13 11:55:49,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 248 flow [2022-12-13 11:55:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:55:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:55:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-13 11:55:49,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7105263157894737 [2022-12-13 11:55:49,764 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 81 transitions. [2022-12-13 11:55:49,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 248 flow [2022-12-13 11:55:49,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:55:49,782 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 128 flow [2022-12-13 11:55:49,783 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 11:55:49,783 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -25 predicate places. [2022-12-13 11:55:49,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:49,783 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 128 flow [2022-12-13 11:55:49,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:49,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:49,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 128 flow [2022-12-13 11:55:49,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 128 flow [2022-12-13 11:55:49,800 INFO L130 PetriNetUnfolder]: 86/342 cut-off events. [2022-12-13 11:55:49,800 INFO L131 PetriNetUnfolder]: For 28/39 co-relation queries the response was YES. [2022-12-13 11:55:49,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 342 events. 86/342 cut-off events. For 28/39 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2247 event pairs, 44 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 561. Up to 131 conditions per place. [2022-12-13 11:55:49,803 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 128 flow [2022-12-13 11:55:49,803 INFO L226 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-13 11:55:49,811 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:49,812 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 11:55:49,812 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 128 flow [2022-12-13 11:55:49,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:55:49,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:49,812 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:55:49,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:55:49,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:49,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:49,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1518668687, now seen corresponding path program 1 times [2022-12-13 11:55:49,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:49,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250958871] [2022-12-13 11:55:49,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:49,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:49,961 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-13 11:55:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:49,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250958871] [2022-12-13 11:55:49,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250958871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:49,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:49,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:55:49,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84001683] [2022-12-13 11:55:49,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:49,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:55:49,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:49,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:55:49,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:55:49,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2022-12-13 11:55:49,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-13 11:55:49,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:49,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2022-12-13 11:55:49,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:51,930 INFO L130 PetriNetUnfolder]: 25198/34397 cut-off events. [2022-12-13 11:55:51,930 INFO L131 PetriNetUnfolder]: For 6364/6406 co-relation queries the response was YES. [2022-12-13 11:55:52,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75838 conditions, 34397 events. 25198/34397 cut-off events. For 6364/6406 co-relation queries the response was YES. Maximal size of possible extension queue 2201. Compared 219584 event pairs, 9441 based on Foata normal form. 56/20520 useless extension candidates. Maximal degree in co-relation 75826. Up to 33514 conditions per place. [2022-12-13 11:55:52,145 INFO L137 encePairwiseOnDemand]: 23/37 looper letters, 44 selfloop transitions, 13 changer transitions 0/68 dead transitions. [2022-12-13 11:55:52,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 312 flow [2022-12-13 11:55:52,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:55:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:55:52,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-12-13 11:55:52,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2022-12-13 11:55:52,146 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 128 flow. Second operand 3 states and 78 transitions. [2022-12-13 11:55:52,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 312 flow [2022-12-13 11:55:52,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:55:52,156 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 205 flow [2022-12-13 11:55:52,156 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2022-12-13 11:55:52,157 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -25 predicate places. [2022-12-13 11:55:52,157 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:52,157 INFO L89 Accepts]: Start accepts. Operand has 51 places, 54 transitions, 205 flow [2022-12-13 11:55:52,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:52,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:52,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 54 transitions, 205 flow [2022-12-13 11:55:52,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 54 transitions, 205 flow [2022-12-13 11:55:52,576 INFO L130 PetriNetUnfolder]: 6422/10159 cut-off events. [2022-12-13 11:55:52,577 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:55:52,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19920 conditions, 10159 events. 6422/10159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 80012 event pairs, 3682 based on Foata normal form. 0/4453 useless extension candidates. Maximal degree in co-relation 19910. Up to 8707 conditions per place. [2022-12-13 11:55:52,633 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 54 transitions, 205 flow [2022-12-13 11:55:52,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 1220 [2022-12-13 11:55:52,688 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:52,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 532 [2022-12-13 11:55:52,689 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 205 flow [2022-12-13 11:55:52,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-13 11:55:52,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:52,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:55:52,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:55:52,689 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2061278454, now seen corresponding path program 1 times [2022-12-13 11:55:52,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:52,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260089479] [2022-12-13 11:55:52,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:52,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:52,786 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-13 11:55:52,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:52,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260089479] [2022-12-13 11:55:52,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260089479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:52,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:52,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:55:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714009391] [2022-12-13 11:55:52,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:52,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:55:52,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:52,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:55:52,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:55:52,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2022-12-13 11:55:52,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-13 11:55:52,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:52,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2022-12-13 11:55:52,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:54,233 INFO L130 PetriNetUnfolder]: 17363/24971 cut-off events. [2022-12-13 11:55:54,234 INFO L131 PetriNetUnfolder]: For 3909/4341 co-relation queries the response was YES. [2022-12-13 11:55:54,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70189 conditions, 24971 events. 17363/24971 cut-off events. For 3909/4341 co-relation queries the response was YES. Maximal size of possible extension queue 1683. Compared 167568 event pairs, 3186 based on Foata normal form. 459/15701 useless extension candidates. Maximal degree in co-relation 70176. Up to 22492 conditions per place. [2022-12-13 11:55:54,460 INFO L137 encePairwiseOnDemand]: 23/37 looper letters, 56 selfloop transitions, 25 changer transitions 0/92 dead transitions. [2022-12-13 11:55:54,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 92 transitions, 493 flow [2022-12-13 11:55:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:55:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:55:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-12-13 11:55:54,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7297297297297297 [2022-12-13 11:55:54,464 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 205 flow. Second operand 4 states and 108 transitions. [2022-12-13 11:55:54,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 92 transitions, 493 flow [2022-12-13 11:55:54,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:55:54,467 INFO L231 Difference]: Finished difference. Result has 54 places, 66 transitions, 340 flow [2022-12-13 11:55:54,467 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=54, PETRI_TRANSITIONS=66} [2022-12-13 11:55:54,468 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -22 predicate places. [2022-12-13 11:55:54,468 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:54,468 INFO L89 Accepts]: Start accepts. Operand has 54 places, 66 transitions, 340 flow [2022-12-13 11:55:54,469 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:54,470 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:54,470 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 66 transitions, 340 flow [2022-12-13 11:55:54,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 66 transitions, 340 flow [2022-12-13 11:55:54,782 INFO L130 PetriNetUnfolder]: 4589/7945 cut-off events. [2022-12-13 11:55:54,783 INFO L131 PetriNetUnfolder]: For 471/2847 co-relation queries the response was YES. [2022-12-13 11:55:54,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22712 conditions, 7945 events. 4589/7945 cut-off events. For 471/2847 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 66379 event pairs, 1315 based on Foata normal form. 18/3826 useless extension candidates. Maximal degree in co-relation 22700. Up to 6631 conditions per place. [2022-12-13 11:55:54,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 66 transitions, 340 flow [2022-12-13 11:55:54,837 INFO L226 LiptonReduction]: Number of co-enabled transitions 1586 [2022-12-13 11:55:54,875 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:54,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 414 [2022-12-13 11:55:54,882 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 66 transitions, 340 flow [2022-12-13 11:55:54,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-13 11:55:54,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:54,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:55:54,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:55:54,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:54,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1359813665, now seen corresponding path program 1 times [2022-12-13 11:55:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:54,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347040482] [2022-12-13 11:55:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:54,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:54,988 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-13 11:55:54,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:54,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347040482] [2022-12-13 11:55:54,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347040482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:54,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:54,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:55:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133419145] [2022-12-13 11:55:54,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:54,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:55:54,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:54,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:55:54,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:55:54,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2022-12-13 11:55:54,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 66 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-13 11:55:54,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:54,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2022-12-13 11:55:54,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:55,858 INFO L130 PetriNetUnfolder]: 9272/14288 cut-off events. [2022-12-13 11:55:55,858 INFO L131 PetriNetUnfolder]: For 3972/5142 co-relation queries the response was YES. [2022-12-13 11:55:55,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51480 conditions, 14288 events. 9272/14288 cut-off events. For 3972/5142 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 99464 event pairs, 720 based on Foata normal form. 912/9485 useless extension candidates. Maximal degree in co-relation 51465. Up to 8983 conditions per place. [2022-12-13 11:55:55,931 INFO L137 encePairwiseOnDemand]: 23/37 looper letters, 66 selfloop transitions, 37 changer transitions 0/114 dead transitions. [2022-12-13 11:55:55,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 114 transitions, 726 flow [2022-12-13 11:55:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:55:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:55:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2022-12-13 11:55:55,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7351351351351352 [2022-12-13 11:55:55,934 INFO L175 Difference]: Start difference. First operand has 54 places, 66 transitions, 340 flow. Second operand 5 states and 136 transitions. [2022-12-13 11:55:55,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 114 transitions, 726 flow [2022-12-13 11:55:55,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 114 transitions, 676 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 11:55:55,940 INFO L231 Difference]: Finished difference. Result has 57 places, 78 transitions, 486 flow [2022-12-13 11:55:55,941 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=486, PETRI_PLACES=57, PETRI_TRANSITIONS=78} [2022-12-13 11:55:55,942 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -19 predicate places. [2022-12-13 11:55:55,943 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:55,943 INFO L89 Accepts]: Start accepts. Operand has 57 places, 78 transitions, 486 flow [2022-12-13 11:55:55,943 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:55,944 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:55,944 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 78 transitions, 486 flow [2022-12-13 11:55:55,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 78 transitions, 486 flow [2022-12-13 11:55:56,294 INFO L130 PetriNetUnfolder]: 2429/4894 cut-off events. [2022-12-13 11:55:56,294 INFO L131 PetriNetUnfolder]: For 1269/2817 co-relation queries the response was YES. [2022-12-13 11:55:56,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17949 conditions, 4894 events. 2429/4894 cut-off events. For 1269/2817 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 43513 event pairs, 253 based on Foata normal form. 21/2470 useless extension candidates. Maximal degree in co-relation 17936. Up to 3925 conditions per place. [2022-12-13 11:55:56,321 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 78 transitions, 486 flow [2022-12-13 11:55:56,321 INFO L226 LiptonReduction]: Number of co-enabled transitions 1610 [2022-12-13 11:55:56,353 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:56,354 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 411 [2022-12-13 11:55:56,354 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 78 transitions, 486 flow [2022-12-13 11:55:56,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-13 11:55:56,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:56,354 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] [2022-12-13 11:55:56,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:55:56,354 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:56,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:56,355 INFO L85 PathProgramCache]: Analyzing trace with hash -604486698, now seen corresponding path program 1 times [2022-12-13 11:55:56,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:56,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295963551] [2022-12-13 11:55:56,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:56,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:56,532 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-13 11:55:56,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:56,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295963551] [2022-12-13 11:55:56,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295963551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:56,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:56,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:55:56,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504706515] [2022-12-13 11:55:56,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:56,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:55:56,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:56,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:55:56,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:55:56,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2022-12-13 11:55:56,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 78 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-13 11:55:56,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:56,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2022-12-13 11:55:56,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:57,895 INFO L130 PetriNetUnfolder]: 11964/19102 cut-off events. [2022-12-13 11:55:57,895 INFO L131 PetriNetUnfolder]: For 20828/22940 co-relation queries the response was YES. [2022-12-13 11:55:57,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74847 conditions, 19102 events. 11964/19102 cut-off events. For 20828/22940 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 139341 event pairs, 770 based on Foata normal form. 1310/16502 useless extension candidates. Maximal degree in co-relation 74831. Up to 10727 conditions per place. [2022-12-13 11:55:58,000 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 143 selfloop transitions, 14 changer transitions 4/182 dead transitions. [2022-12-13 11:55:58,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 182 transitions, 1474 flow [2022-12-13 11:55:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:55:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:55:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2022-12-13 11:55:58,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7135135135135136 [2022-12-13 11:55:58,002 INFO L175 Difference]: Start difference. First operand has 57 places, 78 transitions, 486 flow. Second operand 5 states and 132 transitions. [2022-12-13 11:55:58,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 182 transitions, 1474 flow [2022-12-13 11:55:58,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 182 transitions, 1216 flow, removed 64 selfloop flow, removed 3 redundant places. [2022-12-13 11:55:58,207 INFO L231 Difference]: Finished difference. Result has 61 places, 87 transitions, 484 flow [2022-12-13 11:55:58,207 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=484, PETRI_PLACES=61, PETRI_TRANSITIONS=87} [2022-12-13 11:55:58,209 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -15 predicate places. [2022-12-13 11:55:58,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:58,210 INFO L89 Accepts]: Start accepts. Operand has 61 places, 87 transitions, 484 flow [2022-12-13 11:55:58,211 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:58,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:58,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 87 transitions, 484 flow [2022-12-13 11:55:58,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 87 transitions, 484 flow [2022-12-13 11:55:58,605 INFO L130 PetriNetUnfolder]: 3613/7202 cut-off events. [2022-12-13 11:55:58,606 INFO L131 PetriNetUnfolder]: For 3986/4451 co-relation queries the response was YES. [2022-12-13 11:55:58,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21515 conditions, 7202 events. 3613/7202 cut-off events. For 3986/4451 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 66545 event pairs, 276 based on Foata normal form. 33/3632 useless extension candidates. Maximal degree in co-relation 21499. Up to 4834 conditions per place. [2022-12-13 11:55:58,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 87 transitions, 484 flow [2022-12-13 11:55:58,646 INFO L226 LiptonReduction]: Number of co-enabled transitions 2070 [2022-12-13 11:55:58,678 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:55:58,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 470 [2022-12-13 11:55:58,679 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 87 transitions, 484 flow [2022-12-13 11:55:58,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-13 11:55:58,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:55:58,679 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] [2022-12-13 11:55:58,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:55:58,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:55:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:55:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash -4938865, now seen corresponding path program 1 times [2022-12-13 11:55:58,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:55:58,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859452302] [2022-12-13 11:55:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:55:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:55:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:55:58,797 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-13 11:55:58,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:55:58,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859452302] [2022-12-13 11:55:58,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859452302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:55:58,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:55:58,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:55:58,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754017684] [2022-12-13 11:55:58,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:55:58,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:55:58,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:55:58,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:55:58,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:55:58,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2022-12-13 11:55:58,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 87 transitions, 484 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-13 11:55:58,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:55:58,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2022-12-13 11:55:58,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:55:59,620 INFO L130 PetriNetUnfolder]: 8271/12727 cut-off events. [2022-12-13 11:55:59,620 INFO L131 PetriNetUnfolder]: For 12483/13798 co-relation queries the response was YES. [2022-12-13 11:55:59,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44927 conditions, 12727 events. 8271/12727 cut-off events. For 12483/13798 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 86822 event pairs, 146 based on Foata normal form. 966/8155 useless extension candidates. Maximal degree in co-relation 44908. Up to 4698 conditions per place. [2022-12-13 11:55:59,674 INFO L137 encePairwiseOnDemand]: 23/37 looper letters, 62 selfloop transitions, 49 changer transitions 3/131 dead transitions. [2022-12-13 11:55:59,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 131 transitions, 915 flow [2022-12-13 11:55:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:55:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:55:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2022-12-13 11:55:59,675 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-13 11:55:59,675 INFO L175 Difference]: Start difference. First operand has 61 places, 87 transitions, 484 flow. Second operand 6 states and 144 transitions. [2022-12-13 11:55:59,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 131 transitions, 915 flow [2022-12-13 11:55:59,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 131 transitions, 915 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:55:59,976 INFO L231 Difference]: Finished difference. Result has 67 places, 87 transitions, 608 flow [2022-12-13 11:55:59,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=608, PETRI_PLACES=67, PETRI_TRANSITIONS=87} [2022-12-13 11:55:59,977 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -9 predicate places. [2022-12-13 11:55:59,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:55:59,977 INFO L89 Accepts]: Start accepts. Operand has 67 places, 87 transitions, 608 flow [2022-12-13 11:55:59,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:55:59,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:55:59,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 87 transitions, 608 flow [2022-12-13 11:55:59,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 87 transitions, 608 flow [2022-12-13 11:56:00,154 INFO L130 PetriNetUnfolder]: 2384/4427 cut-off events. [2022-12-13 11:56:00,155 INFO L131 PetriNetUnfolder]: For 2531/3704 co-relation queries the response was YES. [2022-12-13 11:56:00,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17259 conditions, 4427 events. 2384/4427 cut-off events. For 2531/3704 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 35229 event pairs, 6 based on Foata normal form. 1/1785 useless extension candidates. Maximal degree in co-relation 17240. Up to 2917 conditions per place. [2022-12-13 11:56:00,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 87 transitions, 608 flow [2022-12-13 11:56:00,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 1922 [2022-12-13 11:56:00,592 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:56:00,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 616 [2022-12-13 11:56:00,593 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 85 transitions, 604 flow [2022-12-13 11:56:00,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-13 11:56:00,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:00,593 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-13 11:56:00,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:56:00,593 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:56:00,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:00,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1804601332, now seen corresponding path program 1 times [2022-12-13 11:56:00,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:00,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710199942] [2022-12-13 11:56:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:00,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:00,922 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-13 11:56:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:00,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710199942] [2022-12-13 11:56:00,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710199942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:00,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:00,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:56:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209939906] [2022-12-13 11:56:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:00,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:56:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:56:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:56:00,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2022-12-13 11:56:00,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 85 transitions, 604 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 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-13 11:56:00,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:00,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2022-12-13 11:56:00,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:02,035 INFO L130 PetriNetUnfolder]: 11452/17233 cut-off events. [2022-12-13 11:56:02,035 INFO L131 PetriNetUnfolder]: For 34288/35866 co-relation queries the response was YES. [2022-12-13 11:56:02,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73534 conditions, 17233 events. 11452/17233 cut-off events. For 34288/35866 co-relation queries the response was YES. Maximal size of possible extension queue 1463. Compared 121107 event pairs, 479 based on Foata normal form. 569/13269 useless extension candidates. Maximal degree in co-relation 73512. Up to 7314 conditions per place. [2022-12-13 11:56:02,158 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 155 selfloop transitions, 13 changer transitions 50/247 dead transitions. [2022-12-13 11:56:02,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 247 transitions, 2215 flow [2022-12-13 11:56:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:56:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:56:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2022-12-13 11:56:02,159 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2022-12-13 11:56:02,159 INFO L175 Difference]: Start difference. First operand has 65 places, 85 transitions, 604 flow. Second operand 8 states and 174 transitions. [2022-12-13 11:56:02,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 247 transitions, 2215 flow [2022-12-13 11:56:03,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 247 transitions, 1837 flow, removed 60 selfloop flow, removed 4 redundant places. [2022-12-13 11:56:03,770 INFO L231 Difference]: Finished difference. Result has 72 places, 96 transitions, 580 flow [2022-12-13 11:56:03,770 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=580, PETRI_PLACES=72, PETRI_TRANSITIONS=96} [2022-12-13 11:56:03,771 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -4 predicate places. [2022-12-13 11:56:03,771 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:03,771 INFO L89 Accepts]: Start accepts. Operand has 72 places, 96 transitions, 580 flow [2022-12-13 11:56:03,772 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:03,772 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:03,772 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 96 transitions, 580 flow [2022-12-13 11:56:03,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 96 transitions, 580 flow [2022-12-13 11:56:04,134 INFO L130 PetriNetUnfolder]: 5802/9135 cut-off events. [2022-12-13 11:56:04,134 INFO L131 PetriNetUnfolder]: For 6929/8762 co-relation queries the response was YES. [2022-12-13 11:56:04,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25922 conditions, 9135 events. 5802/9135 cut-off events. For 6929/8762 co-relation queries the response was YES. Maximal size of possible extension queue 1443. Compared 69247 event pairs, 12 based on Foata normal form. 48/2927 useless extension candidates. Maximal degree in co-relation 25899. Up to 4213 conditions per place. [2022-12-13 11:56:04,227 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 96 transitions, 580 flow [2022-12-13 11:56:04,227 INFO L226 LiptonReduction]: Number of co-enabled transitions 2462 [2022-12-13 11:56:04,607 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0] and [364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] [2022-12-13 11:56:04,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] L781-->L797: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse3 (= (mod v_~z$r_buff0_thd3~0_52 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse6 .cse3)) (.cse11 (= (mod v_~z$w_buff0_used~0_76 256) 0)) (.cse10 (and .cse3 (= (mod v_~z$w_buff1_used~0_73 256) 0)))) (let ((.cse4 (= (mod v_~z$w_buff1_used~0_72 256) 0)) (.cse8 (or .cse1 .cse11 .cse10)) (.cse9 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_75 256) 0))) (and (= v_~z~0_62 (ite .cse0 v_~z$mem_tmp~0_20 v_~__unbuffered_p2_EAX~0_18)) (= v_~z$w_buff0~0_34 v_~z$w_buff0~0_33) (= v_~z$r_buff0_thd3~0_51 (ite .cse0 v_~z$r_buff0_thd3~0_52 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~z$r_buff0_thd3~0_52 (ite (and .cse5 (not .cse2)) 0 v_~z$r_buff0_thd3~0_52)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_51 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse7 .cse4))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= v_~z$mem_tmp~0_20 v_~z~0_64) (= v_~z$w_buff1~0_31 v_~z$w_buff1~0_30) (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0_used~0_75 (ite .cse0 v_~z$w_buff0_used~0_76 (ite .cse8 v_~z$w_buff0_used~0_76 (ite .cse9 0 v_~z$w_buff0_used~0_76)))) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse8 v_~z~0_64 (ite .cse9 v_~z$w_buff0~0_34 v_~z$w_buff1~0_31)) v_~__unbuffered_p2_EAX~0_18) (= (ite .cse0 v_~z$w_buff1_used~0_73 (ite (or .cse1 .cse2 .cse10) v_~z$w_buff1_used~0_73 0)) v_~z$w_buff1_used~0_72))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_76, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~z$w_buff1~0=v_~z$w_buff1~0_31, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_64, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_75, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_30, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0] and [364] L822-->L829: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd4~0_20 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_27 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~z~0_76 (ite .cse0 v_~z$w_buff0~0_51 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_77))) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_27) v_~z$r_buff0_thd4~0_26) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_26 256) 0)))) 0 v_~z$r_buff1_thd4~0_20) v_~z$r_buff1_thd4~0_19)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_77} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_51, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] [2022-12-13 11:56:05,172 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:56:05,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1402 [2022-12-13 11:56:05,173 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 95 transitions, 585 flow [2022-12-13 11:56:05,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 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-13 11:56:05,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:05,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:05,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:56:05,174 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:56:05,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash -95092082, now seen corresponding path program 1 times [2022-12-13 11:56:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:05,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398266087] [2022-12-13 11:56:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:05,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:05,326 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-13 11:56:05,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:05,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398266087] [2022-12-13 11:56:05,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398266087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:05,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:05,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:56:05,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914360935] [2022-12-13 11:56:05,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:05,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:56:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:56:05,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:56:05,328 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2022-12-13 11:56:05,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 95 transitions, 585 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 11:56:05,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:05,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2022-12-13 11:56:05,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:06,906 INFO L130 PetriNetUnfolder]: 14249/21570 cut-off events. [2022-12-13 11:56:06,907 INFO L131 PetriNetUnfolder]: For 40969/42109 co-relation queries the response was YES. [2022-12-13 11:56:06,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79643 conditions, 21570 events. 14249/21570 cut-off events. For 40969/42109 co-relation queries the response was YES. Maximal size of possible extension queue 2054. Compared 158900 event pairs, 911 based on Foata normal form. 541/16241 useless extension candidates. Maximal degree in co-relation 79617. Up to 8239 conditions per place. [2022-12-13 11:56:07,005 INFO L137 encePairwiseOnDemand]: 34/41 looper letters, 82 selfloop transitions, 2 changer transitions 60/173 dead transitions. [2022-12-13 11:56:07,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 173 transitions, 1336 flow [2022-12-13 11:56:07,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:56:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:56:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-13 11:56:07,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2022-12-13 11:56:07,007 INFO L175 Difference]: Start difference. First operand has 71 places, 95 transitions, 585 flow. Second operand 4 states and 104 transitions. [2022-12-13 11:56:07,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 173 transitions, 1336 flow [2022-12-13 11:56:09,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 173 transitions, 1312 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 11:56:09,285 INFO L231 Difference]: Finished difference. Result has 75 places, 86 transitions, 497 flow [2022-12-13 11:56:09,285 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=497, PETRI_PLACES=75, PETRI_TRANSITIONS=86} [2022-12-13 11:56:09,285 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -1 predicate places. [2022-12-13 11:56:09,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:09,285 INFO L89 Accepts]: Start accepts. Operand has 75 places, 86 transitions, 497 flow [2022-12-13 11:56:09,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:09,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:09,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 86 transitions, 497 flow [2022-12-13 11:56:09,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 86 transitions, 497 flow [2022-12-13 11:56:09,456 INFO L130 PetriNetUnfolder]: 2630/4401 cut-off events. [2022-12-13 11:56:09,456 INFO L131 PetriNetUnfolder]: For 5568/6113 co-relation queries the response was YES. [2022-12-13 11:56:09,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12795 conditions, 4401 events. 2630/4401 cut-off events. For 5568/6113 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 32509 event pairs, 3 based on Foata normal form. 17/1441 useless extension candidates. Maximal degree in co-relation 12770. Up to 2026 conditions per place. [2022-12-13 11:56:09,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 86 transitions, 497 flow [2022-12-13 11:56:09,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 1782 [2022-12-13 11:56:09,838 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:56:09,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 554 [2022-12-13 11:56:09,839 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 85 transitions, 504 flow [2022-12-13 11:56:09,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-13 11:56:09,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:09,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:09,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:56:09,840 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:56:09,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:09,840 INFO L85 PathProgramCache]: Analyzing trace with hash -743465441, now seen corresponding path program 1 times [2022-12-13 11:56:09,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:09,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468495689] [2022-12-13 11:56:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:09,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:10,124 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-13 11:56:10,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:10,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468495689] [2022-12-13 11:56:10,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468495689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:10,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:10,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:56:10,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420311355] [2022-12-13 11:56:10,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:10,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:56:10,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:10,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:56:10,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:56:10,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2022-12-13 11:56:10,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 85 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-13 11:56:10,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:10,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2022-12-13 11:56:10,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:11,213 INFO L130 PetriNetUnfolder]: 11063/16725 cut-off events. [2022-12-13 11:56:11,214 INFO L131 PetriNetUnfolder]: For 31674/32355 co-relation queries the response was YES. [2022-12-13 11:56:11,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61791 conditions, 16725 events. 11063/16725 cut-off events. For 31674/32355 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 112609 event pairs, 743 based on Foata normal form. 443/12751 useless extension candidates. Maximal degree in co-relation 61763. Up to 5234 conditions per place. [2022-12-13 11:56:11,299 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 84 selfloop transitions, 29 changer transitions 127/261 dead transitions. [2022-12-13 11:56:11,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 261 transitions, 2013 flow [2022-12-13 11:56:11,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:56:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:56:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2022-12-13 11:56:11,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6293436293436293 [2022-12-13 11:56:11,301 INFO L175 Difference]: Start difference. First operand has 70 places, 85 transitions, 504 flow. Second operand 7 states and 163 transitions. [2022-12-13 11:56:11,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 261 transitions, 2013 flow [2022-12-13 11:56:13,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 261 transitions, 1964 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-13 11:56:13,019 INFO L231 Difference]: Finished difference. Result has 74 places, 98 transitions, 657 flow [2022-12-13 11:56:13,019 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=657, PETRI_PLACES=74, PETRI_TRANSITIONS=98} [2022-12-13 11:56:13,019 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -2 predicate places. [2022-12-13 11:56:13,019 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:13,019 INFO L89 Accepts]: Start accepts. Operand has 74 places, 98 transitions, 657 flow [2022-12-13 11:56:13,020 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:13,021 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:13,021 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 98 transitions, 657 flow [2022-12-13 11:56:13,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 98 transitions, 657 flow [2022-12-13 11:56:13,202 INFO L130 PetriNetUnfolder]: 2924/4743 cut-off events. [2022-12-13 11:56:13,203 INFO L131 PetriNetUnfolder]: For 3817/4187 co-relation queries the response was YES. [2022-12-13 11:56:13,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13469 conditions, 4743 events. 2924/4743 cut-off events. For 3817/4187 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 34495 event pairs, 1 based on Foata normal form. 12/1503 useless extension candidates. Maximal degree in co-relation 13444. Up to 2188 conditions per place. [2022-12-13 11:56:13,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 98 transitions, 657 flow [2022-12-13 11:56:13,244 INFO L226 LiptonReduction]: Number of co-enabled transitions 1566 [2022-12-13 11:56:13,328 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:56:13,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-13 11:56:13,329 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 97 transitions, 671 flow [2022-12-13 11:56:13,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-13 11:56:13,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:13,329 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] [2022-12-13 11:56:13,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:56:13,330 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:56:13,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:13,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2045433368, now seen corresponding path program 1 times [2022-12-13 11:56:13,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:13,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842012000] [2022-12-13 11:56:13,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:13,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:13,438 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-13 11:56:13,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:13,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842012000] [2022-12-13 11:56:13,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842012000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:13,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:13,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:56:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267763163] [2022-12-13 11:56:13,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:13,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:56:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:13,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:56:13,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:56:13,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 11:56:13,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 97 transitions, 671 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-13 11:56:13,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:13,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 11:56:13,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:14,168 INFO L130 PetriNetUnfolder]: 7300/11070 cut-off events. [2022-12-13 11:56:14,168 INFO L131 PetriNetUnfolder]: For 19562/20206 co-relation queries the response was YES. [2022-12-13 11:56:14,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39685 conditions, 11070 events. 7300/11070 cut-off events. For 19562/20206 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 77844 event pairs, 586 based on Foata normal form. 207/7706 useless extension candidates. Maximal degree in co-relation 39657. Up to 4524 conditions per place. [2022-12-13 11:56:14,202 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 62 selfloop transitions, 9 changer transitions 44/139 dead transitions. [2022-12-13 11:56:14,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 139 transitions, 1139 flow [2022-12-13 11:56:14,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:56:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:56:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-13 11:56:14,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-13 11:56:14,203 INFO L175 Difference]: Start difference. First operand has 72 places, 97 transitions, 671 flow. Second operand 3 states and 73 transitions. [2022-12-13 11:56:14,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 139 transitions, 1139 flow [2022-12-13 11:56:14,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 139 transitions, 1114 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-13 11:56:14,730 INFO L231 Difference]: Finished difference. Result has 72 places, 86 transitions, 571 flow [2022-12-13 11:56:14,730 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=72, PETRI_TRANSITIONS=86} [2022-12-13 11:56:14,730 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -4 predicate places. [2022-12-13 11:56:14,731 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:14,731 INFO L89 Accepts]: Start accepts. Operand has 72 places, 86 transitions, 571 flow [2022-12-13 11:56:14,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:14,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:14,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 86 transitions, 571 flow [2022-12-13 11:56:14,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 86 transitions, 571 flow [2022-12-13 11:56:14,860 INFO L130 PetriNetUnfolder]: 2234/3509 cut-off events. [2022-12-13 11:56:14,860 INFO L131 PetriNetUnfolder]: For 3609/3830 co-relation queries the response was YES. [2022-12-13 11:56:14,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9782 conditions, 3509 events. 2234/3509 cut-off events. For 3609/3830 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 24224 event pairs, 0 based on Foata normal form. 6/1161 useless extension candidates. Maximal degree in co-relation 9758. Up to 1540 conditions per place. [2022-12-13 11:56:14,884 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 86 transitions, 571 flow [2022-12-13 11:56:14,884 INFO L226 LiptonReduction]: Number of co-enabled transitions 996 [2022-12-13 11:56:14,886 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:14,886 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 11:56:14,886 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 86 transitions, 571 flow [2022-12-13 11:56:14,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-13 11:56:14,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:14,887 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] [2022-12-13 11:56:14,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:56:14,887 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:56:14,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1343300989, now seen corresponding path program 1 times [2022-12-13 11:56:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:14,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015391448] [2022-12-13 11:56:14,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:56:14,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:56:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:56:14,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:56:14,950 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:56:14,951 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 11:56:14,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 11:56:14,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 11:56:14,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 11:56:14,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 11:56:14,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 11:56:14,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 11:56:14,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:56:14,953 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:14,957 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:56:14,957 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:56:15,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:56:15 BasicIcfg [2022-12-13 11:56:15,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:56:15,003 INFO L158 Benchmark]: Toolchain (without parser) took 36064.63ms. Allocated memory was 168.8MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 144.3MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-13 11:56:15,003 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:56:15,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.82ms. Allocated memory is still 168.8MB. Free memory was 144.0MB in the beginning and 117.2MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 11:56:15,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.99ms. Allocated memory is still 168.8MB. Free memory was 117.2MB in the beginning and 114.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:56:15,003 INFO L158 Benchmark]: Boogie Preprocessor took 25.23ms. Allocated memory is still 168.8MB. Free memory was 114.6MB in the beginning and 113.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:56:15,003 INFO L158 Benchmark]: RCFGBuilder took 616.39ms. Allocated memory is still 168.8MB. Free memory was 113.1MB in the beginning and 81.1MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 11:56:15,004 INFO L158 Benchmark]: TraceAbstraction took 34924.69ms. Allocated memory was 168.8MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 80.0MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-13 11:56:15,004 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 449.82ms. Allocated memory is still 168.8MB. Free memory was 144.0MB in the beginning and 117.2MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.99ms. Allocated memory is still 168.8MB. Free memory was 117.2MB in the beginning and 114.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.23ms. Allocated memory is still 168.8MB. Free memory was 114.6MB in the beginning and 113.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 616.39ms. Allocated memory is still 168.8MB. Free memory was 113.1MB in the beginning and 81.1MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 34924.69ms. Allocated memory was 168.8MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 80.0MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 133 PlacesBefore, 76 PlacesAfterwards, 122 TransitionsBefore, 65 TransitionsAfterwards, 2620 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 51 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5300, independent: 5123, independent conditional: 5123, independent unconditional: 0, dependent: 177, dependent conditional: 177, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5300, independent: 5123, independent conditional: 0, independent unconditional: 5123, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5300, independent: 5123, independent conditional: 0, independent unconditional: 5123, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5300, independent: 5123, independent conditional: 0, independent unconditional: 5123, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2424, independent: 2363, independent conditional: 0, independent unconditional: 2363, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2424, independent: 2315, independent conditional: 0, independent unconditional: 2315, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 109, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5300, independent: 2760, independent conditional: 0, independent unconditional: 2760, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 2424, unknown conditional: 0, unknown unconditional: 2424] , Statistics on independence cache: Total cache size (in pairs): 5123, Positive cache size: 5062, Positive conditional cache size: 0, Positive unconditional cache size: 5062, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 49 PlacesBefore, 49 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 862 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 525, independent: 485, independent conditional: 485, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 525, independent: 485, independent conditional: 26, independent unconditional: 459, dependent: 40, dependent conditional: 5, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 525, independent: 485, independent conditional: 26, independent unconditional: 459, dependent: 40, dependent conditional: 5, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 525, independent: 485, independent conditional: 26, independent unconditional: 459, dependent: 40, dependent conditional: 5, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 384, independent: 357, independent conditional: 20, independent unconditional: 337, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 384, independent: 302, independent conditional: 0, independent unconditional: 302, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 64, dependent conditional: 12, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 525, independent: 128, independent conditional: 6, independent unconditional: 122, dependent: 13, dependent conditional: 3, dependent unconditional: 10, unknown: 384, unknown conditional: 22, unknown unconditional: 362] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 357, Positive conditional cache size: 20, Positive unconditional cache size: 337, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 247, independent conditional: 247, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 247, independent conditional: 29, independent unconditional: 218, dependent: 15, dependent conditional: 11, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 262, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 262, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 262, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 372, Positive conditional cache size: 20, Positive unconditional cache size: 352, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 51 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 1220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 278, independent: 265, independent conditional: 265, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 278, independent: 265, independent conditional: 66, independent unconditional: 199, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 278, independent: 265, independent conditional: 66, independent unconditional: 199, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 278, independent: 265, independent conditional: 66, independent unconditional: 199, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 278, independent: 265, independent conditional: 66, independent unconditional: 199, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 372, Positive conditional cache size: 20, Positive unconditional cache size: 352, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 103, independent: 87, independent conditional: 24, independent unconditional: 63, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, independent: 87, independent conditional: 24, independent unconditional: 63, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, independent: 87, independent conditional: 24, independent unconditional: 63, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, independent: 86, independent conditional: 24, independent unconditional: 62, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 373, Positive conditional cache size: 20, Positive unconditional cache size: 353, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1610 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 270, independent: 249, independent conditional: 249, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 270, independent: 249, independent conditional: 96, independent unconditional: 153, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 270, independent: 249, independent conditional: 96, independent unconditional: 153, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 270, independent: 249, independent conditional: 96, independent unconditional: 153, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 270, independent: 234, independent conditional: 93, independent unconditional: 141, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 16, unknown conditional: 3, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 388, Positive conditional cache size: 23, Positive unconditional cache size: 365, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 2070 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 572, independent: 548, independent conditional: 548, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 572, independent: 548, independent conditional: 304, independent unconditional: 244, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 572, independent: 548, independent conditional: 168, independent unconditional: 380, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 572, independent: 548, independent conditional: 168, independent unconditional: 380, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 572, independent: 544, independent conditional: 168, independent unconditional: 376, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 392, Positive conditional cache size: 23, Positive unconditional cache size: 369, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 160, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 67 PlacesBefore, 65 PlacesAfterwards, 87 TransitionsBefore, 85 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 976, independent: 932, independent conditional: 932, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 976, independent: 932, independent conditional: 552, independent unconditional: 380, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 976, independent: 932, independent conditional: 368, independent unconditional: 564, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 976, independent: 932, independent conditional: 368, independent unconditional: 564, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 976, independent: 926, independent conditional: 362, independent unconditional: 564, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 411, Positive conditional cache size: 29, Positive unconditional cache size: 382, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 228, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 72 PlacesBefore, 71 PlacesAfterwards, 96 TransitionsBefore, 95 TransitionsAfterwards, 2462 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 254, independent: 254, independent conditional: 254, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 254, independent: 254, independent conditional: 254, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 254, independent: 254, independent conditional: 248, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 254, independent: 254, independent conditional: 248, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 254, independent: 239, independent conditional: 233, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 505, Positive cache size: 474, Positive conditional cache size: 44, Positive unconditional cache size: 430, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 71 PlacesBefore, 70 PlacesAfterwards, 86 TransitionsBefore, 85 TransitionsAfterwards, 1782 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 720, independent: 692, independent conditional: 692, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 720, independent: 692, independent conditional: 524, independent unconditional: 168, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 720, independent: 692, independent conditional: 440, independent unconditional: 252, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 720, independent: 692, independent conditional: 440, independent unconditional: 252, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 720, independent: 687, independent conditional: 435, independent unconditional: 252, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 510, Positive cache size: 479, Positive conditional cache size: 49, Positive unconditional cache size: 430, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 112, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 73 PlacesBefore, 72 PlacesAfterwards, 98 TransitionsBefore, 97 TransitionsAfterwards, 1566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 210, independent conditional: 210, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 210, independent conditional: 175, independent unconditional: 35, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, independent: 210, independent conditional: 170, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 210, independent conditional: 170, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, independent: 210, independent conditional: 170, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 660, Positive cache size: 629, Positive conditional cache size: 54, Positive unconditional cache size: 575, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 996 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 660, Positive cache size: 629, Positive conditional cache size: 54, Positive unconditional cache size: 575, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, 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_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1365; [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1365, ((void *)0), P0, ((void *)0))=-2, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1366; [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1366, ((void *)0), P1, ((void *)0))=-1, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1367; [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1367, ((void *)0), P2, ((void *)0))=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1368; [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1368, ((void *)0), P3, ((void *)0))=1, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 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=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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: 847]: 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, 159 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: 34.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 390 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 390 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1302 IncrementalHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 22 mSDtfsCounter, 1302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=671occurred in iteration=10, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-13 11:56:15,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...