/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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 03:35:53,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 03:35:53,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 03:35:53,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 03:35:53,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 03:35:53,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 03:35:53,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 03:35:53,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 03:35:53,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 03:35:53,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 03:35:53,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 03:35:53,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 03:35:53,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 03:35:53,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 03:35:53,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 03:35:53,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 03:35:53,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 03:35:53,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 03:35:53,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 03:35:53,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 03:35:53,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 03:35:53,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 03:35:53,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 03:35:53,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 03:35:53,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 03:35:53,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 03:35:53,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 03:35:53,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 03:35:53,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 03:35:53,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 03:35:53,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 03:35:53,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 03:35:53,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 03:35:53,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 03:35:53,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 03:35:53,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 03:35:53,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 03:35:53,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 03:35:53,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 03:35:53,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 03:35:53,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 03:35:53,428 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 03:35:53,443 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 03:35:53,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 03:35:53,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 03:35:53,444 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 03:35:53,444 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 03:35:53,444 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 03:35:53,445 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 03:35:53,445 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 03:35:53,445 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 03:35:53,445 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 03:35:53,445 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 03:35:53,445 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 03:35:53,446 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 03:35:53,446 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 03:35:53,446 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 03:35:53,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 03:35:53,447 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 03:35:53,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 03:35:53,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 03:35:53,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 03:35:53,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 03:35:53,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 03:35:53,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 03:35:53,448 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 03:35:53,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 03:35:53,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 03:35:53,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 03:35:53,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 03:35:53,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 03:35:53,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 03:35:53,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 03:35:53,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 03:35:53,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 03:35:53,450 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 03:35:53,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 03:35:53,451 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 03:35:53,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 03:35:53,451 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 03:35:53,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 03:35:53,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 03:35:53,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 03:35:53,743 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 03:35:53,743 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 03:35:53,744 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2019-11-24 03:35:53,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2006a7e/00bb5f1db691422b86cf1cd1773b07b2/FLAG33bad3e4f [2019-11-24 03:35:54,535 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 03:35:54,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2019-11-24 03:35:54,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2006a7e/00bb5f1db691422b86cf1cd1773b07b2/FLAG33bad3e4f [2019-11-24 03:35:55,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2006a7e/00bb5f1db691422b86cf1cd1773b07b2 [2019-11-24 03:35:55,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 03:35:55,097 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 03:35:55,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 03:35:55,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 03:35:55,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 03:35:55,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:35:55" (1/1) ... [2019-11-24 03:35:55,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c58a14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:55, skipping insertion in model container [2019-11-24 03:35:55,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:35:55" (1/1) ... [2019-11-24 03:35:55,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 03:35:55,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 03:35:56,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:35:56,631 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 03:35:56,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:35:57,066 INFO L208 MainTranslator]: Completed translation [2019-11-24 03:35:57,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57 WrapperNode [2019-11-24 03:35:57,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 03:35:57,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 03:35:57,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 03:35:57,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 03:35:57,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57" (1/1) ... [2019-11-24 03:35:57,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57" (1/1) ... [2019-11-24 03:35:57,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 03:35:57,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 03:35:57,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 03:35:57,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 03:35:57,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57" (1/1) ... [2019-11-24 03:35:57,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57" (1/1) ... [2019-11-24 03:35:57,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57" (1/1) ... [2019-11-24 03:35:57,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57" (1/1) ... [2019-11-24 03:35:57,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57" (1/1) ... [2019-11-24 03:35:57,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57" (1/1) ... [2019-11-24 03:35:57,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57" (1/1) ... [2019-11-24 03:35:57,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 03:35:57,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 03:35:57,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 03:35:57,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 03:35:57,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57" (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 03:35:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2019-11-24 03:35:57,564 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2019-11-24 03:35:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 03:35:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 03:35:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2019-11-24 03:35:57,565 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2019-11-24 03:35:57,565 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_disconnect [2019-11-24 03:35:57,565 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_disconnect [2019-11-24 03:35:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 03:35:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 03:35:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 03:35:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-24 03:35:57,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-24 03:35:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 03:35:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2019-11-24 03:35:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 03:35:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 03:35:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 03:35:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 03:35:57,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 03:36:08,199 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 03:36:08,199 INFO L284 CfgBuilder]: Removed 461 assume(true) statements. [2019-11-24 03:36:08,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:36:08 BoogieIcfgContainer [2019-11-24 03:36:08,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 03:36:08,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 03:36:08,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 03:36:08,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 03:36:08,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 03:35:55" (1/3) ... [2019-11-24 03:36:08,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a5097e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:36:08, skipping insertion in model container [2019-11-24 03:36:08,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:35:57" (2/3) ... [2019-11-24 03:36:08,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a5097e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:36:08, skipping insertion in model container [2019-11-24 03:36:08,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:36:08" (3/3) ... [2019-11-24 03:36:08,208 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2019-11-24 03:36:08,216 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 03:36:08,222 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-24 03:36:08,230 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-24 03:36:08,255 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 03:36:08,256 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 03:36:08,256 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 03:36:08,256 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 03:36:08,256 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 03:36:08,256 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 03:36:08,256 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 03:36:08,256 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 03:36:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2019-11-24 03:36:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 03:36:08,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:08,288 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] [2019-11-24 03:36:08,289 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:08,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:08,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1374145613, now seen corresponding path program 1 times [2019-11-24 03:36:08,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:08,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397173751] [2019-11-24 03:36:08,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:08,792 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 03:36:08,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397173751] [2019-11-24 03:36:08,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:08,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:36:08,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860375348] [2019-11-24 03:36:08,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:08,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:08,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:08,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:08,816 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 3 states. [2019-11-24 03:36:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:09,044 INFO L93 Difference]: Finished difference Result 525 states and 820 transitions. [2019-11-24 03:36:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:09,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 03:36:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:09,061 INFO L225 Difference]: With dead ends: 525 [2019-11-24 03:36:09,061 INFO L226 Difference]: Without dead ends: 339 [2019-11-24 03:36:09,066 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 03:36:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-11-24 03:36:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 319. [2019-11-24 03:36:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-24 03:36:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 484 transitions. [2019-11-24 03:36:09,144 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 484 transitions. Word has length 23 [2019-11-24 03:36:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:09,145 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 484 transitions. [2019-11-24 03:36:09,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:09,145 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 484 transitions. [2019-11-24 03:36:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 03:36:09,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:09,147 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] [2019-11-24 03:36:09,147 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:09,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1862132327, now seen corresponding path program 1 times [2019-11-24 03:36:09,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:09,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109930991] [2019-11-24 03:36:09,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:09,351 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 03:36:09,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109930991] [2019-11-24 03:36:09,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:09,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:36:09,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129868846] [2019-11-24 03:36:09,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:09,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:09,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:09,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:09,355 INFO L87 Difference]: Start difference. First operand 319 states and 484 transitions. Second operand 3 states. [2019-11-24 03:36:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:09,511 INFO L93 Difference]: Finished difference Result 751 states and 1128 transitions. [2019-11-24 03:36:09,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:09,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 03:36:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:09,517 INFO L225 Difference]: With dead ends: 751 [2019-11-24 03:36:09,518 INFO L226 Difference]: Without dead ends: 447 [2019-11-24 03:36:09,521 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 03:36:09,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-24 03:36:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 419. [2019-11-24 03:36:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-24 03:36:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 640 transitions. [2019-11-24 03:36:09,566 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 640 transitions. Word has length 24 [2019-11-24 03:36:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:09,567 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 640 transitions. [2019-11-24 03:36:09,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 640 transitions. [2019-11-24 03:36:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 03:36:09,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:09,569 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] [2019-11-24 03:36:09,569 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:09,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:09,570 INFO L82 PathProgramCache]: Analyzing trace with hash 485111250, now seen corresponding path program 1 times [2019-11-24 03:36:09,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:09,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494782762] [2019-11-24 03:36:09,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:09,689 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 03:36:09,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494782762] [2019-11-24 03:36:09,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:09,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:36:09,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330565112] [2019-11-24 03:36:09,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:09,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:09,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:09,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:09,691 INFO L87 Difference]: Start difference. First operand 419 states and 640 transitions. Second operand 3 states. [2019-11-24 03:36:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:09,811 INFO L93 Difference]: Finished difference Result 818 states and 1216 transitions. [2019-11-24 03:36:09,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:09,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 03:36:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:09,822 INFO L225 Difference]: With dead ends: 818 [2019-11-24 03:36:09,822 INFO L226 Difference]: Without dead ends: 414 [2019-11-24 03:36:09,826 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 03:36:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-11-24 03:36:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 386. [2019-11-24 03:36:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-11-24 03:36:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 583 transitions. [2019-11-24 03:36:09,894 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 583 transitions. Word has length 24 [2019-11-24 03:36:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:09,894 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 583 transitions. [2019-11-24 03:36:09,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 583 transitions. [2019-11-24 03:36:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 03:36:09,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:09,901 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] [2019-11-24 03:36:09,901 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:09,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1658045759, now seen corresponding path program 1 times [2019-11-24 03:36:09,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:09,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941693065] [2019-11-24 03:36:09,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:10,035 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 03:36:10,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941693065] [2019-11-24 03:36:10,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:10,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:36:10,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607798611] [2019-11-24 03:36:10,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:10,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:10,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:10,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:10,038 INFO L87 Difference]: Start difference. First operand 386 states and 583 transitions. Second operand 3 states. [2019-11-24 03:36:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:10,055 INFO L93 Difference]: Finished difference Result 386 states and 583 transitions. [2019-11-24 03:36:10,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:10,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 03:36:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:10,060 INFO L225 Difference]: With dead ends: 386 [2019-11-24 03:36:10,060 INFO L226 Difference]: Without dead ends: 384 [2019-11-24 03:36:10,061 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 03:36:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-24 03:36:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-11-24 03:36:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-24 03:36:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 581 transitions. [2019-11-24 03:36:10,084 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 581 transitions. Word has length 27 [2019-11-24 03:36:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:10,084 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 581 transitions. [2019-11-24 03:36:10,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 581 transitions. [2019-11-24 03:36:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 03:36:10,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:10,086 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] [2019-11-24 03:36:10,086 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:10,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash 140196376, now seen corresponding path program 1 times [2019-11-24 03:36:10,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:10,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634050575] [2019-11-24 03:36:10,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:10,296 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 03:36:10,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634050575] [2019-11-24 03:36:10,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:10,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:36:10,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251041055] [2019-11-24 03:36:10,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:10,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:10,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:10,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:10,299 INFO L87 Difference]: Start difference. First operand 384 states and 581 transitions. Second operand 3 states. [2019-11-24 03:36:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:10,316 INFO L93 Difference]: Finished difference Result 384 states and 581 transitions. [2019-11-24 03:36:10,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:10,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 03:36:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:10,320 INFO L225 Difference]: With dead ends: 384 [2019-11-24 03:36:10,320 INFO L226 Difference]: Without dead ends: 382 [2019-11-24 03:36:10,321 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 03:36:10,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-24 03:36:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-11-24 03:36:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-24 03:36:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 579 transitions. [2019-11-24 03:36:10,342 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 579 transitions. Word has length 28 [2019-11-24 03:36:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:10,342 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 579 transitions. [2019-11-24 03:36:10,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 579 transitions. [2019-11-24 03:36:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 03:36:10,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:10,344 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] [2019-11-24 03:36:10,344 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:10,345 INFO L82 PathProgramCache]: Analyzing trace with hash 51127723, now seen corresponding path program 1 times [2019-11-24 03:36:10,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:10,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188096810] [2019-11-24 03:36:10,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:10,467 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 03:36:10,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188096810] [2019-11-24 03:36:10,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:10,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:36:10,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4572454] [2019-11-24 03:36:10,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:10,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:10,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:10,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:10,472 INFO L87 Difference]: Start difference. First operand 382 states and 579 transitions. Second operand 3 states. [2019-11-24 03:36:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:10,492 INFO L93 Difference]: Finished difference Result 382 states and 579 transitions. [2019-11-24 03:36:10,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:10,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-24 03:36:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:10,502 INFO L225 Difference]: With dead ends: 382 [2019-11-24 03:36:10,502 INFO L226 Difference]: Without dead ends: 380 [2019-11-24 03:36:10,510 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 03:36:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-24 03:36:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-11-24 03:36:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-11-24 03:36:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 577 transitions. [2019-11-24 03:36:10,539 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 577 transitions. Word has length 29 [2019-11-24 03:36:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:10,540 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 577 transitions. [2019-11-24 03:36:10,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 577 transitions. [2019-11-24 03:36:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 03:36:10,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:10,546 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] [2019-11-24 03:36:10,546 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:10,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1584966786, now seen corresponding path program 1 times [2019-11-24 03:36:10,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:10,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724904827] [2019-11-24 03:36:10,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:10,685 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 03:36:10,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724904827] [2019-11-24 03:36:10,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:10,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:36:10,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713476504] [2019-11-24 03:36:10,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:10,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:10,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:10,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:10,687 INFO L87 Difference]: Start difference. First operand 380 states and 577 transitions. Second operand 3 states. [2019-11-24 03:36:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:10,829 INFO L93 Difference]: Finished difference Result 626 states and 963 transitions. [2019-11-24 03:36:10,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:10,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-24 03:36:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:10,834 INFO L225 Difference]: With dead ends: 626 [2019-11-24 03:36:10,835 INFO L226 Difference]: Without dead ends: 610 [2019-11-24 03:36:10,835 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 03:36:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-24 03:36:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-11-24 03:36:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-24 03:36:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 935 transitions. [2019-11-24 03:36:10,870 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 935 transitions. Word has length 30 [2019-11-24 03:36:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:10,870 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 935 transitions. [2019-11-24 03:36:10,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 935 transitions. [2019-11-24 03:36:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 03:36:10,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:10,872 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:36:10,872 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash 270233557, now seen corresponding path program 1 times [2019-11-24 03:36:10,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:10,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541178628] [2019-11-24 03:36:10,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:36:11,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541178628] [2019-11-24 03:36:11,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:11,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:36:11,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587776664] [2019-11-24 03:36:11,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:36:11,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:11,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:36:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:36:11,043 INFO L87 Difference]: Start difference. First operand 610 states and 935 transitions. Second operand 4 states. [2019-11-24 03:36:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:11,333 INFO L93 Difference]: Finished difference Result 614 states and 943 transitions. [2019-11-24 03:36:11,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:36:11,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-24 03:36:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:11,340 INFO L225 Difference]: With dead ends: 614 [2019-11-24 03:36:11,341 INFO L226 Difference]: Without dead ends: 610 [2019-11-24 03:36:11,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:36:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-24 03:36:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 606. [2019-11-24 03:36:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-11-24 03:36:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 930 transitions. [2019-11-24 03:36:11,378 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 930 transitions. Word has length 38 [2019-11-24 03:36:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:11,378 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 930 transitions. [2019-11-24 03:36:11,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:36:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 930 transitions. [2019-11-24 03:36:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 03:36:11,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:11,381 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:36:11,382 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:11,382 INFO L82 PathProgramCache]: Analyzing trace with hash -334884697, now seen corresponding path program 1 times [2019-11-24 03:36:11,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:11,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552802854] [2019-11-24 03:36:11,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 03:36:11,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552802854] [2019-11-24 03:36:11,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:11,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:36:11,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991203887] [2019-11-24 03:36:11,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:36:11,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:11,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:36:11,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:36:11,605 INFO L87 Difference]: Start difference. First operand 606 states and 930 transitions. Second operand 4 states. [2019-11-24 03:36:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:11,811 INFO L93 Difference]: Finished difference Result 845 states and 1309 transitions. [2019-11-24 03:36:11,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:36:11,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-24 03:36:11,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:11,817 INFO L225 Difference]: With dead ends: 845 [2019-11-24 03:36:11,817 INFO L226 Difference]: Without dead ends: 829 [2019-11-24 03:36:11,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:36:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-11-24 03:36:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 814. [2019-11-24 03:36:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-11-24 03:36:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1263 transitions. [2019-11-24 03:36:11,864 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1263 transitions. Word has length 50 [2019-11-24 03:36:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:11,865 INFO L462 AbstractCegarLoop]: Abstraction has 814 states and 1263 transitions. [2019-11-24 03:36:11,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:36:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1263 transitions. [2019-11-24 03:36:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 03:36:11,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:11,867 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 03:36:11,867 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:11,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:11,868 INFO L82 PathProgramCache]: Analyzing trace with hash 258909520, now seen corresponding path program 1 times [2019-11-24 03:36:11,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:11,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236464343] [2019-11-24 03:36:11,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 03:36:12,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236464343] [2019-11-24 03:36:12,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:12,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:36:12,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192436846] [2019-11-24 03:36:12,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:12,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:12,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:12,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:12,005 INFO L87 Difference]: Start difference. First operand 814 states and 1263 transitions. Second operand 3 states. [2019-11-24 03:36:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:12,319 INFO L93 Difference]: Finished difference Result 1889 states and 2954 transitions. [2019-11-24 03:36:12,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:12,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-24 03:36:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:12,327 INFO L225 Difference]: With dead ends: 1889 [2019-11-24 03:36:12,327 INFO L226 Difference]: Without dead ends: 1103 [2019-11-24 03:36:12,329 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 03:36:12,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-11-24 03:36:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 981. [2019-11-24 03:36:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-24 03:36:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1527 transitions. [2019-11-24 03:36:12,394 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1527 transitions. Word has length 57 [2019-11-24 03:36:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:12,395 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1527 transitions. [2019-11-24 03:36:12,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1527 transitions. [2019-11-24 03:36:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 03:36:12,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:12,399 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 03:36:12,400 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:12,400 INFO L82 PathProgramCache]: Analyzing trace with hash 258092799, now seen corresponding path program 1 times [2019-11-24 03:36:12,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:12,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545897228] [2019-11-24 03:36:12,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 03:36:12,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545897228] [2019-11-24 03:36:12,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:12,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:36:12,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882669885] [2019-11-24 03:36:12,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:36:12,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:12,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:36:12,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:36:12,643 INFO L87 Difference]: Start difference. First operand 981 states and 1527 transitions. Second operand 4 states. [2019-11-24 03:36:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:13,081 INFO L93 Difference]: Finished difference Result 1264 states and 2002 transitions. [2019-11-24 03:36:13,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:36:13,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-24 03:36:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:13,089 INFO L225 Difference]: With dead ends: 1264 [2019-11-24 03:36:13,089 INFO L226 Difference]: Without dead ends: 1260 [2019-11-24 03:36:13,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:36:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-11-24 03:36:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 977. [2019-11-24 03:36:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-24 03:36:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1521 transitions. [2019-11-24 03:36:13,143 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1521 transitions. Word has length 57 [2019-11-24 03:36:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:13,143 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1521 transitions. [2019-11-24 03:36:13,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:36:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1521 transitions. [2019-11-24 03:36:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 03:36:13,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:13,145 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 03:36:13,145 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:13,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:13,146 INFO L82 PathProgramCache]: Analyzing trace with hash -52186226, now seen corresponding path program 1 times [2019-11-24 03:36:13,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:13,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199661121] [2019-11-24 03:36:13,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 03:36:13,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199661121] [2019-11-24 03:36:13,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:13,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:36:13,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38680830] [2019-11-24 03:36:13,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:36:13,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:13,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:36:13,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:36:13,316 INFO L87 Difference]: Start difference. First operand 977 states and 1521 transitions. Second operand 4 states. [2019-11-24 03:36:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:13,643 INFO L93 Difference]: Finished difference Result 1290 states and 2040 transitions. [2019-11-24 03:36:13,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:36:13,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-24 03:36:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:13,651 INFO L225 Difference]: With dead ends: 1290 [2019-11-24 03:36:13,651 INFO L226 Difference]: Without dead ends: 1288 [2019-11-24 03:36:13,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:36:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-11-24 03:36:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 975. [2019-11-24 03:36:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-11-24 03:36:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1518 transitions. [2019-11-24 03:36:13,706 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1518 transitions. Word has length 63 [2019-11-24 03:36:13,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:13,707 INFO L462 AbstractCegarLoop]: Abstraction has 975 states and 1518 transitions. [2019-11-24 03:36:13,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:36:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1518 transitions. [2019-11-24 03:36:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 03:36:13,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:13,709 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-11-24 03:36:13,709 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:13,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:13,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2127726044, now seen corresponding path program 1 times [2019-11-24 03:36:13,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:13,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26538853] [2019-11-24 03:36:13,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 03:36:13,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26538853] [2019-11-24 03:36:13,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:13,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:36:13,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455581623] [2019-11-24 03:36:13,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:36:13,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:36:13,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:36:13,867 INFO L87 Difference]: Start difference. First operand 975 states and 1518 transitions. Second operand 4 states. [2019-11-24 03:36:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:14,063 INFO L93 Difference]: Finished difference Result 1453 states and 2257 transitions. [2019-11-24 03:36:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:36:14,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-24 03:36:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:14,072 INFO L225 Difference]: With dead ends: 1453 [2019-11-24 03:36:14,072 INFO L226 Difference]: Without dead ends: 1437 [2019-11-24 03:36:14,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:36:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2019-11-24 03:36:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 971. [2019-11-24 03:36:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-11-24 03:36:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1514 transitions. [2019-11-24 03:36:14,142 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1514 transitions. Word has length 64 [2019-11-24 03:36:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:14,142 INFO L462 AbstractCegarLoop]: Abstraction has 971 states and 1514 transitions. [2019-11-24 03:36:14,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:36:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1514 transitions. [2019-11-24 03:36:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 03:36:14,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:14,144 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-11-24 03:36:14,144 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash 182805019, now seen corresponding path program 1 times [2019-11-24 03:36:14,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:14,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484585599] [2019-11-24 03:36:14,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-24 03:36:15,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484585599] [2019-11-24 03:36:15,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:15,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:36:15,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507114017] [2019-11-24 03:36:15,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:15,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:15,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:15,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:15,128 INFO L87 Difference]: Start difference. First operand 971 states and 1514 transitions. Second operand 3 states. [2019-11-24 03:36:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:15,251 INFO L93 Difference]: Finished difference Result 1953 states and 3051 transitions. [2019-11-24 03:36:15,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:15,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-24 03:36:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:15,257 INFO L225 Difference]: With dead ends: 1953 [2019-11-24 03:36:15,257 INFO L226 Difference]: Without dead ends: 984 [2019-11-24 03:36:15,260 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 03:36:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-11-24 03:36:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2019-11-24 03:36:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-11-24 03:36:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1527 transitions. [2019-11-24 03:36:15,320 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1527 transitions. Word has length 69 [2019-11-24 03:36:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:15,321 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1527 transitions. [2019-11-24 03:36:15,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1527 transitions. [2019-11-24 03:36:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 03:36:15,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:15,328 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 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 03:36:15,328 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:15,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash 987421204, now seen corresponding path program 1 times [2019-11-24 03:36:15,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:15,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380194340] [2019-11-24 03:36:15,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-24 03:36:16,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380194340] [2019-11-24 03:36:16,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:16,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:36:16,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579460863] [2019-11-24 03:36:16,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:16,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:16,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:16,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:16,402 INFO L87 Difference]: Start difference. First operand 984 states and 1527 transitions. Second operand 3 states. [2019-11-24 03:36:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:16,556 INFO L93 Difference]: Finished difference Result 1964 states and 3048 transitions. [2019-11-24 03:36:16,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:16,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-24 03:36:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:16,563 INFO L225 Difference]: With dead ends: 1964 [2019-11-24 03:36:16,563 INFO L226 Difference]: Without dead ends: 985 [2019-11-24 03:36:16,567 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 03:36:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-11-24 03:36:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2019-11-24 03:36:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-11-24 03:36:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1528 transitions. [2019-11-24 03:36:16,628 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1528 transitions. Word has length 73 [2019-11-24 03:36:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:16,629 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 1528 transitions. [2019-11-24 03:36:16,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1528 transitions. [2019-11-24 03:36:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 03:36:16,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:16,631 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-11-24 03:36:16,631 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:16,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:16,632 INFO L82 PathProgramCache]: Analyzing trace with hash 531146331, now seen corresponding path program 1 times [2019-11-24 03:36:16,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:16,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351295160] [2019-11-24 03:36:16,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-24 03:36:17,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351295160] [2019-11-24 03:36:17,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:17,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:36:17,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452704395] [2019-11-24 03:36:17,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:17,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:17,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:17,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:17,436 INFO L87 Difference]: Start difference. First operand 985 states and 1528 transitions. Second operand 3 states. [2019-11-24 03:36:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:17,635 INFO L93 Difference]: Finished difference Result 1970 states and 3058 transitions. [2019-11-24 03:36:17,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:17,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-24 03:36:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:17,641 INFO L225 Difference]: With dead ends: 1970 [2019-11-24 03:36:17,641 INFO L226 Difference]: Without dead ends: 989 [2019-11-24 03:36:17,643 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 03:36:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-11-24 03:36:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2019-11-24 03:36:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-11-24 03:36:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1532 transitions. [2019-11-24 03:36:17,705 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1532 transitions. Word has length 74 [2019-11-24 03:36:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:17,705 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 1532 transitions. [2019-11-24 03:36:17,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1532 transitions. [2019-11-24 03:36:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-24 03:36:17,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:17,707 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 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 03:36:17,708 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1170240303, now seen corresponding path program 1 times [2019-11-24 03:36:17,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:17,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025012030] [2019-11-24 03:36:17,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-24 03:36:18,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025012030] [2019-11-24 03:36:18,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:36:18,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:36:18,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385305789] [2019-11-24 03:36:18,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:36:18,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:36:18,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:36:18,362 INFO L87 Difference]: Start difference. First operand 989 states and 1532 transitions. Second operand 3 states. [2019-11-24 03:36:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:18,500 INFO L93 Difference]: Finished difference Result 1970 states and 3055 transitions. [2019-11-24 03:36:18,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:36:18,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-24 03:36:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:18,506 INFO L225 Difference]: With dead ends: 1970 [2019-11-24 03:36:18,506 INFO L226 Difference]: Without dead ends: 996 [2019-11-24 03:36:18,509 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 03:36:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2019-11-24 03:36:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 996. [2019-11-24 03:36:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-11-24 03:36:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1539 transitions. [2019-11-24 03:36:18,640 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1539 transitions. Word has length 78 [2019-11-24 03:36:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:18,641 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1539 transitions. [2019-11-24 03:36:18,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:36:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1539 transitions. [2019-11-24 03:36:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-24 03:36:18,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:36:18,643 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-11-24 03:36:18,643 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION, serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:36:18,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:36:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash -135444158, now seen corresponding path program 1 times [2019-11-24 03:36:18,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:36:18,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88510424] [2019-11-24 03:36:18,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:36:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-24 03:36:19,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88510424] [2019-11-24 03:36:19,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005990263] [2019-11-24 03:36:19,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:36:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:36:20,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 2005 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-24 03:36:20,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 03:36:20,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 03:36:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-24 03:36:20,301 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 03:36:20,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 03:36:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-24 03:36:20,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 03:36:20,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-11-24 03:36:20,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736659905] [2019-11-24 03:36:20,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 03:36:20,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:36:20,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 03:36:20,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 03:36:20,342 INFO L87 Difference]: Start difference. First operand 996 states and 1539 transitions. Second operand 5 states. [2019-11-24 03:36:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:36:20,835 INFO L93 Difference]: Finished difference Result 1264 states and 1939 transitions. [2019-11-24 03:36:20,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 03:36:20,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-24 03:36:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:36:20,837 INFO L225 Difference]: With dead ends: 1264 [2019-11-24 03:36:20,837 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 03:36:20,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-24 03:36:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 03:36:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 03:36:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 03:36:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 03:36:20,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2019-11-24 03:36:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:36:20,841 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 03:36:20,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 03:36:20,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 03:36:20,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 03:36:21,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:36:21,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 03:36:22,229 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 20 [2019-11-24 03:36:22,375 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-11-24 03:36:22,507 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-11-24 03:36:22,630 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-11-24 03:36:23,030 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-11-24 03:36:23,166 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-11-24 03:36:23,951 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-11-24 03:36:25,697 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-11-24 03:36:25,812 INFO L444 ceAbstractionStarter]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2019-11-24 03:36:25,812 INFO L440 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|))) (.cse1 (not (= 1 ~ldv_mutex_lock~0))) (.cse2 (not (= 1 ~ldv_mutex_mutex_of_device~0))) (.cse3 (not (= 1 ~ldv_mutex_i_mutex_of_inode~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 1) (not (= 1 |old(~ldv_state_variable_2~0)|))) (or (not (= 0 |old(~ldv_state_variable_2~0)|)) .cse0 .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse3) (or (= 1 ~ldv_mutex_serio_raw_mutex~0) .cse0 .cse1 .cse2 .cse3))) [2019-11-24 03:36:25,813 INFO L440 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: (or (= 1 ~ldv_mutex_serio_raw_mutex~0) (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|)) (not (= 1 ~ldv_mutex_lock~0)) (not (= 1 ~ldv_mutex_mutex_of_device~0)) (not (= 1 ~ldv_mutex_i_mutex_of_inode~0))) [2019-11-24 03:36:25,813 INFO L440 ceAbstractionStarter]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: (let ((.cse0 (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|))) (.cse1 (not (= 1 ~ldv_mutex_lock~0))) (.cse2 (not (= 1 ~ldv_mutex_mutex_of_device~0))) (.cse3 (not (= 1 ~ldv_mutex_i_mutex_of_inode~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 1) (not (= 1 |old(~ldv_state_variable_2~0)|))) (or (not (= 0 |old(~ldv_state_variable_2~0)|)) .cse0 .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse3) (or (= 1 ~ldv_mutex_serio_raw_mutex~0) .cse0 .cse1 .cse2 .cse3))) [2019-11-24 03:36:25,813 INFO L440 ceAbstractionStarter]: At program point L5347(lines 1 5349) the Hoare annotation is: (let ((.cse5 (= 1 ~ldv_mutex_serio_raw_mutex~0)) (.cse7 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse6 (= 1 ~ldv_mutex_lock~0))) (let ((.cse0 (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|))) (.cse1 (not .cse6)) (.cse2 (not .cse7)) (.cse3 (not (= 1 ~ldv_mutex_i_mutex_of_inode~0))) (.cse4 (and .cse6 .cse5 (= ~ldv_state_variable_2~0 0) .cse7))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 1) .cse4 (not (= 1 |old(~ldv_state_variable_2~0)|))) (or .cse5 .cse0 .cse1 .cse2 .cse3) (or (not (= 0 |old(~ldv_state_variable_2~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4)))) [2019-11-24 03:36:25,814 INFO L440 ceAbstractionStarter]: At program point L3999(lines 3999 4002) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,814 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,814 INFO L440 ceAbstractionStarter]: At program point L4264(lines 4264 4269) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,815 INFO L440 ceAbstractionStarter]: At program point L3802-2(lines 3802 3824) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,815 INFO L444 ceAbstractionStarter]: For program point L3802-4(lines 3802 3824) no Hoare annotation was computed. [2019-11-24 03:36:25,815 INFO L444 ceAbstractionStarter]: For program point L3737-2(lines 3737 3740) no Hoare annotation was computed. [2019-11-24 03:36:25,815 INFO L440 ceAbstractionStarter]: At program point L4004(lines 4004 4007) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (or (= 0 ULTIMATE.start_serio_raw_connect_~err~0) (= 1 ~ldv_mutex_serio_raw_mutex~0)) (= 1 ~ldv_mutex_mutex_of_device~0) (or (= 0 (+ ULTIMATE.start_serio_raw_connect_~err~0 4)) (= 2 ~ldv_mutex_serio_raw_mutex~0))) [2019-11-24 03:36:25,815 INFO L444 ceAbstractionStarter]: For program point L3608(lines 3608 3611) no Hoare annotation was computed. [2019-11-24 03:36:25,815 INFO L444 ceAbstractionStarter]: For program point L3741(lines 3741 3744) no Hoare annotation was computed. [2019-11-24 03:36:25,815 INFO L440 ceAbstractionStarter]: At program point L4336(line 4336) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,815 INFO L444 ceAbstractionStarter]: For program point L4271(line 4271) no Hoare annotation was computed. [2019-11-24 03:36:25,816 INFO L440 ceAbstractionStarter]: At program point L3941-1(lines 3941 3957) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,816 INFO L444 ceAbstractionStarter]: For program point L3941(lines 3941 3957) no Hoare annotation was computed. [2019-11-24 03:36:25,816 INFO L444 ceAbstractionStarter]: For program point L3809-2(lines 3809 3812) no Hoare annotation was computed. [2019-11-24 03:36:25,816 INFO L440 ceAbstractionStarter]: At program point L4272(lines 4272 4284) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,816 INFO L440 ceAbstractionStarter]: At program point L3876(lines 3876 3880) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,816 INFO L440 ceAbstractionStarter]: At program point L3876-1(lines 3876 3880) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,816 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,816 INFO L440 ceAbstractionStarter]: At program point L5331(lines 1 5349) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,816 INFO L444 ceAbstractionStarter]: For program point L4274-2(lines 4272 4283) no Hoare annotation was computed. [2019-11-24 03:36:25,816 INFO L440 ceAbstractionStarter]: At program point L3614(lines 3603 3620) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= ULTIMATE.start_serio_raw_open_~retval~0 0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,817 INFO L444 ceAbstractionStarter]: For program point L3813(lines 3813 3817) no Hoare annotation was computed. [2019-11-24 03:36:25,817 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,817 INFO L440 ceAbstractionStarter]: At program point L5334(lines 1 5349) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,817 INFO L440 ceAbstractionStarter]: At program point L3815(lines 3802 3823) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,817 INFO L444 ceAbstractionStarter]: For program point L3882(lines 3882 3889) no Hoare annotation was computed. [2019-11-24 03:36:25,817 INFO L444 ceAbstractionStarter]: For program point L3882-1(lines 3882 3889) no Hoare annotation was computed. [2019-11-24 03:36:25,817 INFO L440 ceAbstractionStarter]: At program point L4015(lines 4015 4019) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,817 INFO L440 ceAbstractionStarter]: At program point L4015-2(lines 3971 4037) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,818 INFO L440 ceAbstractionStarter]: At program point L3619(lines 3598 3621) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= ULTIMATE.start_serio_raw_open_~retval~0 0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,818 INFO L440 ceAbstractionStarter]: At program point L4280(lines 5218 5221) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,818 INFO L440 ceAbstractionStarter]: At program point L3950(lines 3941 3956) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,818 INFO L444 ceAbstractionStarter]: For program point L4215(line 4215) no Hoare annotation was computed. [2019-11-24 03:36:25,818 INFO L440 ceAbstractionStarter]: At program point L4348(line 4348) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,818 INFO L444 ceAbstractionStarter]: For program point L4216(lines 4216 4257) no Hoare annotation was computed. [2019-11-24 03:36:25,818 INFO L440 ceAbstractionStarter]: At program point L3688(line 3688) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,818 INFO L440 ceAbstractionStarter]: At program point L5076-1(lines 5076 5079) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,819 INFO L444 ceAbstractionStarter]: For program point L5076-2(lines 5076 5079) no Hoare annotation was computed. [2019-11-24 03:36:25,819 INFO L444 ceAbstractionStarter]: For program point L5076(lines 5076 5079) no Hoare annotation was computed. [2019-11-24 03:36:25,819 INFO L440 ceAbstractionStarter]: At program point L5076-5(lines 5076 5079) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,819 INFO L440 ceAbstractionStarter]: At program point L5076-3(lines 5076 5079) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,819 INFO L444 ceAbstractionStarter]: For program point L5076-4(lines 5076 5079) no Hoare annotation was computed. [2019-11-24 03:36:25,819 INFO L444 ceAbstractionStarter]: For program point L4219(line 4219) no Hoare annotation was computed. [2019-11-24 03:36:25,819 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 03:36:25,819 INFO L444 ceAbstractionStarter]: For program point L4286(line 4286) no Hoare annotation was computed. [2019-11-24 03:36:25,820 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,820 INFO L440 ceAbstractionStarter]: At program point L4220(lines 4220 4228) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,820 INFO L440 ceAbstractionStarter]: At program point L3891-1(lines 3849 3901) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,820 INFO L440 ceAbstractionStarter]: At program point L3891(lines 3849 3901) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,820 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,820 INFO L444 ceAbstractionStarter]: For program point L3826(lines 3826 3829) no Hoare annotation was computed. [2019-11-24 03:36:25,820 INFO L444 ceAbstractionStarter]: For program point L4355(line 4355) no Hoare annotation was computed. [2019-11-24 03:36:25,821 INFO L440 ceAbstractionStarter]: At program point L5347(lines 5347 5349) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,821 INFO L440 ceAbstractionStarter]: At program point L4356(lines 4356 4364) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,821 INFO L440 ceAbstractionStarter]: At program point L3894(lines 3894 3897) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,821 INFO L440 ceAbstractionStarter]: At program point L3894-1(lines 3894 3897) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,821 INFO L440 ceAbstractionStarter]: At program point L3631(lines 3631 3634) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_serio_raw_open_~retval~0 4))) (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (or (= ULTIMATE.start_serio_raw_open_~retval~0 0) (and (= 0 .cse0) (= 1 ~ldv_mutex_serio_raw_mutex~0))) (or (<= .cse0 0) (= 2 ~ldv_mutex_serio_raw_mutex~0)))) [2019-11-24 03:36:25,821 INFO L444 ceAbstractionStarter]: For program point L5218(lines 5217 5235) no Hoare annotation was computed. [2019-11-24 03:36:25,821 INFO L444 ceAbstractionStarter]: For program point L4293(line 4293) no Hoare annotation was computed. [2019-11-24 03:36:25,821 INFO L440 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,822 INFO L440 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,822 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,822 INFO L440 ceAbstractionStarter]: At program point L-1-8(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,822 INFO L440 ceAbstractionStarter]: At program point L-1-11(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,822 INFO L440 ceAbstractionStarter]: At program point L-1-14(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,822 INFO L440 ceAbstractionStarter]: At program point L-1-17(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,823 INFO L440 ceAbstractionStarter]: At program point L-1-20(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,823 INFO L440 ceAbstractionStarter]: At program point L-1-23(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,823 INFO L444 ceAbstractionStarter]: For program point L4294(lines 4294 4371) no Hoare annotation was computed. [2019-11-24 03:36:25,823 INFO L440 ceAbstractionStarter]: At program point L-1-26(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,823 INFO L440 ceAbstractionStarter]: At program point L-1-29(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,823 INFO L440 ceAbstractionStarter]: At program point L-1-32(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,823 INFO L440 ceAbstractionStarter]: At program point L-1-35(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,823 INFO L440 ceAbstractionStarter]: At program point L3898(lines 3849 3901) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,824 INFO L440 ceAbstractionStarter]: At program point L-1-38(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,824 INFO L440 ceAbstractionStarter]: At program point L3898-1(lines 3849 3901) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,824 INFO L440 ceAbstractionStarter]: At program point L-1-41(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,824 INFO L440 ceAbstractionStarter]: At program point L-1-44(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,824 INFO L440 ceAbstractionStarter]: At program point L-1-47(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,824 INFO L440 ceAbstractionStarter]: At program point L-1-50(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,824 INFO L440 ceAbstractionStarter]: At program point L-1-53(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,825 INFO L440 ceAbstractionStarter]: At program point L-1-56(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,825 INFO L444 ceAbstractionStarter]: For program point L4230(line 4230) no Hoare annotation was computed. [2019-11-24 03:36:25,825 INFO L440 ceAbstractionStarter]: At program point L3900(lines 3837 3902) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,825 INFO L440 ceAbstractionStarter]: At program point L3834(lines 3707 3836) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,825 INFO L440 ceAbstractionStarter]: At program point L3900-1(lines 3837 3902) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,825 INFO L440 ceAbstractionStarter]: At program point L4231(lines 4231 4235) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,825 INFO L444 ceAbstractionStarter]: For program point L5222(lines 5217 5235) no Hoare annotation was computed. [2019-11-24 03:36:25,825 INFO L444 ceAbstractionStarter]: For program point L4297(line 4297) no Hoare annotation was computed. [2019-11-24 03:36:25,825 INFO L440 ceAbstractionStarter]: At program point L4298(lines 4298 4302) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,826 INFO L440 ceAbstractionStarter]: At program point L4298-2(lines 4296 4368) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,826 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,826 INFO L444 ceAbstractionStarter]: For program point L4035(line 4035) no Hoare annotation was computed. [2019-11-24 03:36:25,826 INFO L444 ceAbstractionStarter]: For program point L4366(line 4366) no Hoare annotation was computed. [2019-11-24 03:36:25,826 INFO L440 ceAbstractionStarter]: At program point L4036(lines 3961 4038) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,826 INFO L444 ceAbstractionStarter]: For program point L5093(lines 5093 5096) no Hoare annotation was computed. [2019-11-24 03:36:25,826 INFO L440 ceAbstractionStarter]: At program point L5093-1(lines 5093 5096) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,826 INFO L444 ceAbstractionStarter]: For program point L5226(lines 5217 5235) no Hoare annotation was computed. [2019-11-24 03:36:25,827 INFO L444 ceAbstractionStarter]: For program point L4566(lines 4566 4570) no Hoare annotation was computed. [2019-11-24 03:36:25,827 INFO L440 ceAbstractionStarter]: At program point L4566-1(lines 4566 4570) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,827 INFO L440 ceAbstractionStarter]: At program point L4237(line 4237) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,827 INFO L440 ceAbstractionStarter]: At program point L3180-1(lines 3971 4037) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (= 1 ~ldv_mutex_serio_raw_mutex~0)) (.cse2 (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (.cse3 (= 1 ~ldv_mutex_mutex_of_device~0))) (or (and .cse0 .cse1 (= 0 (+ ULTIMATE.start_serio_raw_connect_~err~0 4)) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= ~ldv_state_variable_2~0 1) .cse3))) [2019-11-24 03:36:25,827 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,827 INFO L447 ceAbstractionStarter]: At program point L5230(lines 5215 5236) the Hoare annotation is: true [2019-11-24 03:36:25,827 INFO L440 ceAbstractionStarter]: At program point L3975(lines 3975 3989) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,827 INFO L440 ceAbstractionStarter]: At program point L3777(lines 3727 3835) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,828 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,828 INFO L444 ceAbstractionStarter]: For program point L4373(line 4373) no Hoare annotation was computed. [2019-11-24 03:36:25,828 INFO L444 ceAbstractionStarter]: For program point L4309(line 4309) no Hoare annotation was computed. [2019-11-24 03:36:25,828 INFO L440 ceAbstractionStarter]: At program point L4310(lines 4310 4315) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,828 INFO L440 ceAbstractionStarter]: At program point L4376(lines 4186 4381) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,828 INFO L444 ceAbstractionStarter]: For program point L4244(line 4244) no Hoare annotation was computed. [2019-11-24 03:36:25,828 INFO L444 ceAbstractionStarter]: For program point L5170(lines 5170 5173) no Hoare annotation was computed. [2019-11-24 03:36:25,828 INFO L444 ceAbstractionStarter]: For program point L4245(lines 4245 4250) no Hoare annotation was computed. [2019-11-24 03:36:25,828 INFO L440 ceAbstractionStarter]: At program point L5170-3(lines 5170 5173) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,829 INFO L444 ceAbstractionStarter]: For program point L5170-4(lines 5170 5173) no Hoare annotation was computed. [2019-11-24 03:36:25,829 INFO L440 ceAbstractionStarter]: At program point L5170-1(lines 5170 5173) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 0 ULTIMATE.start_serio_raw_connect_~err~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,829 INFO L444 ceAbstractionStarter]: For program point L5170-2(lines 5170 5173) no Hoare annotation was computed. [2019-11-24 03:36:25,829 INFO L440 ceAbstractionStarter]: At program point L5170-7(lines 5170 5173) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,829 INFO L440 ceAbstractionStarter]: At program point L5170-5(lines 5170 5173) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 2 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,829 INFO L444 ceAbstractionStarter]: For program point L5170-6(lines 5170 5173) no Hoare annotation was computed. [2019-11-24 03:36:25,829 INFO L440 ceAbstractionStarter]: At program point L3783(lines 3727 3835) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,830 INFO L440 ceAbstractionStarter]: At program point L4246(line 4246) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,830 INFO L444 ceAbstractionStarter]: For program point L4246-1(line 4246) no Hoare annotation was computed. [2019-11-24 03:36:25,830 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 03:36:25,830 INFO L440 ceAbstractionStarter]: At program point L3786(lines 3786 3790) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,830 INFO L440 ceAbstractionStarter]: At program point L3523-1(lines 1 5349) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,830 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,830 INFO L444 ceAbstractionStarter]: For program point L3854(lines 3854 3857) no Hoare annotation was computed. [2019-11-24 03:36:25,830 INFO L444 ceAbstractionStarter]: For program point L3854-1(lines 3854 3857) no Hoare annotation was computed. [2019-11-24 03:36:25,831 INFO L444 ceAbstractionStarter]: For program point L4317(line 4317) no Hoare annotation was computed. [2019-11-24 03:36:25,831 INFO L444 ceAbstractionStarter]: For program point L4318(lines 4318 4322) no Hoare annotation was computed. [2019-11-24 03:36:25,831 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,831 INFO L444 ceAbstractionStarter]: For program point L4252(line 4252) no Hoare annotation was computed. [2019-11-24 03:36:25,831 INFO L444 ceAbstractionStarter]: For program point L3858(lines 3858 3862) no Hoare annotation was computed. [2019-11-24 03:36:25,831 INFO L444 ceAbstractionStarter]: For program point L3858-1(lines 3858 3862) no Hoare annotation was computed. [2019-11-24 03:36:25,831 INFO L444 ceAbstractionStarter]: For program point L4585-2(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,831 INFO L444 ceAbstractionStarter]: For program point L4585-3(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,831 INFO L444 ceAbstractionStarter]: For program point L4585(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,832 INFO L444 ceAbstractionStarter]: For program point L4585-1(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,832 INFO L444 ceAbstractionStarter]: For program point L4585-6(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,832 INFO L444 ceAbstractionStarter]: For program point L4585-7(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,832 INFO L444 ceAbstractionStarter]: For program point L4585-4(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,832 INFO L444 ceAbstractionStarter]: For program point L4585-5(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,832 INFO L444 ceAbstractionStarter]: For program point L4585-10(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,832 INFO L444 ceAbstractionStarter]: For program point L4585-11(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,832 INFO L444 ceAbstractionStarter]: For program point L4585-8(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,832 INFO L444 ceAbstractionStarter]: For program point L4585-9(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,832 INFO L440 ceAbstractionStarter]: At program point L3793(lines 3727 3835) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,832 INFO L440 ceAbstractionStarter]: At program point L3662(lines 3622 3664) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_2~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,832 INFO L440 ceAbstractionStarter]: At program point L3795(lines 3727 3835) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,832 INFO L440 ceAbstractionStarter]: At program point L4324(line 4324) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,833 INFO L444 ceAbstractionStarter]: For program point L4259(line 4259) no Hoare annotation was computed. [2019-11-24 03:36:25,833 INFO L444 ceAbstractionStarter]: For program point L4260(lines 4260 4291) no Hoare annotation was computed. [2019-11-24 03:36:25,833 INFO L440 ceAbstractionStarter]: At program point L3798(lines 3798 3831) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,833 INFO L440 ceAbstractionStarter]: At program point L3798-2(lines 3727 3835) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_serio_raw_mutex~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 03:36:25,833 INFO L444 ceAbstractionStarter]: For program point L3733(lines 3733 3736) no Hoare annotation was computed. [2019-11-24 03:36:25,833 INFO L447 ceAbstractionStarter]: At program point L3337-1(lines 3336 3339) the Hoare annotation is: true [2019-11-24 03:36:25,833 INFO L447 ceAbstractionStarter]: At program point L3337(lines 3336 3339) the Hoare annotation is: true [2019-11-24 03:36:25,833 INFO L447 ceAbstractionStarter]: At program point L3337-3(lines 3336 3339) the Hoare annotation is: true [2019-11-24 03:36:25,834 INFO L447 ceAbstractionStarter]: At program point L3337-2(lines 3336 3339) the Hoare annotation is: true [2019-11-24 03:36:25,834 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,834 INFO L444 ceAbstractionStarter]: For program point L4263(line 4263) no Hoare annotation was computed. [2019-11-24 03:36:25,834 INFO L444 ceAbstractionStarter]: For program point kref_subEXIT(lines 3461 3482) no Hoare annotation was computed. [2019-11-24 03:36:25,834 INFO L440 ceAbstractionStarter]: At program point L3476(line 3476) the Hoare annotation is: (let ((.cse0 (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|))) (.cse1 (not (= 1 ~ldv_mutex_lock~0))) (.cse2 (not (= 1 ~ldv_mutex_mutex_of_device~0))) (.cse3 (not (= 1 ~ldv_mutex_i_mutex_of_inode~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 1) (not (= 1 |old(~ldv_state_variable_2~0)|))) (or (not (= 0 |old(~ldv_state_variable_2~0)|)) .cse0 .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse3) (or (= 1 ~ldv_mutex_serio_raw_mutex~0) .cse0 .cse1 .cse2 .cse3))) [2019-11-24 03:36:25,834 INFO L440 ceAbstractionStarter]: At program point kref_subENTRY(lines 3461 3482) the Hoare annotation is: (let ((.cse0 (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|))) (.cse1 (not (= 1 ~ldv_mutex_lock~0))) (.cse2 (not (= 1 ~ldv_mutex_mutex_of_device~0))) (.cse3 (not (= 1 ~ldv_mutex_i_mutex_of_inode~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 1) (not (= 1 |old(~ldv_state_variable_2~0)|))) (or (not (= 0 |old(~ldv_state_variable_2~0)|)) .cse0 .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse3) (or (= 1 ~ldv_mutex_serio_raw_mutex~0) .cse0 .cse1 .cse2 .cse3))) [2019-11-24 03:36:25,834 INFO L444 ceAbstractionStarter]: For program point L3475(lines 3475 3479) no Hoare annotation was computed. [2019-11-24 03:36:25,834 INFO L444 ceAbstractionStarter]: For program point L3476-1(line 3476) no Hoare annotation was computed. [2019-11-24 03:36:25,834 INFO L444 ceAbstractionStarter]: For program point kref_subFINAL(lines 3461 3482) no Hoare annotation was computed. [2019-11-24 03:36:25,834 INFO L444 ceAbstractionStarter]: For program point L3487-1(line 3487) no Hoare annotation was computed. [2019-11-24 03:36:25,835 INFO L440 ceAbstractionStarter]: At program point L3487(line 3487) the Hoare annotation is: (let ((.cse0 (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|))) (.cse1 (not (= 1 ~ldv_mutex_lock~0))) (.cse2 (not (= 1 ~ldv_mutex_mutex_of_device~0))) (.cse3 (not (= 1 ~ldv_mutex_i_mutex_of_inode~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 1) (not (= 1 |old(~ldv_state_variable_2~0)|))) (or (not (= 0 |old(~ldv_state_variable_2~0)|)) .cse0 .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse3) (or (= 1 ~ldv_mutex_serio_raw_mutex~0) .cse0 .cse1 .cse2 .cse3))) [2019-11-24 03:36:25,835 INFO L444 ceAbstractionStarter]: For program point kref_putEXIT(lines 3483 3490) no Hoare annotation was computed. [2019-11-24 03:36:25,835 INFO L440 ceAbstractionStarter]: At program point kref_putENTRY(lines 3483 3490) the Hoare annotation is: (let ((.cse0 (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|))) (.cse1 (not (= 1 ~ldv_mutex_lock~0))) (.cse2 (not (= 1 ~ldv_mutex_mutex_of_device~0))) (.cse3 (not (= 1 ~ldv_mutex_i_mutex_of_inode~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 1) (not (= 1 |old(~ldv_state_variable_2~0)|))) (or (not (= 0 |old(~ldv_state_variable_2~0)|)) .cse0 .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse3) (or (= 1 ~ldv_mutex_serio_raw_mutex~0) .cse0 .cse1 .cse2 .cse3))) [2019-11-24 03:36:25,835 INFO L440 ceAbstractionStarter]: At program point L4082(lines 4073 4090) the Hoare annotation is: (or (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|)) (not (= 1 ~ldv_mutex_lock~0)) (not (= 1 ~ldv_mutex_mutex_of_device~0)) (not (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (and (= 1 ~ldv_mutex_serio_raw_mutex~0) (= ~ldv_state_variable_2~0 0))) [2019-11-24 03:36:25,835 INFO L444 ceAbstractionStarter]: For program point serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,835 INFO L440 ceAbstractionStarter]: At program point L5334(lines 5333 5335) the Hoare annotation is: (or (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|)) (not (= 1 ~ldv_mutex_lock~0)) (not (= 1 ~ldv_mutex_mutex_of_device~0)) (not (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (and (= 1 ~ldv_mutex_serio_raw_mutex~0) (= ~ldv_state_variable_2~0 0))) [2019-11-24 03:36:25,835 INFO L444 ceAbstractionStarter]: For program point serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4586) no Hoare annotation was computed. [2019-11-24 03:36:25,835 INFO L440 ceAbstractionStarter]: At program point serio_raw_disconnectENTRY(lines 4092 4110) the Hoare annotation is: (or (= 1 ~ldv_mutex_serio_raw_mutex~0) (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|)) (not (= 1 ~ldv_mutex_lock~0)) (not (= 1 ~ldv_mutex_mutex_of_device~0)) (not (= 1 ~ldv_mutex_i_mutex_of_inode~0))) [2019-11-24 03:36:25,835 INFO L444 ceAbstractionStarter]: For program point serio_raw_disconnectEXIT(lines 4092 4110) no Hoare annotation was computed. [2019-11-24 03:36:25,835 INFO L444 ceAbstractionStarter]: For program point L5170(lines 5170 5173) no Hoare annotation was computed. [2019-11-24 03:36:25,835 INFO L440 ceAbstractionStarter]: At program point L5170-1(lines 5170 5173) the Hoare annotation is: (or (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|)) (not (= 1 ~ldv_mutex_lock~0)) (not (= 1 ~ldv_mutex_mutex_of_device~0)) (not (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (and (= 2 ~ldv_mutex_serio_raw_mutex~0) (= ~ldv_state_variable_2~0 0))) [2019-11-24 03:36:25,835 INFO L444 ceAbstractionStarter]: For program point L5109(lines 5109 5112) no Hoare annotation was computed. [2019-11-24 03:36:25,836 INFO L440 ceAbstractionStarter]: At program point L5109-1(lines 5109 5112) the Hoare annotation is: (or (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|)) (not (= 1 ~ldv_mutex_lock~0)) (not (= 1 ~ldv_mutex_mutex_of_device~0)) (not (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (and (= 1 ~ldv_mutex_serio_raw_mutex~0) (= ~ldv_state_variable_2~0 0))) [2019-11-24 03:36:25,836 INFO L440 ceAbstractionStarter]: At program point L4106(line 4106) the Hoare annotation is: (or (not (= 1 |old(~ldv_mutex_serio_raw_mutex~0)|)) (not (= 1 ~ldv_mutex_lock~0)) (not (= 1 ~ldv_mutex_mutex_of_device~0)) (not (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (and (= 1 ~ldv_mutex_serio_raw_mutex~0) (= ~ldv_state_variable_2~0 0))) [2019-11-24 03:36:25,836 INFO L444 ceAbstractionStarter]: For program point L4585(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,836 INFO L444 ceAbstractionStarter]: For program point L4585-1(line 4585) no Hoare annotation was computed. [2019-11-24 03:36:25,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 03:36:25 BoogieIcfgContainer [2019-11-24 03:36:25,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 03:36:25,880 INFO L168 Benchmark]: Toolchain (without parser) took 30783.55 ms. Allocated memory was 137.4 MB in the beginning and 765.5 MB in the end (delta: 628.1 MB). Free memory was 95.8 MB in the beginning and 371.1 MB in the end (delta: -275.3 MB). Peak memory consumption was 672.5 MB. Max. memory is 7.1 GB. [2019-11-24 03:36:25,881 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 03:36:25,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1969.56 ms. Allocated memory was 137.4 MB in the beginning and 234.9 MB in the end (delta: 97.5 MB). Free memory was 95.6 MB in the beginning and 194.0 MB in the end (delta: -98.4 MB). Peak memory consumption was 90.7 MB. Max. memory is 7.1 GB. [2019-11-24 03:36:25,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 251.88 ms. Allocated memory is still 234.9 MB. Free memory was 194.0 MB in the beginning and 178.9 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2019-11-24 03:36:25,883 INFO L168 Benchmark]: Boogie Preprocessor took 174.20 ms. Allocated memory is still 234.9 MB. Free memory was 178.9 MB in the beginning and 165.4 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-11-24 03:36:25,883 INFO L168 Benchmark]: RCFGBuilder took 10705.82 ms. Allocated memory was 234.9 MB in the beginning and 377.5 MB in the end (delta: 142.6 MB). Free memory was 165.4 MB in the beginning and 114.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 206.6 MB. Max. memory is 7.1 GB. [2019-11-24 03:36:25,884 INFO L168 Benchmark]: TraceAbstraction took 17677.45 ms. Allocated memory was 377.5 MB in the beginning and 765.5 MB in the end (delta: 388.0 MB). Free memory was 114.8 MB in the beginning and 371.1 MB in the end (delta: -256.2 MB). Peak memory consumption was 451.4 MB. Max. memory is 7.1 GB. [2019-11-24 03:36:25,887 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1969.56 ms. Allocated memory was 137.4 MB in the beginning and 234.9 MB in the end (delta: 97.5 MB). Free memory was 95.6 MB in the beginning and 194.0 MB in the end (delta: -98.4 MB). Peak memory consumption was 90.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 251.88 ms. Allocated memory is still 234.9 MB. Free memory was 194.0 MB in the beginning and 178.9 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 174.20 ms. Allocated memory is still 234.9 MB. Free memory was 178.9 MB in the beginning and 165.4 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10705.82 ms. Allocated memory was 234.9 MB in the beginning and 377.5 MB in the end (delta: 142.6 MB). Free memory was 165.4 MB in the beginning and 114.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 206.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17677.45 ms. Allocated memory was 377.5 MB in the beginning and 765.5 MB in the end (delta: 388.0 MB). Free memory was 114.8 MB in the beginning and 371.1 MB in the end (delta: -256.2 MB). Peak memory consumption was 451.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 3971]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3849]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4106]: Loop Invariant Derived loop invariant: (((!(1 == \old(ldv_mutex_serio_raw_mutex)) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode)) || (1 == ldv_mutex_serio_raw_mutex && ldv_state_variable_2 == 0) - InvariantResult [Line: 4004]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && (0 == err || 1 == ldv_mutex_serio_raw_mutex)) && 1 == ldv_mutex_mutex_of_device) && (0 == err + 4 || 2 == ldv_mutex_serio_raw_mutex) - InvariantResult [Line: 3876]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3876]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3894]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5170]: Loop Invariant Derived loop invariant: (((!(1 == \old(ldv_mutex_serio_raw_mutex)) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode)) || (2 == ldv_mutex_serio_raw_mutex && ldv_state_variable_2 == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((!(1 == \old(ldv_mutex_serio_raw_mutex)) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode)) || ldv_state_variable_2 == 1) || (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && ldv_state_variable_2 == 0) && 1 == ldv_mutex_mutex_of_device)) || !(1 == \old(ldv_state_variable_2))) && ((((1 == ldv_mutex_serio_raw_mutex || !(1 == \old(ldv_mutex_serio_raw_mutex))) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode))) && (((((!(0 == \old(ldv_state_variable_2)) || !(1 == \old(ldv_mutex_serio_raw_mutex))) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode)) || (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && ldv_state_variable_2 == 0) && 1 == ldv_mutex_mutex_of_device)) - InvariantResult [Line: 3727]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3894]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4264]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3975]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4231]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3849]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5076]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3849]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5076]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4015]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3849]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5333]: Loop Invariant Derived loop invariant: (((!(1 == \old(ldv_mutex_serio_raw_mutex)) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode)) || (1 == ldv_mutex_serio_raw_mutex && ldv_state_variable_2 == 0) - InvariantResult [Line: 3631]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device) && (retval == 0 || (0 == retval + 4 && 1 == ldv_mutex_serio_raw_mutex))) && (retval + 4 <= 0 || 2 == ldv_mutex_serio_raw_mutex) - InvariantResult [Line: 4220]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4348]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5076]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4356]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3941]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4296]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3802]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3603]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && retval == 0) && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4272]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3727]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5218]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4324]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3622]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3786]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4298]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4073]: Loop Invariant Derived loop invariant: (((!(1 == \old(ldv_mutex_serio_raw_mutex)) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode)) || (1 == ldv_mutex_serio_raw_mutex && ldv_state_variable_2 == 0) - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_serio_raw_mutex || !(1 == \old(ldv_mutex_serio_raw_mutex))) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3336]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3688]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3727]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3336]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3727]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3336]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3707]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3837]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3336]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3837]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4237]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3802]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4186]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5170]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3941]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5109]: Loop Invariant Derived loop invariant: (((!(1 == \old(ldv_mutex_serio_raw_mutex)) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode)) || (1 == ldv_mutex_serio_raw_mutex && ldv_state_variable_2 == 0) - InvariantResult [Line: 5093]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3598]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && retval == 0) && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3999]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4566]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5170]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((((!(1 == \old(ldv_mutex_serio_raw_mutex)) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode)) || ldv_state_variable_2 == 1) || !(1 == \old(ldv_state_variable_2))) && (((((!(0 == \old(ldv_state_variable_2)) || !(1 == \old(ldv_mutex_serio_raw_mutex))) || !(1 == ldv_mutex_lock)) || ldv_state_variable_2 == 0) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode))) && ((((1 == ldv_mutex_serio_raw_mutex || !(1 == \old(ldv_mutex_serio_raw_mutex))) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode)) - InvariantResult [Line: 3798]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4310]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3971]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 0 == err + 4) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) || ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3461]: Loop Invariant Derived loop invariant: ((((((!(1 == \old(ldv_mutex_serio_raw_mutex)) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode)) || ldv_state_variable_2 == 1) || !(1 == \old(ldv_state_variable_2))) && (((((!(0 == \old(ldv_state_variable_2)) || !(1 == \old(ldv_mutex_serio_raw_mutex))) || !(1 == ldv_mutex_lock)) || ldv_state_variable_2 == 0) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode))) && ((((1 == ldv_mutex_serio_raw_mutex || !(1 == \old(ldv_mutex_serio_raw_mutex))) || !(1 == ldv_mutex_lock)) || !(1 == ldv_mutex_mutex_of_device)) || !(1 == ldv_mutex_i_mutex_of_inode)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3727]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4336]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5170]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_2 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5170]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 0 == err) && 2 == ldv_mutex_serio_raw_mutex) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 191 locations, 14 error locations. Result: SAFE, OverallTime: 17.5s, OverallIterations: 18, TraceHistogramMax: 4, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, HoareTripleCheckerStatistics: 5245 SDtfs, 2899 SDslu, 4175 SDs, 0 SdLazy, 579 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=996occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 1279 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 100 LocationsWithAnnotation, 1050 PreInvPairs, 1631 NumberOfFragments, 1934 HoareAnnotationTreeSize, 1050 FomulaSimplifications, 37377 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 100 FomulaSimplificationsInter, 7117 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 978 NumberOfCodeBlocks, 978 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1043 ConstructedInterpolants, 0 QuantifiedInterpolants, 96413 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2005 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 236/237 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...