./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a77405369d2109bb3213a2ea70dd19a374bb505f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:16:12,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:16:12,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:16:12,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:16:12,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:16:12,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:16:12,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:16:12,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:16:12,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:16:12,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:16:12,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:16:12,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:16:12,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:16:12,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:16:12,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:16:12,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:16:12,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:16:12,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:16:12,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:16:12,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:16:12,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:16:12,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:16:12,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:16:12,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:16:12,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:16:12,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:16:12,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:16:12,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:16:12,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:16:12,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:16:12,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:16:12,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:16:12,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:16:12,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:16:12,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:16:12,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:16:12,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:16:12,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:16:12,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:16:12,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:16:12,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:16:12,718 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2019-11-26 02:16:12,730 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:16:12,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:16:12,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:16:12,731 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:16:12,731 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:16:12,731 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:16:12,731 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:16:12,732 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:16:12,732 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:16:12,732 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:16:12,732 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:16:12,732 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:16:12,733 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:16:12,733 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:16:12,733 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:16:12,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:16:12,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:16:12,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:16:12,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:16:12,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:16:12,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:16:12,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:16:12,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:16:12,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:16:12,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:16:12,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:16:12,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:16:12,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:16:12,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:16:12,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:16:12,736 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:16:12,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:16:12,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:16:12,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:16:12,737 INFO L138 SettingsManager]: * To the following directory=dump/ [2019-11-26 02:16:12,737 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a77405369d2109bb3213a2ea70dd19a374bb505f [2019-11-26 02:16:12,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:16:12,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:16:12,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:16:12,910 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:16:12,911 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:16:12,911 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/../../sv-benchmarks/c/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-26 02:16:12,960 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/data/3f9baadd5/ca52c648265d42b58715db3b4a76f31d/FLAG6f961615b [2019-11-26 02:16:13,573 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:16:13,574 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/sv-benchmarks/c/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-26 02:16:13,610 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/data/3f9baadd5/ca52c648265d42b58715db3b4a76f31d/FLAG6f961615b [2019-11-26 02:16:13,979 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/data/3f9baadd5/ca52c648265d42b58715db3b4a76f31d [2019-11-26 02:16:13,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:16:13,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:16:13,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:16:13,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:16:13,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:16:13,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:16:13" (1/1) ... [2019-11-26 02:16:13,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0fdede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:13, skipping insertion in model container [2019-11-26 02:16:13,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:16:13" (1/1) ... [2019-11-26 02:16:13,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:16:14,081 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:16:15,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:16:15,100 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:16:15,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:16:15,467 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:16:15,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15 WrapperNode [2019-11-26 02:16:15,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:16:15,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:16:15,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:16:15,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:16:15,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15" (1/1) ... [2019-11-26 02:16:15,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15" (1/1) ... [2019-11-26 02:16:15,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:16:15,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:16:15,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:16:15,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:16:15,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15" (1/1) ... [2019-11-26 02:16:15,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15" (1/1) ... [2019-11-26 02:16:15,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15" (1/1) ... [2019-11-26 02:16:15,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15" (1/1) ... [2019-11-26 02:16:15,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15" (1/1) ... [2019-11-26 02:16:15,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15" (1/1) ... [2019-11-26 02:16:15,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15" (1/1) ... [2019-11-26 02:16:15,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:16:15,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:16:15,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:16:15,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:16:15,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/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-26 02:16:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2019-11-26 02:16:15,914 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2019-11-26 02:16:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:16:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:16:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2019-11-26 02:16:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2019-11-26 02:16:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_disconnect [2019-11-26 02:16:15,919 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_disconnect [2019-11-26 02:16:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:16:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:16:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:16:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 02:16:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 02:16:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:16:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2019-11-26 02:16:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:16:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:16:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:16:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:16:15,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:16:22,042 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:16:22,043 INFO L284 CfgBuilder]: Removed 461 assume(true) statements. [2019-11-26 02:16:22,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:16:22 BoogieIcfgContainer [2019-11-26 02:16:22,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:16:22,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:16:22,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:16:22,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:16:22,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:16:13" (1/3) ... [2019-11-26 02:16:22,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df19c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:16:22, skipping insertion in model container [2019-11-26 02:16:22,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:15" (2/3) ... [2019-11-26 02:16:22,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df19c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:16:22, skipping insertion in model container [2019-11-26 02:16:22,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:16:22" (3/3) ... [2019-11-26 02:16:22,050 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-26 02:16:22,057 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:16:22,066 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-26 02:16:22,078 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-26 02:16:22,100 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:16:22,101 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:16:22,101 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:16:22,101 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:16:22,101 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:16:22,101 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:16:22,101 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:16:22,102 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:16:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2019-11-26 02:16:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:16:22,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:22,129 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-26 02:16:22,130 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-26 02:16:22,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:22,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1410773399, now seen corresponding path program 1 times [2019-11-26 02:16:22,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:22,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068345048] [2019-11-26 02:16:22,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:22,620 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-26 02:16:22,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068345048] [2019-11-26 02:16:22,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:22,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:16:22,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187663399] [2019-11-26 02:16:22,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:22,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:22,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:22,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:22,641 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 3 states. [2019-11-26 02:16:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:22,857 INFO L93 Difference]: Finished difference Result 525 states and 820 transitions. [2019-11-26 02:16:22,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:22,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-26 02:16:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:22,892 INFO L225 Difference]: With dead ends: 525 [2019-11-26 02:16:22,892 INFO L226 Difference]: Without dead ends: 339 [2019-11-26 02:16:22,900 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-26 02:16:22,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-11-26 02:16:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 319. [2019-11-26 02:16:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-26 02:16:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 484 transitions. [2019-11-26 02:16:22,975 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 484 transitions. Word has length 23 [2019-11-26 02:16:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:22,976 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 484 transitions. [2019-11-26 02:16:22,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 484 transitions. [2019-11-26 02:16:22,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:16:22,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:22,977 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-26 02:16:22,978 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-26 02:16:22,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:22,978 INFO L82 PathProgramCache]: Analyzing trace with hash -728743838, now seen corresponding path program 1 times [2019-11-26 02:16:22,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:22,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821097693] [2019-11-26 02:16:22,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:23,178 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-26 02:16:23,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821097693] [2019-11-26 02:16:23,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:23,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:16:23,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896245597] [2019-11-26 02:16:23,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:23,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:23,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:23,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:23,181 INFO L87 Difference]: Start difference. First operand 319 states and 484 transitions. Second operand 3 states. [2019-11-26 02:16:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:23,306 INFO L93 Difference]: Finished difference Result 751 states and 1128 transitions. [2019-11-26 02:16:23,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:23,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-26 02:16:23,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:23,311 INFO L225 Difference]: With dead ends: 751 [2019-11-26 02:16:23,311 INFO L226 Difference]: Without dead ends: 447 [2019-11-26 02:16:23,313 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-26 02:16:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-26 02:16:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 419. [2019-11-26 02:16:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-26 02:16:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 640 transitions. [2019-11-26 02:16:23,355 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 640 transitions. Word has length 24 [2019-11-26 02:16:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:23,355 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 640 transitions. [2019-11-26 02:16:23,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 640 transitions. [2019-11-26 02:16:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:16:23,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:23,357 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-26 02:16:23,357 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-26 02:16:23,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:23,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1585223192, now seen corresponding path program 1 times [2019-11-26 02:16:23,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:23,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317442060] [2019-11-26 02:16:23,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:23,575 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-26 02:16:23,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317442060] [2019-11-26 02:16:23,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:23,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:16:23,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527713562] [2019-11-26 02:16:23,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:23,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:23,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:23,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:23,577 INFO L87 Difference]: Start difference. First operand 419 states and 640 transitions. Second operand 3 states. [2019-11-26 02:16:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:23,668 INFO L93 Difference]: Finished difference Result 818 states and 1216 transitions. [2019-11-26 02:16:23,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:23,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-26 02:16:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:23,672 INFO L225 Difference]: With dead ends: 818 [2019-11-26 02:16:23,672 INFO L226 Difference]: Without dead ends: 414 [2019-11-26 02:16:23,674 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-26 02:16:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-11-26 02:16:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 386. [2019-11-26 02:16:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-11-26 02:16:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 583 transitions. [2019-11-26 02:16:23,699 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 583 transitions. Word has length 24 [2019-11-26 02:16:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:23,700 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 583 transitions. [2019-11-26 02:16:23,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 583 transitions. [2019-11-26 02:16:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 02:16:23,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:23,701 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-26 02:16:23,702 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-26 02:16:23,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:23,702 INFO L82 PathProgramCache]: Analyzing trace with hash 93985172, now seen corresponding path program 1 times [2019-11-26 02:16:23,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:23,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958751239] [2019-11-26 02:16:23,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:23,804 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-26 02:16:23,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958751239] [2019-11-26 02:16:23,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:23,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:16:23,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471583449] [2019-11-26 02:16:23,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:23,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:23,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:23,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:23,806 INFO L87 Difference]: Start difference. First operand 386 states and 583 transitions. Second operand 3 states. [2019-11-26 02:16:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:23,819 INFO L93 Difference]: Finished difference Result 386 states and 583 transitions. [2019-11-26 02:16:23,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:23,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-26 02:16:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:23,823 INFO L225 Difference]: With dead ends: 386 [2019-11-26 02:16:23,823 INFO L226 Difference]: Without dead ends: 384 [2019-11-26 02:16:23,824 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-26 02:16:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-26 02:16:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-11-26 02:16:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-26 02:16:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 581 transitions. [2019-11-26 02:16:23,847 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 581 transitions. Word has length 27 [2019-11-26 02:16:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:23,848 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 581 transitions. [2019-11-26 02:16:23,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 581 transitions. [2019-11-26 02:16:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-26 02:16:23,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:23,852 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-26 02:16:23,852 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-26 02:16:23,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:23,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1381419611, now seen corresponding path program 1 times [2019-11-26 02:16:23,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:23,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494372714] [2019-11-26 02:16:23,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:24,012 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-26 02:16:24,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494372714] [2019-11-26 02:16:24,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:24,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:16:24,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307025475] [2019-11-26 02:16:24,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:24,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:24,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:24,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:24,014 INFO L87 Difference]: Start difference. First operand 384 states and 581 transitions. Second operand 3 states. [2019-11-26 02:16:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:24,031 INFO L93 Difference]: Finished difference Result 384 states and 581 transitions. [2019-11-26 02:16:24,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:24,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-26 02:16:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:24,035 INFO L225 Difference]: With dead ends: 384 [2019-11-26 02:16:24,035 INFO L226 Difference]: Without dead ends: 382 [2019-11-26 02:16:24,035 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-26 02:16:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-26 02:16:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-11-26 02:16:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-26 02:16:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 579 transitions. [2019-11-26 02:16:24,057 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 579 transitions. Word has length 28 [2019-11-26 02:16:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:24,057 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 579 transitions. [2019-11-26 02:16:24,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 579 transitions. [2019-11-26 02:16:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 02:16:24,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:24,060 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-26 02:16:24,060 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-26 02:16:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash 125672382, now seen corresponding path program 1 times [2019-11-26 02:16:24,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:24,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171681057] [2019-11-26 02:16:24,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:24,176 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-26 02:16:24,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171681057] [2019-11-26 02:16:24,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:24,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:16:24,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059276071] [2019-11-26 02:16:24,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:24,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:24,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:24,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:24,178 INFO L87 Difference]: Start difference. First operand 382 states and 579 transitions. Second operand 3 states. [2019-11-26 02:16:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:24,195 INFO L93 Difference]: Finished difference Result 382 states and 579 transitions. [2019-11-26 02:16:24,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:24,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-26 02:16:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:24,201 INFO L225 Difference]: With dead ends: 382 [2019-11-26 02:16:24,201 INFO L226 Difference]: Without dead ends: 380 [2019-11-26 02:16:24,202 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-26 02:16:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-26 02:16:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-11-26 02:16:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-11-26 02:16:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 577 transitions. [2019-11-26 02:16:24,234 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 577 transitions. Word has length 29 [2019-11-26 02:16:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:24,235 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 577 transitions. [2019-11-26 02:16:24,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 577 transitions. [2019-11-26 02:16:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-26 02:16:24,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:24,238 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-26 02:16:24,238 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-26 02:16:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:24,239 INFO L82 PathProgramCache]: Analyzing trace with hash -399116081, now seen corresponding path program 1 times [2019-11-26 02:16:24,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:24,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713530079] [2019-11-26 02:16:24,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:24,355 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-26 02:16:24,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713530079] [2019-11-26 02:16:24,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:24,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:16:24,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220017754] [2019-11-26 02:16:24,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:24,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:24,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:24,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:24,357 INFO L87 Difference]: Start difference. First operand 380 states and 577 transitions. Second operand 3 states. [2019-11-26 02:16:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:24,459 INFO L93 Difference]: Finished difference Result 626 states and 963 transitions. [2019-11-26 02:16:24,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:24,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-26 02:16:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:24,468 INFO L225 Difference]: With dead ends: 626 [2019-11-26 02:16:24,468 INFO L226 Difference]: Without dead ends: 610 [2019-11-26 02:16:24,468 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-26 02:16:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-26 02:16:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-11-26 02:16:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-26 02:16:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 935 transitions. [2019-11-26 02:16:24,501 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 935 transitions. Word has length 30 [2019-11-26 02:16:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:24,501 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 935 transitions. [2019-11-26 02:16:24,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 935 transitions. [2019-11-26 02:16:24,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 02:16:24,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:24,502 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-26 02:16:24,503 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-26 02:16:24,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:24,503 INFO L82 PathProgramCache]: Analyzing trace with hash -825905215, now seen corresponding path program 1 times [2019-11-26 02:16:24,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:24,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371903497] [2019-11-26 02:16:24,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:24,630 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-26 02:16:24,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371903497] [2019-11-26 02:16:24,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:24,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:16:24,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360726878] [2019-11-26 02:16:24,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:16:24,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:24,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:16:24,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:16:24,632 INFO L87 Difference]: Start difference. First operand 610 states and 935 transitions. Second operand 4 states. [2019-11-26 02:16:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:24,861 INFO L93 Difference]: Finished difference Result 614 states and 943 transitions. [2019-11-26 02:16:24,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:16:24,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-26 02:16:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:24,866 INFO L225 Difference]: With dead ends: 614 [2019-11-26 02:16:24,866 INFO L226 Difference]: Without dead ends: 610 [2019-11-26 02:16:24,867 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-26 02:16:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-26 02:16:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 606. [2019-11-26 02:16:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-11-26 02:16:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 930 transitions. [2019-11-26 02:16:24,901 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 930 transitions. Word has length 38 [2019-11-26 02:16:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:24,902 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 930 transitions. [2019-11-26 02:16:24,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:16:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 930 transitions. [2019-11-26 02:16:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:16:24,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:24,904 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-26 02:16:24,905 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-26 02:16:24,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash -499211243, now seen corresponding path program 1 times [2019-11-26 02:16:24,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:24,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323040971] [2019-11-26 02:16:24,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:25,095 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-26 02:16:25,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323040971] [2019-11-26 02:16:25,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:25,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:16:25,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133477941] [2019-11-26 02:16:25,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:16:25,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:16:25,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:16:25,097 INFO L87 Difference]: Start difference. First operand 606 states and 930 transitions. Second operand 4 states. [2019-11-26 02:16:25,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:25,293 INFO L93 Difference]: Finished difference Result 845 states and 1309 transitions. [2019-11-26 02:16:25,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:16:25,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:16:25,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:25,299 INFO L225 Difference]: With dead ends: 845 [2019-11-26 02:16:25,299 INFO L226 Difference]: Without dead ends: 829 [2019-11-26 02:16:25,300 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-26 02:16:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-11-26 02:16:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 814. [2019-11-26 02:16:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-11-26 02:16:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1263 transitions. [2019-11-26 02:16:25,344 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1263 transitions. Word has length 50 [2019-11-26 02:16:25,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:25,347 INFO L462 AbstractCegarLoop]: Abstraction has 814 states and 1263 transitions. [2019-11-26 02:16:25,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:16:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1263 transitions. [2019-11-26 02:16:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:16:25,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:25,350 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-26 02:16:25,351 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-26 02:16:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash 502326328, now seen corresponding path program 1 times [2019-11-26 02:16:25,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:25,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383316166] [2019-11-26 02:16:25,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:25,514 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-26 02:16:25,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383316166] [2019-11-26 02:16:25,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:25,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:16:25,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175947127] [2019-11-26 02:16:25,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:25,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:25,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:25,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:25,516 INFO L87 Difference]: Start difference. First operand 814 states and 1263 transitions. Second operand 3 states. [2019-11-26 02:16:25,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:25,858 INFO L93 Difference]: Finished difference Result 1889 states and 2954 transitions. [2019-11-26 02:16:25,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:25,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-26 02:16:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:25,866 INFO L225 Difference]: With dead ends: 1889 [2019-11-26 02:16:25,866 INFO L226 Difference]: Without dead ends: 1103 [2019-11-26 02:16:25,868 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-26 02:16:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-11-26 02:16:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 981. [2019-11-26 02:16:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-26 02:16:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1527 transitions. [2019-11-26 02:16:25,923 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1527 transitions. Word has length 57 [2019-11-26 02:16:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:25,924 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1527 transitions. [2019-11-26 02:16:25,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1527 transitions. [2019-11-26 02:16:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:16:25,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:25,927 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-26 02:16:25,927 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-26 02:16:25,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:25,927 INFO L82 PathProgramCache]: Analyzing trace with hash 501460596, now seen corresponding path program 1 times [2019-11-26 02:16:25,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:25,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80180718] [2019-11-26 02:16:25,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:26,194 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-26 02:16:26,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80180718] [2019-11-26 02:16:26,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:26,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:16:26,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291800356] [2019-11-26 02:16:26,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:16:26,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:26,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:16:26,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:16:26,196 INFO L87 Difference]: Start difference. First operand 981 states and 1527 transitions. Second operand 4 states. [2019-11-26 02:16:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:26,692 INFO L93 Difference]: Finished difference Result 1264 states and 2002 transitions. [2019-11-26 02:16:26,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:16:26,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-26 02:16:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:26,700 INFO L225 Difference]: With dead ends: 1264 [2019-11-26 02:16:26,700 INFO L226 Difference]: Without dead ends: 1260 [2019-11-26 02:16:26,701 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-26 02:16:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-11-26 02:16:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 977. [2019-11-26 02:16:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-26 02:16:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1521 transitions. [2019-11-26 02:16:26,759 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1521 transitions. Word has length 57 [2019-11-26 02:16:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:26,760 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1521 transitions. [2019-11-26 02:16:26,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:16:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1521 transitions. [2019-11-26 02:16:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 02:16:26,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:26,761 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-26 02:16:26,762 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-26 02:16:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:26,763 INFO L82 PathProgramCache]: Analyzing trace with hash 630738529, now seen corresponding path program 1 times [2019-11-26 02:16:26,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:26,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86927194] [2019-11-26 02:16:26,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:27,054 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-26 02:16:27,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86927194] [2019-11-26 02:16:27,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:27,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:16:27,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089717945] [2019-11-26 02:16:27,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:16:27,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:27,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:16:27,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:16:27,056 INFO L87 Difference]: Start difference. First operand 977 states and 1521 transitions. Second operand 4 states. [2019-11-26 02:16:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:27,324 INFO L93 Difference]: Finished difference Result 1290 states and 2040 transitions. [2019-11-26 02:16:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:16:27,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-26 02:16:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:27,334 INFO L225 Difference]: With dead ends: 1290 [2019-11-26 02:16:27,334 INFO L226 Difference]: Without dead ends: 1288 [2019-11-26 02:16:27,335 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-26 02:16:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-11-26 02:16:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 975. [2019-11-26 02:16:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-11-26 02:16:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1518 transitions. [2019-11-26 02:16:27,398 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1518 transitions. Word has length 63 [2019-11-26 02:16:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:27,398 INFO L462 AbstractCegarLoop]: Abstraction has 975 states and 1518 transitions. [2019-11-26 02:16:27,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:16:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1518 transitions. [2019-11-26 02:16:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:16:27,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:27,400 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-26 02:16:27,400 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-26 02:16:27,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:27,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2126070331, now seen corresponding path program 1 times [2019-11-26 02:16:27,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:27,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888432800] [2019-11-26 02:16:27,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-26 02:16:28,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888432800] [2019-11-26 02:16:28,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:28,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:16:28,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559598459] [2019-11-26 02:16:28,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:28,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:28,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:28,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:28,625 INFO L87 Difference]: Start difference. First operand 975 states and 1518 transitions. Second operand 3 states. [2019-11-26 02:16:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:28,786 INFO L93 Difference]: Finished difference Result 1962 states and 3061 transitions. [2019-11-26 02:16:28,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:28,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-26 02:16:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:28,792 INFO L225 Difference]: With dead ends: 1962 [2019-11-26 02:16:28,792 INFO L226 Difference]: Without dead ends: 989 [2019-11-26 02:16:28,795 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-26 02:16:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-11-26 02:16:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2019-11-26 02:16:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-11-26 02:16:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1532 transitions. [2019-11-26 02:16:28,862 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1532 transitions. Word has length 64 [2019-11-26 02:16:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:28,863 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 1532 transitions. [2019-11-26 02:16:28,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1532 transitions. [2019-11-26 02:16:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:16:28,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:28,865 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, 1, 1, 1, 1, 1] [2019-11-26 02:16:28,865 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-26 02:16:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:28,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1025742921, now seen corresponding path program 1 times [2019-11-26 02:16:28,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:28,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837009713] [2019-11-26 02:16:28,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-26 02:16:29,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837009713] [2019-11-26 02:16:29,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:29,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:16:29,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675354276] [2019-11-26 02:16:29,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:29,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:29,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:29,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:29,415 INFO L87 Difference]: Start difference. First operand 989 states and 1532 transitions. Second operand 3 states. [2019-11-26 02:16:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:29,573 INFO L93 Difference]: Finished difference Result 1976 states and 3062 transitions. [2019-11-26 02:16:29,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:29,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-26 02:16:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:29,579 INFO L225 Difference]: With dead ends: 1976 [2019-11-26 02:16:29,580 INFO L226 Difference]: Without dead ends: 991 [2019-11-26 02:16:29,582 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-26 02:16:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-26 02:16:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-11-26 02:16:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-26 02:16:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1534 transitions. [2019-11-26 02:16:29,636 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1534 transitions. Word has length 69 [2019-11-26 02:16:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:29,636 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1534 transitions. [2019-11-26 02:16:29,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1534 transitions. [2019-11-26 02:16:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:16:29,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:29,642 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:16:29,642 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-26 02:16:29,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:29,643 INFO L82 PathProgramCache]: Analyzing trace with hash -919151373, now seen corresponding path program 1 times [2019-11-26 02:16:29,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:29,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590864600] [2019-11-26 02:16:29,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:30,638 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-26 02:16:30,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590864600] [2019-11-26 02:16:30,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:30,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:16:30,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357203598] [2019-11-26 02:16:30,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:30,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:30,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:30,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:30,641 INFO L87 Difference]: Start difference. First operand 991 states and 1534 transitions. Second operand 3 states. [2019-11-26 02:16:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:30,786 INFO L93 Difference]: Finished difference Result 1974 states and 3057 transitions. [2019-11-26 02:16:30,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:30,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-26 02:16:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:30,792 INFO L225 Difference]: With dead ends: 1974 [2019-11-26 02:16:30,792 INFO L226 Difference]: Without dead ends: 993 [2019-11-26 02:16:30,796 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-26 02:16:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-11-26 02:16:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2019-11-26 02:16:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-11-26 02:16:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1536 transitions. [2019-11-26 02:16:30,854 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1536 transitions. Word has length 71 [2019-11-26 02:16:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:30,854 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 1536 transitions. [2019-11-26 02:16:30,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1536 transitions. [2019-11-26 02:16:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-26 02:16:30,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:30,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:16:30,857 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-26 02:16:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1872879031, now seen corresponding path program 1 times [2019-11-26 02:16:30,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:30,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508637242] [2019-11-26 02:16:30,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-26 02:16:31,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508637242] [2019-11-26 02:16:31,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:31,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:16:31,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706737103] [2019-11-26 02:16:31,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:31,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:31,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:31,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:31,618 INFO L87 Difference]: Start difference. First operand 993 states and 1536 transitions. Second operand 3 states. [2019-11-26 02:16:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:31,718 INFO L93 Difference]: Finished difference Result 1980 states and 3067 transitions. [2019-11-26 02:16:31,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:31,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-26 02:16:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:31,725 INFO L225 Difference]: With dead ends: 1980 [2019-11-26 02:16:31,725 INFO L226 Difference]: Without dead ends: 1001 [2019-11-26 02:16:31,727 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-26 02:16:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-11-26 02:16:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2019-11-26 02:16:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-11-26 02:16:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1544 transitions. [2019-11-26 02:16:31,790 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1544 transitions. Word has length 73 [2019-11-26 02:16:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:31,790 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 1544 transitions. [2019-11-26 02:16:31,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1544 transitions. [2019-11-26 02:16:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-26 02:16:31,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:31,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:16:31,793 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-26 02:16:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash -397518835, now seen corresponding path program 1 times [2019-11-26 02:16:31,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:31,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530974503] [2019-11-26 02:16:31,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:16:32,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530974503] [2019-11-26 02:16:32,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965141087] [2019-11-26 02:16:32,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/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-26 02:16:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:33,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 2019 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:16:33,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:16:33,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:16:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-26 02:16:33,645 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:16:33,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:16:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-26 02:16:33,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:16:33,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-11-26 02:16:33,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675422243] [2019-11-26 02:16:33,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:16:33,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:33,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:16:33,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:16:33,683 INFO L87 Difference]: Start difference. First operand 1001 states and 1544 transitions. Second operand 5 states. [2019-11-26 02:16:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:34,099 INFO L93 Difference]: Finished difference Result 1622 states and 2502 transitions. [2019-11-26 02:16:34,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:16:34,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-26 02:16:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:34,109 INFO L225 Difference]: With dead ends: 1622 [2019-11-26 02:16:34,109 INFO L226 Difference]: Without dead ends: 1606 [2019-11-26 02:16:34,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:16:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-26 02:16:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 997. [2019-11-26 02:16:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:16:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1540 transitions. [2019-11-26 02:16:34,194 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1540 transitions. Word has length 81 [2019-11-26 02:16:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:34,194 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1540 transitions. [2019-11-26 02:16:34,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:16:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1540 transitions. [2019-11-26 02:16:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 02:16:34,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:34,196 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, 1] [2019-11-26 02:16:34,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:16:34,404 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-26 02:16:34,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:34,405 INFO L82 PathProgramCache]: Analyzing trace with hash -77580838, now seen corresponding path program 1 times [2019-11-26 02:16:34,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:16:34,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032412477] [2019-11-26 02:16:34,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:16:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-26 02:16:35,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032412477] [2019-11-26 02:16:35,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323960271] [2019-11-26 02:16:35,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:16:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:36,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 2011 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:16:36,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:16:36,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:16:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-26 02:16:36,260 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:16:36,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:16:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-26 02:16:36,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:16:36,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-11-26 02:16:36,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429306199] [2019-11-26 02:16:36,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:16:36,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:16:36,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:16:36,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:16:36,291 INFO L87 Difference]: Start difference. First operand 997 states and 1540 transitions. Second operand 5 states. [2019-11-26 02:16:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:36,696 INFO L93 Difference]: Finished difference Result 1265 states and 1940 transitions. [2019-11-26 02:16:36,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:16:36,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-26 02:16:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:36,697 INFO L225 Difference]: With dead ends: 1265 [2019-11-26 02:16:36,697 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:16:36,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:16:36,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:16:36,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:16:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:16:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:16:36,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2019-11-26 02:16:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:36,700 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:16:36,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:16:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:16:36,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:16:36,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:16:36,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:16:38,451 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 22 [2019-11-26 02:16:38,567 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2019-11-26 02:16:39,343 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 12 [2019-11-26 02:16:39,470 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2019-11-26 02:16:39,862 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-11-26 02:16:41,750 INFO L444 ceAbstractionStarter]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:16:41,750 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-26 02:16:41,750 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-26 02:16:41,750 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-26 02:16:41,751 INFO L440 ceAbstractionStarter]: At program point L5346(lines 1 5348) 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-26 02:16:41,751 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,751 INFO L440 ceAbstractionStarter]: At program point L3801-2(lines 3801 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-26 02:16:41,751 INFO L444 ceAbstractionStarter]: For program point L3801-4(lines 3801 3823) no Hoare annotation was computed. [2019-11-26 02:16:41,751 INFO L444 ceAbstractionStarter]: For program point L3736-2(lines 3736 3739) no Hoare annotation was computed. [2019-11-26 02:16:41,751 INFO L440 ceAbstractionStarter]: At program point L4003(lines 4003 4006) 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-26 02:16:41,751 INFO L444 ceAbstractionStarter]: For program point L3607(lines 3607 3610) no Hoare annotation was computed. [2019-11-26 02:16:41,751 INFO L444 ceAbstractionStarter]: For program point L3740(lines 3740 3743) no Hoare annotation was computed. [2019-11-26 02:16:41,752 INFO L440 ceAbstractionStarter]: At program point L4335(line 4335) 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-26 02:16:41,752 INFO L444 ceAbstractionStarter]: For program point L4270(line 4270) no Hoare annotation was computed. [2019-11-26 02:16:41,752 INFO L444 ceAbstractionStarter]: For program point L3940(lines 3940 3956) no Hoare annotation was computed. [2019-11-26 02:16:41,752 INFO L440 ceAbstractionStarter]: At program point L3940-1(lines 3940 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-26 02:16:41,752 INFO L444 ceAbstractionStarter]: For program point L3808-2(lines 3808 3811) no Hoare annotation was computed. [2019-11-26 02:16:41,752 INFO L440 ceAbstractionStarter]: At program point L4271(lines 4271 4283) 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-26 02:16:41,752 INFO L440 ceAbstractionStarter]: At program point L3875-1(lines 3875 3879) 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-26 02:16:41,752 INFO L440 ceAbstractionStarter]: At program point L3875(lines 3875 3879) 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-26 02:16:41,752 INFO L440 ceAbstractionStarter]: At program point L5330(lines 1 5348) 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-26 02:16:41,753 INFO L444 ceAbstractionStarter]: For program point L4273-2(lines 4271 4282) no Hoare annotation was computed. [2019-11-26 02:16:41,753 INFO L440 ceAbstractionStarter]: At program point L3613(lines 3602 3619) 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-26 02:16:41,753 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,753 INFO L444 ceAbstractionStarter]: For program point L3812(lines 3812 3816) no Hoare annotation was computed. [2019-11-26 02:16:41,753 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,753 INFO L440 ceAbstractionStarter]: At program point L5333(lines 1 5348) 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-26 02:16:41,753 INFO L440 ceAbstractionStarter]: At program point L3814(lines 3801 3822) 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-26 02:16:41,753 INFO L444 ceAbstractionStarter]: For program point L3881-1(lines 3881 3888) no Hoare annotation was computed. [2019-11-26 02:16:41,753 INFO L444 ceAbstractionStarter]: For program point L3881(lines 3881 3888) no Hoare annotation was computed. [2019-11-26 02:16:41,754 INFO L440 ceAbstractionStarter]: At program point L4014(lines 4014 4018) 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-26 02:16:41,754 INFO L440 ceAbstractionStarter]: At program point L4014-2(lines 3970 4036) 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-26 02:16:41,754 INFO L440 ceAbstractionStarter]: At program point L3618(lines 3597 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-26 02:16:41,754 INFO L440 ceAbstractionStarter]: At program point L4279(lines 5217 5220) 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-26 02:16:41,754 INFO L440 ceAbstractionStarter]: At program point L3949(lines 3940 3955) 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-26 02:16:41,754 INFO L444 ceAbstractionStarter]: For program point L4214(line 4214) no Hoare annotation was computed. [2019-11-26 02:16:41,754 INFO L440 ceAbstractionStarter]: At program point L4347(line 4347) 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-26 02:16:41,754 INFO L444 ceAbstractionStarter]: For program point L4215(lines 4215 4256) no Hoare annotation was computed. [2019-11-26 02:16:41,755 INFO L440 ceAbstractionStarter]: At program point L3687(line 3687) 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-26 02:16:41,755 INFO L444 ceAbstractionStarter]: For program point L5075(lines 5075 5078) no Hoare annotation was computed. [2019-11-26 02:16:41,755 INFO L440 ceAbstractionStarter]: At program point L5075-1(lines 5075 5078) 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-26 02:16:41,755 INFO L444 ceAbstractionStarter]: For program point L5075-4(lines 5075 5078) no Hoare annotation was computed. [2019-11-26 02:16:41,755 INFO L440 ceAbstractionStarter]: At program point L5075-5(lines 5075 5078) 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-26 02:16:41,755 INFO L444 ceAbstractionStarter]: For program point L5075-2(lines 5075 5078) no Hoare annotation was computed. [2019-11-26 02:16:41,755 INFO L440 ceAbstractionStarter]: At program point L5075-3(lines 5075 5078) 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-26 02:16:41,755 INFO L444 ceAbstractionStarter]: For program point L4218(line 4218) no Hoare annotation was computed. [2019-11-26 02:16:41,755 INFO L440 ceAbstractionStarter]: At program point L4219(lines 4219 4227) 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-26 02:16:41,755 INFO L444 ceAbstractionStarter]: For program point L4285(line 4285) no Hoare annotation was computed. [2019-11-26 02:16:41,756 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:16:41,756 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,756 INFO L440 ceAbstractionStarter]: At program point L3890(lines 3848 3900) 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-26 02:16:41,756 INFO L440 ceAbstractionStarter]: At program point L3890-1(lines 3848 3900) 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-26 02:16:41,756 INFO L444 ceAbstractionStarter]: For program point L3825(lines 3825 3828) no Hoare annotation was computed. [2019-11-26 02:16:41,756 INFO L444 ceAbstractionStarter]: For program point L4354(line 4354) no Hoare annotation was computed. [2019-11-26 02:16:41,756 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,756 INFO L440 ceAbstractionStarter]: At program point L4355(lines 4355 4363) 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-26 02:16:41,756 INFO L440 ceAbstractionStarter]: At program point L5346(lines 5346 5348) 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-26 02:16:41,757 INFO L440 ceAbstractionStarter]: At program point L3893-1(lines 3893 3896) 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-26 02:16:41,757 INFO L440 ceAbstractionStarter]: At program point L3893(lines 3893 3896) 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-26 02:16:41,757 INFO L440 ceAbstractionStarter]: At program point L3630(lines 3630 3633) 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-26 02:16:41,757 INFO L444 ceAbstractionStarter]: For program point L4292(line 4292) no Hoare annotation was computed. [2019-11-26 02:16:41,757 INFO L444 ceAbstractionStarter]: For program point L5217(lines 5216 5234) no Hoare annotation was computed. [2019-11-26 02:16:41,757 INFO L444 ceAbstractionStarter]: For program point L4293(lines 4293 4370) no Hoare annotation was computed. [2019-11-26 02:16:41,757 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-26 02:16:41,757 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-26 02:16:41,757 INFO L440 ceAbstractionStarter]: At program point L3897-1(lines 3848 3900) 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-26 02:16:41,758 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,758 INFO L440 ceAbstractionStarter]: At program point L3897(lines 3848 3900) 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-26 02:16:41,758 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-26 02:16:41,758 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-26 02:16:41,758 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-26 02:16:41,758 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-26 02:16:41,758 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-26 02:16:41,758 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-26 02:16:41,759 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-26 02:16:41,759 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-26 02:16:41,759 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-26 02:16:41,759 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-26 02:16:41,759 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-26 02:16:41,759 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-26 02:16:41,759 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-26 02:16:41,759 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-26 02:16:41,760 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-26 02:16:41,760 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-26 02:16:41,760 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-26 02:16:41,760 INFO L444 ceAbstractionStarter]: For program point L4229(line 4229) no Hoare annotation was computed. [2019-11-26 02:16:41,760 INFO L440 ceAbstractionStarter]: At program point L3899-1(lines 3836 3901) 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-26 02:16:41,760 INFO L440 ceAbstractionStarter]: At program point L3899(lines 3836 3901) 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-26 02:16:41,760 INFO L440 ceAbstractionStarter]: At program point L3833(lines 3706 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-26 02:16:41,760 INFO L440 ceAbstractionStarter]: At program point L4230(lines 4230 4234) 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-26 02:16:41,760 INFO L444 ceAbstractionStarter]: For program point L4296(line 4296) no Hoare annotation was computed. [2019-11-26 02:16:41,760 INFO L444 ceAbstractionStarter]: For program point L5221(lines 5216 5234) no Hoare annotation was computed. [2019-11-26 02:16:41,761 INFO L440 ceAbstractionStarter]: At program point L4297-2(lines 4295 4367) 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-26 02:16:41,761 INFO L440 ceAbstractionStarter]: At program point L4297(lines 4297 4301) 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-26 02:16:41,761 INFO L444 ceAbstractionStarter]: For program point L4034(line 4034) no Hoare annotation was computed. [2019-11-26 02:16:41,761 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,761 INFO L444 ceAbstractionStarter]: For program point L4365(line 4365) no Hoare annotation was computed. [2019-11-26 02:16:41,761 INFO L440 ceAbstractionStarter]: At program point L5092-1(lines 5092 5095) 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-26 02:16:41,761 INFO L444 ceAbstractionStarter]: For program point L5092(lines 5092 5095) no Hoare annotation was computed. [2019-11-26 02:16:41,761 INFO L440 ceAbstractionStarter]: At program point L4035(lines 3960 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) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-26 02:16:41,764 INFO L444 ceAbstractionStarter]: For program point L5225(lines 5216 5234) no Hoare annotation was computed. [2019-11-26 02:16:41,764 INFO L444 ceAbstractionStarter]: For program point L4565(lines 4565 4569) no Hoare annotation was computed. [2019-11-26 02:16:41,764 INFO L440 ceAbstractionStarter]: At program point L4565-1(lines 4565 4569) 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-26 02:16:41,764 INFO L440 ceAbstractionStarter]: At program point L4236(line 4236) 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-26 02:16:41,764 INFO L440 ceAbstractionStarter]: At program point L3180-1(lines 3970 4036) 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-26 02:16:41,765 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,765 INFO L447 ceAbstractionStarter]: At program point L5229(lines 5214 5235) the Hoare annotation is: true [2019-11-26 02:16:41,765 INFO L440 ceAbstractionStarter]: At program point L3974(lines 3974 3988) 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-26 02:16:41,765 INFO L440 ceAbstractionStarter]: At program point L3776(lines 3726 3834) 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-26 02:16:41,765 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,765 INFO L444 ceAbstractionStarter]: For program point L4372(line 4372) no Hoare annotation was computed. [2019-11-26 02:16:41,765 INFO L444 ceAbstractionStarter]: For program point L4308(line 4308) no Hoare annotation was computed. [2019-11-26 02:16:41,766 INFO L440 ceAbstractionStarter]: At program point L4375(lines 4185 4380) 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-26 02:16:41,766 INFO L444 ceAbstractionStarter]: For program point L4243(line 4243) no Hoare annotation was computed. [2019-11-26 02:16:41,766 INFO L440 ceAbstractionStarter]: At program point L4309(lines 4309 4314) 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-26 02:16:41,766 INFO L444 ceAbstractionStarter]: For program point L4244(lines 4244 4249) no Hoare annotation was computed. [2019-11-26 02:16:41,766 INFO L444 ceAbstractionStarter]: For program point L5169-2(lines 5169 5172) no Hoare annotation was computed. [2019-11-26 02:16:41,766 INFO L440 ceAbstractionStarter]: At program point L5169-3(lines 5169 5172) 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-26 02:16:41,767 INFO L444 ceAbstractionStarter]: For program point L5169(lines 5169 5172) no Hoare annotation was computed. [2019-11-26 02:16:41,767 INFO L440 ceAbstractionStarter]: At program point L5169-1(lines 5169 5172) 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-26 02:16:41,767 INFO L444 ceAbstractionStarter]: For program point L5169-6(lines 5169 5172) no Hoare annotation was computed. [2019-11-26 02:16:41,767 INFO L440 ceAbstractionStarter]: At program point L5169-7(lines 5169 5172) 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-26 02:16:41,767 INFO L444 ceAbstractionStarter]: For program point L5169-4(lines 5169 5172) no Hoare annotation was computed. [2019-11-26 02:16:41,767 INFO L440 ceAbstractionStarter]: At program point L5169-5(lines 5169 5172) 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-26 02:16:41,768 INFO L440 ceAbstractionStarter]: At program point L3782(lines 3726 3834) 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-26 02:16:41,768 INFO L440 ceAbstractionStarter]: At program point L4245(line 4245) 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-26 02:16:41,768 INFO L444 ceAbstractionStarter]: For program point L4245-1(line 4245) no Hoare annotation was computed. [2019-11-26 02:16:41,768 INFO L440 ceAbstractionStarter]: At program point L3785(lines 3785 3789) 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-26 02:16:41,768 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:16:41,768 INFO L440 ceAbstractionStarter]: At program point L3522-1(lines 1 5348) 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-26 02:16:41,769 INFO L444 ceAbstractionStarter]: For program point L3853-1(lines 3853 3856) no Hoare annotation was computed. [2019-11-26 02:16:41,769 INFO L444 ceAbstractionStarter]: For program point L3853(lines 3853 3856) no Hoare annotation was computed. [2019-11-26 02:16:41,769 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,769 INFO L444 ceAbstractionStarter]: For program point L4316(line 4316) no Hoare annotation was computed. [2019-11-26 02:16:41,769 INFO L444 ceAbstractionStarter]: For program point L4251(line 4251) no Hoare annotation was computed. [2019-11-26 02:16:41,769 INFO L444 ceAbstractionStarter]: For program point L4317(lines 4317 4321) no Hoare annotation was computed. [2019-11-26 02:16:41,769 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,770 INFO L444 ceAbstractionStarter]: For program point L3857-1(lines 3857 3861) no Hoare annotation was computed. [2019-11-26 02:16:41,770 INFO L444 ceAbstractionStarter]: For program point L3857(lines 3857 3861) no Hoare annotation was computed. [2019-11-26 02:16:41,770 INFO L444 ceAbstractionStarter]: For program point L4584-1(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,770 INFO L444 ceAbstractionStarter]: For program point L4584-2(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,770 INFO L444 ceAbstractionStarter]: For program point L4584(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,770 INFO L444 ceAbstractionStarter]: For program point L4584-5(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,770 INFO L444 ceAbstractionStarter]: For program point L4584-6(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,771 INFO L444 ceAbstractionStarter]: For program point L4584-3(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,771 INFO L444 ceAbstractionStarter]: For program point L4584-4(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,771 INFO L444 ceAbstractionStarter]: For program point L4584-9(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,771 INFO L444 ceAbstractionStarter]: For program point L4584-10(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,771 INFO L444 ceAbstractionStarter]: For program point L4584-7(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,771 INFO L444 ceAbstractionStarter]: For program point L4584-8(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,771 INFO L444 ceAbstractionStarter]: For program point L4584-11(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,772 INFO L440 ceAbstractionStarter]: At program point L3792(lines 3726 3834) 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-26 02:16:41,772 INFO L440 ceAbstractionStarter]: At program point L3661(lines 3621 3663) 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-26 02:16:41,772 INFO L440 ceAbstractionStarter]: At program point L3794(lines 3726 3834) 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-26 02:16:41,772 INFO L440 ceAbstractionStarter]: At program point L4323(line 4323) 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-26 02:16:41,772 INFO L444 ceAbstractionStarter]: For program point L4258(line 4258) no Hoare annotation was computed. [2019-11-26 02:16:41,772 INFO L444 ceAbstractionStarter]: For program point L4259(lines 4259 4290) no Hoare annotation was computed. [2019-11-26 02:16:41,772 INFO L440 ceAbstractionStarter]: At program point L3797(lines 3797 3830) 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-26 02:16:41,773 INFO L440 ceAbstractionStarter]: At program point L3797-2(lines 3726 3834) 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-26 02:16:41,773 INFO L444 ceAbstractionStarter]: For program point L3732(lines 3732 3735) no Hoare annotation was computed. [2019-11-26 02:16:41,773 INFO L447 ceAbstractionStarter]: At program point L3336(lines 3335 3338) the Hoare annotation is: true [2019-11-26 02:16:41,773 INFO L447 ceAbstractionStarter]: At program point L3336-2(lines 3335 3338) the Hoare annotation is: true [2019-11-26 02:16:41,773 INFO L447 ceAbstractionStarter]: At program point L3336-1(lines 3335 3338) the Hoare annotation is: true [2019-11-26 02:16:41,773 INFO L447 ceAbstractionStarter]: At program point L3336-3(lines 3335 3338) the Hoare annotation is: true [2019-11-26 02:16:41,774 INFO L444 ceAbstractionStarter]: For program point L4262(line 4262) no Hoare annotation was computed. [2019-11-26 02:16:41,774 INFO L440 ceAbstractionStarter]: At program point L3998(lines 3998 4001) 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-26 02:16:41,774 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,774 INFO L440 ceAbstractionStarter]: At program point L4263(lines 4263 4268) 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-26 02:16:41,774 INFO L444 ceAbstractionStarter]: For program point kref_subEXIT(lines 3460 3481) no Hoare annotation was computed. [2019-11-26 02:16:41,774 INFO L444 ceAbstractionStarter]: For program point L3474(lines 3474 3478) no Hoare annotation was computed. [2019-11-26 02:16:41,774 INFO L444 ceAbstractionStarter]: For program point L3475-1(line 3475) no Hoare annotation was computed. [2019-11-26 02:16:41,775 INFO L440 ceAbstractionStarter]: At program point kref_subENTRY(lines 3460 3481) 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-26 02:16:41,775 INFO L440 ceAbstractionStarter]: At program point L3475(line 3475) 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-26 02:16:41,775 INFO L444 ceAbstractionStarter]: For program point kref_subFINAL(lines 3460 3481) no Hoare annotation was computed. [2019-11-26 02:16:41,775 INFO L440 ceAbstractionStarter]: At program point L3486(line 3486) 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-26 02:16:41,775 INFO L444 ceAbstractionStarter]: For program point kref_putEXIT(lines 3482 3489) no Hoare annotation was computed. [2019-11-26 02:16:41,776 INFO L444 ceAbstractionStarter]: For program point L3486-1(line 3486) no Hoare annotation was computed. [2019-11-26 02:16:41,776 INFO L440 ceAbstractionStarter]: At program point kref_putENTRY(lines 3482 3489) 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-26 02:16:41,776 INFO L440 ceAbstractionStarter]: At program point L5333(lines 5332 5334) 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-26 02:16:41,776 INFO L444 ceAbstractionStarter]: For program point serio_raw_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,776 INFO L444 ceAbstractionStarter]: For program point L5169(lines 5169 5172) no Hoare annotation was computed. [2019-11-26 02:16:41,776 INFO L444 ceAbstractionStarter]: For program point serio_raw_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4585) no Hoare annotation was computed. [2019-11-26 02:16:41,777 INFO L440 ceAbstractionStarter]: At program point L5169-1(lines 5169 5172) 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-26 02:16:41,777 INFO L440 ceAbstractionStarter]: At program point serio_raw_disconnectENTRY(lines 4091 4109) 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-26 02:16:41,777 INFO L444 ceAbstractionStarter]: For program point serio_raw_disconnectEXIT(lines 4091 4109) no Hoare annotation was computed. [2019-11-26 02:16:41,777 INFO L440 ceAbstractionStarter]: At program point L5108-1(lines 5108 5111) 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-26 02:16:41,777 INFO L444 ceAbstractionStarter]: For program point L5108(lines 5108 5111) no Hoare annotation was computed. [2019-11-26 02:16:41,777 INFO L444 ceAbstractionStarter]: For program point L4584-1(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,778 INFO L440 ceAbstractionStarter]: At program point L4105(line 4105) 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-26 02:16:41,778 INFO L444 ceAbstractionStarter]: For program point L4584(line 4584) no Hoare annotation was computed. [2019-11-26 02:16:41,778 INFO L440 ceAbstractionStarter]: At program point L4081(lines 4072 4089) 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-26 02:16:41,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:16:41 BoogieIcfgContainer [2019-11-26 02:16:41,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:16:41,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:16:41,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:16:41,819 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:16:41,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:16:22" (3/4) ... [2019-11-26 02:16:41,823 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:16:41,828 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-26 02:16:41,828 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kref_sub [2019-11-26 02:16:41,828 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kref_put [2019-11-26 02:16:41,828 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure serio_raw_disconnect [2019-11-26 02:16:41,865 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 478 nodes and edges [2019-11-26 02:16:41,870 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 164 nodes and edges [2019-11-26 02:16:41,875 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-26 02:16:41,880 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 02:16:41,884 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:16:41,920 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((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) [2019-11-26 02:16:41,924 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(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)) [2019-11-26 02:16:41,925 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(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) [2019-11-26 02:16:41,926 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(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) [2019-11-26 02:16:41,927 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(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) [2019-11-26 02:16:41,927 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(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)) [2019-11-26 02:16:41,928 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(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)) [2019-11-26 02:16:41,929 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(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) [2019-11-26 02:16:41,930 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(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) [2019-11-26 02:16:42,153 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_91b09aeb-506d-45e6-b965-9eeb936c63a4/bin/utaipan/witness.graphml [2019-11-26 02:16:42,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:16:42,155 INFO L168 Benchmark]: Toolchain (without parser) took 28172.99 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 998.2 MB). Free memory was 939.3 MB in the beginning and 1.8 GB in the end (delta: -813.2 MB). Peak memory consumption was 185.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:16:42,155 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:16:42,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1483.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:16:42,156 INFO L168 Benchmark]: Boogie Procedure Inliner took 193.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:16:42,156 INFO L168 Benchmark]: Boogie Preprocessor took 180.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:16:42,157 INFO L168 Benchmark]: RCFGBuilder took 6199.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.4 MB). Peak memory consumption was 232.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:16:42,157 INFO L168 Benchmark]: TraceAbstraction took 19773.63 ms. Allocated memory was 1.3 GB in the beginning and 2.0 GB in the end (delta: 725.6 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -811.5 MB). Peak memory consumption was 829.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:16:42,157 INFO L168 Benchmark]: Witness Printer took 334.96 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:16:42,159 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1483.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 193.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 180.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6199.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.4 MB). Peak memory consumption was 232.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19773.63 ms. Allocated memory was 1.3 GB in the beginning and 2.0 GB in the end (delta: 725.6 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -811.5 MB). Peak memory consumption was 829.0 MB. Max. memory is 11.5 GB. * Witness Printer took 334.96 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4585]: 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: 3940]: 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: 5108]: 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: 5214]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4355]: 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: 3602]: 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: 4295]: 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: 4297]: 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: 3785]: 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: 3726]: 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: 4271]: 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: 3801]: 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: 4105]: 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: 3621]: 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: 5217]: 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: 3706]: 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: 4323]: 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: 5169]: 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 == 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) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3335]: Loop Invariant Derived loop invariant: 1 - 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: 3335]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3687]: 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: 4565]: 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: 3998]: 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: 3726]: 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: 3335]: Loop Invariant Derived loop invariant: 1 - 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: 3836]: 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: 3836]: 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: 3726]: 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: 3335]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4185]: 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: 3597]: 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: 3801]: 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: 5169]: 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: 5092]: 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: 3960]: 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: 3940]: 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: 5332]: 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: -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: 4309]: 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: 5169]: 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_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3797]: 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: 4236]: 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: 5169]: 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: 4091]: 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: 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: 3726]: 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: 3893]: 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: 4335]: 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: 5169]: 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 - 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: 3848]: 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: 3875]: 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: 3848]: 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: 5075]: 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: 4003]: 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: 3875]: 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: 3630]: 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: 4014]: 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: 3893]: 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: 3726]: 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: 4072]: 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: -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 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3970]: 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 == \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: 3970]: 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 == \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: 5075]: 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 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 4263]: 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: 3460]: 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: 3848]: 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 == 0) && ldv_state_variable_1 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5075]: 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 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3848]: 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: 4219]: 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: 4347]: 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: 3974]: 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: 4230]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 191 locations, 14 error locations. Result: SAFE, OverallTime: 19.6s, OverallIterations: 18, TraceHistogramMax: 4, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, HoareTripleCheckerStatistics: 5358 SDtfs, 3208 SDslu, 4189 SDs, 0 SdLazy, 613 SolverSat, 235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1001occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 1422 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 100 LocationsWithAnnotation, 1050 PreInvPairs, 1636 NumberOfFragments, 1934 HoareAnnotationTreeSize, 1050 FomulaSimplifications, 41813 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 100 FomulaSimplificationsInter, 9938 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1061 NumberOfCodeBlocks, 1061 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1206 ConstructedInterpolants, 0 QuantifiedInterpolants, 118284 SizeOfPredicates, 10 NumberOfNonLiveVariables, 4030 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 340/342 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...