/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.0-7d8eed3 [2020-11-06 22:51:07,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:51:07,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:51:07,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:51:07,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:51:07,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:51:07,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:51:07,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:51:07,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:51:07,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:51:07,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:51:07,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:51:07,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:51:07,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:51:07,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:51:07,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:51:07,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:51:07,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:51:07,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:51:07,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:51:07,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:51:07,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:51:07,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:51:07,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:51:07,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:51:07,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:51:07,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:51:07,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:51:07,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:51:07,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:51:07,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:51:07,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:51:07,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:51:07,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:51:07,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:51:07,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:51:07,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:51:07,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:51:07,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:51:07,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:51:07,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:51:07,808 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 [2020-11-06 22:51:07,842 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:51:07,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:51:07,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:51:07,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:51:07,847 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:51:07,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:51:07,848 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:51:07,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:51:07,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:51:07,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:51:07,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:51:07,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:51:07,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:51:07,850 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:51:07,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:51:07,851 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:51:07,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:51:07,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:51:07,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:51:07,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:51:07,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:51:07,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:51:07,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:51:07,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:51:07,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:51:07,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:51:07,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:51:07,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:51:07,855 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:51:07,855 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 [2020-11-06 22:51:08,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:51:08,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:51:08,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:51:08,311 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:51:08,312 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:51:08,313 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 [2020-11-06 22:51:08,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5f00592/e41b39a348e94652a4b7fe2fe1aff793/FLAG6afe146de [2020-11-06 22:51:08,968 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:51:08,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c [2020-11-06 22:51:08,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5f00592/e41b39a348e94652a4b7fe2fe1aff793/FLAG6afe146de [2020-11-06 22:51:09,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5f00592/e41b39a348e94652a4b7fe2fe1aff793 [2020-11-06 22:51:09,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:51:09,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:51:09,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:51:09,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:51:09,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:51:09,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:09" (1/1) ... [2020-11-06 22:51:09,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@847d14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:09, skipping insertion in model container [2020-11-06 22:51:09,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:09" (1/1) ... [2020-11-06 22:51:09,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:51:09,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:51:09,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:51:09,603 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:51:09,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:51:09,688 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:51:09,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:09 WrapperNode [2020-11-06 22:51:09,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:51:09,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:51:09,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:51:09,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:51:09,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:09" (1/1) ... [2020-11-06 22:51:09,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:09" (1/1) ... [2020-11-06 22:51:09,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:09" (1/1) ... [2020-11-06 22:51:09,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:09" (1/1) ... [2020-11-06 22:51:09,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:09" (1/1) ... [2020-11-06 22:51:09,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:09" (1/1) ... [2020-11-06 22:51:09,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:09" (1/1) ... [2020-11-06 22:51:09,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:51:09,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:51:09,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:51:09,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:51:09,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:09" (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 [2020-11-06 22:51:09,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:51:09,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:51:09,816 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:51:09,816 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-11-06 22:51:09,816 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2020-11-06 22:51:09,816 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-11-06 22:51:09,816 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-11-06 22:51:09,817 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-11-06 22:51:09,817 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-11-06 22:51:09,817 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-11-06 22:51:09,817 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-11-06 22:51:09,817 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-11-06 22:51:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-11-06 22:51:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-11-06 22:51:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-11-06 22:51:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-11-06 22:51:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-11-06 22:51:09,819 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-11-06 22:51:09,819 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-11-06 22:51:09,819 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-11-06 22:51:09,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:51:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:51:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:51:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:51:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:51:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:51:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-11-06 22:51:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2020-11-06 22:51:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-11-06 22:51:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-11-06 22:51:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-11-06 22:51:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-11-06 22:51:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-11-06 22:51:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-11-06 22:51:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-11-06 22:51:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-11-06 22:51:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-11-06 22:51:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-11-06 22:51:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-11-06 22:51:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-11-06 22:51:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-11-06 22:51:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-11-06 22:51:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-11-06 22:51:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:51:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:51:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:51:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:51:09,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:51:09,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:51:09,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:51:10,540 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:51:10,540 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-11-06 22:51:10,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:10 BoogieIcfgContainer [2020-11-06 22:51:10,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:51:10,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:51:10,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:51:10,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:51:10,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:09" (1/3) ... [2020-11-06 22:51:10,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6e0d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:10, skipping insertion in model container [2020-11-06 22:51:10,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:09" (2/3) ... [2020-11-06 22:51:10,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6e0d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:10, skipping insertion in model container [2020-11-06 22:51:10,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:10" (3/3) ... [2020-11-06 22:51:10,553 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2020-11-06 22:51:10,569 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:51:10,574 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:51:10,588 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:51:10,618 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:51:10,618 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:51:10,618 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:51:10,619 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:51:10,619 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:51:10,619 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:51:10,619 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:51:10,619 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:51:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2020-11-06 22:51:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-06 22:51:10,650 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:10,651 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, 1] [2020-11-06 22:51:10,651 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:10,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:10,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1621750076, now seen corresponding path program 1 times [2020-11-06 22:51:10,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:10,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574180655] [2020-11-06 22:51:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:11,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:11,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:11,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:11,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:51:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:11,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:51:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:11,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:51:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:11,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:11,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:11,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:51:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:11,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-06 22:51:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:11,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574180655] [2020-11-06 22:51:11,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:11,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:51:11,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196468945] [2020-11-06 22:51:11,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:51:11,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:11,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:51:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:51:11,420 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 10 states. [2020-11-06 22:51:11,640 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-06 22:51:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:15,183 INFO L93 Difference]: Finished difference Result 558 states and 926 transitions. [2020-11-06 22:51:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-06 22:51:15,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2020-11-06 22:51:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:15,220 INFO L225 Difference]: With dead ends: 558 [2020-11-06 22:51:15,220 INFO L226 Difference]: Without dead ends: 418 [2020-11-06 22:51:15,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2020-11-06 22:51:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-11-06 22:51:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 235. [2020-11-06 22:51:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-11-06 22:51:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 307 transitions. [2020-11-06 22:51:15,370 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 307 transitions. Word has length 71 [2020-11-06 22:51:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:15,371 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 307 transitions. [2020-11-06 22:51:15,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:51:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 307 transitions. [2020-11-06 22:51:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-06 22:51:15,375 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:15,376 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, 1] [2020-11-06 22:51:15,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:51:15,376 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:15,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1339911357, now seen corresponding path program 1 times [2020-11-06 22:51:15,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:15,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803525701] [2020-11-06 22:51:15,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:15,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:15,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:15,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:15,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:51:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:15,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:51:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:15,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:51:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:15,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:15,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:15,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:51:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:15,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-06 22:51:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:15,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803525701] [2020-11-06 22:51:15,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:15,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:51:15,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446485167] [2020-11-06 22:51:15,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:51:15,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:51:15,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:51:15,730 INFO L87 Difference]: Start difference. First operand 235 states and 307 transitions. Second operand 11 states. [2020-11-06 22:51:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:18,407 INFO L93 Difference]: Finished difference Result 608 states and 881 transitions. [2020-11-06 22:51:18,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-06 22:51:18,408 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2020-11-06 22:51:18,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:18,414 INFO L225 Difference]: With dead ends: 608 [2020-11-06 22:51:18,414 INFO L226 Difference]: Without dead ends: 400 [2020-11-06 22:51:18,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:51:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-11-06 22:51:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 240. [2020-11-06 22:51:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2020-11-06 22:51:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 311 transitions. [2020-11-06 22:51:18,500 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 311 transitions. Word has length 71 [2020-11-06 22:51:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:18,500 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 311 transitions. [2020-11-06 22:51:18,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:51:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 311 transitions. [2020-11-06 22:51:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-06 22:51:18,513 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:18,513 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, 1] [2020-11-06 22:51:18,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:51:18,514 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:18,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:18,514 INFO L82 PathProgramCache]: Analyzing trace with hash 495905855, now seen corresponding path program 1 times [2020-11-06 22:51:18,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:18,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494236963] [2020-11-06 22:51:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:18,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:18,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:18,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:18,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:51:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:18,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:51:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:18,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:51:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:18,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:18,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:18,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:51:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:18,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-06 22:51:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:18,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494236963] [2020-11-06 22:51:18,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:18,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:51:18,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698247424] [2020-11-06 22:51:18,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:51:18,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:51:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:51:18,944 INFO L87 Difference]: Start difference. First operand 240 states and 311 transitions. Second operand 11 states. [2020-11-06 22:51:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:21,293 INFO L93 Difference]: Finished difference Result 625 states and 899 transitions. [2020-11-06 22:51:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-06 22:51:21,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2020-11-06 22:51:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:21,304 INFO L225 Difference]: With dead ends: 625 [2020-11-06 22:51:21,304 INFO L226 Difference]: Without dead ends: 412 [2020-11-06 22:51:21,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2020-11-06 22:51:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2020-11-06 22:51:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 250. [2020-11-06 22:51:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-11-06 22:51:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 321 transitions. [2020-11-06 22:51:21,377 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 321 transitions. Word has length 71 [2020-11-06 22:51:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:21,380 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 321 transitions. [2020-11-06 22:51:21,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:51:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 321 transitions. [2020-11-06 22:51:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-06 22:51:21,384 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:21,385 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, 1] [2020-11-06 22:51:21,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:51:21,385 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:21,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:21,386 INFO L82 PathProgramCache]: Analyzing trace with hash 557945469, now seen corresponding path program 1 times [2020-11-06 22:51:21,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:21,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055179142] [2020-11-06 22:51:21,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:21,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:51:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:21,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:51:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:21,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:51:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:21,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:51:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:21,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:51:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:21,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:51:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:21,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:51:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:21,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:51:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:21,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:51:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:21,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-06 22:51:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:51:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:51:21,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055179142] [2020-11-06 22:51:21,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:51:21,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:51:21,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995843667] [2020-11-06 22:51:21,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:51:21,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:51:21,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:51:21,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:51:21,709 INFO L87 Difference]: Start difference. First operand 250 states and 321 transitions. Second operand 10 states. [2020-11-06 22:51:25,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:51:25,120 INFO L93 Difference]: Finished difference Result 885 states and 1234 transitions. [2020-11-06 22:51:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-06 22:51:25,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2020-11-06 22:51:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:51:25,129 INFO L225 Difference]: With dead ends: 885 [2020-11-06 22:51:25,129 INFO L226 Difference]: Without dead ends: 663 [2020-11-06 22:51:25,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2020-11-06 22:51:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-11-06 22:51:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 407. [2020-11-06 22:51:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-11-06 22:51:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 525 transitions. [2020-11-06 22:51:25,203 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 525 transitions. Word has length 71 [2020-11-06 22:51:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:51:25,203 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 525 transitions. [2020-11-06 22:51:25,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:51:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 525 transitions. [2020-11-06 22:51:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-06 22:51:25,205 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:51:25,205 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, 1] [2020-11-06 22:51:25,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:51:25,206 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:51:25,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:51:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash 980647295, now seen corresponding path program 1 times [2020-11-06 22:51:25,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:51:25,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150429770] [2020-11-06 22:51:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:51:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:51:25,228 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:51:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:51:25,251 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:51:25,329 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:51:25,329 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:51:25,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:51:25,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:51:25 BoogieIcfgContainer [2020-11-06 22:51:25,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:51:25,490 INFO L168 Benchmark]: Toolchain (without parser) took 16145.33 ms. Allocated memory was 163.6 MB in the beginning and 350.2 MB in the end (delta: 186.6 MB). Free memory was 138.2 MB in the beginning and 214.6 MB in the end (delta: -76.4 MB). Peak memory consumption was 111.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:51:25,493 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 163.6 MB. Free memory is still 134.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:51:25,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.44 ms. Allocated memory is still 163.6 MB. Free memory was 137.5 MB in the beginning and 124.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:51:25,495 INFO L168 Benchmark]: Boogie Preprocessor took 50.64 ms. Allocated memory is still 163.6 MB. Free memory was 124.4 MB in the beginning and 122.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:51:25,496 INFO L168 Benchmark]: RCFGBuilder took 800.81 ms. Allocated memory is still 163.6 MB. Free memory was 122.4 MB in the beginning and 127.5 MB in the end (delta: -5.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:51:25,500 INFO L168 Benchmark]: TraceAbstraction took 14943.17 ms. Allocated memory was 163.6 MB in the beginning and 350.2 MB in the end (delta: 186.6 MB). Free memory was 126.9 MB in the beginning and 214.6 MB in the end (delta: -87.7 MB). Peak memory consumption was 98.4 MB. Max. memory is 8.0 GB. [2020-11-06 22:51:25,506 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 163.6 MB. Free memory is still 134.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 337.44 ms. Allocated memory is still 163.6 MB. Free memory was 137.5 MB in the beginning and 124.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 50.64 ms. Allocated memory is still 163.6 MB. Free memory was 124.4 MB in the beginning and 122.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 800.81 ms. Allocated memory is still 163.6 MB. Free memory was 122.4 MB in the beginning and 127.5 MB in the end (delta: -5.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14943.17 ms. Allocated memory was 163.6 MB in the beginning and 350.2 MB in the end (delta: 186.6 MB). Free memory was 126.9 MB in the beginning and 214.6 MB in the end (delta: -87.7 MB). Peak memory consumption was 98.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_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] CALL 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] [L3] __assert_fail("0", "pc_sfifo_2.cil-2.c", 3, "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, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.7s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 556 SDtfs, 1996 SDslu, 806 SDs, 0 SdLazy, 5194 SolverSat, 1258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 761 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 70350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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...