/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/mix020.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:34:21,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:34:21,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:34:21,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:34:21,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:34:21,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:34:21,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:34:21,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:34:21,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:34:21,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:34:21,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:34:21,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:34:21,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:34:21,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:34:21,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:34:21,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:34:21,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:34:21,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:34:21,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:34:21,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:34:21,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:34:21,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:34:21,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:34:21,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:34:21,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:34:21,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:34:21,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:34:21,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:34:21,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:34:21,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:34:21,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:34:21,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:34:21,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:34:21,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:34:21,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:34:21,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:34:21,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:34:21,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:34:21,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:34:21,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:34:21,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:34:21,121 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:34:21,151 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:34:21,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:34:21,153 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:34:21,153 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:34:21,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:34:21,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:34:21,155 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:34:21,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:34:21,155 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:34:21,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:34:21,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:34:21,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:34:21,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:34:21,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:34:21,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:34:21,157 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:34:21,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:34:21,157 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:34:21,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:34:21,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:34:21,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:34:21,158 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:34:21,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:34:21,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:34:21,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:34:21,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:34:21,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:34:21,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:34:21,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:34:21,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:34:21,159 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:34:21,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:34:21,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:34:21,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:34:21,510 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:34:21,510 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:34:21,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2022-12-12 21:34:22,612 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:34:22,885 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:34:22,886 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2022-12-12 21:34:22,910 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805b5eeb2/a21c948739d04d45a840fc72840ae051/FLAG06d55aed0 [2022-12-12 21:34:22,929 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805b5eeb2/a21c948739d04d45a840fc72840ae051 [2022-12-12 21:34:22,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:34:22,934 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:34:22,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:34:22,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:34:22,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:34:22,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:34:22" (1/1) ... [2022-12-12 21:34:22,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dcd69f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:22, skipping insertion in model container [2022-12-12 21:34:22,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:34:22" (1/1) ... [2022-12-12 21:34:22,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:34:22,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:34:23,164 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/mix020.opt.i[944,957] [2022-12-12 21:34:23,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:34:23,403 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:34:23,415 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/mix020.opt.i[944,957] [2022-12-12 21:34:23,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:34:23,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:34:23,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:34:23,524 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:34:23,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:23 WrapperNode [2022-12-12 21:34:23,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:34:23,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:34:23,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:34:23,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:34:23,532 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:34:23" (1/1) ... [2022-12-12 21:34:23,546 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:34:23" (1/1) ... [2022-12-12 21:34:23,578 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-12-12 21:34:23,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:34:23,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:34:23,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:34:23,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:34:23,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:23" (1/1) ... [2022-12-12 21:34:23,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:23" (1/1) ... [2022-12-12 21:34:23,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:23" (1/1) ... [2022-12-12 21:34:23,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:23" (1/1) ... [2022-12-12 21:34:23,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:23" (1/1) ... [2022-12-12 21:34:23,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:23" (1/1) ... [2022-12-12 21:34:23,613 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:23" (1/1) ... [2022-12-12 21:34:23,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:23" (1/1) ... [2022-12-12 21:34:23,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:34:23,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:34:23,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:34:23,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:34:23,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:23" (1/1) ... [2022-12-12 21:34:23,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:34:23,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:34:23,660 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:34:23,671 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:34:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:34:23,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:34:23,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:34:23,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:34:23,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:34:23,704 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:34:23,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:34:23,704 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:34:23,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:34:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:34:23,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:34:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 21:34:23,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 21:34:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:34:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:34:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:34:23,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:34:23,707 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:34:23,907 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:34:23,909 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:34:24,298 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:34:24,420 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:34:24,420 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:34:24,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:34:24 BoogieIcfgContainer [2022-12-12 21:34:24,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:34:24,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:34:24,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:34:24,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:34:24,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:34:22" (1/3) ... [2022-12-12 21:34:24,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156ebbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:34:24, skipping insertion in model container [2022-12-12 21:34:24,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:34:23" (2/3) ... [2022-12-12 21:34:24,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156ebbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:34:24, skipping insertion in model container [2022-12-12 21:34:24,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:34:24" (3/3) ... [2022-12-12 21:34:24,431 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.opt.i [2022-12-12 21:34:24,448 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:34:24,449 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:34:24,449 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:34:24,505 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:34:24,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2022-12-12 21:34:24,610 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-12 21:34:24,610 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:34:24,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-12 21:34:24,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2022-12-12 21:34:24,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2022-12-12 21:34:24,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:34:24,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-12 21:34:24,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2022-12-12 21:34:24,697 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-12 21:34:24,698 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:34:24,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-12 21:34:24,702 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-12 21:34:24,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 2718 [2022-12-12 21:34:30,065 INFO L241 LiptonReduction]: Total number of compositions: 100 [2022-12-12 21:34:30,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:34:30,084 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;@7e164310, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:34:30,084 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 21:34:30,094 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-12 21:34:30,095 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:34:30,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:30,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:30,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash -31270810, now seen corresponding path program 1 times [2022-12-12 21:34:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:30,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361624] [2022-12-12 21:34:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:30,562 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:34:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:30,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361624] [2022-12-12 21:34:30,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:30,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:30,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:34:30,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232771786] [2022-12-12 21:34:30,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:30,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:34:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:30,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:34:30,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:34:30,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 64 [2022-12-12 21:34:30,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:34:30,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:30,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 64 [2022-12-12 21:34:30,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:35,825 INFO L130 PetriNetUnfolder]: 40551/58279 cut-off events. [2022-12-12 21:34:35,826 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-12 21:34:35,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112199 conditions, 58279 events. 40551/58279 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 3498. Compared 446478 event pairs, 5311 based on Foata normal form. 0/35872 useless extension candidates. Maximal degree in co-relation 112187. Up to 46041 conditions per place. [2022-12-12 21:34:36,079 INFO L137 encePairwiseOnDemand]: 60/64 looper letters, 37 selfloop transitions, 2 changer transitions 46/98 dead transitions. [2022-12-12 21:34:36,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 98 transitions, 378 flow [2022-12-12 21:34:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:34:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:34:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-12-12 21:34:36,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2022-12-12 21:34:36,096 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 0 predicate places. [2022-12-12 21:34:36,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 98 transitions, 378 flow [2022-12-12 21:34:36,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 52 transitions, 194 flow [2022-12-12 21:34:36,179 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 194 flow [2022-12-12 21:34:36,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:34:36,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:36,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:36,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:34:36,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash 13624052, now seen corresponding path program 1 times [2022-12-12 21:34:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:36,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704162375] [2022-12-12 21:34:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:36,432 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:34:36,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:36,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704162375] [2022-12-12 21:34:36,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704162375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:36,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:36,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:34:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214626756] [2022-12-12 21:34:36,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:36,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:34:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:36,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:34:36,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:34:36,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 21:34:36,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:34:36,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:36,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 21:34:36,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:38,715 INFO L130 PetriNetUnfolder]: 21274/30211 cut-off events. [2022-12-12 21:34:38,715 INFO L131 PetriNetUnfolder]: For 3433/3433 co-relation queries the response was YES. [2022-12-12 21:34:38,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83243 conditions, 30211 events. 21274/30211 cut-off events. For 3433/3433 co-relation queries the response was YES. Maximal size of possible extension queue 1137. Compared 185841 event pairs, 1455 based on Foata normal form. 533/24928 useless extension candidates. Maximal degree in co-relation 83228. Up to 20113 conditions per place. [2022-12-12 21:34:38,876 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 71 selfloop transitions, 9 changer transitions 2/91 dead transitions. [2022-12-12 21:34:38,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 91 transitions, 515 flow [2022-12-12 21:34:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:34:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:34:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-12 21:34:38,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2022-12-12 21:34:38,879 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -21 predicate places. [2022-12-12 21:34:38,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 91 transitions, 515 flow [2022-12-12 21:34:38,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 89 transitions, 507 flow [2022-12-12 21:34:38,984 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 89 transitions, 507 flow [2022-12-12 21:34:38,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:34:38,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:38,985 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:38,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:34:38,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:38,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:38,986 INFO L85 PathProgramCache]: Analyzing trace with hash 422346190, now seen corresponding path program 1 times [2022-12-12 21:34:38,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:38,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035137468] [2022-12-12 21:34:38,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:39,138 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:34:39,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:39,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035137468] [2022-12-12 21:34:39,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035137468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:39,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:39,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:34:39,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520835387] [2022-12-12 21:34:39,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:39,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:34:39,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:39,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:34:39,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:34:39,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 21:34:39,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 89 transitions, 507 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:34:39,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:39,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 21:34:39,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:41,029 INFO L130 PetriNetUnfolder]: 15746/22629 cut-off events. [2022-12-12 21:34:41,029 INFO L131 PetriNetUnfolder]: For 2265/2265 co-relation queries the response was YES. [2022-12-12 21:34:41,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84618 conditions, 22629 events. 15746/22629 cut-off events. For 2265/2265 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 135637 event pairs, 1147 based on Foata normal form. 230/18401 useless extension candidates. Maximal degree in co-relation 84600. Up to 15854 conditions per place. [2022-12-12 21:34:41,310 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 97 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2022-12-12 21:34:41,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 114 transitions, 861 flow [2022-12-12 21:34:41,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:34:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:34:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-12 21:34:41,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-12 21:34:41,323 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -19 predicate places. [2022-12-12 21:34:41,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 114 transitions, 861 flow [2022-12-12 21:34:41,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 114 transitions, 861 flow [2022-12-12 21:34:41,427 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 114 transitions, 861 flow [2022-12-12 21:34:41,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:34:41,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:41,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:41,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:34:41,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:41,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash 207791241, now seen corresponding path program 1 times [2022-12-12 21:34:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:41,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689998468] [2022-12-12 21:34:41,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:41,622 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:34:41,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:41,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689998468] [2022-12-12 21:34:41,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689998468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:41,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:41,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:34:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810119660] [2022-12-12 21:34:41,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:41,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:34:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:41,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:34:41,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:34:41,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 21:34:41,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 114 transitions, 861 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:34:41,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:41,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 21:34:41,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:43,280 INFO L130 PetriNetUnfolder]: 15396/22148 cut-off events. [2022-12-12 21:34:43,281 INFO L131 PetriNetUnfolder]: For 2700/2700 co-relation queries the response was YES. [2022-12-12 21:34:43,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103690 conditions, 22148 events. 15396/22148 cut-off events. For 2700/2700 co-relation queries the response was YES. Maximal size of possible extension queue 831. Compared 133082 event pairs, 487 based on Foata normal form. 50/17815 useless extension candidates. Maximal degree in co-relation 103669. Up to 15454 conditions per place. [2022-12-12 21:34:43,460 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 131 selfloop transitions, 21 changer transitions 0/161 dead transitions. [2022-12-12 21:34:43,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 161 transitions, 1543 flow [2022-12-12 21:34:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:34:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:34:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-12-12 21:34:43,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2022-12-12 21:34:43,466 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -16 predicate places. [2022-12-12 21:34:43,467 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 161 transitions, 1543 flow [2022-12-12 21:34:43,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 161 transitions, 1543 flow [2022-12-12 21:34:43,605 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 161 transitions, 1543 flow [2022-12-12 21:34:43,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:34:43,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:43,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:43,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:34:43,607 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:43,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:43,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2147225373, now seen corresponding path program 1 times [2022-12-12 21:34:43,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:43,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122840873] [2022-12-12 21:34:43,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:43,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:43,775 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:34:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:43,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122840873] [2022-12-12 21:34:43,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122840873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:43,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:43,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:34:43,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599851357] [2022-12-12 21:34:43,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:43,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:34:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:43,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:34:43,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:34:43,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 21:34:43,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 161 transitions, 1543 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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:34:43,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:43,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 21:34:43,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:46,962 INFO L130 PetriNetUnfolder]: 29909/40789 cut-off events. [2022-12-12 21:34:46,962 INFO L131 PetriNetUnfolder]: For 50371/50813 co-relation queries the response was YES. [2022-12-12 21:34:47,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212971 conditions, 40789 events. 29909/40789 cut-off events. For 50371/50813 co-relation queries the response was YES. Maximal size of possible extension queue 1492. Compared 238936 event pairs, 3966 based on Foata normal form. 327/34044 useless extension candidates. Maximal degree in co-relation 212947. Up to 36752 conditions per place. [2022-12-12 21:34:47,230 INFO L137 encePairwiseOnDemand]: 50/64 looper letters, 184 selfloop transitions, 53 changer transitions 0/256 dead transitions. [2022-12-12 21:34:47,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 256 transitions, 2956 flow [2022-12-12 21:34:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:34:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:34:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-12 21:34:47,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4322916666666667 [2022-12-12 21:34:47,232 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -14 predicate places. [2022-12-12 21:34:47,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 256 transitions, 2956 flow [2022-12-12 21:34:47,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 256 transitions, 2956 flow [2022-12-12 21:34:47,397 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 256 transitions, 2956 flow [2022-12-12 21:34:47,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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:34:47,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:47,398 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:34:47,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:34:47,398 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:47,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:47,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1958847848, now seen corresponding path program 1 times [2022-12-12 21:34:47,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:47,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188082989] [2022-12-12 21:34:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:47,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:47,617 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:34:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188082989] [2022-12-12 21:34:47,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188082989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:47,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:47,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:34:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948096120] [2022-12-12 21:34:47,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:47,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:34:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:47,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:34:47,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:34:47,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 21:34:47,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 256 transitions, 2956 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:34:47,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:47,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 21:34:47,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:52,391 INFO L130 PetriNetUnfolder]: 38797/53120 cut-off events. [2022-12-12 21:34:52,392 INFO L131 PetriNetUnfolder]: For 85695/86871 co-relation queries the response was YES. [2022-12-12 21:34:52,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320233 conditions, 53120 events. 38797/53120 cut-off events. For 85695/86871 co-relation queries the response was YES. Maximal size of possible extension queue 1930. Compared 322329 event pairs, 6421 based on Foata normal form. 1500/44936 useless extension candidates. Maximal degree in co-relation 320206. Up to 48238 conditions per place. [2022-12-12 21:34:52,826 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 261 selfloop transitions, 22 changer transitions 31/327 dead transitions. [2022-12-12 21:34:52,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 327 transitions, 4430 flow [2022-12-12 21:34:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:34:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:34:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-12-12 21:34:52,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2022-12-12 21:34:52,828 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -11 predicate places. [2022-12-12 21:34:52,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 327 transitions, 4430 flow [2022-12-12 21:34:53,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 296 transitions, 4000 flow [2022-12-12 21:34:53,015 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 296 transitions, 4000 flow [2022-12-12 21:34:53,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:34:53,016 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:53,016 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:34:53,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:34:53,016 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:53,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:53,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1898005637, now seen corresponding path program 1 times [2022-12-12 21:34:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:53,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601656029] [2022-12-12 21:34:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:53,238 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:34:53,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:53,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601656029] [2022-12-12 21:34:53,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601656029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:53,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:53,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:34:53,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40145141] [2022-12-12 21:34:53,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:53,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:34:53,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:53,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:34:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:34:53,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 21:34:53,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 296 transitions, 4000 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:34:53,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:53,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 21:34:53,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:56,802 INFO L130 PetriNetUnfolder]: 25872/37370 cut-off events. [2022-12-12 21:34:56,802 INFO L131 PetriNetUnfolder]: For 72596/75071 co-relation queries the response was YES. [2022-12-12 21:34:56,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259685 conditions, 37370 events. 25872/37370 cut-off events. For 72596/75071 co-relation queries the response was YES. Maximal size of possible extension queue 1624. Compared 245677 event pairs, 3304 based on Foata normal form. 1853/32628 useless extension candidates. Maximal degree in co-relation 259655. Up to 33888 conditions per place. [2022-12-12 21:34:56,984 INFO L137 encePairwiseOnDemand]: 50/64 looper letters, 223 selfloop transitions, 121 changer transitions 25/390 dead transitions. [2022-12-12 21:34:56,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 390 transitions, 6029 flow [2022-12-12 21:34:56,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:34:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:34:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-12-12 21:34:56,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44921875 [2022-12-12 21:34:56,987 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -8 predicate places. [2022-12-12 21:34:56,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 390 transitions, 6029 flow [2022-12-12 21:34:57,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 365 transitions, 5629 flow [2022-12-12 21:34:57,104 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 365 transitions, 5629 flow [2022-12-12 21:34:57,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:34:57,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:57,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:57,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:34:57,105 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:57,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1349691320, now seen corresponding path program 1 times [2022-12-12 21:34:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:57,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110991165] [2022-12-12 21:34:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:57,282 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:34:57,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:57,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110991165] [2022-12-12 21:34:57,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110991165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:57,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:57,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:34:57,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570317818] [2022-12-12 21:34:57,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:57,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:34:57,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:57,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:34:57,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:34:57,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 21:34:57,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 365 transitions, 5629 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:34:57,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:57,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 21:34:57,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:59,449 INFO L130 PetriNetUnfolder]: 13386/20957 cut-off events. [2022-12-12 21:34:59,449 INFO L131 PetriNetUnfolder]: For 62097/64748 co-relation queries the response was YES. [2022-12-12 21:34:59,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164343 conditions, 20957 events. 13386/20957 cut-off events. For 62097/64748 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 146813 event pairs, 709 based on Foata normal form. 2551/19797 useless extension candidates. Maximal degree in co-relation 164310. Up to 18787 conditions per place. [2022-12-12 21:34:59,567 INFO L137 encePairwiseOnDemand]: 50/64 looper letters, 196 selfloop transitions, 157 changer transitions 40/414 dead transitions. [2022-12-12 21:34:59,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 414 transitions, 7168 flow [2022-12-12 21:34:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:34:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:34:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-12-12 21:34:59,569 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.453125 [2022-12-12 21:34:59,569 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2022-12-12 21:34:59,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 414 transitions, 7168 flow [2022-12-12 21:34:59,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 374 transitions, 6442 flow [2022-12-12 21:34:59,651 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 374 transitions, 6442 flow [2022-12-12 21:34:59,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:34:59,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:59,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:59,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:34:59,652 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:59,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1443143067, now seen corresponding path program 1 times [2022-12-12 21:34:59,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:59,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035986446] [2022-12-12 21:34:59,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:59,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:35:00,161 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:35:00,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:35:00,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035986446] [2022-12-12 21:35:00,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035986446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:35:00,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:35:00,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:35:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513636459] [2022-12-12 21:35:00,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:35:00,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:35:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:35:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:35:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:35:00,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 21:35:00,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 374 transitions, 6442 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:35:00,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:35:00,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 21:35:00,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:35:02,601 INFO L130 PetriNetUnfolder]: 13634/22444 cut-off events. [2022-12-12 21:35:02,601 INFO L131 PetriNetUnfolder]: For 76000/77977 co-relation queries the response was YES. [2022-12-12 21:35:02,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190782 conditions, 22444 events. 13634/22444 cut-off events. For 76000/77977 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 172239 event pairs, 622 based on Foata normal form. 564/19376 useless extension candidates. Maximal degree in co-relation 190746. Up to 19876 conditions per place. [2022-12-12 21:35:02,730 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 516 selfloop transitions, 97 changer transitions 6/640 dead transitions. [2022-12-12 21:35:02,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 640 transitions, 12393 flow [2022-12-12 21:35:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 21:35:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 21:35:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions. [2022-12-12 21:35:02,732 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3663194444444444 [2022-12-12 21:35:02,733 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2022-12-12 21:35:02,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 640 transitions, 12393 flow [2022-12-12 21:35:02,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 634 transitions, 12273 flow [2022-12-12 21:35:02,824 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 634 transitions, 12273 flow [2022-12-12 21:35:02,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:35:02,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:35:02,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:35:02,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:35:02,825 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:35:02,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:35:02,825 INFO L85 PathProgramCache]: Analyzing trace with hash 408725627, now seen corresponding path program 2 times [2022-12-12 21:35:02,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:35:02,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641775042] [2022-12-12 21:35:02,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:35:02,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:35:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:35:03,025 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:35:03,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:35:03,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641775042] [2022-12-12 21:35:03,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641775042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:35:03,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:35:03,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:35:03,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806176256] [2022-12-12 21:35:03,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:35:03,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:35:03,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:35:03,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:35:03,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:35:03,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 21:35:03,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 634 transitions, 12273 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:35:03,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:35:03,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 21:35:03,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:35:05,376 INFO L130 PetriNetUnfolder]: 10811/17156 cut-off events. [2022-12-12 21:35:05,377 INFO L131 PetriNetUnfolder]: For 79303/82224 co-relation queries the response was YES. [2022-12-12 21:35:05,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160651 conditions, 17156 events. 10811/17156 cut-off events. For 79303/82224 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 120375 event pairs, 36 based on Foata normal form. 2109/16080 useless extension candidates. Maximal degree in co-relation 160612. Up to 15165 conditions per place. [2022-12-12 21:35:05,469 INFO L137 encePairwiseOnDemand]: 50/64 looper letters, 245 selfloop transitions, 277 changer transitions 69/622 dead transitions. [2022-12-12 21:35:05,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 622 transitions, 13199 flow [2022-12-12 21:35:05,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:35:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:35:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2022-12-12 21:35:05,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4010416666666667 [2022-12-12 21:35:05,471 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 9 predicate places. [2022-12-12 21:35:05,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 622 transitions, 13199 flow [2022-12-12 21:35:05,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 553 transitions, 11752 flow [2022-12-12 21:35:05,535 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 553 transitions, 11752 flow [2022-12-12 21:35:05,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:35:05,535 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:35:05,535 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:35:05,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:35:05,535 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:35:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:35:05,536 INFO L85 PathProgramCache]: Analyzing trace with hash 811110130, now seen corresponding path program 1 times [2022-12-12 21:35:05,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:35:05,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349636925] [2022-12-12 21:35:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:35:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:35:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:35:06,137 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:35:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:35:06,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349636925] [2022-12-12 21:35:06,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349636925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:35:06,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:35:06,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:35:06,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566945494] [2022-12-12 21:35:06,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:35:06,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:35:06,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:35:06,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:35:06,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:35:06,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 21:35:06,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 553 transitions, 11752 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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:35:06,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:35:06,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 21:35:06,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:35:07,791 INFO L130 PetriNetUnfolder]: 7621/11420 cut-off events. [2022-12-12 21:35:07,792 INFO L131 PetriNetUnfolder]: For 54145/55295 co-relation queries the response was YES. [2022-12-12 21:35:07,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118856 conditions, 11420 events. 7621/11420 cut-off events. For 54145/55295 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 66216 event pairs, 60 based on Foata normal form. 143/9181 useless extension candidates. Maximal degree in co-relation 118814. Up to 10428 conditions per place. [2022-12-12 21:35:07,855 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 226 selfloop transitions, 20 changer transitions 571/845 dead transitions. [2022-12-12 21:35:07,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 845 transitions, 19782 flow [2022-12-12 21:35:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:35:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:35:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2022-12-12 21:35:07,857 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36830357142857145 [2022-12-12 21:35:07,857 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 15 predicate places. [2022-12-12 21:35:07,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 845 transitions, 19782 flow [2022-12-12 21:35:07,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 274 transitions, 6157 flow [2022-12-12 21:35:07,899 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 274 transitions, 6157 flow [2022-12-12 21:35:07,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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:35:07,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:35:07,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:35:07,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:35:07,900 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:35:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:35:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1621383636, now seen corresponding path program 2 times [2022-12-12 21:35:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:35:07,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020884552] [2022-12-12 21:35:07,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:35:07,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:35:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:35:08,076 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:35:08,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:35:08,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020884552] [2022-12-12 21:35:08,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020884552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:35:08,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:35:08,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:35:08,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403785024] [2022-12-12 21:35:08,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:35:08,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:35:08,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:35:08,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:35:08,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:35:08,077 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 21:35:08,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 274 transitions, 6157 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:35:08,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:35:08,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 21:35:08,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:35:08,761 INFO L130 PetriNetUnfolder]: 3683/5877 cut-off events. [2022-12-12 21:35:08,761 INFO L131 PetriNetUnfolder]: For 31642/32393 co-relation queries the response was YES. [2022-12-12 21:35:08,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65234 conditions, 5877 events. 3683/5877 cut-off events. For 31642/32393 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 34981 event pairs, 4 based on Foata normal form. 123/4622 useless extension candidates. Maximal degree in co-relation 65189. Up to 5540 conditions per place. [2022-12-12 21:35:08,790 INFO L137 encePairwiseOnDemand]: 61/64 looper letters, 104 selfloop transitions, 3 changer transitions 253/381 dead transitions. [2022-12-12 21:35:08,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 381 transitions, 9419 flow [2022-12-12 21:35:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:35:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:35:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-12 21:35:08,792 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2022-12-12 21:35:08,792 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 12 predicate places. [2022-12-12 21:35:08,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 381 transitions, 9419 flow [2022-12-12 21:35:08,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 128 transitions, 2974 flow [2022-12-12 21:35:08,811 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 128 transitions, 2974 flow [2022-12-12 21:35:08,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:35:08,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:35:08,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:35:08,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:35:08,812 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:35:08,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:35:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1408793720, now seen corresponding path program 3 times [2022-12-12 21:35:08,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:35:08,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626460281] [2022-12-12 21:35:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:35:08,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:35:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:35:09,939 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:35:09,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:35:09,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626460281] [2022-12-12 21:35:09,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626460281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:35:09,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:35:09,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:35:09,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211169004] [2022-12-12 21:35:09,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:35:09,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:35:09,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:35:09,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:35:09,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:35:09,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 21:35:09,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 128 transitions, 2974 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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:35:09,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:35:09,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 21:35:09,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:35:10,371 INFO L130 PetriNetUnfolder]: 2009/3528 cut-off events. [2022-12-12 21:35:10,372 INFO L131 PetriNetUnfolder]: For 14575/14578 co-relation queries the response was YES. [2022-12-12 21:35:10,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41198 conditions, 3528 events. 2009/3528 cut-off events. For 14575/14578 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 22335 event pairs, 3 based on Foata normal form. 84/2718 useless extension candidates. Maximal degree in co-relation 41150. Up to 3454 conditions per place. [2022-12-12 21:35:10,390 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 80 selfloop transitions, 8 changer transitions 92/201 dead transitions. [2022-12-12 21:35:10,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 201 transitions, 5230 flow [2022-12-12 21:35:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:35:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:35:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2022-12-12 21:35:10,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.279296875 [2022-12-12 21:35:10,392 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 14 predicate places. [2022-12-12 21:35:10,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 201 transitions, 5230 flow [2022-12-12 21:35:10,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 109 transitions, 2680 flow [2022-12-12 21:35:10,404 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 109 transitions, 2680 flow [2022-12-12 21:35:10,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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:35:10,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:35:10,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:35:10,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:35:10,405 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:35:10,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:35:10,405 INFO L85 PathProgramCache]: Analyzing trace with hash 163575024, now seen corresponding path program 4 times [2022-12-12 21:35:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:35:10,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997105919] [2022-12-12 21:35:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:35:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:35:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:35:10,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:35:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:35:10,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:35:10,502 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:35:10,503 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 21:35:10,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 21:35:10,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 21:35:10,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 21:35:10,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 21:35:10,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 21:35:10,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 21:35:10,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 21:35:10,505 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:35:10,510 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:35:10,510 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:35:10,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:35:10 BasicIcfg [2022-12-12 21:35:10,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:35:10,580 INFO L158 Benchmark]: Toolchain (without parser) took 47645.92ms. Allocated memory was 195.0MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 168.8MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-12 21:35:10,580 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 171.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:35:10,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.92ms. Allocated memory is still 195.0MB. Free memory was 168.8MB in the beginning and 140.5MB in the end (delta: 28.2MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-12 21:35:10,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.98ms. Allocated memory is still 195.0MB. Free memory was 140.5MB in the beginning and 137.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:35:10,581 INFO L158 Benchmark]: Boogie Preprocessor took 32.61ms. Allocated memory is still 195.0MB. Free memory was 137.4MB in the beginning and 135.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:35:10,581 INFO L158 Benchmark]: RCFGBuilder took 805.24ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 135.4MB in the beginning and 190.1MB in the end (delta: -54.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-12 21:35:10,582 INFO L158 Benchmark]: TraceAbstraction took 46153.80ms. Allocated memory was 234.9MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 188.5MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-12 21:35:10,583 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.13ms. Allocated memory is still 195.0MB. Free memory is still 171.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 589.92ms. Allocated memory is still 195.0MB. Free memory was 168.8MB in the beginning and 140.5MB in the end (delta: 28.2MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.98ms. Allocated memory is still 195.0MB. Free memory was 140.5MB in the beginning and 137.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.61ms. Allocated memory is still 195.0MB. Free memory was 137.4MB in the beginning and 135.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 805.24ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 135.4MB in the beginning and 190.1MB in the end (delta: -54.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 46153.80ms. Allocated memory was 234.9MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 188.5MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 135 PlacesBefore, 77 PlacesAfterwards, 124 TransitionsBefore, 64 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 4196, independent unconditional: 0, dependent: 211, dependent conditional: 211, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 0, independent unconditional: 4196, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 0, independent unconditional: 4196, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 0, independent unconditional: 4196, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2392, independent: 2330, independent conditional: 0, independent unconditional: 2330, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2392, independent: 2295, independent conditional: 0, independent unconditional: 2295, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 363, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4407, independent: 1866, independent conditional: 0, independent unconditional: 1866, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 2392, unknown conditional: 0, unknown unconditional: 2392] , Statistics on independence cache: Total cache size (in pairs): 4451, Positive cache size: 4389, Positive conditional cache size: 0, Positive unconditional cache size: 4389, Negative cache size: 62, Negative conditional cache size: 0, Negative unconditional cache size: 62, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t525; [L865] FCALL, FORK 0 pthread_create(&t525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t525, ((void *)0), P0, ((void *)0))=-4, t525={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t526; [L867] FCALL, FORK 0 pthread_create(&t526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t526, ((void *)0), P1, ((void *)0))=-3, t525={5:0}, t526={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t527; [L869] FCALL, FORK 0 pthread_create(&t527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t527, ((void *)0), P2, ((void *)0))=-2, t525={5:0}, t526={6:0}, t527={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t528; [L871] FCALL, FORK 0 pthread_create(&t528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t528, ((void *)0), P3, ((void *)0))=-1, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: 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: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 162 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 1.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 46.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 34.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 566 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1599 IncrementalHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 24 mSDtfsCounter, 1599 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12273occurred in iteration=9, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 25935 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 1493 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:35:10,602 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...