/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 01:10:51,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 01:10:51,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 01:10:52,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 01:10:52,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 01:10:52,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 01:10:52,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 01:10:52,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 01:10:52,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 01:10:52,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 01:10:52,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 01:10:52,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 01:10:52,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 01:10:52,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 01:10:52,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 01:10:52,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 01:10:52,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 01:10:52,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 01:10:52,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 01:10:52,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 01:10:52,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 01:10:52,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 01:10:52,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 01:10:52,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 01:10:52,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 01:10:52,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 01:10:52,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 01:10:52,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 01:10:52,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 01:10:52,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 01:10:52,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 01:10:52,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 01:10:52,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 01:10:52,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 01:10:52,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 01:10:52,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 01:10:52,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 01:10:52,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 01:10:52,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 01:10:52,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 01:10:52,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 01:10:52,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 01:10:52,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 01:10:52,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 01:10:52,065 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 01:10:52,065 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 01:10:52,065 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 01:10:52,066 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 01:10:52,066 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 01:10:52,066 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 01:10:52,066 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 01:10:52,066 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 01:10:52,067 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 01:10:52,067 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 01:10:52,067 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 01:10:52,067 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 01:10:52,067 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 01:10:52,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 01:10:52,068 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 01:10:52,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 01:10:52,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 01:10:52,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 01:10:52,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 01:10:52,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 01:10:52,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 01:10:52,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 01:10:52,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 01:10:52,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 01:10:52,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 01:10:52,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 01:10:52,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 01:10:52,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 01:10:52,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 01:10:52,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 01:10:52,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 01:10:52,072 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 01:10:52,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 01:10:52,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 01:10:52,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 01:10:52,072 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 01:10:52,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 01:10:52,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 01:10:52,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 01:10:52,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 01:10:52,367 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 01:10:52,368 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i [2019-11-24 01:10:52,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa1e637b/6cbea16b77ad4742822a1ae7518b949c/FLAGad51ec906 [2019-11-24 01:10:53,197 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 01:10:53,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i [2019-11-24 01:10:53,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa1e637b/6cbea16b77ad4742822a1ae7518b949c/FLAGad51ec906 [2019-11-24 01:10:53,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa1e637b/6cbea16b77ad4742822a1ae7518b949c [2019-11-24 01:10:53,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 01:10:53,312 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 01:10:53,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 01:10:53,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 01:10:53,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 01:10:53,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:53" (1/1) ... [2019-11-24 01:10:53,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@751fa370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:53, skipping insertion in model container [2019-11-24 01:10:53,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:53" (1/1) ... [2019-11-24 01:10:53,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 01:10:53,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 01:10:55,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:10:55,121 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 01:10:55,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:10:55,895 INFO L208 MainTranslator]: Completed translation [2019-11-24 01:10:55,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55 WrapperNode [2019-11-24 01:10:55,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 01:10:55,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 01:10:55,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 01:10:55,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 01:10:55,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55" (1/1) ... [2019-11-24 01:10:56,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55" (1/1) ... [2019-11-24 01:10:56,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 01:10:56,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 01:10:56,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 01:10:56,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 01:10:56,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55" (1/1) ... [2019-11-24 01:10:56,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55" (1/1) ... [2019-11-24 01:10:56,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55" (1/1) ... [2019-11-24 01:10:56,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55" (1/1) ... [2019-11-24 01:10:56,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55" (1/1) ... [2019-11-24 01:10:56,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55" (1/1) ... [2019-11-24 01:10:56,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55" (1/1) ... [2019-11-24 01:10:56,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 01:10:56,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 01:10:56,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 01:10:56,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 01:10:56,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55" (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 [2019-11-24 01:10:56,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 01:10:56,866 INFO L130 BoogieDeclarations]: Found specification of procedure backlight_update_status [2019-11-24 01:10:56,866 INFO L138 BoogieDeclarations]: Found implementation of procedure backlight_update_status [2019-11-24 01:10:56,867 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_acpi_add [2019-11-24 01:10:56,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_acpi_add [2019-11-24 01:10:56,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 01:10:56,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 01:10:56,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 01:10:56,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 01:10:56,868 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-11-24 01:10:56,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-11-24 01:10:56,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 01:10:56,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 01:10:56,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 01:10:56,869 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_backlight_init [2019-11-24 01:10:56,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_backlight_init [2019-11-24 01:10:56,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 01:10:56,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 01:10:56,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 01:11:45,090 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 01:11:45,091 INFO L284 CfgBuilder]: Removed 1221 assume(true) statements. [2019-11-24 01:11:45,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:11:45 BoogieIcfgContainer [2019-11-24 01:11:45,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 01:11:45,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 01:11:45,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 01:11:45,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 01:11:45,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:10:53" (1/3) ... [2019-11-24 01:11:45,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4134a293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:11:45, skipping insertion in model container [2019-11-24 01:11:45,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:55" (2/3) ... [2019-11-24 01:11:45,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4134a293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:11:45, skipping insertion in model container [2019-11-24 01:11:45,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:11:45" (3/3) ... [2019-11-24 01:11:45,114 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i [2019-11-24 01:11:45,127 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 01:11:45,145 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-24 01:11:45,162 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-24 01:11:45,214 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 01:11:45,214 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 01:11:45,216 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 01:11:45,217 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 01:11:45,217 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 01:11:45,217 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 01:11:45,217 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 01:11:45,218 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 01:11:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states. [2019-11-24 01:11:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 01:11:45,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:45,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:45,276 INFO L410 AbstractCegarLoop]: === Iteration 1 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1043082885, now seen corresponding path program 1 times [2019-11-24 01:11:45,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:45,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928712007] [2019-11-24 01:11:45,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:11:45,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928712007] [2019-11-24 01:11:45,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:45,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:45,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411211749] [2019-11-24 01:11:45,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:45,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:45,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:45,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:45,992 INFO L87 Difference]: Start difference. First operand 432 states. Second operand 3 states. [2019-11-24 01:11:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:46,196 INFO L93 Difference]: Finished difference Result 1276 states and 2244 transitions. [2019-11-24 01:11:46,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:46,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 01:11:46,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:46,230 INFO L225 Difference]: With dead ends: 1276 [2019-11-24 01:11:46,230 INFO L226 Difference]: Without dead ends: 843 [2019-11-24 01:11:46,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-11-24 01:11:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 839. [2019-11-24 01:11:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-11-24 01:11:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1466 transitions. [2019-11-24 01:11:46,377 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1466 transitions. Word has length 16 [2019-11-24 01:11:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:46,377 INFO L462 AbstractCegarLoop]: Abstraction has 839 states and 1466 transitions. [2019-11-24 01:11:46,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1466 transitions. [2019-11-24 01:11:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 01:11:46,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:46,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:46,381 INFO L410 AbstractCegarLoop]: === Iteration 2 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:46,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:46,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1961716676, now seen corresponding path program 1 times [2019-11-24 01:11:46,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:46,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864191399] [2019-11-24 01:11:46,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:11:46,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864191399] [2019-11-24 01:11:46,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:46,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:46,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604604463] [2019-11-24 01:11:46,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:46,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:46,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:46,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:46,613 INFO L87 Difference]: Start difference. First operand 839 states and 1466 transitions. Second operand 3 states. [2019-11-24 01:11:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:46,641 INFO L93 Difference]: Finished difference Result 839 states and 1466 transitions. [2019-11-24 01:11:46,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:46,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 01:11:46,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:46,650 INFO L225 Difference]: With dead ends: 839 [2019-11-24 01:11:46,651 INFO L226 Difference]: Without dead ends: 837 [2019-11-24 01:11:46,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-11-24 01:11:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2019-11-24 01:11:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-11-24 01:11:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1464 transitions. [2019-11-24 01:11:46,697 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1464 transitions. Word has length 18 [2019-11-24 01:11:46,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:46,697 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1464 transitions. [2019-11-24 01:11:46,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1464 transitions. [2019-11-24 01:11:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 01:11:46,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:46,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:46,706 INFO L410 AbstractCegarLoop]: === Iteration 3 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:46,706 INFO L82 PathProgramCache]: Analyzing trace with hash 683677485, now seen corresponding path program 1 times [2019-11-24 01:11:46,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:46,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386725883] [2019-11-24 01:11:46,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:11:46,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386725883] [2019-11-24 01:11:46,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:46,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:46,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507235024] [2019-11-24 01:11:46,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:46,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:46,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:46,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:46,913 INFO L87 Difference]: Start difference. First operand 837 states and 1464 transitions. Second operand 3 states. [2019-11-24 01:11:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:46,953 INFO L93 Difference]: Finished difference Result 837 states and 1464 transitions. [2019-11-24 01:11:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:46,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 01:11:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:46,961 INFO L225 Difference]: With dead ends: 837 [2019-11-24 01:11:46,961 INFO L226 Difference]: Without dead ends: 835 [2019-11-24 01:11:46,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-11-24 01:11:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2019-11-24 01:11:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-11-24 01:11:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1462 transitions. [2019-11-24 01:11:47,015 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1462 transitions. Word has length 19 [2019-11-24 01:11:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:47,016 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1462 transitions. [2019-11-24 01:11:47,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1462 transitions. [2019-11-24 01:11:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 01:11:47,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:47,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:47,018 INFO L410 AbstractCegarLoop]: === Iteration 4 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash -280831762, now seen corresponding path program 1 times [2019-11-24 01:11:47,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:47,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615763979] [2019-11-24 01:11:47,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:11:47,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615763979] [2019-11-24 01:11:47,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:47,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:47,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991904143] [2019-11-24 01:11:47,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:47,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:47,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:47,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:47,177 INFO L87 Difference]: Start difference. First operand 835 states and 1462 transitions. Second operand 3 states. [2019-11-24 01:11:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:47,208 INFO L93 Difference]: Finished difference Result 835 states and 1462 transitions. [2019-11-24 01:11:47,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:47,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 01:11:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:47,214 INFO L225 Difference]: With dead ends: 835 [2019-11-24 01:11:47,214 INFO L226 Difference]: Without dead ends: 833 [2019-11-24 01:11:47,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-11-24 01:11:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2019-11-24 01:11:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-11-24 01:11:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1460 transitions. [2019-11-24 01:11:47,251 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1460 transitions. Word has length 20 [2019-11-24 01:11:47,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:47,252 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1460 transitions. [2019-11-24 01:11:47,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1460 transitions. [2019-11-24 01:11:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 01:11:47,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:47,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:47,255 INFO L410 AbstractCegarLoop]: === Iteration 5 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:47,255 INFO L82 PathProgramCache]: Analyzing trace with hash -115847337, now seen corresponding path program 1 times [2019-11-24 01:11:47,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:47,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135152927] [2019-11-24 01:11:47,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:11:47,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135152927] [2019-11-24 01:11:47,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:47,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:47,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112596601] [2019-11-24 01:11:47,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:47,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:47,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:47,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:47,403 INFO L87 Difference]: Start difference. First operand 833 states and 1460 transitions. Second operand 3 states. [2019-11-24 01:11:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:47,436 INFO L93 Difference]: Finished difference Result 833 states and 1460 transitions. [2019-11-24 01:11:47,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:47,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 01:11:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:47,443 INFO L225 Difference]: With dead ends: 833 [2019-11-24 01:11:47,444 INFO L226 Difference]: Without dead ends: 831 [2019-11-24 01:11:47,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-11-24 01:11:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2019-11-24 01:11:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-24 01:11:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1458 transitions. [2019-11-24 01:11:47,496 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1458 transitions. Word has length 21 [2019-11-24 01:11:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:47,497 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1458 transitions. [2019-11-24 01:11:47,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1458 transitions. [2019-11-24 01:11:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 01:11:47,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:47,500 INFO L410 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] [2019-11-24 01:11:47,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:47,501 INFO L82 PathProgramCache]: Analyzing trace with hash 703702552, now seen corresponding path program 1 times [2019-11-24 01:11:47,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:47,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543547432] [2019-11-24 01:11:47,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:11:47,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543547432] [2019-11-24 01:11:47,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:47,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:47,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025600312] [2019-11-24 01:11:47,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:47,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:47,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:47,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:47,717 INFO L87 Difference]: Start difference. First operand 831 states and 1458 transitions. Second operand 3 states. [2019-11-24 01:11:47,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:47,786 INFO L93 Difference]: Finished difference Result 1849 states and 3239 transitions. [2019-11-24 01:11:47,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:47,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 01:11:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:47,799 INFO L225 Difference]: With dead ends: 1849 [2019-11-24 01:11:47,800 INFO L226 Difference]: Without dead ends: 1014 [2019-11-24 01:11:47,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-11-24 01:11:47,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1009. [2019-11-24 01:11:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-11-24 01:11:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1753 transitions. [2019-11-24 01:11:47,875 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1753 transitions. Word has length 22 [2019-11-24 01:11:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:47,876 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1753 transitions. [2019-11-24 01:11:47,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1753 transitions. [2019-11-24 01:11:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 01:11:47,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:47,879 INFO L410 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] [2019-11-24 01:11:47,879 INFO L410 AbstractCegarLoop]: === Iteration 7 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:47,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1002069669, now seen corresponding path program 1 times [2019-11-24 01:11:47,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:47,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830112304] [2019-11-24 01:11:47,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:11:48,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830112304] [2019-11-24 01:11:48,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:48,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:48,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423413626] [2019-11-24 01:11:48,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:48,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:48,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:48,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:48,037 INFO L87 Difference]: Start difference. First operand 1009 states and 1753 transitions. Second operand 3 states. [2019-11-24 01:11:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:48,358 INFO L93 Difference]: Finished difference Result 1809 states and 3167 transitions. [2019-11-24 01:11:48,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:48,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-24 01:11:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:48,363 INFO L225 Difference]: With dead ends: 1809 [2019-11-24 01:11:48,364 INFO L226 Difference]: Without dead ends: 801 [2019-11-24 01:11:48,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-11-24 01:11:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2019-11-24 01:11:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-11-24 01:11:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1413 transitions. [2019-11-24 01:11:48,411 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1413 transitions. Word has length 56 [2019-11-24 01:11:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:48,413 INFO L462 AbstractCegarLoop]: Abstraction has 801 states and 1413 transitions. [2019-11-24 01:11:48,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1413 transitions. [2019-11-24 01:11:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-24 01:11:48,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:48,417 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:48,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1500678775, now seen corresponding path program 1 times [2019-11-24 01:11:48,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:48,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353429887] [2019-11-24 01:11:48,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 01:11:48,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353429887] [2019-11-24 01:11:48,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:48,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:11:48,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497117468] [2019-11-24 01:11:48,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:11:48,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:48,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:11:48,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:11:48,701 INFO L87 Difference]: Start difference. First operand 801 states and 1413 transitions. Second operand 4 states. [2019-11-24 01:11:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:48,809 INFO L93 Difference]: Finished difference Result 1465 states and 2581 transitions. [2019-11-24 01:11:48,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:11:48,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-24 01:11:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:48,815 INFO L225 Difference]: With dead ends: 1465 [2019-11-24 01:11:48,816 INFO L226 Difference]: Without dead ends: 811 [2019-11-24 01:11:48,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:11:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-11-24 01:11:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 808. [2019-11-24 01:11:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-11-24 01:11:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1420 transitions. [2019-11-24 01:11:48,861 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1420 transitions. Word has length 71 [2019-11-24 01:11:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:48,862 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1420 transitions. [2019-11-24 01:11:48,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:11:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1420 transitions. [2019-11-24 01:11:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 01:11:48,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:48,866 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:48,866 INFO L410 AbstractCegarLoop]: === Iteration 9 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:48,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:48,867 INFO L82 PathProgramCache]: Analyzing trace with hash -55267117, now seen corresponding path program 1 times [2019-11-24 01:11:48,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:48,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802976158] [2019-11-24 01:11:48,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 01:11:49,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802976158] [2019-11-24 01:11:49,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:49,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:11:49,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159112365] [2019-11-24 01:11:49,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:11:49,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:49,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:11:49,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:11:49,098 INFO L87 Difference]: Start difference. First operand 808 states and 1420 transitions. Second operand 4 states. [2019-11-24 01:11:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:49,197 INFO L93 Difference]: Finished difference Result 1481 states and 2597 transitions. [2019-11-24 01:11:49,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:11:49,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-24 01:11:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:49,203 INFO L225 Difference]: With dead ends: 1481 [2019-11-24 01:11:49,204 INFO L226 Difference]: Without dead ends: 820 [2019-11-24 01:11:49,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:11:49,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-11-24 01:11:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 813. [2019-11-24 01:11:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-24 01:11:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1425 transitions. [2019-11-24 01:11:49,252 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1425 transitions. Word has length 73 [2019-11-24 01:11:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:49,254 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1425 transitions. [2019-11-24 01:11:49,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:11:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1425 transitions. [2019-11-24 01:11:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 01:11:49,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:49,258 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:49,258 INFO L410 AbstractCegarLoop]: === Iteration 10 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1411667056, now seen corresponding path program 1 times [2019-11-24 01:11:49,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:49,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708606805] [2019-11-24 01:11:49,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 01:11:49,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708606805] [2019-11-24 01:11:49,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:49,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:11:49,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841990598] [2019-11-24 01:11:49,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:11:49,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:11:49,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:11:49,535 INFO L87 Difference]: Start difference. First operand 813 states and 1425 transitions. Second operand 4 states. [2019-11-24 01:11:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:49,625 INFO L93 Difference]: Finished difference Result 1493 states and 2609 transitions. [2019-11-24 01:11:49,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:11:49,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-24 01:11:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:49,631 INFO L225 Difference]: With dead ends: 1493 [2019-11-24 01:11:49,631 INFO L226 Difference]: Without dead ends: 827 [2019-11-24 01:11:49,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:11:49,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-11-24 01:11:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 818. [2019-11-24 01:11:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-11-24 01:11:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1430 transitions. [2019-11-24 01:11:49,676 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1430 transitions. Word has length 74 [2019-11-24 01:11:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:49,676 INFO L462 AbstractCegarLoop]: Abstraction has 818 states and 1430 transitions. [2019-11-24 01:11:49,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:11:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1430 transitions. [2019-11-24 01:11:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-24 01:11:49,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:49,679 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:49,679 INFO L410 AbstractCegarLoop]: === Iteration 11 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:49,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1057978421, now seen corresponding path program 1 times [2019-11-24 01:11:49,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:49,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978803936] [2019-11-24 01:11:49,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:49,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 01:11:49,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978803936] [2019-11-24 01:11:49,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:49,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:11:49,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887771515] [2019-11-24 01:11:49,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:49,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:49,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:49,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:49,921 INFO L87 Difference]: Start difference. First operand 818 states and 1430 transitions. Second operand 3 states. [2019-11-24 01:11:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:50,070 INFO L93 Difference]: Finished difference Result 1525 states and 2667 transitions. [2019-11-24 01:11:50,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:50,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-24 01:11:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:50,088 INFO L225 Difference]: With dead ends: 1525 [2019-11-24 01:11:50,088 INFO L226 Difference]: Without dead ends: 854 [2019-11-24 01:11:50,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-11-24 01:11:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 822. [2019-11-24 01:11:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-24 01:11:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1434 transitions. [2019-11-24 01:11:50,154 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1434 transitions. Word has length 76 [2019-11-24 01:11:50,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:50,158 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1434 transitions. [2019-11-24 01:11:50,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1434 transitions. [2019-11-24 01:11:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-24 01:11:50,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:50,171 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:50,174 INFO L410 AbstractCegarLoop]: === Iteration 12 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:50,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash 839366297, now seen corresponding path program 1 times [2019-11-24 01:11:50,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:50,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681733322] [2019-11-24 01:11:50,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-24 01:11:50,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681733322] [2019-11-24 01:11:50,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:50,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:11:50,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870466214] [2019-11-24 01:11:50,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:11:50,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:50,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:11:50,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:11:50,500 INFO L87 Difference]: Start difference. First operand 822 states and 1434 transitions. Second operand 4 states. [2019-11-24 01:11:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:50,708 INFO L93 Difference]: Finished difference Result 1524 states and 2654 transitions. [2019-11-24 01:11:50,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:11:50,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-24 01:11:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:50,713 INFO L225 Difference]: With dead ends: 1524 [2019-11-24 01:11:50,714 INFO L226 Difference]: Without dead ends: 849 [2019-11-24 01:11:50,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:11:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2019-11-24 01:11:50,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 828. [2019-11-24 01:11:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-11-24 01:11:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1440 transitions. [2019-11-24 01:11:50,760 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1440 transitions. Word has length 79 [2019-11-24 01:11:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:50,760 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1440 transitions. [2019-11-24 01:11:50,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:11:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1440 transitions. [2019-11-24 01:11:50,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-24 01:11:50,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:50,763 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:50,766 INFO L410 AbstractCegarLoop]: === Iteration 13 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:50,767 INFO L82 PathProgramCache]: Analyzing trace with hash -173370337, now seen corresponding path program 1 times [2019-11-24 01:11:50,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:50,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864777696] [2019-11-24 01:11:50,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-24 01:11:51,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864777696] [2019-11-24 01:11:51,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:51,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:11:51,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999451053] [2019-11-24 01:11:51,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:11:51,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:51,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:11:51,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:11:51,061 INFO L87 Difference]: Start difference. First operand 828 states and 1440 transitions. Second operand 4 states. [2019-11-24 01:11:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:51,399 INFO L93 Difference]: Finished difference Result 1532 states and 2660 transitions. [2019-11-24 01:11:51,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:11:51,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-24 01:11:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:51,408 INFO L225 Difference]: With dead ends: 1532 [2019-11-24 01:11:51,408 INFO L226 Difference]: Without dead ends: 851 [2019-11-24 01:11:51,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:11:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-11-24 01:11:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 832. [2019-11-24 01:11:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2019-11-24 01:11:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1444 transitions. [2019-11-24 01:11:51,470 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1444 transitions. Word has length 82 [2019-11-24 01:11:51,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:51,471 INFO L462 AbstractCegarLoop]: Abstraction has 832 states and 1444 transitions. [2019-11-24 01:11:51,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:11:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1444 transitions. [2019-11-24 01:11:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-24 01:11:51,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:51,478 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:51,479 INFO L410 AbstractCegarLoop]: === Iteration 14 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:51,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash -214454267, now seen corresponding path program 1 times [2019-11-24 01:11:51,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:51,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838626981] [2019-11-24 01:11:51,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-24 01:11:51,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838626981] [2019-11-24 01:11:51,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:51,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:11:51,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413444027] [2019-11-24 01:11:51,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:11:51,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:51,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:11:51,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:11:51,943 INFO L87 Difference]: Start difference. First operand 832 states and 1444 transitions. Second operand 4 states. [2019-11-24 01:11:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:52,178 INFO L93 Difference]: Finished difference Result 1527 states and 2644 transitions. [2019-11-24 01:11:52,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:11:52,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-24 01:11:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:52,184 INFO L225 Difference]: With dead ends: 1527 [2019-11-24 01:11:52,185 INFO L226 Difference]: Without dead ends: 842 [2019-11-24 01:11:52,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:11:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-11-24 01:11:52,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 836. [2019-11-24 01:11:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-11-24 01:11:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1448 transitions. [2019-11-24 01:11:52,229 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1448 transitions. Word has length 85 [2019-11-24 01:11:52,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:52,229 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1448 transitions. [2019-11-24 01:11:52,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:11:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1448 transitions. [2019-11-24 01:11:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-24 01:11:52,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:52,232 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:52,232 INFO L410 AbstractCegarLoop]: === Iteration 15 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:52,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:52,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1363030886, now seen corresponding path program 1 times [2019-11-24 01:11:52,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:52,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758960987] [2019-11-24 01:11:52,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-24 01:11:52,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758960987] [2019-11-24 01:11:52,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:52,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:11:52,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646494003] [2019-11-24 01:11:52,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:52,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:52,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:52,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:52,576 INFO L87 Difference]: Start difference. First operand 836 states and 1448 transitions. Second operand 3 states. [2019-11-24 01:11:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:54,066 INFO L93 Difference]: Finished difference Result 1001 states and 1703 transitions. [2019-11-24 01:11:54,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:54,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-24 01:11:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:54,071 INFO L225 Difference]: With dead ends: 1001 [2019-11-24 01:11:54,072 INFO L226 Difference]: Without dead ends: 828 [2019-11-24 01:11:54,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-11-24 01:11:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 821. [2019-11-24 01:11:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-11-24 01:11:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1429 transitions. [2019-11-24 01:11:54,111 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1429 transitions. Word has length 88 [2019-11-24 01:11:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:54,111 INFO L462 AbstractCegarLoop]: Abstraction has 821 states and 1429 transitions. [2019-11-24 01:11:54,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1429 transitions. [2019-11-24 01:11:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-24 01:11:54,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:54,115 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:54,115 INFO L410 AbstractCegarLoop]: === Iteration 16 === [backlight_update_statusErr1ASSERT_VIOLATIONERROR_FUNCTION, backlight_update_statusErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1113932284, now seen corresponding path program 1 times [2019-11-24 01:11:54,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:54,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719587216] [2019-11-24 01:11:54,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY