/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:29:33,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:29:33,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:29:33,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:29:33,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:29:33,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:29:33,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:29:33,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:29:33,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:29:33,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:29:33,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:29:33,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:29:33,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:29:33,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:29:33,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:29:33,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:29:33,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:29:33,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:29:33,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:29:33,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:29:33,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:29:33,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:29:33,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:29:33,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:29:33,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:29:33,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:29:33,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:29:33,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:29:33,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:29:33,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:29:33,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:29:33,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:29:33,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:29:33,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:29:33,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:29:33,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:29:33,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:29:33,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:29:33,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:29:33,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:29:33,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:29:33,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:29:33,297 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:29:33,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:29:33,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:29:33,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:29:33,303 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:29:33,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:29:33,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:29:33,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:29:33,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:29:33,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:29:33,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:29:33,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:29:33,305 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:29:33,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:29:33,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:29:33,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:29:33,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:29:33,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:29:33,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:29:33,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:29:33,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:29:33,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:29:33,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:29:33,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:29:33,309 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:29:33,309 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-bitabs/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 [2020-12-23 09:29:33,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:29:33,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:29:33,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:29:33,767 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:29:33,768 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:29:33,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2020-12-23 09:29:33,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f2c3ce7ea/0f38b4cd0fb04010a2b03fcc344d0460/FLAG74cfa9b55 [2020-12-23 09:29:34,472 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:29:34,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2020-12-23 09:29:34,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f2c3ce7ea/0f38b4cd0fb04010a2b03fcc344d0460/FLAG74cfa9b55 [2020-12-23 09:29:34,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f2c3ce7ea/0f38b4cd0fb04010a2b03fcc344d0460 [2020-12-23 09:29:34,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:29:34,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:29:34,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:29:34,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:29:34,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:29:34,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:29:34" (1/1) ... [2020-12-23 09:29:34,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d88075d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:34, skipping insertion in model container [2020-12-23 09:29:34,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:29:34" (1/1) ... [2020-12-23 09:29:34,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:29:34,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:29:35,057 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_buf_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_last_write~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_last_read~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_num_write~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_num_read~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] [2020-12-23 09:29:35,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:29:35,125 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:29:35,150 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_buf_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_last_write~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_last_read~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_num_write~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_num_read~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] [2020-12-23 09:29:35,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:29:35,253 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:29:35,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35 WrapperNode [2020-12-23 09:29:35,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:29:35,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:29:35,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:29:35,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:29:35,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35" (1/1) ... [2020-12-23 09:29:35,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35" (1/1) ... [2020-12-23 09:29:35,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:29:35,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:29:35,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:29:35,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:29:35,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35" (1/1) ... [2020-12-23 09:29:35,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35" (1/1) ... [2020-12-23 09:29:35,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35" (1/1) ... [2020-12-23 09:29:35,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35" (1/1) ... [2020-12-23 09:29:35,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35" (1/1) ... [2020-12-23 09:29:35,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35" (1/1) ... [2020-12-23 09:29:35,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35" (1/1) ... [2020-12-23 09:29:35,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:29:35,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:29:35,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:29:35,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:29:35,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:29:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:29:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:29:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:29:35,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:29:35,953 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:29:35,953 INFO L299 CfgBuilder]: Removed 42 assume(true) statements. [2020-12-23 09:29:35,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:29:35 BoogieIcfgContainer [2020-12-23 09:29:35,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:29:35,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:29:35,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:29:35,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:29:35,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:29:34" (1/3) ... [2020-12-23 09:29:35,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d41dd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:29:35, skipping insertion in model container [2020-12-23 09:29:35,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:35" (2/3) ... [2020-12-23 09:29:35,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d41dd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:29:35, skipping insertion in model container [2020-12-23 09:29:35,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:29:35" (3/3) ... [2020-12-23 09:29:35,968 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-12-23 09:29:35,979 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:29:35,986 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 09:29:36,018 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-23 09:29:36,076 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:29:36,079 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:29:36,079 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:29:36,079 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:29:36,080 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:29:36,080 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:29:36,080 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:29:36,080 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:29:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2020-12-23 09:29:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 09:29:36,139 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:36,140 INFO L422 BasicCegarLoop]: 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] [2020-12-23 09:29:36,141 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:36,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2020-12-23 09:29:36,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:36,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372231671] [2020-12-23 09:29:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:36,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372231671] [2020-12-23 09:29:36,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:36,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:36,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721255812] [2020-12-23 09:29:36,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:36,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:36,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:36,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:36,553 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2020-12-23 09:29:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:36,707 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2020-12-23 09:29:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:36,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-12-23 09:29:36,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:36,743 INFO L225 Difference]: With dead ends: 214 [2020-12-23 09:29:36,743 INFO L226 Difference]: Without dead ends: 135 [2020-12-23 09:29:36,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-12-23 09:29:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2020-12-23 09:29:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-23 09:29:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2020-12-23 09:29:36,807 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2020-12-23 09:29:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:36,808 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2020-12-23 09:29:36,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2020-12-23 09:29:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:29:36,811 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:36,811 INFO L422 BasicCegarLoop]: 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] [2020-12-23 09:29:36,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:29:36,812 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:36,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2020-12-23 09:29:36,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:36,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855926864] [2020-12-23 09:29:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:36,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855926864] [2020-12-23 09:29:36,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:36,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:36,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282857988] [2020-12-23 09:29:36,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:36,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:36,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:36,889 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2020-12-23 09:29:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:36,979 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2020-12-23 09:29:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:36,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-23 09:29:36,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:36,983 INFO L225 Difference]: With dead ends: 323 [2020-12-23 09:29:36,983 INFO L226 Difference]: Without dead ends: 215 [2020-12-23 09:29:36,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-12-23 09:29:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2020-12-23 09:29:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-12-23 09:29:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2020-12-23 09:29:37,014 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2020-12-23 09:29:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:37,015 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2020-12-23 09:29:37,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2020-12-23 09:29:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 09:29:37,018 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:37,018 INFO L422 BasicCegarLoop]: 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] [2020-12-23 09:29:37,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:29:37,019 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:37,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2020-12-23 09:29:37,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:37,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88313549] [2020-12-23 09:29:37,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:37,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88313549] [2020-12-23 09:29:37,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:37,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:37,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716511286] [2020-12-23 09:29:37,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:37,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:37,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:37,117 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2020-12-23 09:29:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:37,189 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2020-12-23 09:29:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:37,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-23 09:29:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:37,192 INFO L225 Difference]: With dead ends: 526 [2020-12-23 09:29:37,193 INFO L226 Difference]: Without dead ends: 321 [2020-12-23 09:29:37,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-12-23 09:29:37,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2020-12-23 09:29:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-12-23 09:29:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2020-12-23 09:29:37,240 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2020-12-23 09:29:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:37,241 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2020-12-23 09:29:37,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2020-12-23 09:29:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 09:29:37,244 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:37,244 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:37,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:29:37,245 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2020-12-23 09:29:37,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:37,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336116640] [2020-12-23 09:29:37,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:37,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336116640] [2020-12-23 09:29:37,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:37,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:37,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514243968] [2020-12-23 09:29:37,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:37,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:37,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:37,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:37,312 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2020-12-23 09:29:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:37,362 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2020-12-23 09:29:37,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:37,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-23 09:29:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:37,365 INFO L225 Difference]: With dead ends: 740 [2020-12-23 09:29:37,365 INFO L226 Difference]: Without dead ends: 449 [2020-12-23 09:29:37,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2020-12-23 09:29:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2020-12-23 09:29:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-12-23 09:29:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2020-12-23 09:29:37,404 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2020-12-23 09:29:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:37,405 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2020-12-23 09:29:37,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2020-12-23 09:29:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 09:29:37,409 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:37,409 INFO L422 BasicCegarLoop]: 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] [2020-12-23 09:29:37,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:29:37,409 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:37,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2020-12-23 09:29:37,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:37,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188276081] [2020-12-23 09:29:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:37,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188276081] [2020-12-23 09:29:37,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:37,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:37,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15140974] [2020-12-23 09:29:37,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:37,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:37,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:37,464 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2020-12-23 09:29:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:37,506 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2020-12-23 09:29:37,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:37,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-12-23 09:29:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:37,510 INFO L225 Difference]: With dead ends: 914 [2020-12-23 09:29:37,510 INFO L226 Difference]: Without dead ends: 555 [2020-12-23 09:29:37,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-12-23 09:29:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2020-12-23 09:29:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-12-23 09:29:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2020-12-23 09:29:37,536 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2020-12-23 09:29:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:37,536 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2020-12-23 09:29:37,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2020-12-23 09:29:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 09:29:37,538 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:37,539 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:37,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:29:37,539 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:37,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:37,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2020-12-23 09:29:37,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:37,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551774847] [2020-12-23 09:29:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:37,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551774847] [2020-12-23 09:29:37,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:37,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:29:37,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756377589] [2020-12-23 09:29:37,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:29:37,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:37,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:29:37,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:29:37,601 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 5 states. [2020-12-23 09:29:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:37,702 INFO L93 Difference]: Finished difference Result 1620 states and 2104 transitions. [2020-12-23 09:29:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:29:37,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-12-23 09:29:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:37,708 INFO L225 Difference]: With dead ends: 1620 [2020-12-23 09:29:37,709 INFO L226 Difference]: Without dead ends: 1203 [2020-12-23 09:29:37,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:29:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-12-23 09:29:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 579. [2020-12-23 09:29:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2020-12-23 09:29:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 738 transitions. [2020-12-23 09:29:37,775 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 738 transitions. Word has length 53 [2020-12-23 09:29:37,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:37,776 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 738 transitions. [2020-12-23 09:29:37,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:29:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 738 transitions. [2020-12-23 09:29:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 09:29:37,778 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:37,779 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:37,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:29:37,779 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:37,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1443121595, now seen corresponding path program 1 times [2020-12-23 09:29:37,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:37,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342086877] [2020-12-23 09:29:37,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:37,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342086877] [2020-12-23 09:29:37,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:37,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:29:37,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529663671] [2020-12-23 09:29:37,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:29:37,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:37,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:29:37,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:29:37,847 INFO L87 Difference]: Start difference. First operand 579 states and 738 transitions. Second operand 5 states. [2020-12-23 09:29:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:37,981 INFO L93 Difference]: Finished difference Result 1356 states and 1736 transitions. [2020-12-23 09:29:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:29:37,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-12-23 09:29:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:37,987 INFO L225 Difference]: With dead ends: 1356 [2020-12-23 09:29:37,987 INFO L226 Difference]: Without dead ends: 866 [2020-12-23 09:29:37,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:29:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2020-12-23 09:29:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 480. [2020-12-23 09:29:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2020-12-23 09:29:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 610 transitions. [2020-12-23 09:29:38,029 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 610 transitions. Word has length 53 [2020-12-23 09:29:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:38,029 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 610 transitions. [2020-12-23 09:29:38,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:29:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 610 transitions. [2020-12-23 09:29:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 09:29:38,031 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:38,031 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:38,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:29:38,031 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:38,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:38,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1577075519, now seen corresponding path program 1 times [2020-12-23 09:29:38,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:38,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819671574] [2020-12-23 09:29:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:29:38,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819671574] [2020-12-23 09:29:38,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:38,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:38,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395028393] [2020-12-23 09:29:38,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:38,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:38,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:38,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:38,077 INFO L87 Difference]: Start difference. First operand 480 states and 610 transitions. Second operand 3 states. [2020-12-23 09:29:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:38,126 INFO L93 Difference]: Finished difference Result 862 states and 1099 transitions. [2020-12-23 09:29:38,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:38,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-12-23 09:29:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:38,129 INFO L225 Difference]: With dead ends: 862 [2020-12-23 09:29:38,129 INFO L226 Difference]: Without dead ends: 478 [2020-12-23 09:29:38,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:38,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-12-23 09:29:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 437. [2020-12-23 09:29:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-12-23 09:29:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 544 transitions. [2020-12-23 09:29:38,162 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 544 transitions. Word has length 53 [2020-12-23 09:29:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:38,163 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 544 transitions. [2020-12-23 09:29:38,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 544 transitions. [2020-12-23 09:29:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 09:29:38,164 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:38,164 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:38,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:29:38,165 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:38,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:38,165 INFO L82 PathProgramCache]: Analyzing trace with hash -179687388, now seen corresponding path program 1 times [2020-12-23 09:29:38,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:38,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030420899] [2020-12-23 09:29:38,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:38,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030420899] [2020-12-23 09:29:38,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:38,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:29:38,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103041114] [2020-12-23 09:29:38,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:29:38,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:38,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:29:38,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:38,235 INFO L87 Difference]: Start difference. First operand 437 states and 544 transitions. Second operand 4 states. [2020-12-23 09:29:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:38,299 INFO L93 Difference]: Finished difference Result 481 states and 596 transitions. [2020-12-23 09:29:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:29:38,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-12-23 09:29:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:38,303 INFO L225 Difference]: With dead ends: 481 [2020-12-23 09:29:38,303 INFO L226 Difference]: Without dead ends: 479 [2020-12-23 09:29:38,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:29:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-12-23 09:29:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 435. [2020-12-23 09:29:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-12-23 09:29:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 541 transitions. [2020-12-23 09:29:38,346 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 541 transitions. Word has length 53 [2020-12-23 09:29:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:38,346 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 541 transitions. [2020-12-23 09:29:38,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:29:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 541 transitions. [2020-12-23 09:29:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 09:29:38,348 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:38,348 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:38,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:29:38,348 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:38,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:38,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1275353301, now seen corresponding path program 1 times [2020-12-23 09:29:38,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:38,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227764618] [2020-12-23 09:29:38,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:38,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227764618] [2020-12-23 09:29:38,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78190291] [2020-12-23 09:29:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:38,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 09:29:38,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:38,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:38,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-23 09:29:38,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287993515] [2020-12-23 09:29:38,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:29:38,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:38,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:29:38,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:38,777 INFO L87 Difference]: Start difference. First operand 435 states and 541 transitions. Second operand 6 states. [2020-12-23 09:29:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:38,876 INFO L93 Difference]: Finished difference Result 781 states and 968 transitions. [2020-12-23 09:29:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:29:38,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-12-23 09:29:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:38,881 INFO L225 Difference]: With dead ends: 781 [2020-12-23 09:29:38,882 INFO L226 Difference]: Without dead ends: 779 [2020-12-23 09:29:38,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-12-23 09:29:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 633. [2020-12-23 09:29:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-12-23 09:29:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 794 transitions. [2020-12-23 09:29:38,949 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 794 transitions. Word has length 54 [2020-12-23 09:29:38,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:38,949 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 794 transitions. [2020-12-23 09:29:38,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:29:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 794 transitions. [2020-12-23 09:29:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 09:29:38,951 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:38,952 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:39,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 09:29:39,168 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:39,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash 602571322, now seen corresponding path program 2 times [2020-12-23 09:29:39,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:39,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46791328] [2020-12-23 09:29:39,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:39,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46791328] [2020-12-23 09:29:39,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:39,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:39,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437696244] [2020-12-23 09:29:39,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:39,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:39,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:39,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:39,218 INFO L87 Difference]: Start difference. First operand 633 states and 794 transitions. Second operand 3 states. [2020-12-23 09:29:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:39,285 INFO L93 Difference]: Finished difference Result 966 states and 1210 transitions. [2020-12-23 09:29:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:39,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-12-23 09:29:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:39,290 INFO L225 Difference]: With dead ends: 966 [2020-12-23 09:29:39,290 INFO L226 Difference]: Without dead ends: 629 [2020-12-23 09:29:39,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-12-23 09:29:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 580. [2020-12-23 09:29:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-12-23 09:29:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 719 transitions. [2020-12-23 09:29:39,344 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 719 transitions. Word has length 69 [2020-12-23 09:29:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:39,345 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 719 transitions. [2020-12-23 09:29:39,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 719 transitions. [2020-12-23 09:29:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 09:29:39,346 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:39,347 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:39,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:29:39,347 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:39,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:39,348 INFO L82 PathProgramCache]: Analyzing trace with hash -630281229, now seen corresponding path program 1 times [2020-12-23 09:29:39,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:39,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561238436] [2020-12-23 09:29:39,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:29:39,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561238436] [2020-12-23 09:29:39,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:39,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:39,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679879335] [2020-12-23 09:29:39,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:39,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:39,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:39,391 INFO L87 Difference]: Start difference. First operand 580 states and 719 transitions. Second operand 3 states. [2020-12-23 09:29:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:39,465 INFO L93 Difference]: Finished difference Result 1172 states and 1450 transitions. [2020-12-23 09:29:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:39,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 09:29:39,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:39,469 INFO L225 Difference]: With dead ends: 1172 [2020-12-23 09:29:39,470 INFO L226 Difference]: Without dead ends: 598 [2020-12-23 09:29:39,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-12-23 09:29:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 580. [2020-12-23 09:29:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-12-23 09:29:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 699 transitions. [2020-12-23 09:29:39,524 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 699 transitions. Word has length 80 [2020-12-23 09:29:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:39,524 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 699 transitions. [2020-12-23 09:29:39,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 699 transitions. [2020-12-23 09:29:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 09:29:39,526 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:39,526 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:39,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:29:39,526 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:39,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1099928721, now seen corresponding path program 1 times [2020-12-23 09:29:39,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:39,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352507397] [2020-12-23 09:29:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:29:39,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352507397] [2020-12-23 09:29:39,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:39,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:39,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443302235] [2020-12-23 09:29:39,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:39,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:39,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:39,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:39,609 INFO L87 Difference]: Start difference. First operand 580 states and 699 transitions. Second operand 3 states. [2020-12-23 09:29:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:39,669 INFO L93 Difference]: Finished difference Result 911 states and 1095 transitions. [2020-12-23 09:29:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:39,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-12-23 09:29:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:39,671 INFO L225 Difference]: With dead ends: 911 [2020-12-23 09:29:39,672 INFO L226 Difference]: Without dead ends: 284 [2020-12-23 09:29:39,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-12-23 09:29:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2020-12-23 09:29:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 09:29:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 320 transitions. [2020-12-23 09:29:39,701 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 320 transitions. Word has length 81 [2020-12-23 09:29:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:39,702 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 320 transitions. [2020-12-23 09:29:39,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 320 transitions. [2020-12-23 09:29:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 09:29:39,703 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:39,703 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:39,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:29:39,704 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:39,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1534139577, now seen corresponding path program 1 times [2020-12-23 09:29:39,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:39,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534497880] [2020-12-23 09:29:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:29:39,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534497880] [2020-12-23 09:29:39,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:39,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:39,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235393704] [2020-12-23 09:29:39,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:39,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:39,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:39,780 INFO L87 Difference]: Start difference. First operand 282 states and 320 transitions. Second operand 3 states. [2020-12-23 09:29:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:39,818 INFO L93 Difference]: Finished difference Result 401 states and 458 transitions. [2020-12-23 09:29:39,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:39,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-23 09:29:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:39,820 INFO L225 Difference]: With dead ends: 401 [2020-12-23 09:29:39,820 INFO L226 Difference]: Without dead ends: 279 [2020-12-23 09:29:39,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-12-23 09:29:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2020-12-23 09:29:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2020-12-23 09:29:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 315 transitions. [2020-12-23 09:29:39,844 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 315 transitions. Word has length 101 [2020-12-23 09:29:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:39,845 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 315 transitions. [2020-12-23 09:29:39,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 315 transitions. [2020-12-23 09:29:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 09:29:39,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:39,846 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:39,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:29:39,847 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:39,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:39,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1342369766, now seen corresponding path program 1 times [2020-12-23 09:29:39,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:39,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006812517] [2020-12-23 09:29:39,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 09:29:39,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006812517] [2020-12-23 09:29:39,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:39,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:29:39,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46651681] [2020-12-23 09:29:39,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:29:39,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:39,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:29:39,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:39,922 INFO L87 Difference]: Start difference. First operand 279 states and 315 transitions. Second operand 4 states. [2020-12-23 09:29:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:39,968 INFO L93 Difference]: Finished difference Result 395 states and 447 transitions. [2020-12-23 09:29:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:29:39,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-23 09:29:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:39,970 INFO L225 Difference]: With dead ends: 395 [2020-12-23 09:29:39,970 INFO L226 Difference]: Without dead ends: 270 [2020-12-23 09:29:39,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:29:39,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-12-23 09:29:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2020-12-23 09:29:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-12-23 09:29:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 300 transitions. [2020-12-23 09:29:39,996 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 300 transitions. Word has length 102 [2020-12-23 09:29:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:39,997 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 300 transitions. [2020-12-23 09:29:39,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:29:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 300 transitions. [2020-12-23 09:29:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 09:29:40,002 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:40,002 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:40,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:29:40,002 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:40,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:40,003 INFO L82 PathProgramCache]: Analyzing trace with hash 759125341, now seen corresponding path program 1 times [2020-12-23 09:29:40,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:40,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110837389] [2020-12-23 09:29:40,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 09:29:40,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110837389] [2020-12-23 09:29:40,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:40,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:40,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881010904] [2020-12-23 09:29:40,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:40,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:40,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:40,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:40,077 INFO L87 Difference]: Start difference. First operand 270 states and 300 transitions. Second operand 3 states. [2020-12-23 09:29:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:40,119 INFO L93 Difference]: Finished difference Result 400 states and 443 transitions. [2020-12-23 09:29:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:40,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-12-23 09:29:40,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:40,122 INFO L225 Difference]: With dead ends: 400 [2020-12-23 09:29:40,122 INFO L226 Difference]: Without dead ends: 259 [2020-12-23 09:29:40,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-12-23 09:29:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2020-12-23 09:29:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 09:29:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2020-12-23 09:29:40,146 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 102 [2020-12-23 09:29:40,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:40,146 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2020-12-23 09:29:40,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2020-12-23 09:29:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 09:29:40,148 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:40,148 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:40,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:29:40,148 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:40,149 INFO L82 PathProgramCache]: Analyzing trace with hash 961855834, now seen corresponding path program 1 times [2020-12-23 09:29:40,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:40,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425569928] [2020-12-23 09:29:40,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:29:40,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425569928] [2020-12-23 09:29:40,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:40,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:29:40,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597518550] [2020-12-23 09:29:40,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:29:40,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:40,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:29:40,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:40,264 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand 4 states. [2020-12-23 09:29:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:40,301 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2020-12-23 09:29:40,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:29:40,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-12-23 09:29:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:40,302 INFO L225 Difference]: With dead ends: 250 [2020-12-23 09:29:40,302 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 09:29:40,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 09:29:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 09:29:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 09:29:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 09:29:40,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2020-12-23 09:29:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:40,307 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 09:29:40,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:29:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 09:29:40,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 09:29:40,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:29:40,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 09:29:40,828 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2020-12-23 09:29:40,991 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2020-12-23 09:29:41,095 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2020-12-23 09:29:41,206 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2020-12-23 09:29:41,321 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2020-12-23 09:29:42,039 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2020-12-23 09:29:42,236 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-12-23 09:29:42,473 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-12-23 09:29:42,674 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2020-12-23 09:29:42,932 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2020-12-23 09:29:43,157 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2020-12-23 09:29:43,497 WARN L197 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-12-23 09:29:43,640 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2020-12-23 09:29:44,225 WARN L197 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-23 09:29:44,445 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2020-12-23 09:29:45,153 WARN L197 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-23 09:29:45,797 WARN L197 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-23 09:29:46,506 WARN L197 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-23 09:29:47,225 WARN L197 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-23 09:29:47,469 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2020-12-23 09:29:47,776 WARN L197 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-23 09:29:48,003 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-12-23 09:29:48,660 WARN L197 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-23 09:29:49,359 WARN L197 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-23 09:29:49,620 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-12-23 09:29:50,321 WARN L197 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-23 09:29:51,027 WARN L197 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-23 09:29:51,734 WARN L197 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-23 09:29:51,738 INFO L189 CegarLoopUtils]: For program point L316(line 316) no Hoare annotation was computed. [2020-12-23 09:29:51,739 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2020-12-23 09:29:51,739 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 09:29:51,739 INFO L189 CegarLoopUtils]: For program point L53(lines 53 62) no Hoare annotation was computed. [2020-12-23 09:29:51,739 INFO L189 CegarLoopUtils]: For program point L53-2(lines 53 62) no Hoare annotation was computed. [2020-12-23 09:29:51,739 INFO L189 CegarLoopUtils]: For program point L53-3(lines 53 62) no Hoare annotation was computed. [2020-12-23 09:29:51,739 INFO L189 CegarLoopUtils]: For program point L53-5(lines 53 62) no Hoare annotation was computed. [2020-12-23 09:29:51,740 INFO L185 CegarLoopUtils]: At program point L301(lines 290 303) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-23 09:29:51,740 INFO L189 CegarLoopUtils]: For program point L268(lines 268 275) no Hoare annotation was computed. [2020-12-23 09:29:51,740 INFO L189 CegarLoopUtils]: For program point L153(lines 152 187) no Hoare annotation was computed. [2020-12-23 09:29:51,741 INFO L189 CegarLoopUtils]: For program point L54(lines 54 59) no Hoare annotation was computed. [2020-12-23 09:29:51,741 INFO L189 CegarLoopUtils]: For program point L54-1(lines 54 59) no Hoare annotation was computed. [2020-12-23 09:29:51,741 INFO L185 CegarLoopUtils]: At program point L302(lines 286 304) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-23 09:29:51,741 INFO L189 CegarLoopUtils]: For program point L253(lines 253 260) no Hoare annotation was computed. [2020-12-23 09:29:51,742 INFO L189 CegarLoopUtils]: For program point L220(lines 220 225) no Hoare annotation was computed. [2020-12-23 09:29:51,742 INFO L189 CegarLoopUtils]: For program point L220-1(lines 220 225) no Hoare annotation was computed. [2020-12-23 09:29:51,742 INFO L189 CegarLoopUtils]: For program point L154-1(lines 154 164) no Hoare annotation was computed. [2020-12-23 09:29:51,742 INFO L189 CegarLoopUtils]: For program point L322(lines 322 326) no Hoare annotation was computed. [2020-12-23 09:29:51,742 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 09:29:51,742 INFO L189 CegarLoopUtils]: For program point L240(line 240) no Hoare annotation was computed. [2020-12-23 09:29:51,742 INFO L189 CegarLoopUtils]: For program point L174(lines 174 186) no Hoare annotation was computed. [2020-12-23 09:29:51,742 INFO L189 CegarLoopUtils]: For program point L141(lines 141 149) no Hoare annotation was computed. [2020-12-23 09:29:51,742 INFO L189 CegarLoopUtils]: For program point L175(lines 175 181) no Hoare annotation was computed. [2020-12-23 09:29:51,742 INFO L189 CegarLoopUtils]: For program point L76(lines 76 80) no Hoare annotation was computed. [2020-12-23 09:29:51,743 INFO L185 CegarLoopUtils]: At program point L109-1(lines 97 134) the Hoare annotation is: (let ((.cse21 (+ ~c_num_read~0 1))) (let ((.cse8 (<= .cse21 ~p_num_write~0)) (.cse9 (<= ~p_num_write~0 .cse21)) (.cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse7 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse5 (= ~q_free~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse11 (<= ~p_num_write~0 1)) (.cse12 (<= 1 ~p_num_write~0)) (.cse6 (= ~p_dw_pc~0 0)) (.cse0 (= ~q_read_ev~0 2)) (.cse20 (= ~c_dr_st~0 2)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse18 (= ~q_free~0 1)) (.cse13 (not (= ~q_write_ev~0 1))) (.cse19 (= ~c_num_read~0 0)) (.cse15 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse5 .cse8 .cse0 .cse9 .cse10 .cse14 .cse1 .cse13 .cse15) (and .cse6 .cse0 .cse10 .cse1 .cse16 .cse17 .cse4 .cse18 .cse13 .cse19) (and .cse7 .cse20 .cse2 .cse3 .cse4) (and .cse6 .cse20 .cse4 .cse18) (and .cse5 .cse7 .cse20 .cse10 .cse14) (and .cse5 .cse6 .cse7 .cse20 .cse10) (and .cse5 .cse6 .cse0 .cse10 .cse1 .cse11 .cse12 .cse13 .cse19 .cse15) (and .cse6 .cse0 .cse20 .cse10 .cse16 .cse17 .cse18 .cse13 .cse19 .cse15)))) [2020-12-23 09:29:51,743 INFO L189 CegarLoopUtils]: For program point L76-2(lines 76 80) no Hoare annotation was computed. [2020-12-23 09:29:51,743 INFO L189 CegarLoopUtils]: For program point L76-3(lines 76 80) no Hoare annotation was computed. [2020-12-23 09:29:51,743 INFO L189 CegarLoopUtils]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2020-12-23 09:29:51,743 INFO L189 CegarLoopUtils]: For program point L110(lines 109 129) no Hoare annotation was computed. [2020-12-23 09:29:51,743 INFO L189 CegarLoopUtils]: For program point L11(line 11) no Hoare annotation was computed. [2020-12-23 09:29:51,743 INFO L189 CegarLoopUtils]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-12-23 09:29:51,744 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 09:29:51,744 INFO L189 CegarLoopUtils]: For program point L144(lines 144 148) no Hoare annotation was computed. [2020-12-23 09:29:51,744 INFO L185 CegarLoopUtils]: At program point L111(lines 97 134) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse7 (= ~c_num_read~0 0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse1 (= ~c_dr_st~0 2)) (.cse2 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 (= ~c_dr_st~0 0) .cse5 .cse2 .cse6 .cse7) (and .cse3 .cse1 (<= ~p_num_write~0 ~c_num_read~0) .cse4 (= ~p_dw_pc~0 1) .cse6 (<= ~c_num_read~0 ~p_num_write~0) .cse8) (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0) .cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse2))) [2020-12-23 09:29:51,744 INFO L185 CegarLoopUtils]: At program point L45(lines 33 47) the Hoare annotation is: (let ((.cse8 (= ~c_dr_pc~0 1)) (.cse1 (= ~c_dr_st~0 2)) (.cse4 (= ~q_free~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= ~p_num_write~0 1)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse10 (<= 1 ~p_num_write~0)) (.cse3 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_num_read~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ ~c_num_read~0 1))) (and .cse4 (<= .cse5 ~p_num_write~0) .cse6 .cse1 (<= ~p_num_write~0 .cse5) .cse7 (= ~p_dw_pc~0 1) .cse2 .cse8)) (and .cse4 .cse0 .cse1 .cse6 .cse7 .cse2 .cse9 .cse10 .cse11 .cse8) (and .cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse3) (and .cse4 .cse0 .cse6 .cse7 (= ~c_dr_st~0 0) .cse9 .cse2 .cse10 .cse3 .cse11))) [2020-12-23 09:29:51,744 INFO L185 CegarLoopUtils]: At program point L45-1(lines 33 47) the Hoare annotation is: (let ((.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= ~p_num_write~0 1)) (.cse5 (= ~q_free~0 1)) (.cse9 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 (= ~c_dr_pc~0 0) .cse5 .cse9 .cse6 .cse7) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse4 .cse8 .cse5 .cse9))) [2020-12-23 09:29:51,745 INFO L185 CegarLoopUtils]: At program point L12-1(lines 140 192) the Hoare annotation is: (let ((.cse0 (= 2 ~p_dw_st~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse6 (= ~p_dw_pc~0 0)) (.cse1 (= ~q_read_ev~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~q_free~0 1)) (.cse4 (not (= ~q_write_ev~0 1))) (.cse5 (= ~c_num_read~0 0))) (or (and (= ~q_free~0 0) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 1) (= ~c_dr_pc~0 0) (<= 1 ~p_num_write~0) .cse4 .cse5) (and .cse6 .cse0 .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse1 .cse10 .cse11 .cse2 .cse3 .cse7 .cse9 .cse4 (<= ~c_num_read~0 ~p_num_write~0)) (and .cse0 .cse10 .cse2 .cse3 .cse7 (< ~c_num_read~0 (+ ~p_num_write~0 1)) (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0) .cse9) (and .cse6 .cse1 .cse11 .cse2 .cse7 .cse8 .cse9 .cse4 .cse5))) [2020-12-23 09:29:51,745 INFO L189 CegarLoopUtils]: For program point L244(lines 244 248) no Hoare annotation was computed. [2020-12-23 09:29:51,745 INFO L189 CegarLoopUtils]: For program point L244-1(lines 239 279) no Hoare annotation was computed. [2020-12-23 09:29:51,745 INFO L185 CegarLoopUtils]: At program point L145(lines 140 192) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (= 2 ~p_dw_st~0) (<= .cse0 ~p_num_write~0) (= ~q_read_ev~0 2) (<= ~p_num_write~0 .cse0) (= ~p_last_write~0 ~q_buf_0~0) (= ~p_dw_pc~0 1) (not (= ~q_write_ev~0 1)) (= ~c_dr_pc~0 1))) [2020-12-23 09:29:51,745 INFO L185 CegarLoopUtils]: At program point L46(lines 30 48) the Hoare annotation is: (let ((.cse13 (+ ~c_num_read~0 1))) (let ((.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~q_free~0 0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= .cse13 ~p_num_write~0)) (.cse3 (= ~q_read_ev~0 2)) (.cse5 (<= ~p_num_write~0 .cse13)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (<= ~p_num_write~0 1)) (.cse9 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse10 (<= 1 ~p_num_write~0)) (.cse4 (= ~c_dr_st~0 2)) (.cse12 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_pc~0 1) .cse7 .cse9 .cse11) (and .cse1 .cse4 .cse7 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (= ~c_dr_st~0 0) .cse8 .cse9 .cse12 .cse10) (and .cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse12)))) [2020-12-23 09:29:51,746 INFO L185 CegarLoopUtils]: At program point L46-1(lines 30 48) the Hoare annotation is: (let ((.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= ~p_num_write~0 1)) (.cse5 (= ~q_free~0 1)) (.cse9 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 (= ~c_dr_pc~0 0) .cse5 .cse9 .cse6 .cse7) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse4 .cse8 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) .cse5 .cse9))) [2020-12-23 09:29:51,746 INFO L192 CegarLoopUtils]: At program point L360(lines 351 362) the Hoare annotation is: true [2020-12-23 09:29:51,746 INFO L189 CegarLoopUtils]: For program point L294(lines 294 299) no Hoare annotation was computed. [2020-12-23 09:29:51,746 INFO L185 CegarLoopUtils]: At program point L228(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-23 09:29:51,747 INFO L185 CegarLoopUtils]: At program point L228-1(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-23 09:29:51,747 INFO L192 CegarLoopUtils]: At program point L328(lines 305 333) the Hoare annotation is: true [2020-12-23 09:29:51,747 INFO L185 CegarLoopUtils]: At program point L229(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-23 09:29:51,747 INFO L185 CegarLoopUtils]: At program point L229-1(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-23 09:29:51,748 INFO L185 CegarLoopUtils]: At program point L64(lines 52 66) the Hoare annotation is: (let ((.cse16 (+ ~c_num_read~0 1))) (let ((.cse6 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 2)) (.cse15 (= ~p_dw_pc~0 1)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~c_dr_pc~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (<= .cse16 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 .cse16)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= ~p_num_write~0 1)) (.cse13 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse14 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse9 .cse3 .cse0 .cse10 .cse11 .cse15 .cse6) (and .cse7 .cse8 .cse0 .cse11 .cse4 .cse1 .cse13 .cse5) (and .cse7 .cse0 .cse11 .cse15 .cse1) (and .cse3 (= ~c_dr_st~0 0) .cse4 .cse1 .cse5 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2020-12-23 09:29:51,748 INFO L185 CegarLoopUtils]: At program point L64-1(lines 52 66) the Hoare annotation is: (let ((.cse0 (= 2 ~p_dw_st~0)) (.cse6 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~p_num_write~0 1)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse7 (= ~q_free~0 1)) (.cse12 (<= 1 ~p_num_write~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse12) (and .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse12 .cse8 .cse9))) [2020-12-23 09:29:51,748 INFO L189 CegarLoopUtils]: For program point L98(lines 98 106) no Hoare annotation was computed. [2020-12-23 09:29:51,748 INFO L185 CegarLoopUtils]: At program point L65(lines 49 67) the Hoare annotation is: (let ((.cse17 (+ ~c_num_read~0 1))) (let ((.cse3 (= ~p_dw_pc~0 1)) (.cse9 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse0 (= ~q_free~0 0)) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (<= .cse17 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 .cse17)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= ~p_num_write~0 1)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse15 (<= 1 ~p_num_write~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse16 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15) (and .cse0 .cse11 .cse6 .cse1 .cse12 .cse2 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse7 .cse4 .cse14 .cse8 .cse5) (and .cse6 (= ~c_dr_st~0 0) .cse7 .cse4 .cse8 .cse5 .cse16 .cse0 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and .cse1 .cse4 .cse5 .cse16)))) [2020-12-23 09:29:51,749 INFO L185 CegarLoopUtils]: At program point L65-1(lines 49 67) the Hoare annotation is: (let ((.cse1 (= ~p_dw_st~0 0)) (.cse11 (= ~c_num_read~0 1)) (.cse12 (<= ~p_num_write~0 1)) (.cse13 (<= 1 ~p_num_write~0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse15 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse6 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse4 .cse12 .cse6 .cse7 .cse13 .cse8) (and .cse14 .cse11 .cse2 .cse3 .cse4 .cse12 .cse15 .cse7 .cse13) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-12-23 09:29:51,749 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 09:29:51,749 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2020-12-23 09:29:51,749 INFO L185 CegarLoopUtils]: At program point L280(lines 232 285) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-23 09:29:51,749 INFO L185 CegarLoopUtils]: At program point L264(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse0 .cse2 .cse13 .cse7) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-23 09:29:51,750 INFO L189 CegarLoopUtils]: For program point L198(lines 198 202) no Hoare annotation was computed. [2020-12-23 09:29:51,750 INFO L189 CegarLoopUtils]: For program point L198-2(lines 197 210) no Hoare annotation was computed. [2020-12-23 09:29:51,750 INFO L189 CegarLoopUtils]: For program point L34(lines 34 43) no Hoare annotation was computed. [2020-12-23 09:29:51,750 INFO L189 CegarLoopUtils]: For program point L34-2(lines 34 43) no Hoare annotation was computed. [2020-12-23 09:29:51,750 INFO L189 CegarLoopUtils]: For program point L34-3(lines 34 43) no Hoare annotation was computed. [2020-12-23 09:29:51,750 INFO L189 CegarLoopUtils]: For program point L34-5(lines 34 43) no Hoare annotation was computed. [2020-12-23 09:29:51,750 INFO L185 CegarLoopUtils]: At program point L348(lines 334 350) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (<= ~p_num_write~0 ~c_num_read~0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (not (= ~q_write_ev~0 1)) (<= ~c_num_read~0 ~p_num_write~0) (= ~c_num_read~0 0)) [2020-12-23 09:29:51,751 INFO L185 CegarLoopUtils]: At program point L315-1(lines 194 327) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-23 09:29:51,751 INFO L185 CegarLoopUtils]: At program point L249(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-23 09:29:51,751 INFO L189 CegarLoopUtils]: For program point L216(lines 216 226) no Hoare annotation was computed. [2020-12-23 09:29:51,751 INFO L189 CegarLoopUtils]: For program point L216-1(lines 216 226) no Hoare annotation was computed. [2020-12-23 09:29:51,751 INFO L189 CegarLoopUtils]: For program point L84(lines 84 88) no Hoare annotation was computed. [2020-12-23 09:29:51,751 INFO L185 CegarLoopUtils]: At program point L84-2(lines 68 92) the Hoare annotation is: (let ((.cse19 (+ ~c_num_read~0 1))) (let ((.cse2 (= ~q_read_ev~0 2)) (.cse6 (= ~c_dr_st~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse1 (<= .cse19 ~p_num_write~0)) (.cse3 (<= ~p_num_write~0 .cse19)) (.cse15 (<= ~p_num_write~0 1)) (.cse17 (<= 1 ~p_num_write~0)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse11 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse0 (= ~q_free~0 0)) (.cse13 (= ~p_dw_pc~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse18 (= ~c_dr_st~0 2)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse10 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse1 .cse3 .cse4 .cse15 .cse16 .cse17) (and .cse2 .cse8 .cse6 .cse10 .cse7 .cse0 .cse13 .cse1 .cse3 .cse4 .cse15 .cse16 .cse17) (and .cse14 .cse18 .cse9 .cse11 .cse12) (and .cse0 .cse14 .cse18 .cse4 .cse5) (and .cse0 .cse13 .cse14 .cse18 .cse4 .cse8 .cse16 .cse10)))) [2020-12-23 09:29:51,752 INFO L189 CegarLoopUtils]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2020-12-23 09:29:51,752 INFO L185 CegarLoopUtils]: At program point L84-5(lines 68 92) the Hoare annotation is: (let ((.cse9 (= ~p_dw_st~0 0)) (.cse4 (<= ~p_num_write~0 1)) (.cse7 (<= 1 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_dw_pc~0 1)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse6 (= ~q_free~0 1)) (.cse10 (not (= ~q_write_ev~0 1))) (.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~c_dr_pc~0 1))) (or (and .cse0 (= ~c_num_read~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse2 .cse3 .cse6 .cse10 .cse11 .cse12) (and .cse9 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10 .cse11) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse10 .cse11 .cse12))) [2020-12-23 09:29:51,752 INFO L189 CegarLoopUtils]: For program point L101(lines 101 105) no Hoare annotation was computed. [2020-12-23 09:29:51,752 INFO L189 CegarLoopUtils]: For program point L35(lines 35 40) no Hoare annotation was computed. [2020-12-23 09:29:51,752 INFO L189 CegarLoopUtils]: For program point L35-1(lines 35 40) no Hoare annotation was computed. [2020-12-23 09:29:51,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:29:51 BoogieIcfgContainer [2020-12-23 09:29:51,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 09:29:51,831 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 09:29:51,831 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 09:29:51,831 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 09:29:51,832 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:29:35" (3/4) ... [2020-12-23 09:29:51,835 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 09:29:51,850 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-23 09:29:51,851 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-23 09:29:51,851 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 09:29:51,852 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 09:29:51,881 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-23 09:29:51,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-23 09:29:51,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-23 09:29:51,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-23 09:29:51,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-23 09:29:51,883 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-23 09:29:51,883 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-23 09:29:51,883 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-23 09:29:51,883 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-23 09:29:51,883 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-23 09:29:51,884 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1) [2020-12-23 09:29:51,884 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) || (((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write == 0) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read == 0)) || (((((((q_read_ev == 2 && c_dr_st == 2) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && p_num_write == 0) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) [2020-12-23 09:29:51,885 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1)) || (((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && q_read_ev == 2) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 1 <= p_num_write) && c_num_read == 0) && c_dr_pc == 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && __retres1 == 0) && 1 <= p_num_write) && c_dr_pc == 0) && c_num_read == 0) [2020-12-23 09:29:51,885 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 0 == \result) && 1 <= p_num_write) && c_dr_pc == 1) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_pc == 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0)) || (((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && c_dr_st == 0) && p_num_write <= 1) && 0 == \result) && c_dr_pc == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) [2020-12-23 09:29:51,885 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && 0 == \result) && q_free == 1) && 1 <= p_num_write) [2020-12-23 09:29:51,886 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result)) || ((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0)) || (((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write) [2020-12-23 09:29:51,886 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && \result == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || ((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) [2020-12-23 09:29:51,886 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((c_num_read == 1 && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && \result == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-23 09:29:51,886 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && c_dr_pc == 1) || (((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && c_dr_st == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && tmp == 0) && 0 == \result) [2020-12-23 09:29:51,923 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/pc_sfifo_1.cil-2.c-witness.graphml [2020-12-23 09:29:51,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 09:29:51,925 INFO L168 Benchmark]: Toolchain (without parser) took 17084.45 ms. Allocated memory was 170.9 MB in the beginning and 208.7 MB in the end (delta: 37.7 MB). Free memory was 146.9 MB in the beginning and 107.2 MB in the end (delta: 39.7 MB). Peak memory consumption was 78.5 MB. Max. memory is 8.0 GB. [2020-12-23 09:29:51,925 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 170.9 MB. Free memory is still 149.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:29:51,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.65 ms. Allocated memory is still 170.9 MB. Free memory was 146.7 MB in the beginning and 134.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-12-23 09:29:51,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.05 ms. Allocated memory is still 170.9 MB. Free memory was 134.8 MB in the beginning and 132.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:29:51,926 INFO L168 Benchmark]: Boogie Preprocessor took 40.75 ms. Allocated memory is still 170.9 MB. Free memory was 132.5 MB in the beginning and 131.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 09:29:51,927 INFO L168 Benchmark]: RCFGBuilder took 601.85 ms. Allocated memory is still 170.9 MB. Free memory was 130.9 MB in the beginning and 104.7 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2020-12-23 09:29:51,927 INFO L168 Benchmark]: TraceAbstraction took 15872.12 ms. Allocated memory was 170.9 MB in the beginning and 208.7 MB in the end (delta: 37.7 MB). Free memory was 104.2 MB in the beginning and 114.0 MB in the end (delta: -9.8 MB). Peak memory consumption was 77.6 MB. Max. memory is 8.0 GB. [2020-12-23 09:29:51,927 INFO L168 Benchmark]: Witness Printer took 92.56 ms. Allocated memory is still 208.7 MB. Free memory was 114.0 MB in the beginning and 107.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2020-12-23 09:29:51,930 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.17 ms. Allocated memory is still 170.9 MB. Free memory is still 149.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 409.65 ms. Allocated memory is still 170.9 MB. Free memory was 146.7 MB in the beginning and 134.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 54.05 ms. Allocated memory is still 170.9 MB. Free memory was 134.8 MB in the beginning and 132.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.75 ms. Allocated memory is still 170.9 MB. Free memory was 132.5 MB in the beginning and 131.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 601.85 ms. Allocated memory is still 170.9 MB. Free memory was 130.9 MB in the beginning and 104.7 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15872.12 ms. Allocated memory was 170.9 MB in the beginning and 208.7 MB in the end (delta: 37.7 MB). Free memory was 104.2 MB in the beginning and 114.0 MB in the end (delta: -9.8 MB). Peak memory consumption was 77.6 MB. Max. memory is 8.0 GB. * Witness Printer took 92.56 ms. Allocated memory is still 208.7 MB. Free memory was 114.0 MB in the beginning and 107.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) || (((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write == 0) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read == 0)) || (((((((q_read_ev == 2 && c_dr_st == 2) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && p_num_write == 0) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write) || ((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((((p_dw_st == 0 && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && tmp == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && c_dr_pc == 1) || (((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && c_dr_st == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && tmp == 0) && 0 == \result) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((c_num_read == 1 && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && \result == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((q_free == 0 && 2 == p_dw_st) && q_read_ev == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && c_dr_pc == 0) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) || ((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((((((q_read_ev == 2 && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) && tmp == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && \result == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || ((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && q_free == 1) && 1 <= p_num_write) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1)) || (((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && q_read_ev == 2) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 1 <= p_num_write) && c_num_read == 0) && c_dr_pc == 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && __retres1 == 0) && 1 <= p_num_write) && c_dr_pc == 0) && c_num_read == 0) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_dr_pc == 1 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((p_dw_st == 0 && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && __retres1 == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result)) || ((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0)) || (((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && 0 == \result) && q_free == 1) && 1 <= p_num_write) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 0 == \result) && 1 <= p_num_write) && c_dr_pc == 1) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_pc == 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0)) || (((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && c_dr_st == 0) && p_num_write <= 1) && 0 == \result) && c_dr_pc == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.2s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2052 SDtfs, 1724 SDslu, 2161 SDs, 0 SdLazy, 206 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=633occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1368 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 241 NumberOfFragments, 5154 HoareAnnotationTreeSize, 27 FomulaSimplifications, 69948 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 27 FomulaSimplificationsInter, 11282 FormulaSimplificationTreeSizeReductionInter, 9.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 200654 SizeOfPredicates, 2 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 280/284 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 correct! Received shutdown request...