/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:36:54,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:36:54,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:36:54,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:36:54,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:36:54,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:36:54,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:36:54,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:36:54,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:36:54,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:36:54,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:36:54,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:36:54,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:36:54,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:36:54,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:36:54,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:36:54,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:36:54,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:36:54,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:36:54,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:36:54,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:36:54,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:36:54,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:36:54,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:36:54,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:36:54,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:36:54,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:36:54,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:36:54,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:36:54,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:36:54,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:36:54,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:36:54,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:36:54,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:36:54,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:36:54,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:36:54,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:36:54,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:36:54,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:36:54,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:36:54,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:36:54,307 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 21:36:54,332 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:36:54,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:36:54,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:36:54,334 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:36:54,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:36:54,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:36:54,335 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:36:54,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:36:54,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:36:54,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:36:54,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:36:54,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:36:54,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:36:54,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:36:54,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:36:54,337 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:36:54,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:36:54,337 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:36:54,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:36:54,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:36:54,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:36:54,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:36:54,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:36:54,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:36:54,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:36:54,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:36:54,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:36:54,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:36:54,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:36:54,338 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:36:54,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:36:54,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:36:54,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:36:54,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:36:54,638 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:36:54,639 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:36:54,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2022-12-12 21:36:55,643 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:36:55,924 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:36:55,928 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2022-12-12 21:36:55,940 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f503252a/aae940a721e1426abb02099f111755c1/FLAGad879e76f [2022-12-12 21:36:55,951 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f503252a/aae940a721e1426abb02099f111755c1 [2022-12-12 21:36:55,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:36:55,953 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:36:55,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:36:55,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:36:55,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:36:55,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:36:55" (1/1) ... [2022-12-12 21:36:55,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29790ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:55, skipping insertion in model container [2022-12-12 21:36:55,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:36:55" (1/1) ... [2022-12-12 21:36:55,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:36:56,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:36:56,158 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/mix036_pso.opt_tso.opt.i[956,969] [2022-12-12 21:36:56,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:36:56,358 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:36:56,366 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/mix036_pso.opt_tso.opt.i[956,969] [2022-12-12 21:36:56,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:56,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:56,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:36:56,452 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:36:56,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56 WrapperNode [2022-12-12 21:36:56,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:36:56,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:36:56,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:36:56,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:36:56,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,515 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2022-12-12 21:36:56,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:36:56,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:36:56,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:36:56,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:36:56,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,554 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:36:56,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:36:56,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:36:56,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:36:56,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:36:56,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:36:56,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 21:36:56,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 21:36:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:36:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:36:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:36:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:36:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:36:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:36:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:36:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:36:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:36:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:36:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:36:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 21:36:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 21:36:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:36:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:36:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:36:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:36:56,619 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:36:56,761 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:36:56,764 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:36:57,013 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:36:57,105 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:36:57,105 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:36:57,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:36:57 BoogieIcfgContainer [2022-12-12 21:36:57,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:36:57,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:36:57,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:36:57,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:36:57,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:36:55" (1/3) ... [2022-12-12 21:36:57,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dac37cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:36:57, skipping insertion in model container [2022-12-12 21:36:57,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56" (2/3) ... [2022-12-12 21:36:57,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dac37cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:36:57, skipping insertion in model container [2022-12-12 21:36:57,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:36:57" (3/3) ... [2022-12-12 21:36:57,116 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2022-12-12 21:36:57,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:36:57,133 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:36:57,133 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:36:57,200 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:36:57,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-12 21:36:57,271 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-12 21:36:57,272 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:57,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-12 21:36:57,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-12 21:36:57,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-12 21:36:57,281 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:36:57,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-12 21:36:57,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-12 21:36:57,336 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-12 21:36:57,336 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:57,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-12 21:36:57,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-12 21:36:57,339 INFO L226 LiptonReduction]: Number of co-enabled transitions 2816 [2022-12-12 21:37:03,163 INFO L241 LiptonReduction]: Total number of compositions: 103 [2022-12-12 21:37:03,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:37:03,179 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1ef0d6c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:37:03,179 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 21:37:03,183 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-12 21:37:03,184 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:37:03,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:03,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:03,185 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-12 21:37:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2011968914, now seen corresponding path program 1 times [2022-12-12 21:37:03,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:03,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850972844] [2022-12-12 21:37:03,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:03,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:03,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:03,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850972844] [2022-12-12 21:37:03,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850972844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:03,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:03,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:37:03,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572019449] [2022-12-12 21:37:03,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:03,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:37:03,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:03,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:37:03,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:37:03,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 65 [2022-12-12 21:37:03,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:03,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:03,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 65 [2022-12-12 21:37:03,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:08,049 INFO L130 PetriNetUnfolder]: 47599/67487 cut-off events. [2022-12-12 21:37:08,050 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-12 21:37:08,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130615 conditions, 67487 events. 47599/67487 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 4054. Compared 511656 event pairs, 5311 based on Foata normal form. 0/39568 useless extension candidates. Maximal degree in co-relation 130603. Up to 55249 conditions per place. [2022-12-12 21:37:08,290 INFO L137 encePairwiseOnDemand]: 60/65 looper letters, 37 selfloop transitions, 3 changer transitions 46/99 dead transitions. [2022-12-12 21:37:08,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 382 flow [2022-12-12 21:37:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:37:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:37:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2022-12-12 21:37:08,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6564102564102564 [2022-12-12 21:37:08,305 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 0 predicate places. [2022-12-12 21:37:08,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 99 transitions, 382 flow [2022-12-12 21:37:08,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 53 transitions, 198 flow [2022-12-12 21:37:08,379 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 198 flow [2022-12-12 21:37:08,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:08,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:08,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:08,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:37:08,380 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-12 21:37:08,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash -766737601, now seen corresponding path program 1 times [2022-12-12 21:37:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:08,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015118138] [2022-12-12 21:37:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:08,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:08,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015118138] [2022-12-12 21:37:08,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015118138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:08,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:08,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:37:08,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060407082] [2022-12-12 21:37:08,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:08,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:37:08,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:08,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:37:08,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:37:08,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:37:08,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 198 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-12 21:37:08,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:08,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:37:08,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:10,362 INFO L130 PetriNetUnfolder]: 15968/22290 cut-off events. [2022-12-12 21:37:10,362 INFO L131 PetriNetUnfolder]: For 1852/1852 co-relation queries the response was YES. [2022-12-12 21:37:10,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61396 conditions, 22290 events. 15968/22290 cut-off events. For 1852/1852 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 124526 event pairs, 1526 based on Foata normal form. 24/17900 useless extension candidates. Maximal degree in co-relation 61381. Up to 20912 conditions per place. [2022-12-12 21:37:10,480 INFO L137 encePairwiseOnDemand]: 59/65 looper letters, 60 selfloop transitions, 6 changer transitions 2/77 dead transitions. [2022-12-12 21:37:10,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 77 transitions, 433 flow [2022-12-12 21:37:10,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:37:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:37:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-12 21:37:10,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39487179487179486 [2022-12-12 21:37:10,482 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -21 predicate places. [2022-12-12 21:37:10,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 77 transitions, 433 flow [2022-12-12 21:37:10,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 75 transitions, 425 flow [2022-12-12 21:37:10,557 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 425 flow [2022-12-12 21:37:10,557 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-12 21:37:10,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:10,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:10,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:37:10,558 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-12 21:37:10,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 599754370, now seen corresponding path program 1 times [2022-12-12 21:37:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:10,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279021203] [2022-12-12 21:37:10,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:10,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:10,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279021203] [2022-12-12 21:37:10,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279021203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:10,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:10,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:37:10,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560815003] [2022-12-12 21:37:10,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:10,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:37:10,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:10,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:37:10,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:37:10,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:37:10,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 75 transitions, 425 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:10,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:10,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:37:10,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:11,771 INFO L130 PetriNetUnfolder]: 11514/16179 cut-off events. [2022-12-12 21:37:11,772 INFO L131 PetriNetUnfolder]: For 1430/1430 co-relation queries the response was YES. [2022-12-12 21:37:11,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60777 conditions, 16179 events. 11514/16179 cut-off events. For 1430/1430 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 86149 event pairs, 1143 based on Foata normal form. 351/13308 useless extension candidates. Maximal degree in co-relation 60759. Up to 15183 conditions per place. [2022-12-12 21:37:11,868 INFO L137 encePairwiseOnDemand]: 62/65 looper letters, 74 selfloop transitions, 3 changer transitions 2/88 dead transitions. [2022-12-12 21:37:11,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 657 flow [2022-12-12 21:37:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:37:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:37:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-12 21:37:11,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36923076923076925 [2022-12-12 21:37:11,870 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2022-12-12 21:37:11,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 88 transitions, 657 flow [2022-12-12 21:37:11,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 86 transitions, 641 flow [2022-12-12 21:37:11,935 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 86 transitions, 641 flow [2022-12-12 21:37:11,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:11,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:11,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:11,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:37:11,936 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-12 21:37:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:11,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1899489726, now seen corresponding path program 1 times [2022-12-12 21:37:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:11,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340617189] [2022-12-12 21:37:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:11,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:12,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:12,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340617189] [2022-12-12 21:37:12,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340617189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:12,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:12,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:37:12,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254625535] [2022-12-12 21:37:12,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:12,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:37:12,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:12,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:37:12,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:37:12,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:37:12,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 86 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:12,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:12,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:37:12,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:13,876 INFO L130 PetriNetUnfolder]: 18616/25286 cut-off events. [2022-12-12 21:37:13,877 INFO L131 PetriNetUnfolder]: For 17080/17120 co-relation queries the response was YES. [2022-12-12 21:37:13,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110564 conditions, 25286 events. 18616/25286 cut-off events. For 17080/17120 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 133601 event pairs, 3266 based on Foata normal form. 157/21506 useless extension candidates. Maximal degree in co-relation 110543. Up to 22276 conditions per place. [2022-12-12 21:37:14,080 INFO L137 encePairwiseOnDemand]: 51/65 looper letters, 90 selfloop transitions, 25 changer transitions 0/127 dead transitions. [2022-12-12 21:37:14,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 1184 flow [2022-12-12 21:37:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:37:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:37:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-12 21:37:14,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4256410256410256 [2022-12-12 21:37:14,082 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -19 predicate places. [2022-12-12 21:37:14,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 127 transitions, 1184 flow [2022-12-12 21:37:14,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 127 transitions, 1184 flow [2022-12-12 21:37:14,184 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 127 transitions, 1184 flow [2022-12-12 21:37:14,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:14,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:14,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:14,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:37:14,184 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-12 21:37:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1694328127, now seen corresponding path program 1 times [2022-12-12 21:37:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:14,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547676312] [2022-12-12 21:37:14,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:14,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:14,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:14,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547676312] [2022-12-12 21:37:14,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547676312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:14,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:14,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:37:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901235925] [2022-12-12 21:37:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:14,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:37:14,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:14,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:37:14,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:37:14,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:37:14,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 127 transitions, 1184 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-12 21:37:14,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:14,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:37:14,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:15,641 INFO L130 PetriNetUnfolder]: 12559/17933 cut-off events. [2022-12-12 21:37:15,641 INFO L131 PetriNetUnfolder]: For 16554/16982 co-relation queries the response was YES. [2022-12-12 21:37:15,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94840 conditions, 17933 events. 12559/17933 cut-off events. For 16554/16982 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 101174 event pairs, 1648 based on Foata normal form. 739/15897 useless extension candidates. Maximal degree in co-relation 94816. Up to 15756 conditions per place. [2022-12-12 21:37:15,769 INFO L137 encePairwiseOnDemand]: 51/65 looper letters, 109 selfloop transitions, 49 changer transitions 0/170 dead transitions. [2022-12-12 21:37:15,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 170 transitions, 1912 flow [2022-12-12 21:37:15,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:37:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:37:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-12-12 21:37:15,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2022-12-12 21:37:15,777 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -16 predicate places. [2022-12-12 21:37:15,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 170 transitions, 1912 flow [2022-12-12 21:37:15,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 170 transitions, 1912 flow [2022-12-12 21:37:15,866 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 170 transitions, 1912 flow [2022-12-12 21:37:15,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-12 21:37:15,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:15,866 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:15,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:37:15,866 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-12 21:37:15,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:15,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1803768244, now seen corresponding path program 1 times [2022-12-12 21:37:15,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:15,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949968367] [2022-12-12 21:37:15,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:15,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:15,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949968367] [2022-12-12 21:37:15,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949968367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:15,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:15,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:37:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298475723] [2022-12-12 21:37:15,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:15,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:37:15,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:15,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:37:15,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:37:15,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:37:15,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 170 transitions, 1912 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:15,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:15,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:37:15,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:18,264 INFO L130 PetriNetUnfolder]: 19549/28054 cut-off events. [2022-12-12 21:37:18,267 INFO L131 PetriNetUnfolder]: For 35644/36539 co-relation queries the response was YES. [2022-12-12 21:37:18,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171896 conditions, 28054 events. 19549/28054 cut-off events. For 35644/36539 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 172670 event pairs, 2125 based on Foata normal form. 658/23910 useless extension candidates. Maximal degree in co-relation 171869. Up to 25060 conditions per place. [2022-12-12 21:37:18,436 INFO L137 encePairwiseOnDemand]: 58/65 looper letters, 266 selfloop transitions, 23 changer transitions 69/375 dead transitions. [2022-12-12 21:37:18,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 375 transitions, 5085 flow [2022-12-12 21:37:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:37:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:37:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2022-12-12 21:37:18,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-12 21:37:18,443 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -11 predicate places. [2022-12-12 21:37:18,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 375 transitions, 5085 flow [2022-12-12 21:37:18,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 306 transitions, 4116 flow [2022-12-12 21:37:18,543 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 306 transitions, 4116 flow [2022-12-12 21:37:18,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:18,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:18,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:18,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:37:18,548 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-12 21:37:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash 706682208, now seen corresponding path program 1 times [2022-12-12 21:37:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:18,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995842684] [2022-12-12 21:37:18,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:18,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:18,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:18,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995842684] [2022-12-12 21:37:18,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995842684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:18,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:18,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:37:18,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243976504] [2022-12-12 21:37:18,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:18,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:37:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:18,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:37:18,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:37:18,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:37:18,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 306 transitions, 4116 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-12 21:37:18,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:18,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:37:18,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:19,942 INFO L130 PetriNetUnfolder]: 7784/12490 cut-off events. [2022-12-12 21:37:19,942 INFO L131 PetriNetUnfolder]: For 29644/31290 co-relation queries the response was YES. [2022-12-12 21:37:19,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87159 conditions, 12490 events. 7784/12490 cut-off events. For 29644/31290 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 83123 event pairs, 314 based on Foata normal form. 1212/11587 useless extension candidates. Maximal degree in co-relation 87129. Up to 10907 conditions per place. [2022-12-12 21:37:20,026 INFO L137 encePairwiseOnDemand]: 51/65 looper letters, 187 selfloop transitions, 111 changer transitions 20/337 dead transitions. [2022-12-12 21:37:20,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 337 transitions, 5160 flow [2022-12-12 21:37:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:37:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:37:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-12-12 21:37:20,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2022-12-12 21:37:20,029 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -7 predicate places. [2022-12-12 21:37:20,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 337 transitions, 5160 flow [2022-12-12 21:37:20,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 317 transitions, 4837 flow [2022-12-12 21:37:20,091 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 317 transitions, 4837 flow [2022-12-12 21:37:20,092 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-12 21:37:20,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:20,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:20,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:37:20,092 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-12 21:37:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1054143381, now seen corresponding path program 1 times [2022-12-12 21:37:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:20,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085909394] [2022-12-12 21:37:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:20,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:20,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:20,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085909394] [2022-12-12 21:37:20,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085909394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:20,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:20,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:37:20,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084290803] [2022-12-12 21:37:20,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:20,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:37:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:20,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:37:20,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:37:20,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2022-12-12 21:37:20,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 317 transitions, 4837 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-12 21:37:20,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:20,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2022-12-12 21:37:20,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:22,286 INFO L130 PetriNetUnfolder]: 11068/18340 cut-off events. [2022-12-12 21:37:22,287 INFO L131 PetriNetUnfolder]: For 57141/58728 co-relation queries the response was YES. [2022-12-12 21:37:22,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141096 conditions, 18340 events. 11068/18340 cut-off events. For 57141/58728 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 137441 event pairs, 401 based on Foata normal form. 448/15666 useless extension candidates. Maximal degree in co-relation 141063. Up to 16352 conditions per place. [2022-12-12 21:37:22,419 INFO L137 encePairwiseOnDemand]: 62/65 looper letters, 370 selfloop transitions, 24 changer transitions 147/571 dead transitions. [2022-12-12 21:37:22,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 571 transitions, 9994 flow [2022-12-12 21:37:22,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:37:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:37:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-12-12 21:37:22,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4076923076923077 [2022-12-12 21:37:22,423 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2022-12-12 21:37:22,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 571 transitions, 9994 flow [2022-12-12 21:37:22,504 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 424 transitions, 7348 flow [2022-12-12 21:37:22,504 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 424 transitions, 7348 flow [2022-12-12 21:37:22,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-12 21:37:22,504 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:22,505 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:22,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:37:22,505 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-12 21:37:22,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash -511210152, now seen corresponding path program 1 times [2022-12-12 21:37:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:22,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115832301] [2022-12-12 21:37:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115832301] [2022-12-12 21:37:22,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115832301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:22,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:22,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:37:22,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167185641] [2022-12-12 21:37:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:22,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:37:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:22,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:37:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:37:22,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:37:22,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 424 transitions, 7348 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:22,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:22,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:37:22,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:23,936 INFO L130 PetriNetUnfolder]: 5426/9271 cut-off events. [2022-12-12 21:37:23,936 INFO L131 PetriNetUnfolder]: For 39843/41832 co-relation queries the response was YES. [2022-12-12 21:37:23,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76672 conditions, 9271 events. 5426/9271 cut-off events. For 39843/41832 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 65673 event pairs, 57 based on Foata normal form. 999/8796 useless extension candidates. Maximal degree in co-relation 76636. Up to 7990 conditions per place. [2022-12-12 21:37:23,987 INFO L137 encePairwiseOnDemand]: 51/65 looper letters, 102 selfloop transitions, 131 changer transitions 171/414 dead transitions. [2022-12-12 21:37:23,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 414 transitions, 7954 flow [2022-12-12 21:37:23,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:37:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:37:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2022-12-12 21:37:23,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39487179487179486 [2022-12-12 21:37:23,989 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2022-12-12 21:37:23,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 414 transitions, 7954 flow [2022-12-12 21:37:24,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 243 transitions, 4620 flow [2022-12-12 21:37:24,023 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 243 transitions, 4620 flow [2022-12-12 21:37:24,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:24,023 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:24,023 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:24,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:37:24,024 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-12 21:37:24,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:24,024 INFO L85 PathProgramCache]: Analyzing trace with hash -579685870, now seen corresponding path program 1 times [2022-12-12 21:37:24,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:24,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137091314] [2022-12-12 21:37:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:24,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:24,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137091314] [2022-12-12 21:37:24,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137091314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:24,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:24,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:37:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145435751] [2022-12-12 21:37:24,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:24,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:37:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:24,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:37:24,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:37:24,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:37:24,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 243 transitions, 4620 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-12 21:37:24,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:24,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:37:24,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:25,002 INFO L130 PetriNetUnfolder]: 4591/7439 cut-off events. [2022-12-12 21:37:25,004 INFO L131 PetriNetUnfolder]: For 30114/30689 co-relation queries the response was YES. [2022-12-12 21:37:25,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71338 conditions, 7439 events. 4591/7439 cut-off events. For 30114/30689 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 46783 event pairs, 5 based on Foata normal form. 126/5853 useless extension candidates. Maximal degree in co-relation 71299. Up to 7034 conditions per place. [2022-12-12 21:37:25,046 INFO L137 encePairwiseOnDemand]: 57/65 looper letters, 254 selfloop transitions, 16 changer transitions 88/378 dead transitions. [2022-12-12 21:37:25,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 378 transitions, 7989 flow [2022-12-12 21:37:25,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:37:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:37:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2022-12-12 21:37:25,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36923076923076925 [2022-12-12 21:37:25,048 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2022-12-12 21:37:25,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 378 transitions, 7989 flow [2022-12-12 21:37:25,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 290 transitions, 6072 flow [2022-12-12 21:37:25,076 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 290 transitions, 6072 flow [2022-12-12 21:37:25,077 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-12 21:37:25,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:25,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:25,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:37:25,077 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-12 21:37:25,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:25,077 INFO L85 PathProgramCache]: Analyzing trace with hash -727476756, now seen corresponding path program 1 times [2022-12-12 21:37:25,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:25,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279007398] [2022-12-12 21:37:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:25,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:25,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:25,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279007398] [2022-12-12 21:37:25,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279007398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:25,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:25,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:37:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993554189] [2022-12-12 21:37:25,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:25,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:37:25,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:25,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:37:25,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:37:25,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-12 21:37:25,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 290 transitions, 6072 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:25,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:25,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-12 21:37:25,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:26,143 INFO L130 PetriNetUnfolder]: 4589/7674 cut-off events. [2022-12-12 21:37:26,143 INFO L131 PetriNetUnfolder]: For 33606/34274 co-relation queries the response was YES. [2022-12-12 21:37:26,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78129 conditions, 7674 events. 4589/7674 cut-off events. For 33606/34274 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 51421 event pairs, 21 based on Foata normal form. 211/6122 useless extension candidates. Maximal degree in co-relation 78087. Up to 7294 conditions per place. [2022-12-12 21:37:26,177 INFO L137 encePairwiseOnDemand]: 59/65 looper letters, 95 selfloop transitions, 4 changer transitions 253/371 dead transitions. [2022-12-12 21:37:26,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 371 transitions, 8546 flow [2022-12-12 21:37:26,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:37:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:37:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-12-12 21:37:26,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3128205128205128 [2022-12-12 21:37:26,180 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 6 predicate places. [2022-12-12 21:37:26,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 371 transitions, 8546 flow [2022-12-12 21:37:26,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 118 transitions, 2520 flow [2022-12-12 21:37:26,201 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 118 transitions, 2520 flow [2022-12-12 21:37:26,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:26,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:26,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:26,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:37:26,202 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-12 21:37:26,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash 992140686, now seen corresponding path program 1 times [2022-12-12 21:37:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:26,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814174660] [2022-12-12 21:37:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:26,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:37:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:26,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814174660] [2022-12-12 21:37:26,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814174660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:26,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:26,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:37:26,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073150400] [2022-12-12 21:37:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:26,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:37:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:26,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:37:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:37:26,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2022-12-12 21:37:26,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 118 transitions, 2520 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:26,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:26,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2022-12-12 21:37:26,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:27,238 INFO L130 PetriNetUnfolder]: 2283/4034 cut-off events. [2022-12-12 21:37:27,239 INFO L131 PetriNetUnfolder]: For 9252/9254 co-relation queries the response was YES. [2022-12-12 21:37:27,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44005 conditions, 4034 events. 2283/4034 cut-off events. For 9252/9254 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 26455 event pairs, 23 based on Foata normal form. 83/3085 useless extension candidates. Maximal degree in co-relation 43960. Up to 3944 conditions per place. [2022-12-12 21:37:27,260 INFO L137 encePairwiseOnDemand]: 59/65 looper letters, 71 selfloop transitions, 5 changer transitions 103/200 dead transitions. [2022-12-12 21:37:27,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 200 transitions, 4844 flow [2022-12-12 21:37:27,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:37:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:37:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2022-12-12 21:37:27,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2989010989010989 [2022-12-12 21:37:27,262 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2022-12-12 21:37:27,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 200 transitions, 4844 flow [2022-12-12 21:37:27,274 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 97 transitions, 2190 flow [2022-12-12 21:37:27,275 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 97 transitions, 2190 flow [2022-12-12 21:37:27,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:37:27,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:27,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:27,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:37:27,275 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:37:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1885245835, now seen corresponding path program 1 times [2022-12-12 21:37:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:27,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747684252] [2022-12-12 21:37:27,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:27,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:37:27,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:37:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:37:27,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:37:27,347 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:37:27,348 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 21:37:27,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 21:37:27,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 21:37:27,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 21:37:27,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 21:37:27,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 21:37:27,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 21:37:27,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:37:27,350 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:27,354 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:37:27,354 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:37:27,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:37:27 BasicIcfg [2022-12-12 21:37:27,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:37:27,405 INFO L158 Benchmark]: Toolchain (without parser) took 31452.09ms. Allocated memory was 218.1MB in the beginning and 6.5GB in the end (delta: 6.2GB). Free memory was 193.5MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-12 21:37:27,406 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 218.1MB. Free memory is still 195.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:37:27,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.52ms. Allocated memory is still 218.1MB. Free memory was 193.5MB in the beginning and 166.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 21:37:27,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.88ms. Allocated memory is still 218.1MB. Free memory was 166.2MB in the beginning and 163.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:37:27,406 INFO L158 Benchmark]: Boogie Preprocessor took 41.30ms. Allocated memory is still 218.1MB. Free memory was 163.6MB in the beginning and 161.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:37:27,406 INFO L158 Benchmark]: RCFGBuilder took 549.83ms. Allocated memory is still 218.1MB. Free memory was 161.5MB in the beginning and 130.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-12 21:37:27,406 INFO L158 Benchmark]: TraceAbstraction took 30294.50ms. Allocated memory was 218.1MB in the beginning and 6.5GB in the end (delta: 6.2GB). Free memory was 128.5MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-12 21:37:27,407 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 218.1MB. Free memory is still 195.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 499.52ms. Allocated memory is still 218.1MB. Free memory was 193.5MB in the beginning and 166.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.88ms. Allocated memory is still 218.1MB. Free memory was 166.2MB in the beginning and 163.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.30ms. Allocated memory is still 218.1MB. Free memory was 163.6MB in the beginning and 161.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 549.83ms. Allocated memory is still 218.1MB. Free memory was 161.5MB in the beginning and 130.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 30294.50ms. Allocated memory was 218.1MB in the beginning and 6.5GB in the end (delta: 6.2GB). Free memory was 128.5MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 138 PlacesBefore, 78 PlacesAfterwards, 127 TransitionsBefore, 65 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 45 TrivialYvCompositions, 53 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5884, independent: 5683, independent conditional: 5683, independent unconditional: 0, dependent: 201, dependent conditional: 201, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5884, independent: 5683, independent conditional: 0, independent unconditional: 5683, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5884, independent: 5683, independent conditional: 0, independent unconditional: 5683, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5884, independent: 5683, independent conditional: 0, independent unconditional: 5683, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2860, independent: 2796, independent conditional: 0, independent unconditional: 2796, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2860, independent: 2755, independent conditional: 0, independent unconditional: 2755, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 243, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5884, independent: 2887, independent conditional: 0, independent unconditional: 2887, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 2860, unknown conditional: 0, unknown unconditional: 2860] , Statistics on independence cache: Total cache size (in pairs): 5936, Positive cache size: 5872, Positive conditional cache size: 0, Positive unconditional cache size: 5872, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t949, ((void *)0), P0, ((void *)0))=-1, t949={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] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t950, ((void *)0), P1, ((void *)0))=0, t949={5:0}, t950={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] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t951, ((void *)0), P2, ((void *)0))=1, t949={5:0}, t950={6:0}, t951={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] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t952, ((void *)0), P3, ((void *)0))=2, t949={5:0}, t950={6:0}, t951={7:0}, t952={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] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 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) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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] [L836] 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) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 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 [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 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 [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.7s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 435 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 435 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1237 IncrementalHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 22 mSDtfsCounter, 1237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7348occurred in iteration=8, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 18077 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 1164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 21:37:27,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...