/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-23 14:07:27,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-23 14:07:27,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-23 14:07:27,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-23 14:07:27,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-23 14:07:27,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-23 14:07:27,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-23 14:07:27,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-23 14:07:27,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-23 14:07:27,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-23 14:07:27,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-23 14:07:27,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-23 14:07:27,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-23 14:07:27,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-23 14:07:27,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-23 14:07:27,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-23 14:07:27,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-23 14:07:27,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-23 14:07:27,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-23 14:07:27,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-23 14:07:27,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-23 14:07:27,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-23 14:07:27,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-23 14:07:27,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-23 14:07:27,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-23 14:07:27,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-23 14:07:27,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-23 14:07:27,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-23 14:07:27,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-23 14:07:27,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-23 14:07:27,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-23 14:07:27,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-23 14:07:27,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-23 14:07:27,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-23 14:07:27,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-23 14:07:27,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-23 14:07:27,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-23 14:07:27,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-23 14:07:27,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-23 14:07:27,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-23 14:07:27,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-23 14:07:27,542 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-02-23 14:07:27,592 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-23 14:07:27,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-23 14:07:27,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-02-23 14:07:27,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-02-23 14:07:27,598 INFO L138 SettingsManager]: * Use SBE=true [2021-02-23 14:07:27,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-23 14:07:27,599 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-23 14:07:27,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-23 14:07:27,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-23 14:07:27,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-23 14:07:27,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-23 14:07:27,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-23 14:07:27,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-23 14:07:27,601 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-23 14:07:27,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-23 14:07:27,602 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-23 14:07:27,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-23 14:07:27,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-23 14:07:27,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-02-23 14:07:27,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-23 14:07:27,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-23 14:07:27,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-23 14:07:27,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-02-23 14:07:27,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-02-23 14:07:27,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-02-23 14:07:27,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-02-23 14:07:27,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-23 14:07:27,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-02-23 14:07:27,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-02-23 14:07:28,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-23 14:07:28,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-23 14:07:28,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-23 14:07:28,106 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-23 14:07:28,107 INFO L275 PluginConnector]: CDTParser initialized [2021-02-23 14:07:28,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c [2021-02-23 14:07:28,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b19ae68/f7317ddbc2a34bacb411448ee0beb35a/FLAGcb8446807 [2021-02-23 14:07:28,848 INFO L306 CDTParser]: Found 1 translation units. [2021-02-23 14:07:28,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c [2021-02-23 14:07:28,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b19ae68/f7317ddbc2a34bacb411448ee0beb35a/FLAGcb8446807 [2021-02-23 14:07:29,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b19ae68/f7317ddbc2a34bacb411448ee0beb35a [2021-02-23 14:07:29,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-23 14:07:29,197 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-23 14:07:29,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-23 14:07:29,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-23 14:07:29,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-23 14:07:29,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 02:07:29" (1/1) ... [2021-02-23 14:07:29,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a38f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 02:07:29, skipping insertion in model container [2021-02-23 14:07:29,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 02:07:29" (1/1) ... [2021-02-23 14:07:29,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-23 14:07:29,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-23 14:07:29,397 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c[338,351] [2021-02-23 14:07:29,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 14:07:29,460 INFO L203 MainTranslator]: Completed pre-run [2021-02-23 14:07:29,479 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c[338,351] [2021-02-23 14:07:29,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 14:07:29,533 INFO L208 MainTranslator]: Completed translation [2021-02-23 14:07:29,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 02:07:29 WrapperNode [2021-02-23 14:07:29,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-23 14:07:29,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-23 14:07:29,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-23 14:07:29,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-23 14:07:29,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 02:07:29" (1/1) ... [2021-02-23 14:07:29,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 02:07:29" (1/1) ... [2021-02-23 14:07:29,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 02:07:29" (1/1) ... [2021-02-23 14:07:29,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 02:07:29" (1/1) ... [2021-02-23 14:07:29,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 02:07:29" (1/1) ... [2021-02-23 14:07:29,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 02:07:29" (1/1) ... [2021-02-23 14:07:29,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 02:07:29" (1/1) ... [2021-02-23 14:07:29,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-23 14:07:29,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-23 14:07:29,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-23 14:07:29,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-23 14:07:29,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 02:07:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2021-02-23 14:07:29,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-23 14:07:29,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-23 14:07:29,706 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-23 14:07:29,707 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-02-23 14:07:29,707 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2021-02-23 14:07:29,707 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-02-23 14:07:29,707 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-02-23 14:07:29,707 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2021-02-23 14:07:29,708 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2021-02-23 14:07:29,708 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2021-02-23 14:07:29,708 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-02-23 14:07:29,708 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2021-02-23 14:07:29,709 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-02-23 14:07:29,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-02-23 14:07:29,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-02-23 14:07:29,709 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-02-23 14:07:29,709 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2021-02-23 14:07:29,710 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2021-02-23 14:07:29,710 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2021-02-23 14:07:29,710 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2021-02-23 14:07:29,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-23 14:07:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-23 14:07:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-23 14:07:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-23 14:07:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-23 14:07:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-23 14:07:29,712 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-02-23 14:07:29,712 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2021-02-23 14:07:29,712 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-02-23 14:07:29,712 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-02-23 14:07:29,712 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2021-02-23 14:07:29,712 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2021-02-23 14:07:29,713 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2021-02-23 14:07:29,713 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-02-23 14:07:29,713 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2021-02-23 14:07:29,713 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-02-23 14:07:29,713 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-02-23 14:07:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-02-23 14:07:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-02-23 14:07:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2021-02-23 14:07:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2021-02-23 14:07:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2021-02-23 14:07:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2021-02-23 14:07:29,715 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-23 14:07:29,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-23 14:07:29,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-23 14:07:29,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-23 14:07:29,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-23 14:07:29,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-23 14:07:29,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-23 14:07:30,253 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-23 14:07:30,253 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-02-23 14:07:30,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 02:07:30 BoogieIcfgContainer [2021-02-23 14:07:30,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-23 14:07:30,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-23 14:07:30,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-23 14:07:30,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-23 14:07:30,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 02:07:29" (1/3) ... [2021-02-23 14:07:30,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1fc75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 02:07:30, skipping insertion in model container [2021-02-23 14:07:30,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 02:07:29" (2/3) ... [2021-02-23 14:07:30,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1fc75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 02:07:30, skipping insertion in model container [2021-02-23 14:07:30,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 02:07:30" (3/3) ... [2021-02-23 14:07:30,269 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2021-02-23 14:07:30,277 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-02-23 14:07:30,282 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-23 14:07:30,304 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-23 14:07:30,349 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-23 14:07:30,350 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-23 14:07:30,350 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-02-23 14:07:30,350 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-23 14:07:30,350 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-23 14:07:30,351 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-23 14:07:30,352 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-23 14:07:30,352 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-23 14:07:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2021-02-23 14:07:30,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-23 14:07:30,396 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 14:07:30,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 14:07:30,398 INFO L428 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 14:07:30,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 14:07:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1736225506, now seen corresponding path program 1 times [2021-02-23 14:07:30,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-23 14:07:30,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657398711] [2021-02-23 14:07:30,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 14:07:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:30,807 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:30,808 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:30,809 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:30,810 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:30,821 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:30,821 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:30,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 14:07:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:30,928 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:30,929 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:30,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-23 14:07:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:30,965 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:30,966 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 14:07:30,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-23 14:07:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:30,989 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:30,989 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:31,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-23 14:07:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:31,009 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:31,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 14:07:31,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 14:07:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:31,040 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:31,041 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:31,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-23 14:07:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:31,055 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:31,056 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:31,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-23 14:07:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:31,061 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:31,062 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:31,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-23 14:07:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:31,068 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:31,068 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:31,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-23 14:07:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:31,078 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:31,078 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:31,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-23 14:07:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:31,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:31,085 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 14:07:31,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657398711] [2021-02-23 14:07:31,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 14:07:31,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-23 14:07:31,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75904987] [2021-02-23 14:07:31,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-23 14:07:31,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-23 14:07:31,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-23 14:07:31,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-02-23 14:07:31,132 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 9 states. [2021-02-23 14:07:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 14:07:32,816 INFO L93 Difference]: Finished difference Result 364 states and 588 transitions. [2021-02-23 14:07:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-02-23 14:07:32,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2021-02-23 14:07:32,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 14:07:32,833 INFO L225 Difference]: With dead ends: 364 [2021-02-23 14:07:32,834 INFO L226 Difference]: Without dead ends: 233 [2021-02-23 14:07:32,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-02-23 14:07:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-02-23 14:07:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 122. [2021-02-23 14:07:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2021-02-23 14:07:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 156 transitions. [2021-02-23 14:07:32,926 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 156 transitions. Word has length 70 [2021-02-23 14:07:32,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 14:07:32,927 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 156 transitions. [2021-02-23 14:07:32,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-23 14:07:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 156 transitions. [2021-02-23 14:07:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-23 14:07:32,930 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 14:07:32,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 14:07:32,931 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-23 14:07:32,931 INFO L428 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 14:07:32,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 14:07:32,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2114841116, now seen corresponding path program 1 times [2021-02-23 14:07:32,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-23 14:07:32,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104081418] [2021-02-23 14:07:32,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 14:07:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:33,006 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,007 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:33,007 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,008 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:33,011 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,012 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:33,012 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,013 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:33,013 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:33,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 14:07:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:33,103 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,103 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:33,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-23 14:07:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:33,147 WARN L141 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-02-23 14:07:33,148 WARN L147 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size 7 [2021-02-23 14:07:33,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-23 14:07:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:33,175 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,176 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:33,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-23 14:07:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:33,227 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,228 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:33,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 14:07:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:33,269 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,271 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:33,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-23 14:07:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:33,301 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,302 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:33,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-23 14:07:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:33,309 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,310 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:33,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-23 14:07:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:33,319 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,320 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:33,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-23 14:07:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:33,327 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,328 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:33,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-23 14:07:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:33,337 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:33,338 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 14:07:33,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104081418] [2021-02-23 14:07:33,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 14:07:33,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-23 14:07:33,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509263209] [2021-02-23 14:07:33,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-23 14:07:33,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-23 14:07:33,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-23 14:07:33,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-02-23 14:07:33,362 INFO L87 Difference]: Start difference. First operand 122 states and 156 transitions. Second operand 10 states. [2021-02-23 14:07:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 14:07:36,512 INFO L93 Difference]: Finished difference Result 519 states and 794 transitions. [2021-02-23 14:07:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-23 14:07:36,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2021-02-23 14:07:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 14:07:36,531 INFO L225 Difference]: With dead ends: 519 [2021-02-23 14:07:36,531 INFO L226 Difference]: Without dead ends: 416 [2021-02-23 14:07:36,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2021-02-23 14:07:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-02-23 14:07:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 234. [2021-02-23 14:07:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-02-23 14:07:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 304 transitions. [2021-02-23 14:07:36,635 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 304 transitions. Word has length 70 [2021-02-23 14:07:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 14:07:36,635 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 304 transitions. [2021-02-23 14:07:36,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-23 14:07:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 304 transitions. [2021-02-23 14:07:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-23 14:07:36,639 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 14:07:36,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 14:07:36,639 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-23 14:07:36,639 INFO L428 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 14:07:36,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 14:07:36,640 INFO L82 PathProgramCache]: Analyzing trace with hash 581728891, now seen corresponding path program 1 times [2021-02-23 14:07:36,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-23 14:07:36,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932782098] [2021-02-23 14:07:36,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 14:07:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:36,689 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,689 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:36,690 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,690 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:36,693 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,694 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:36,694 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,695 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:36,695 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,696 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:36,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 14:07:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:36,789 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,789 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:36,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-23 14:07:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:36,820 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,820 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:36,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-23 14:07:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:36,840 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,842 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 14:07:36,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-23 14:07:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:36,868 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,868 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:36,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 14:07:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:36,882 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,884 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-02-23 14:07:36,895 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,896 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 14:07:36,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-23 14:07:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:36,913 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,914 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:36,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-23 14:07:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:36,917 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,918 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:36,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-23 14:07:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:36,921 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,921 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:36,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-23 14:07:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:36,933 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,933 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:36,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-23 14:07:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:36,937 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:36,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 14:07:36,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932782098] [2021-02-23 14:07:36,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 14:07:36,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-23 14:07:36,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409993216] [2021-02-23 14:07:36,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-23 14:07:36,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-23 14:07:36,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-23 14:07:36,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-02-23 14:07:36,950 INFO L87 Difference]: Start difference. First operand 234 states and 304 transitions. Second operand 10 states. [2021-02-23 14:07:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 14:07:40,233 INFO L93 Difference]: Finished difference Result 805 states and 1156 transitions. [2021-02-23 14:07:40,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-02-23 14:07:40,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2021-02-23 14:07:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 14:07:40,240 INFO L225 Difference]: With dead ends: 805 [2021-02-23 14:07:40,241 INFO L226 Difference]: Without dead ends: 598 [2021-02-23 14:07:40,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2021-02-23 14:07:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-02-23 14:07:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 360. [2021-02-23 14:07:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2021-02-23 14:07:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 473 transitions. [2021-02-23 14:07:40,317 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 473 transitions. Word has length 70 [2021-02-23 14:07:40,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 14:07:40,317 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 473 transitions. [2021-02-23 14:07:40,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-23 14:07:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 473 transitions. [2021-02-23 14:07:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-23 14:07:40,320 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 14:07:40,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 14:07:40,321 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-23 14:07:40,321 INFO L428 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 14:07:40,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 14:07:40,322 INFO L82 PathProgramCache]: Analyzing trace with hash 228640509, now seen corresponding path program 1 times [2021-02-23 14:07:40,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-23 14:07:40,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115209618] [2021-02-23 14:07:40,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 14:07:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:40,363 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,364 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,365 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,365 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 14:07:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:40,439 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,440 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-23 14:07:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:40,464 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,464 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-23 14:07:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:40,479 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,481 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-23 14:07:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:40,495 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,497 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 14:07:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:40,510 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,511 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-23 14:07:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:40,534 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,538 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,539 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,540 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:40,552 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,552 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:40,561 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,561 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-23 14:07:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:40,567 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,568 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-23 14:07:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:40,581 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,581 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,582 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,583 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:40,593 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,594 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:40,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-23 14:07:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:40,612 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,613 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-23 14:07:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:40,625 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:40,626 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 14:07:40,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115209618] [2021-02-23 14:07:40,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 14:07:40,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-23 14:07:40,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055938174] [2021-02-23 14:07:40,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-23 14:07:40,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-23 14:07:40,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-23 14:07:40,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-02-23 14:07:40,643 INFO L87 Difference]: Start difference. First operand 360 states and 473 transitions. Second operand 11 states. [2021-02-23 14:07:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 14:07:42,999 INFO L93 Difference]: Finished difference Result 884 states and 1248 transitions. [2021-02-23 14:07:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-02-23 14:07:43,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2021-02-23 14:07:43,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 14:07:43,006 INFO L225 Difference]: With dead ends: 884 [2021-02-23 14:07:43,006 INFO L226 Difference]: Without dead ends: 567 [2021-02-23 14:07:43,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-02-23 14:07:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-02-23 14:07:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 375. [2021-02-23 14:07:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2021-02-23 14:07:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 488 transitions. [2021-02-23 14:07:43,072 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 488 transitions. Word has length 70 [2021-02-23 14:07:43,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 14:07:43,073 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 488 transitions. [2021-02-23 14:07:43,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-23 14:07:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 488 transitions. [2021-02-23 14:07:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-23 14:07:43,075 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 14:07:43,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 14:07:43,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-23 14:07:43,076 INFO L428 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 14:07:43,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 14:07:43,077 INFO L82 PathProgramCache]: Analyzing trace with hash 88091899, now seen corresponding path program 1 times [2021-02-23 14:07:43,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-23 14:07:43,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187014999] [2021-02-23 14:07:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 14:07:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:43,168 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,169 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,169 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,170 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 14:07:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:43,254 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,255 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-23 14:07:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:43,278 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,279 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-23 14:07:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:43,293 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,293 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-23 14:07:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:43,305 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,306 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 14:07:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:43,319 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,320 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-23 14:07:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:43,334 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,335 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,336 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,336 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 14:07:43,347 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-23 14:07:43,348 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-23 14:07:43,359 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,359 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-23 14:07:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:43,366 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,367 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,367 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,368 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 14:07:43,380 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,381 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 14:07:43,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-23 14:07:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:43,397 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,399 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-23 14:07:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:43,404 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,405 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-23 14:07:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:43,410 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:43,410 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 14:07:43,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187014999] [2021-02-23 14:07:43,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 14:07:43,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-23 14:07:43,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970609739] [2021-02-23 14:07:43,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-23 14:07:43,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-23 14:07:43,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-23 14:07:43,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-02-23 14:07:43,422 INFO L87 Difference]: Start difference. First operand 375 states and 488 transitions. Second operand 11 states. [2021-02-23 14:07:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 14:07:45,722 INFO L93 Difference]: Finished difference Result 890 states and 1237 transitions. [2021-02-23 14:07:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-23 14:07:45,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2021-02-23 14:07:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 14:07:45,727 INFO L225 Difference]: With dead ends: 890 [2021-02-23 14:07:45,727 INFO L226 Difference]: Without dead ends: 558 [2021-02-23 14:07:45,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-02-23 14:07:45,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-02-23 14:07:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 380. [2021-02-23 14:07:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2021-02-23 14:07:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 491 transitions. [2021-02-23 14:07:45,789 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 491 transitions. Word has length 70 [2021-02-23 14:07:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 14:07:45,789 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 491 transitions. [2021-02-23 14:07:45,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-23 14:07:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 491 transitions. [2021-02-23 14:07:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-23 14:07:45,791 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 14:07:45,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 14:07:45,792 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-23 14:07:45,792 INFO L428 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 14:07:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 14:07:45,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2139075897, now seen corresponding path program 1 times [2021-02-23 14:07:45,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-23 14:07:45,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278620993] [2021-02-23 14:07:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 14:07:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:45,829 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:45,829 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:45,832 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:45,833 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:45,833 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:45,834 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:45,838 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:45,838 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:45,839 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:45,839 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 14:07:45,844 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:45,845 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:45,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 14:07:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:45,927 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:45,927 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:45,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-23 14:07:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:45,956 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:45,957 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:45,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-23 14:07:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:45,988 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:45,989 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 14:07:46,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-23 14:07:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:46,016 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:46,017 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:46,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 14:07:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:46,035 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:46,036 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:46,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-23 14:07:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:46,044 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:46,045 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:46,045 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:46,046 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 14:07:46,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-23 14:07:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:46,060 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:46,060 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:46,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-23 14:07:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:46,064 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:46,065 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:46,066 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:46,066 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 14:07:46,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-23 14:07:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:46,069 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:46,070 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:46,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-23 14:07:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:46,072 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:46,073 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 14:07:46,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278620993] [2021-02-23 14:07:46,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 14:07:46,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-02-23 14:07:46,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724662887] [2021-02-23 14:07:46,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-23 14:07:46,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-23 14:07:46,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-23 14:07:46,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-02-23 14:07:46,083 INFO L87 Difference]: Start difference. First operand 380 states and 491 transitions. Second operand 13 states. [2021-02-23 14:07:46,262 WARN L202 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2021-02-23 14:07:47,407 WARN L202 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-02-23 14:07:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 14:07:53,043 INFO L93 Difference]: Finished difference Result 2301 states and 3260 transitions. [2021-02-23 14:07:53,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-02-23 14:07:53,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2021-02-23 14:07:53,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 14:07:53,058 INFO L225 Difference]: With dead ends: 2301 [2021-02-23 14:07:53,058 INFO L226 Difference]: Without dead ends: 1935 [2021-02-23 14:07:53,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=505, Invalid=2687, Unknown=0, NotChecked=0, Total=3192 [2021-02-23 14:07:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2021-02-23 14:07:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1616. [2021-02-23 14:07:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2021-02-23 14:07:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2137 transitions. [2021-02-23 14:07:53,274 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2137 transitions. Word has length 70 [2021-02-23 14:07:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 14:07:53,275 INFO L480 AbstractCegarLoop]: Abstraction has 1616 states and 2137 transitions. [2021-02-23 14:07:53,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-23 14:07:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2137 transitions. [2021-02-23 14:07:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-23 14:07:53,276 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 14:07:53,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 14:07:53,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-23 14:07:53,277 INFO L428 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 14:07:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 14:07:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash 508153532, now seen corresponding path program 1 times [2021-02-23 14:07:53,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-23 14:07:53,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200162911] [2021-02-23 14:07:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 14:07:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:53,312 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,312 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:53,313 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,313 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:53,316 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,316 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:53,317 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,317 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:53,318 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,318 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:53,319 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,320 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:53,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 14:07:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:53,397 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,398 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:53,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-02-23 14:07:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:53,424 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,424 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 14:07:53,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-02-23 14:07:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:53,441 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,442 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 14:07:53,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-02-23 14:07:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:53,468 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,469 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:53,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 14:07:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:53,481 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,482 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 14:07:53,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-02-23 14:07:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:53,488 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,489 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:53,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-23 14:07:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:53,493 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,494 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:53,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-23 14:07:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:53,497 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,498 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:53,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-02-23 14:07:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:53,515 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,516 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-02-23 14:07:53,527 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 14:07:53,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-02-23 14:07:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 14:07:53,539 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 14:07:53,540 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 14:07:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 14:07:53,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200162911] [2021-02-23 14:07:53,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 14:07:53,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-23 14:07:53,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261615273] [2021-02-23 14:07:53,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-23 14:07:53,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-02-23 14:07:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-23 14:07:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-02-23 14:07:53,552 INFO L87 Difference]: Start difference. First operand 1616 states and 2137 transitions. Second operand 10 states. [2021-02-23 14:07:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 14:07:56,588 INFO L93 Difference]: Finished difference Result 3486 states and 4678 transitions. [2021-02-23 14:07:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-23 14:07:56,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2021-02-23 14:07:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 14:07:56,603 INFO L225 Difference]: With dead ends: 3486 [2021-02-23 14:07:56,603 INFO L226 Difference]: Without dead ends: 2141 [2021-02-23 14:07:56,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2021-02-23 14:07:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2021-02-23 14:07:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1623. [2021-02-23 14:07:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2021-02-23 14:07:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2135 transitions. [2021-02-23 14:07:56,853 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2135 transitions. Word has length 70 [2021-02-23 14:07:56,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 14:07:56,854 INFO L480 AbstractCegarLoop]: Abstraction has 1623 states and 2135 transitions. [2021-02-23 14:07:56,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-23 14:07:56,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2135 transitions. [2021-02-23 14:07:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-23 14:07:56,855 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 14:07:56,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 14:07:56,855 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-23 14:07:56,855 INFO L428 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 14:07:56,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 14:07:56,856 INFO L82 PathProgramCache]: Analyzing trace with hash -309494918, now seen corresponding path program 1 times [2021-02-23 14:07:56,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-02-23 14:07:56,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071332497] [2021-02-23 14:07:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 14:07:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-23 14:07:56,875 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-23 14:07:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-23 14:07:56,895 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-23 14:07:56,942 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-02-23 14:07:56,942 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-02-23 14:07:56,942 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-23 14:07:57,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 02:07:57 BoogieIcfgContainer [2021-02-23 14:07:57,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-23 14:07:57,062 INFO L168 Benchmark]: Toolchain (without parser) took 27880.80 ms. Allocated memory was 178.3 MB in the beginning and 444.6 MB in the end (delta: 266.3 MB). Free memory was 153.2 MB in the beginning and 233.6 MB in the end (delta: -80.5 MB). Peak memory consumption was 187.0 MB. Max. memory is 8.0 GB. [2021-02-23 14:07:57,063 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 178.3 MB. Free memory is still 149.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-23 14:07:57,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.94 ms. Allocated memory is still 178.3 MB. Free memory was 151.9 MB in the beginning and 139.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-02-23 14:07:57,063 INFO L168 Benchmark]: Boogie Preprocessor took 57.99 ms. Allocated memory is still 178.3 MB. Free memory was 139.5 MB in the beginning and 137.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-23 14:07:57,064 INFO L168 Benchmark]: RCFGBuilder took 662.39 ms. Allocated memory is still 178.3 MB. Free memory was 137.2 MB in the beginning and 140.2 MB in the end (delta: -3.0 MB). Peak memory consumption was 17.2 MB. Max. memory is 8.0 GB. [2021-02-23 14:07:57,064 INFO L168 Benchmark]: TraceAbstraction took 26801.89 ms. Allocated memory was 178.3 MB in the beginning and 444.6 MB in the end (delta: 266.3 MB). Free memory was 139.8 MB in the beginning and 233.6 MB in the end (delta: -93.9 MB). Peak memory consumption was 173.0 MB. Max. memory is 8.0 GB. [2021-02-23 14:07:57,066 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.21 ms. Allocated memory is still 178.3 MB. Free memory is still 149.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 332.94 ms. Allocated memory is still 178.3 MB. Free memory was 151.9 MB in the beginning and 139.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 57.99 ms. Allocated memory is still 178.3 MB. Free memory was 139.5 MB in the beginning and 137.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 662.39 ms. Allocated memory is still 178.3 MB. Free memory was 137.2 MB in the beginning and 140.2 MB in the end (delta: -3.0 MB). Peak memory consumption was 17.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 26801.89 ms. Allocated memory was 178.3 MB in the beginning and 444.6 MB in the end (delta: 266.3 MB). Free memory was 139.8 MB in the beginning and 233.6 MB in the end (delta: -93.9 MB). Peak memory consumption was 173.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int q_buf_0 ; [L18] int q_free ; [L19] int q_read_ev ; [L20] int q_write_ev ; [L21] int q_req_up ; [L22] int q_ev ; [L43] int p_num_write ; [L44] int p_last_write ; [L45] int p_dw_st ; [L46] int p_dw_pc ; [L47] int p_dw_i ; [L48] int c_num_read ; [L49] int c_last_read ; [L50] int c_dr_st ; [L51] int c_dr_pc ; [L52] int c_dr_i ; [L156] static int a_t ; VAL [\old(a_t)=69, \old(c_dr_i)=49, \old(c_dr_pc)=58, \old(c_dr_st)=60, \old(c_last_read)=65, \old(c_num_read)=66, \old(p_dw_i)=63, \old(p_dw_pc)=59, \old(p_dw_st)=52, \old(p_last_write)=73, \old(p_num_write)=51, \old(q_buf_0)=54, \old(q_ev)=72, \old(q_free)=61, \old(q_read_ev)=71, \old(q_req_up)=57, \old(q_write_ev)=67, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0] [L458] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0] [L462] CALL init_model() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0] [L444] q_free = 1 [L445] q_write_ev = 2 [L446] q_read_ev = q_write_ev [L447] p_num_write = 0 [L448] p_dw_pc = 0 [L449] p_dw_i = 1 [L450] c_num_read = 0 [L451] c_dr_pc = 0 [L452] c_dr_i = 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L462] RET init_model() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L463] CALL start_simulation() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L398] int kernel_st ; [L399] int tmp ; [L403] kernel_st = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L404] CALL update_channels() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L214] COND FALSE !((int )q_req_up == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L404] RET update_channels() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L405] CALL init_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L229] COND TRUE (int )p_dw_i == 1 [L230] p_dw_st = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L234] COND TRUE (int )c_dr_i == 1 [L235] c_dr_st = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L405] RET init_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L406] CALL fire_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L267] COND FALSE !((int )q_read_ev == 0) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L272] COND FALSE !((int )q_write_ev == 0) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L406] RET fire_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L407] CALL activate_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L300] int tmp ; [L301] int tmp___0 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L305] CALL, EXPR is_do_write_p_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L54] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L57] COND FALSE !((int )p_dw_pc == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L67] __retres1 = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L69] return (__retres1); VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L305] RET, EXPR is_do_write_p_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, is_do_write_p_triggered()=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L305] tmp = is_do_write_p_triggered() [L307] COND FALSE !(\read(tmp)) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L313] CALL, EXPR is_do_read_c_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L73] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L76] COND FALSE !((int )c_dr_pc == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L86] __retres1 = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L88] return (__retres1); VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] RET, EXPR is_do_read_c_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, is_do_read_c_triggered()=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L313] tmp___0 = is_do_read_c_triggered() [L315] COND FALSE !(\read(tmp___0)) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___0=0] [L407] RET activate_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L408] CALL reset_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L285] COND FALSE !((int )q_read_ev == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L290] COND FALSE !((int )q_write_ev == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L408] RET reset_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L411] COND TRUE 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L414] kernel_st = 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=1, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L415] CALL eval() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L325] int tmp ; [L326] int tmp___0 ; [L327] int tmp___1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L331] COND TRUE 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L334] CALL, EXPR exists_runnable_thread() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L244] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L247] COND TRUE (int )p_dw_st == 0 [L248] __retres1 = 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L260] return (__retres1); VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, \result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L334] RET, EXPR exists_runnable_thread() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, exists_runnable_thread()=1, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L334] tmp___1 = exists_runnable_thread() [L336] COND TRUE \read(tmp___1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp___1=1] [L341] COND TRUE (int )p_dw_st == 0 [L343] tmp = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp)) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___1=1] [L351] CALL error() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L12] reach_error() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 26.5s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1127 SDtfs, 4454 SDslu, 1200 SDs, 0 SdLazy, 11189 SolverSat, 2882 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 160 SyntacticMatches, 5 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1623occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 7 MinimizatonAttempts, 1738 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 119301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...