/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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:39:46,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:39:46,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:39:46,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:39:46,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:39:46,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:39:46,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:39:46,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:39:46,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:39:46,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:39:46,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:39:46,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:39:46,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:39:46,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:39:46,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:39:46,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:39:46,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:39:46,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:39:46,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:39:46,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:39:46,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:39:46,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:39:46,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:39:46,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:39:46,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:39:46,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:39:46,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:39:46,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:39:46,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:39:46,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:39:46,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:39:46,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:39:46,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:39:46,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:39:46,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:39:46,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:39:46,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:39:46,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:39:46,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:39:46,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:39:46,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:39:46,424 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:39:46,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:39:46,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:39:46,448 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:39:46,448 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:39:46,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:39:46,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:39:46,450 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:39:46,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:39:46,450 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:39:46,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:39:46,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:39:46,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:39:46,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:39:46,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:39:46,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:39:46,451 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:39:46,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:39:46,452 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:39:46,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:39:46,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:39:46,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:39:46,452 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:39:46,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:39:46,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:39:46,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:39:46,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:39:46,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:39:46,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:39:46,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:39:46,453 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:39:46,453 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:39:46,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:39:46,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:39:46,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:39:46,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:39:46,765 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:39:46,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 21:39:47,777 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:39:48,046 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:39:48,046 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 21:39:48,062 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26674b197/e99c3712e9ec413abf0c7d301688e816/FLAG0dae19e9d [2022-12-12 21:39:48,090 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26674b197/e99c3712e9ec413abf0c7d301688e816 [2022-12-12 21:39:48,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:39:48,093 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:39:48,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:39:48,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:39:48,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:39:48,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:39:48" (1/1) ... [2022-12-12 21:39:48,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c925b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48, skipping insertion in model container [2022-12-12 21:39:48,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:39:48" (1/1) ... [2022-12-12 21:39:48,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:39:48,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:39:48,285 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-12 21:39:48,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:39:48,486 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:39:48,494 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-12 21:39:48,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:48,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:48,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:39:48,584 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:39:48,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48 WrapperNode [2022-12-12 21:39:48,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:39:48,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:39:48,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:39:48,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:39:48,593 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:39:48" (1/1) ... [2022-12-12 21:39:48,612 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:39:48" (1/1) ... [2022-12-12 21:39:48,640 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-12 21:39:48,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:39:48,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:39:48,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:39:48,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:39:48,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48" (1/1) ... [2022-12-12 21:39:48,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48" (1/1) ... [2022-12-12 21:39:48,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48" (1/1) ... [2022-12-12 21:39:48,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48" (1/1) ... [2022-12-12 21:39:48,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48" (1/1) ... [2022-12-12 21:39:48,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48" (1/1) ... [2022-12-12 21:39:48,665 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48" (1/1) ... [2022-12-12 21:39:48,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48" (1/1) ... [2022-12-12 21:39:48,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:39:48,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:39:48,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:39:48,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:39:48,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48" (1/1) ... [2022-12-12 21:39:48,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:39:48,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:39:48,757 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:39:48,760 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:39:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:39:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:39:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:39:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:39:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:39:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:39:48,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:39:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:39:48,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:39:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:39:48,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:39:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:39:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:39:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:39:48,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:39:48,817 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:39:48,910 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:39:48,911 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:39:49,258 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:39:49,403 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:39:49,403 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:39:49,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:39:49 BoogieIcfgContainer [2022-12-12 21:39:49,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:39:49,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:39:49,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:39:49,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:39:49,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:39:48" (1/3) ... [2022-12-12 21:39:49,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1e27d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:39:49, skipping insertion in model container [2022-12-12 21:39:49,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:48" (2/3) ... [2022-12-12 21:39:49,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1e27d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:39:49, skipping insertion in model container [2022-12-12 21:39:49,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:39:49" (3/3) ... [2022-12-12 21:39:49,414 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 21:39:49,431 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:39:49,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:39:49,432 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:39:49,487 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:39:49,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 21:39:49,594 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 21:39:49,595 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:39:49,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 21:39:49,602 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 21:39:49,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-12 21:39:49,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:39:49,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 21:39:49,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-12 21:39:49,669 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 21:39:49,669 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:39:49,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 21:39:49,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 21:39:49,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-12 21:39:56,872 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-12 21:39:56,890 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:39:56,897 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;@62b5de2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:39:56,897 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:39:56,904 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-12 21:39:56,904 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:39:56,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:56,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:56,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:39:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1323519518, now seen corresponding path program 1 times [2022-12-12 21:39:56,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:56,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702912026] [2022-12-12 21:39:56,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:56,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:57,285 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:39:57,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:57,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702912026] [2022-12-12 21:39:57,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702912026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:57,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:57,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:39:57,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732107497] [2022-12-12 21:39:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:57,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:39:57,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:57,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:39:57,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:39:57,315 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 56 [2022-12-12 21:39:57,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:39:57,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:57,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 56 [2022-12-12 21:39:57,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:58,505 INFO L130 PetriNetUnfolder]: 6079/9809 cut-off events. [2022-12-12 21:39:58,506 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-12 21:39:58,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18592 conditions, 9809 events. 6079/9809 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 73377 event pairs, 855 based on Foata normal form. 0/5894 useless extension candidates. Maximal degree in co-relation 18581. Up to 7305 conditions per place. [2022-12-12 21:39:58,547 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 28 selfloop transitions, 2 changer transitions 44/84 dead transitions. [2022-12-12 21:39:58,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 325 flow [2022-12-12 21:39:58,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:39:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:39:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-12-12 21:39:58,558 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-12 21:39:58,560 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -1 predicate places. [2022-12-12 21:39:58,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 84 transitions, 325 flow [2022-12-12 21:39:58,576 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 40 transitions, 149 flow [2022-12-12 21:39:58,577 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 149 flow [2022-12-12 21:39:58,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:39:58,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:58,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:58,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:39:58,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:39:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:58,579 INFO L85 PathProgramCache]: Analyzing trace with hash 592008445, now seen corresponding path program 1 times [2022-12-12 21:39:58,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:58,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380063447] [2022-12-12 21:39:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:58,781 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:39:58,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:58,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380063447] [2022-12-12 21:39:58,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380063447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:58,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:58,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:39:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866561636] [2022-12-12 21:39:58,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:58,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:39:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:58,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:39:58,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:39:58,784 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 21:39:58,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:39:58,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:58,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 21:39:58,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:58,976 INFO L130 PetriNetUnfolder]: 1136/1951 cut-off events. [2022-12-12 21:39:58,976 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-12 21:39:58,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5286 conditions, 1951 events. 1136/1951 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10772 event pairs, 74 based on Foata normal form. 10/1641 useless extension candidates. Maximal degree in co-relation 5272. Up to 1615 conditions per place. [2022-12-12 21:39:58,993 INFO L137 encePairwiseOnDemand]: 52/56 looper letters, 44 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2022-12-12 21:39:58,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 317 flow [2022-12-12 21:39:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:39:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:39:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-12 21:39:58,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2022-12-12 21:39:58,997 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -21 predicate places. [2022-12-12 21:39:58,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 57 transitions, 317 flow [2022-12-12 21:39:59,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 57 transitions, 317 flow [2022-12-12 21:39:59,007 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 57 transitions, 317 flow [2022-12-12 21:39:59,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:39:59,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:59,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:59,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:39:59,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:39:59,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1172391830, now seen corresponding path program 1 times [2022-12-12 21:39:59,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:59,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210434285] [2022-12-12 21:39:59,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:59,501 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:39:59,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:59,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210434285] [2022-12-12 21:39:59,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210434285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:59,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:59,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:39:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7361376] [2022-12-12 21:39:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:59,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:39:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:59,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:39:59,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:39:59,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 21:39:59,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 57 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:39:59,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:59,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 21:39:59,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:59,718 INFO L130 PetriNetUnfolder]: 1363/2258 cut-off events. [2022-12-12 21:39:59,718 INFO L131 PetriNetUnfolder]: For 628/628 co-relation queries the response was YES. [2022-12-12 21:39:59,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7927 conditions, 2258 events. 1363/2258 cut-off events. For 628/628 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11896 event pairs, 91 based on Foata normal form. 8/1906 useless extension candidates. Maximal degree in co-relation 7910. Up to 1839 conditions per place. [2022-12-12 21:39:59,729 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 56 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2022-12-12 21:39:59,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 550 flow [2022-12-12 21:39:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:39:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:39:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-12 21:39:59,731 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2022-12-12 21:39:59,732 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-12-12 21:39:59,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 75 transitions, 550 flow [2022-12-12 21:39:59,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 75 transitions, 550 flow [2022-12-12 21:39:59,742 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 75 transitions, 550 flow [2022-12-12 21:39:59,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:39:59,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:59,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:59,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:39:59,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:39:59,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1989725910, now seen corresponding path program 1 times [2022-12-12 21:39:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:59,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923409768] [2022-12-12 21:39:59,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:00,147 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:40:00,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:00,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923409768] [2022-12-12 21:40:00,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923409768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:00,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:00,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:40:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844913177] [2022-12-12 21:40:00,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:00,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:40:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:00,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:40:00,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:40:00,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 21:40:00,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 75 transitions, 550 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:40:00,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:00,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 21:40:00,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:00,502 INFO L130 PetriNetUnfolder]: 1349/2204 cut-off events. [2022-12-12 21:40:00,503 INFO L131 PetriNetUnfolder]: For 971/971 co-relation queries the response was YES. [2022-12-12 21:40:00,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9693 conditions, 2204 events. 1349/2204 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11337 event pairs, 131 based on Foata normal form. 5/1850 useless extension candidates. Maximal degree in co-relation 9673. Up to 1820 conditions per place. [2022-12-12 21:40:00,546 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 63 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2022-12-12 21:40:00,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 83 transitions, 763 flow [2022-12-12 21:40:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:40:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:40:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-12 21:40:00,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-12 21:40:00,550 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -15 predicate places. [2022-12-12 21:40:00,550 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 83 transitions, 763 flow [2022-12-12 21:40:00,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 83 transitions, 763 flow [2022-12-12 21:40:00,563 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 83 transitions, 763 flow [2022-12-12 21:40:00,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:40:00,563 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:00,563 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:00,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:40:00,564 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:40:00,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1989779726, now seen corresponding path program 1 times [2022-12-12 21:40:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:00,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881400670] [2022-12-12 21:40:00,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:00,931 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:40:00,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:00,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881400670] [2022-12-12 21:40:00,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881400670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:00,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:00,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:40:00,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800227046] [2022-12-12 21:40:00,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:00,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:40:00,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:00,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:40:00,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:40:00,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 21:40:00,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 83 transitions, 763 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:40:00,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:00,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 21:40:00,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:01,192 INFO L130 PetriNetUnfolder]: 1367/2244 cut-off events. [2022-12-12 21:40:01,192 INFO L131 PetriNetUnfolder]: For 1643/1643 co-relation queries the response was YES. [2022-12-12 21:40:01,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11730 conditions, 2244 events. 1367/2244 cut-off events. For 1643/1643 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11615 event pairs, 111 based on Foata normal form. 8/1891 useless extension candidates. Maximal degree in co-relation 11707. Up to 1840 conditions per place. [2022-12-12 21:40:01,204 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 78 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2022-12-12 21:40:01,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 105 transitions, 1165 flow [2022-12-12 21:40:01,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:40:01,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:40:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-12 21:40:01,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857 [2022-12-12 21:40:01,208 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -11 predicate places. [2022-12-12 21:40:01,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 105 transitions, 1165 flow [2022-12-12 21:40:01,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 105 transitions, 1165 flow [2022-12-12 21:40:01,219 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 105 transitions, 1165 flow [2022-12-12 21:40:01,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:40:01,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:01,219 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:01,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:40:01,220 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:40:01,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:01,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1989625346, now seen corresponding path program 2 times [2022-12-12 21:40:01,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:01,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199597256] [2022-12-12 21:40:01,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:01,582 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:40:01,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:01,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199597256] [2022-12-12 21:40:01,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199597256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:01,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:01,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:40:01,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048240656] [2022-12-12 21:40:01,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:01,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:40:01,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:01,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:40:01,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:40:01,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 21:40:01,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 105 transitions, 1165 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:40:01,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:01,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 21:40:01,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:01,912 INFO L130 PetriNetUnfolder]: 1390/2299 cut-off events. [2022-12-12 21:40:01,912 INFO L131 PetriNetUnfolder]: For 2380/2380 co-relation queries the response was YES. [2022-12-12 21:40:01,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13916 conditions, 2299 events. 1390/2299 cut-off events. For 2380/2380 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12248 event pairs, 91 based on Foata normal form. 43/1968 useless extension candidates. Maximal degree in co-relation 13890. Up to 1885 conditions per place. [2022-12-12 21:40:01,933 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 90 selfloop transitions, 17 changer transitions 0/117 dead transitions. [2022-12-12 21:40:01,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 117 transitions, 1519 flow [2022-12-12 21:40:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:40:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:40:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-12 21:40:01,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3535714285714286 [2022-12-12 21:40:01,935 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -7 predicate places. [2022-12-12 21:40:01,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 117 transitions, 1519 flow [2022-12-12 21:40:01,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 117 transitions, 1519 flow [2022-12-12 21:40:01,955 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 117 transitions, 1519 flow [2022-12-12 21:40:01,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:40:01,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:01,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:01,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:40:01,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:40:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash 866111213, now seen corresponding path program 1 times [2022-12-12 21:40:01,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:01,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337432159] [2022-12-12 21:40:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:01,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:02,476 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:40:02,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:02,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337432159] [2022-12-12 21:40:02,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337432159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:02,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:02,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:40:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069768189] [2022-12-12 21:40:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:02,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:40:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:02,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:40:02,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:40:02,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 21:40:02,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 117 transitions, 1519 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:40:02,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:02,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 21:40:02,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:02,771 INFO L130 PetriNetUnfolder]: 1543/2537 cut-off events. [2022-12-12 21:40:02,771 INFO L131 PetriNetUnfolder]: For 3341/3341 co-relation queries the response was YES. [2022-12-12 21:40:02,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17609 conditions, 2537 events. 1543/2537 cut-off events. For 3341/3341 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13831 event pairs, 81 based on Foata normal form. 15/2143 useless extension candidates. Maximal degree in co-relation 17580. Up to 2113 conditions per place. [2022-12-12 21:40:02,789 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 111 selfloop transitions, 13 changer transitions 0/134 dead transitions. [2022-12-12 21:40:02,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 134 transitions, 2005 flow [2022-12-12 21:40:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:40:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:40:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-12 21:40:02,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3357142857142857 [2022-12-12 21:40:02,791 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -3 predicate places. [2022-12-12 21:40:02,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 134 transitions, 2005 flow [2022-12-12 21:40:02,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 134 transitions, 2005 flow [2022-12-12 21:40:02,806 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 134 transitions, 2005 flow [2022-12-12 21:40:02,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:40:02,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:02,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:02,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:40:02,807 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:40:02,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:02,807 INFO L85 PathProgramCache]: Analyzing trace with hash 871000223, now seen corresponding path program 2 times [2022-12-12 21:40:02,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:02,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196626159] [2022-12-12 21:40:02,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:02,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:03,521 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:40:03,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:03,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196626159] [2022-12-12 21:40:03,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196626159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:03,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:03,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:40:03,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801533088] [2022-12-12 21:40:03,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:03,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:40:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:03,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:40:03,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:40:03,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 21:40:03,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 134 transitions, 2005 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:40:03,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:03,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 21:40:03,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:03,873 INFO L130 PetriNetUnfolder]: 1514/2493 cut-off events. [2022-12-12 21:40:03,874 INFO L131 PetriNetUnfolder]: For 4413/4413 co-relation queries the response was YES. [2022-12-12 21:40:03,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19426 conditions, 2493 events. 1514/2493 cut-off events. For 4413/4413 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13420 event pairs, 91 based on Foata normal form. 15/2106 useless extension candidates. Maximal degree in co-relation 19394. Up to 2074 conditions per place. [2022-12-12 21:40:03,894 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 115 selfloop transitions, 21 changer transitions 0/146 dead transitions. [2022-12-12 21:40:03,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 146 transitions, 2469 flow [2022-12-12 21:40:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:40:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:40:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-12 21:40:03,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2022-12-12 21:40:03,898 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 1 predicate places. [2022-12-12 21:40:03,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 146 transitions, 2469 flow [2022-12-12 21:40:03,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 146 transitions, 2469 flow [2022-12-12 21:40:03,915 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 146 transitions, 2469 flow [2022-12-12 21:40:03,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:40:03,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:03,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:03,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:40:03,916 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:40:03,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:03,919 INFO L85 PathProgramCache]: Analyzing trace with hash 921295119, now seen corresponding path program 1 times [2022-12-12 21:40:03,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:03,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221694069] [2022-12-12 21:40:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:04,094 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:40:04,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:04,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221694069] [2022-12-12 21:40:04,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221694069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:04,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:04,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:40:04,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661333577] [2022-12-12 21:40:04,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:04,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:40:04,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:04,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:40:04,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:40:04,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:40:04,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 146 transitions, 2469 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:40:04,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:04,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:40:04,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:04,372 INFO L130 PetriNetUnfolder]: 2048/3231 cut-off events. [2022-12-12 21:40:04,372 INFO L131 PetriNetUnfolder]: For 15227/15231 co-relation queries the response was YES. [2022-12-12 21:40:04,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26661 conditions, 3231 events. 2048/3231 cut-off events. For 15227/15231 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 17206 event pairs, 275 based on Foata normal form. 49/2835 useless extension candidates. Maximal degree in co-relation 26626. Up to 2770 conditions per place. [2022-12-12 21:40:04,394 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 133 selfloop transitions, 36 changer transitions 0/182 dead transitions. [2022-12-12 21:40:04,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 182 transitions, 3419 flow [2022-12-12 21:40:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:40:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:40:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-12 21:40:04,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-12 21:40:04,397 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 3 predicate places. [2022-12-12 21:40:04,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 182 transitions, 3419 flow [2022-12-12 21:40:04,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 182 transitions, 3419 flow [2022-12-12 21:40:04,416 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 182 transitions, 3419 flow [2022-12-12 21:40:04,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:40:04,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:04,416 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:04,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:40:04,417 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:40:04,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1994318955, now seen corresponding path program 1 times [2022-12-12 21:40:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:04,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269937589] [2022-12-12 21:40:04,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:04,517 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:40:04,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:04,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269937589] [2022-12-12 21:40:04,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269937589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:04,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:04,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:40:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238873572] [2022-12-12 21:40:04,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:04,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:40:04,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:04,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:40:04,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:40:04,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:40:04,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 182 transitions, 3419 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:40:04,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:04,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:40:04,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:04,749 INFO L130 PetriNetUnfolder]: 1047/1867 cut-off events. [2022-12-12 21:40:04,749 INFO L131 PetriNetUnfolder]: For 11614/11652 co-relation queries the response was YES. [2022-12-12 21:40:04,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17241 conditions, 1867 events. 1047/1867 cut-off events. For 11614/11652 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10400 event pairs, 61 based on Foata normal form. 161/1777 useless extension candidates. Maximal degree in co-relation 17203. Up to 1554 conditions per place. [2022-12-12 21:40:04,761 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 105 selfloop transitions, 61 changer transitions 0/176 dead transitions. [2022-12-12 21:40:04,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 176 transitions, 3604 flow [2022-12-12 21:40:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:40:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:40:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-12 21:40:04,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2022-12-12 21:40:04,763 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 4 predicate places. [2022-12-12 21:40:04,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 176 transitions, 3604 flow [2022-12-12 21:40:04,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 176 transitions, 3604 flow [2022-12-12 21:40:04,773 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 176 transitions, 3604 flow [2022-12-12 21:40:04,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:40:04,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:04,774 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:40:04,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:40:04,774 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:40:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash -625951675, now seen corresponding path program 1 times [2022-12-12 21:40:04,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:04,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540372163] [2022-12-12 21:40:04,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:05,101 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:40:05,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:05,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540372163] [2022-12-12 21:40:05,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540372163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:05,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:05,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:40:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223699717] [2022-12-12 21:40:05,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:05,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:40:05,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:05,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:40:05,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:40:05,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:40:05,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 176 transitions, 3604 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:40:05,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:05,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:40:05,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:05,826 INFO L130 PetriNetUnfolder]: 2532/4375 cut-off events. [2022-12-12 21:40:05,826 INFO L131 PetriNetUnfolder]: For 37357/37470 co-relation queries the response was YES. [2022-12-12 21:40:05,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43333 conditions, 4375 events. 2532/4375 cut-off events. For 37357/37470 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 28260 event pairs, 93 based on Foata normal form. 159/3880 useless extension candidates. Maximal degree in co-relation 43292. Up to 3693 conditions per place. [2022-12-12 21:40:05,858 INFO L137 encePairwiseOnDemand]: 46/56 looper letters, 188 selfloop transitions, 48 changer transitions 198/446 dead transitions. [2022-12-12 21:40:05,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 446 transitions, 10291 flow [2022-12-12 21:40:05,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:40:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:40:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-12-12 21:40:05,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-12 21:40:05,861 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 9 predicate places. [2022-12-12 21:40:05,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 446 transitions, 10291 flow [2022-12-12 21:40:05,884 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 248 transitions, 5633 flow [2022-12-12 21:40:05,884 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 248 transitions, 5633 flow [2022-12-12 21:40:05,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:40:05,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:05,884 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:40:05,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:40:05,885 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:40:05,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:05,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1251201048, now seen corresponding path program 1 times [2022-12-12 21:40:05,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:05,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455180198] [2022-12-12 21:40:05,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:05,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:05,980 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:40:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455180198] [2022-12-12 21:40:05,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455180198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:05,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:05,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:40:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36832117] [2022-12-12 21:40:05,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:05,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:40:05,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:05,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:40:05,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:40:05,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 21:40:05,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 248 transitions, 5633 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:40:05,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:05,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 21:40:05,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:06,381 INFO L130 PetriNetUnfolder]: 1735/3174 cut-off events. [2022-12-12 21:40:06,382 INFO L131 PetriNetUnfolder]: For 19906/20007 co-relation queries the response was YES. [2022-12-12 21:40:06,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34730 conditions, 3174 events. 1735/3174 cut-off events. For 19906/20007 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 21131 event pairs, 151 based on Foata normal form. 123/2761 useless extension candidates. Maximal degree in co-relation 34686. Up to 2875 conditions per place. [2022-12-12 21:40:06,397 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 160 selfloop transitions, 10 changer transitions 100/288 dead transitions. [2022-12-12 21:40:06,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 288 transitions, 7129 flow [2022-12-12 21:40:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:40:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:40:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-12 21:40:06,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-12 21:40:06,400 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 9 predicate places. [2022-12-12 21:40:06,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 288 transitions, 7129 flow [2022-12-12 21:40:06,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 188 transitions, 4549 flow [2022-12-12 21:40:06,411 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 188 transitions, 4549 flow [2022-12-12 21:40:06,411 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:40:06,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:06,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:06,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:40:06,412 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:40:06,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:06,413 INFO L85 PathProgramCache]: Analyzing trace with hash -275299570, now seen corresponding path program 1 times [2022-12-12 21:40:06,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:06,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786302234] [2022-12-12 21:40:06,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:06,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:06,541 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:40:06,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:06,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786302234] [2022-12-12 21:40:06,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786302234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:06,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:06,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:40:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259224826] [2022-12-12 21:40:06,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:06,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:40:06,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:06,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:40:06,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:40:06,543 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:40:06,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 188 transitions, 4549 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:40:06,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:06,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:40:06,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:06,736 INFO L130 PetriNetUnfolder]: 476/1114 cut-off events. [2022-12-12 21:40:06,736 INFO L131 PetriNetUnfolder]: For 11718/11862 co-relation queries the response was YES. [2022-12-12 21:40:06,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12368 conditions, 1114 events. 476/1114 cut-off events. For 11718/11862 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7314 event pairs, 15 based on Foata normal form. 198/1115 useless extension candidates. Maximal degree in co-relation 12321. Up to 928 conditions per place. [2022-12-12 21:40:06,742 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 36 selfloop transitions, 62 changer transitions 77/181 dead transitions. [2022-12-12 21:40:06,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 181 transitions, 4707 flow [2022-12-12 21:40:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:40:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:40:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-12 21:40:06,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-12 21:40:06,744 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 13 predicate places. [2022-12-12 21:40:06,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 181 transitions, 4707 flow [2022-12-12 21:40:06,749 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 104 transitions, 2621 flow [2022-12-12 21:40:06,750 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 104 transitions, 2621 flow [2022-12-12 21:40:06,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:40:06,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:06,750 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:06,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:40:06,750 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:40:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1671438462, now seen corresponding path program 1 times [2022-12-12 21:40:06,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:06,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915417624] [2022-12-12 21:40:06,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:06,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:40:06,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:40:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:40:06,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:40:06,827 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:40:06,828 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:40:06,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 21:40:06,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:40:06,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 21:40:06,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 21:40:06,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:40:06,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 21:40:06,831 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:06,836 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:40:06,836 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:40:06,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:40:06 BasicIcfg [2022-12-12 21:40:06,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:40:06,897 INFO L158 Benchmark]: Toolchain (without parser) took 18804.21ms. Allocated memory was 195.0MB in the beginning and 692.1MB in the end (delta: 497.0MB). Free memory was 170.8MB in the beginning and 318.5MB in the end (delta: -147.7MB). Peak memory consumption was 349.8MB. Max. memory is 8.0GB. [2022-12-12 21:40:06,898 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 171.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:40:06,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.77ms. Allocated memory is still 195.0MB. Free memory was 170.3MB in the beginning and 144.5MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 21:40:06,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.36ms. Allocated memory is still 195.0MB. Free memory was 144.5MB in the beginning and 142.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:40:06,898 INFO L158 Benchmark]: Boogie Preprocessor took 35.88ms. Allocated memory is still 195.0MB. Free memory was 142.0MB in the beginning and 139.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:40:06,898 INFO L158 Benchmark]: RCFGBuilder took 728.73ms. Allocated memory is still 195.0MB. Free memory was 139.9MB in the beginning and 108.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-12 21:40:06,898 INFO L158 Benchmark]: TraceAbstraction took 17488.64ms. Allocated memory was 195.0MB in the beginning and 692.1MB in the end (delta: 497.0MB). Free memory was 107.4MB in the beginning and 318.5MB in the end (delta: -211.1MB). Peak memory consumption was 286.9MB. Max. memory is 8.0GB. [2022-12-12 21:40:06,904 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.10ms. Allocated memory is still 195.0MB. Free memory is still 171.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 489.77ms. Allocated memory is still 195.0MB. Free memory was 170.3MB in the beginning and 144.5MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.36ms. Allocated memory is still 195.0MB. Free memory was 144.5MB in the beginning and 142.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.88ms. Allocated memory is still 195.0MB. Free memory was 142.0MB in the beginning and 139.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 728.73ms. Allocated memory is still 195.0MB. Free memory was 139.9MB in the beginning and 108.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 17488.64ms. Allocated memory was 195.0MB in the beginning and 692.1MB in the end (delta: 497.0MB). Free memory was 107.4MB in the beginning and 318.5MB in the end (delta: -211.1MB). Peak memory consumption was 286.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 111 PlacesBefore, 65 PlacesAfterwards, 103 TransitionsBefore, 56 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 3061, independent unconditional: 0, dependent: 117, dependent conditional: 117, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1713, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1713, independent: 1622, independent conditional: 0, independent unconditional: 1622, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 300, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3178, independent: 1393, independent conditional: 0, independent unconditional: 1393, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 1713, unknown conditional: 0, unknown unconditional: 1713] , Statistics on independence cache: Total cache size (in pairs): 3019, Positive cache size: 2974, Positive conditional cache size: 0, Positive unconditional cache size: 2974, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-3, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-2, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 814]: 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: 816]: 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 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 981 IncrementalHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 16 mSDtfsCounter, 981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5633occurred in iteration=11, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 9500 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 1645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:40:06,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...