/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 21:04:22,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 21:04:22,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 21:04:22,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 21:04:22,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 21:04:22,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 21:04:22,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 21:04:22,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 21:04:22,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 21:04:22,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 21:04:22,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 21:04:22,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 21:04:22,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 21:04:22,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 21:04:22,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 21:04:22,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 21:04:22,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 21:04:22,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 21:04:22,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 21:04:22,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 21:04:22,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 21:04:22,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 21:04:22,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 21:04:22,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 21:04:22,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 21:04:22,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 21:04:22,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 21:04:22,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 21:04:22,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 21:04:22,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 21:04:22,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 21:04:22,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 21:04:22,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 21:04:22,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 21:04:22,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 21:04:22,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 21:04:22,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 21:04:22,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 21:04:22,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 21:04:22,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 21:04:22,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 21:04:22,126 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-NoLbe.epf [2022-12-11 21:04:22,152 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 21:04:22,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 21:04:22,153 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 21:04:22,154 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 21:04:22,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 21:04:22,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 21:04:22,155 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 21:04:22,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 21:04:22,155 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 21:04:22,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 21:04:22,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 21:04:22,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 21:04:22,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 21:04:22,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 21:04:22,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 21:04:22,156 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 21:04:22,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 21:04:22,157 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 21:04:22,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 21:04:22,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 21:04:22,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 21:04:22,157 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 21:04:22,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 21:04:22,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:04:22,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 21:04:22,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 21:04:22,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 21:04:22,158 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 21:04:22,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 21:04:22,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 21:04:22,158 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 21:04:22,158 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 [2022-12-11 21:04:22,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 21:04:22,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 21:04:22,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 21:04:22,457 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 21:04:22,457 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 21:04:22,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 21:04:23,415 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 21:04:23,652 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 21:04:23,653 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 21:04:23,678 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb9670fb/bb64bb5304c94b479b6fdcf94a93ab79/FLAG4663057f8 [2022-12-11 21:04:23,691 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb9670fb/bb64bb5304c94b479b6fdcf94a93ab79 [2022-12-11 21:04:23,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 21:04:23,694 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 21:04:23,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 21:04:23,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 21:04:23,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 21:04:23,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:04:23" (1/1) ... [2022-12-11 21:04:23,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be01e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:23, skipping insertion in model container [2022-12-11 21:04:23,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:04:23" (1/1) ... [2022-12-11 21:04:23,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 21:04:23,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 21:04:23,903 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-11 21:04:24,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:04:24,102 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 21:04:24,113 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-11 21:04:24,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:24,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:24,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:04:24,198 INFO L208 MainTranslator]: Completed translation [2022-12-11 21:04:24,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24 WrapperNode [2022-12-11 21:04:24,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 21:04:24,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 21:04:24,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 21:04:24,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 21:04:24,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (1/1) ... [2022-12-11 21:04:24,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (1/1) ... [2022-12-11 21:04:24,257 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-11 21:04:24,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 21:04:24,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 21:04:24,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 21:04:24,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 21:04:24,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (1/1) ... [2022-12-11 21:04:24,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (1/1) ... [2022-12-11 21:04:24,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (1/1) ... [2022-12-11 21:04:24,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (1/1) ... [2022-12-11 21:04:24,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (1/1) ... [2022-12-11 21:04:24,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (1/1) ... [2022-12-11 21:04:24,290 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (1/1) ... [2022-12-11 21:04:24,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (1/1) ... [2022-12-11 21:04:24,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 21:04:24,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 21:04:24,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 21:04:24,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 21:04:24,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (1/1) ... [2022-12-11 21:04:24,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:04:24,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:04:24,333 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-11 21:04:24,373 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-11 21:04:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 21:04:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 21:04:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 21:04:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 21:04:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 21:04:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 21:04:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 21:04:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 21:04:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 21:04:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 21:04:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 21:04:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 21:04:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 21:04:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 21:04:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 21:04:24,392 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 21:04:24,530 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 21:04:24,532 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 21:04:24,782 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 21:04:24,913 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 21:04:24,914 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 21:04:24,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:04:24 BoogieIcfgContainer [2022-12-11 21:04:24,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 21:04:24,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 21:04:24,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 21:04:24,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 21:04:24,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 09:04:23" (1/3) ... [2022-12-11 21:04:24,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df7c29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:04:24, skipping insertion in model container [2022-12-11 21:04:24,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:24" (2/3) ... [2022-12-11 21:04:24,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df7c29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:04:24, skipping insertion in model container [2022-12-11 21:04:24,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:04:24" (3/3) ... [2022-12-11 21:04:24,934 INFO L112 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 21:04:24,947 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 21:04:24,947 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 21:04:24,947 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 21:04:25,025 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 21:04:25,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-11 21:04:25,120 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-11 21:04:25,120 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:04:25,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-11 21:04:25,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-11 21:04:25,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-11 21:04:25,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 21:04:25,155 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;@20748879, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 21:04:25,156 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 21:04:25,164 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-11 21:04:25,164 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:04:25,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:25,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:25,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:25,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -819204958, now seen corresponding path program 1 times [2022-12-11 21:04:25,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:25,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072309569] [2022-12-11 21:04:25,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:25,603 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-11 21:04:25,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:25,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072309569] [2022-12-11 21:04:25,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072309569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:25,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:25,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 21:04:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286958877] [2022-12-11 21:04:25,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:25,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 21:04:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:25,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 21:04:25,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 21:04:25,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2022-12-11 21:04:25,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-11 21:04:25,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:25,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2022-12-11 21:04:25,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:25,749 INFO L130 PetriNetUnfolder]: 58/306 cut-off events. [2022-12-11 21:04:25,749 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-11 21:04:25,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 306 events. 58/306 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1296 event pairs, 44 based on Foata normal form. 13/293 useless extension candidates. Maximal degree in co-relation 387. Up to 79 conditions per place. [2022-12-11 21:04:25,753 INFO L137 encePairwiseOnDemand]: 101/106 looper letters, 14 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2022-12-11 21:04:25,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 257 flow [2022-12-11 21:04:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 21:04:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 21:04:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-12-11 21:04:25,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9339622641509434 [2022-12-11 21:04:25,765 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-12-11 21:04:25,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 105 transitions, 257 flow [2022-12-11 21:04:25,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 105 transitions, 257 flow [2022-12-11 21:04:25,768 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 105 transitions, 257 flow [2022-12-11 21:04:25,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-11 21:04:25,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:25,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:25,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 21:04:25,769 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:25,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:25,769 INFO L85 PathProgramCache]: Analyzing trace with hash -257755097, now seen corresponding path program 1 times [2022-12-11 21:04:25,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:25,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469532999] [2022-12-11 21:04:25,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:26,135 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-11 21:04:26,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:26,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469532999] [2022-12-11 21:04:26,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469532999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:26,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:26,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235586451] [2022-12-11 21:04:26,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:26,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:26,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:26,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-11 21:04:26,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 257 flow. Second operand has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 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-11 21:04:26,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:26,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-11 21:04:26,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:26,873 INFO L130 PetriNetUnfolder]: 1508/3719 cut-off events. [2022-12-11 21:04:26,874 INFO L131 PetriNetUnfolder]: For 939/1637 co-relation queries the response was YES. [2022-12-11 21:04:26,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7292 conditions, 3719 events. 1508/3719 cut-off events. For 939/1637 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 29776 event pairs, 193 based on Foata normal form. 0/3592 useless extension candidates. Maximal degree in co-relation 7238. Up to 1077 conditions per place. [2022-12-11 21:04:26,895 INFO L137 encePairwiseOnDemand]: 97/106 looper letters, 40 selfloop transitions, 5 changer transitions 91/204 dead transitions. [2022-12-11 21:04:26,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 204 transitions, 827 flow [2022-12-11 21:04:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1150 transitions. [2022-12-11 21:04:26,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8345428156748912 [2022-12-11 21:04:26,901 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 12 predicate places. [2022-12-11 21:04:26,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 204 transitions, 827 flow [2022-12-11 21:04:26,912 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 113 transitions, 385 flow [2022-12-11 21:04:26,912 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 113 transitions, 385 flow [2022-12-11 21:04:26,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 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-11 21:04:26,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:26,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:26,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 21:04:26,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:26,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1591146214, now seen corresponding path program 1 times [2022-12-11 21:04:26,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:26,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638270263] [2022-12-11 21:04:26,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:27,135 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-11 21:04:27,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:27,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638270263] [2022-12-11 21:04:27,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638270263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:27,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:27,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100000111] [2022-12-11 21:04:27,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:27,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:27,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:27,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:27,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-11 21:04:27,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 113 transitions, 385 flow. Second operand has 7 states, 7 states have (on average 82.0) internal successors, (574), 7 states have internal predecessors, (574), 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-11 21:04:27,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:27,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-11 21:04:27,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:27,642 INFO L130 PetriNetUnfolder]: 994/2196 cut-off events. [2022-12-11 21:04:27,642 INFO L131 PetriNetUnfolder]: For 796/5899 co-relation queries the response was YES. [2022-12-11 21:04:27,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6342 conditions, 2196 events. 994/2196 cut-off events. For 796/5899 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14976 event pairs, 102 based on Foata normal form. 61/2201 useless extension candidates. Maximal degree in co-relation 6282. Up to 1060 conditions per place. [2022-12-11 21:04:27,652 INFO L137 encePairwiseOnDemand]: 95/106 looper letters, 55 selfloop transitions, 13 changer transitions 76/212 dead transitions. [2022-12-11 21:04:27,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 212 transitions, 1217 flow [2022-12-11 21:04:27,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1146 transitions. [2022-12-11 21:04:27,654 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8316400580551524 [2022-12-11 21:04:27,655 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places. [2022-12-11 21:04:27,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 212 transitions, 1217 flow [2022-12-11 21:04:27,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 136 transitions, 659 flow [2022-12-11 21:04:27,665 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 136 transitions, 659 flow [2022-12-11 21:04:27,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.0) internal successors, (574), 7 states have internal predecessors, (574), 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-11 21:04:27,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:27,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:27,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 21:04:27,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:27,667 INFO L85 PathProgramCache]: Analyzing trace with hash 303872745, now seen corresponding path program 1 times [2022-12-11 21:04:27,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:27,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404998664] [2022-12-11 21:04:27,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:27,835 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-11 21:04:27,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:27,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404998664] [2022-12-11 21:04:27,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404998664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:27,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:27,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:04:27,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009799295] [2022-12-11 21:04:27,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:27,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:04:27,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:27,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:04:27,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:04:27,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-11 21:04:27,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 136 transitions, 659 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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-11 21:04:27,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:27,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-11 21:04:27,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:28,509 INFO L130 PetriNetUnfolder]: 2958/5490 cut-off events. [2022-12-11 21:04:28,510 INFO L131 PetriNetUnfolder]: For 10584/12124 co-relation queries the response was YES. [2022-12-11 21:04:28,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17287 conditions, 5490 events. 2958/5490 cut-off events. For 10584/12124 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 39535 event pairs, 87 based on Foata normal form. 132/5496 useless extension candidates. Maximal degree in co-relation 17223. Up to 2037 conditions per place. [2022-12-11 21:04:28,532 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 117 selfloop transitions, 13 changer transitions 94/306 dead transitions. [2022-12-11 21:04:28,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 306 transitions, 2299 flow [2022-12-11 21:04:28,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:04:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:04:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 909 transitions. [2022-12-11 21:04:28,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8575471698113207 [2022-12-11 21:04:28,535 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places. [2022-12-11 21:04:28,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 306 transitions, 2299 flow [2022-12-11 21:04:28,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 212 transitions, 1419 flow [2022-12-11 21:04:28,550 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 212 transitions, 1419 flow [2022-12-11 21:04:28,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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-11 21:04:28,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:28,550 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:28,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 21:04:28,550 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:28,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:28,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1464593482, now seen corresponding path program 1 times [2022-12-11 21:04:28,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:28,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066188275] [2022-12-11 21:04:28,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:28,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:28,691 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-11 21:04:28,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:28,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066188275] [2022-12-11 21:04:28,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066188275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:28,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:28,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:28,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895452261] [2022-12-11 21:04:28,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:28,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:28,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:28,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:28,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:28,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-11 21:04:28,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 212 transitions, 1419 flow. Second operand has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 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-11 21:04:28,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:28,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-11 21:04:28,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:29,233 INFO L130 PetriNetUnfolder]: 1322/3408 cut-off events. [2022-12-11 21:04:29,233 INFO L131 PetriNetUnfolder]: For 5495/7224 co-relation queries the response was YES. [2022-12-11 21:04:29,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11959 conditions, 3408 events. 1322/3408 cut-off events. For 5495/7224 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 29300 event pairs, 43 based on Foata normal form. 233/3568 useless extension candidates. Maximal degree in co-relation 11891. Up to 1058 conditions per place. [2022-12-11 21:04:29,245 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 143 selfloop transitions, 32 changer transitions 87/344 dead transitions. [2022-12-11 21:04:29,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 344 transitions, 3029 flow [2022-12-11 21:04:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1173 transitions. [2022-12-11 21:04:29,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.851233671988389 [2022-12-11 21:04:29,249 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 17 predicate places. [2022-12-11 21:04:29,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 344 transitions, 3029 flow [2022-12-11 21:04:29,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 257 transitions, 2099 flow [2022-12-11 21:04:29,257 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 257 transitions, 2099 flow [2022-12-11 21:04:29,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 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-11 21:04:29,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:29,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:29,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 21:04:29,258 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:29,259 INFO L85 PathProgramCache]: Analyzing trace with hash 931511738, now seen corresponding path program 1 times [2022-12-11 21:04:29,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:29,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906875592] [2022-12-11 21:04:29,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:29,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:29,496 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-11 21:04:29,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:29,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906875592] [2022-12-11 21:04:29,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906875592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:29,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:29,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 21:04:29,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765589637] [2022-12-11 21:04:29,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:29,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 21:04:29,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:29,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 21:04:29,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 21:04:29,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-11 21:04:29,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 257 transitions, 2099 flow. Second operand has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 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-11 21:04:29,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:29,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-11 21:04:29,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:30,016 INFO L130 PetriNetUnfolder]: 1007/2816 cut-off events. [2022-12-11 21:04:30,016 INFO L131 PetriNetUnfolder]: For 4712/6521 co-relation queries the response was YES. [2022-12-11 21:04:30,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11642 conditions, 2816 events. 1007/2816 cut-off events. For 4712/6521 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 25069 event pairs, 42 based on Foata normal form. 200/2972 useless extension candidates. Maximal degree in co-relation 11570. Up to 745 conditions per place. [2022-12-11 21:04:30,027 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 121 selfloop transitions, 36 changer transitions 44/279 dead transitions. [2022-12-11 21:04:30,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 279 transitions, 2699 flow [2022-12-11 21:04:30,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 21:04:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 21:04:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1410 transitions. [2022-12-11 21:04:30,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8313679245283019 [2022-12-11 21:04:30,031 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 32 predicate places. [2022-12-11 21:04:30,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 279 transitions, 2699 flow [2022-12-11 21:04:30,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 235 transitions, 2167 flow [2022-12-11 21:04:30,037 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 235 transitions, 2167 flow [2022-12-11 21:04:30,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 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-11 21:04:30,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:30,038 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:04:30,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 21:04:30,038 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:30,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1158725287, now seen corresponding path program 1 times [2022-12-11 21:04:30,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:30,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574450457] [2022-12-11 21:04:30,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:30,698 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-11 21:04:30,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:30,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574450457] [2022-12-11 21:04:30,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574450457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:30,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:30,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 21:04:30,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269091692] [2022-12-11 21:04:30,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:30,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 21:04:30,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:30,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 21:04:30,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-11 21:04:30,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 106 [2022-12-11 21:04:30,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 235 transitions, 2167 flow. Second operand has 11 states, 11 states have (on average 79.18181818181819) internal successors, (871), 11 states have internal predecessors, (871), 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-11 21:04:30,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:30,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 106 [2022-12-11 21:04:30,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:31,183 INFO L130 PetriNetUnfolder]: 1117/3283 cut-off events. [2022-12-11 21:04:31,183 INFO L131 PetriNetUnfolder]: For 8355/10157 co-relation queries the response was YES. [2022-12-11 21:04:31,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13994 conditions, 3283 events. 1117/3283 cut-off events. For 8355/10157 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 31103 event pairs, 50 based on Foata normal form. 58/3308 useless extension candidates. Maximal degree in co-relation 13910. Up to 876 conditions per place. [2022-12-11 21:04:31,194 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 59 selfloop transitions, 33 changer transitions 87/285 dead transitions. [2022-12-11 21:04:31,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 285 transitions, 3188 flow [2022-12-11 21:04:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 21:04:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 21:04:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 889 transitions. [2022-12-11 21:04:31,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7624356775300172 [2022-12-11 21:04:31,197 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 39 predicate places. [2022-12-11 21:04:31,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 285 transitions, 3188 flow [2022-12-11 21:04:31,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 198 transitions, 1884 flow [2022-12-11 21:04:31,204 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 198 transitions, 1884 flow [2022-12-11 21:04:31,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.18181818181819) internal successors, (871), 11 states have internal predecessors, (871), 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-11 21:04:31,204 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:31,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:04:31,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 21:04:31,205 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:31,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1888523627, now seen corresponding path program 2 times [2022-12-11 21:04:31,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:31,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549886287] [2022-12-11 21:04:31,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:31,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:04:31,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 21:04:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:04:31,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 21:04:31,327 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 21:04:31,328 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 21:04:31,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 21:04:31,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 21:04:31,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 21:04:31,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 21:04:31,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 21:04:31,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 21:04:31,331 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:31,335 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 21:04:31,336 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 21:04:31,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 09:04:31 BasicIcfg [2022-12-11 21:04:31,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 21:04:31,429 INFO L158 Benchmark]: Toolchain (without parser) took 7730.84ms. Allocated memory was 187.7MB in the beginning and 420.5MB in the end (delta: 232.8MB). Free memory was 162.3MB in the beginning and 214.9MB in the end (delta: -52.6MB). Peak memory consumption was 181.1MB. Max. memory is 8.0GB. [2022-12-11 21:04:31,429 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory was 164.0MB in the beginning and 163.9MB in the end (delta: 87.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 21:04:31,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.79ms. Allocated memory is still 187.7MB. Free memory was 161.7MB in the beginning and 136.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-11 21:04:31,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.36ms. Allocated memory is still 187.7MB. Free memory was 136.0MB in the beginning and 133.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 21:04:31,429 INFO L158 Benchmark]: Boogie Preprocessor took 35.50ms. Allocated memory is still 187.7MB. Free memory was 133.4MB in the beginning and 131.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 21:04:31,429 INFO L158 Benchmark]: RCFGBuilder took 621.89ms. Allocated memory is still 187.7MB. Free memory was 131.8MB in the beginning and 96.2MB in the end (delta: 35.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-11 21:04:31,430 INFO L158 Benchmark]: TraceAbstraction took 6507.74ms. Allocated memory was 187.7MB in the beginning and 420.5MB in the end (delta: 232.8MB). Free memory was 95.1MB in the beginning and 214.9MB in the end (delta: -119.8MB). Peak memory consumption was 114.0MB. Max. memory is 8.0GB. [2022-12-11 21:04:31,432 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory was 164.0MB in the beginning and 163.9MB in the end (delta: 87.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 503.79ms. Allocated memory is still 187.7MB. Free memory was 161.7MB in the beginning and 136.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.36ms. Allocated memory is still 187.7MB. Free memory was 136.0MB in the beginning and 133.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.50ms. Allocated memory is still 187.7MB. Free memory was 133.4MB in the beginning and 131.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 621.89ms. Allocated memory is still 187.7MB. Free memory was 131.8MB in the beginning and 96.2MB in the end (delta: 35.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6507.74ms. Allocated memory was 187.7MB in the beginning and 420.5MB in the end (delta: 232.8MB). Free memory was 95.1MB in the beginning and 214.9MB in the end (delta: -119.8MB). Peak memory consumption was 114.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t2393; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2393, ((void *)0), P0, ((void *)0))=-2, t2393={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] 0 pthread_t t2394; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2394, ((void *)0), P1, ((void *)0))=-1, t2393={5:0}, t2394={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 1 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 pthread_t t2395; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2395, ((void *)0), P2, ((void *)0))=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L807] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L808] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L809] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] RET 0 assume_abort_if_not(main$tmp_guard0) [L839] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L840] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L842] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$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: 833]: 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: 831]: 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: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 550 mSDsluCounter, 311 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 252 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 963 IncrementalHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 59 mSDtfsCounter, 963 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2167occurred in iteration=6, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4646 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 2240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-11 21:04:31,448 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...