./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.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_4ee133f5-753e-4e3e-8956-2dce22d59fb9/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.ko-entry_point.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/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 139e983ce92258f6d10df6c844d89fe736be0967 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:39:20,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:39:20,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:39:20,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:39:20,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:39:20,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:39:20,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:39:20,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:39:20,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:39:20,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:39:20,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:39:20,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:39:20,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:39:20,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:39:20,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:39:20,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:39:20,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:39:20,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:39:20,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:39:20,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:39:20,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:39:20,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:39:20,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:39:20,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:39:20,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:39:20,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:39:20,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:39:20,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:39:20,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:39:20,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:39:20,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:39:20,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:39:20,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:39:20,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:39:20,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:39:20,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:39:20,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:39:20,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:39:20,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:39:20,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:39:20,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:39:20,809 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/bin/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2019-11-26 02:39:20,826 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:39:20,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:39:20,827 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:39:20,827 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:39:20,827 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:39:20,827 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:39:20,828 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:39:20,828 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:39:20,828 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:39:20,828 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:39:20,828 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:39:20,829 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:39:20,829 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:39:20,829 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:39:20,829 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:39:20,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:39:20,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:39:20,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:39:20,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:39:20,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:39:20,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:39:20,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:39:20,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:39:20,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:39:20,832 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:39:20,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:39:20,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:39:20,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:39:20,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:39:20,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:39:20,833 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:39:20,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:39:20,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:39:20,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:39:20,834 INFO L138 SettingsManager]: * To the following directory=dump/ [2019-11-26 02:39:20,834 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_4ee133f5-753e-4e3e-8956-2dce22d59fb9/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 -> 139e983ce92258f6d10df6c844d89fe736be0967 [2019-11-26 02:39:20,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:39:20,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:39:20,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:39:20,984 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:39:20,984 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:39:20,985 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/bin/utaipan/../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.ko-entry_point.cil.out.i [2019-11-26 02:39:21,034 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/bin/utaipan/data/037292cb0/a6c48e5f39fc437dbdff3f19c57e0eb0/FLAG8638f572c [2019-11-26 02:39:21,731 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:39:21,731 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.ko-entry_point.cil.out.i [2019-11-26 02:39:21,771 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/bin/utaipan/data/037292cb0/a6c48e5f39fc437dbdff3f19c57e0eb0/FLAG8638f572c [2019-11-26 02:39:22,255 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/bin/utaipan/data/037292cb0/a6c48e5f39fc437dbdff3f19c57e0eb0 [2019-11-26 02:39:22,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:39:22,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:39:22,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:39:22,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:39:22,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:39:22,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:39:22" (1/1) ... [2019-11-26 02:39:22,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d0f7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:22, skipping insertion in model container [2019-11-26 02:39:22,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:39:22" (1/1) ... [2019-11-26 02:39:22,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:39:22,359 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:39:23,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:39:23,460 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:39:23,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:39:23,800 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:39:23,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:23 WrapperNode [2019-11-26 02:39:23,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:39:23,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:39:23,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:39:23,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:39:23,809 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:39:23" (1/1) ... [2019-11-26 02:39:23,861 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:39:23" (1/1) ... [2019-11-26 02:39:23,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:39:23,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:39:23,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:39:23,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:39:23,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:23" (1/1) ... [2019-11-26 02:39:23,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:23" (1/1) ... [2019-11-26 02:39:23,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:23" (1/1) ... [2019-11-26 02:39:24,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:23" (1/1) ... [2019-11-26 02:39:24,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:23" (1/1) ... [2019-11-26 02:39:24,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:23" (1/1) ... [2019-11-26 02:39:24,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:23" (1/1) ... [2019-11-26 02:39:24,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:39:24,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:39:24,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:39:24,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:39:24,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/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:39:24,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:39:24,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:39:24,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:39:24,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:39:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:39:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:39:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:39:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:39:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:39:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:39:24,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:39:48,206 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:39:48,206 INFO L284 CfgBuilder]: Removed 384 assume(true) statements. [2019-11-26 02:39:48,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:39:48 BoogieIcfgContainer [2019-11-26 02:39:48,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:39:48,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:39:48,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:39:48,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:39:48,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:39:22" (1/3) ... [2019-11-26 02:39:48,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1d93e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:39:48, skipping insertion in model container [2019-11-26 02:39:48,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:23" (2/3) ... [2019-11-26 02:39:48,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1d93e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:39:48, skipping insertion in model container [2019-11-26 02:39:48,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:39:48" (3/3) ... [2019-11-26 02:39:48,214 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.ko-entry_point.cil.out.i [2019-11-26 02:39:48,221 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:39:48,227 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-26 02:39:48,236 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-26 02:39:48,258 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:39:48,258 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:39:48,258 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:39:48,258 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:39:48,259 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:39:48,259 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:39:48,259 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:39:48,259 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:39:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2019-11-26 02:39:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:39:48,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:48,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:48,284 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:48,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1350160746, now seen corresponding path program 1 times [2019-11-26 02:39:48,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:48,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723023522] [2019-11-26 02:39:48,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:48,705 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:39:48,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723023522] [2019-11-26 02:39:48,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:48,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:39:48,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366002360] [2019-11-26 02:39:48,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:39:48,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:48,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:39:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:39:48,731 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 3 states. [2019-11-26 02:39:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:48,831 INFO L93 Difference]: Finished difference Result 318 states and 552 transitions. [2019-11-26 02:39:48,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:39:48,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-26 02:39:48,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:48,846 INFO L225 Difference]: With dead ends: 318 [2019-11-26 02:39:48,846 INFO L226 Difference]: Without dead ends: 197 [2019-11-26 02:39:48,852 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:39:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-26 02:39:48,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-11-26 02:39:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-26 02:39:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 336 transitions. [2019-11-26 02:39:48,932 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 336 transitions. Word has length 15 [2019-11-26 02:39:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:48,932 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 336 transitions. [2019-11-26 02:39:48,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:39:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 336 transitions. [2019-11-26 02:39:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:39:48,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:48,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:48,935 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2108014974, now seen corresponding path program 1 times [2019-11-26 02:39:48,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:48,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810952007] [2019-11-26 02:39:48,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:49,089 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:39:49,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810952007] [2019-11-26 02:39:49,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:49,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:39:49,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272538126] [2019-11-26 02:39:49,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:39:49,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:49,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:39:49,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:39:49,092 INFO L87 Difference]: Start difference. First operand 197 states and 336 transitions. Second operand 3 states. [2019-11-26 02:39:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:51,384 INFO L93 Difference]: Finished difference Result 388 states and 663 transitions. [2019-11-26 02:39:51,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:39:51,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-26 02:39:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:51,388 INFO L225 Difference]: With dead ends: 388 [2019-11-26 02:39:51,388 INFO L226 Difference]: Without dead ends: 199 [2019-11-26 02:39:51,390 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:39:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-26 02:39:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-11-26 02:39:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-26 02:39:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 338 transitions. [2019-11-26 02:39:51,416 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 338 transitions. Word has length 18 [2019-11-26 02:39:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:51,417 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 338 transitions. [2019-11-26 02:39:51,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:39:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 338 transitions. [2019-11-26 02:39:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 02:39:51,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:51,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:51,420 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:51,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:51,421 INFO L82 PathProgramCache]: Analyzing trace with hash -922737080, now seen corresponding path program 1 times [2019-11-26 02:39:51,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:51,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737359964] [2019-11-26 02:39:51,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:39:51,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737359964] [2019-11-26 02:39:51,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:51,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:39:51,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968309524] [2019-11-26 02:39:51,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:39:51,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:39:51,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:39:51,604 INFO L87 Difference]: Start difference. First operand 199 states and 338 transitions. Second operand 3 states. [2019-11-26 02:39:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:51,613 INFO L93 Difference]: Finished difference Result 199 states and 338 transitions. [2019-11-26 02:39:51,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:39:51,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-26 02:39:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:51,615 INFO L225 Difference]: With dead ends: 199 [2019-11-26 02:39:51,616 INFO L226 Difference]: Without dead ends: 197 [2019-11-26 02:39:51,616 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:39:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-26 02:39:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-11-26 02:39:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-26 02:39:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 336 transitions. [2019-11-26 02:39:51,630 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 336 transitions. Word has length 20 [2019-11-26 02:39:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:51,630 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 336 transitions. [2019-11-26 02:39:51,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:39:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 336 transitions. [2019-11-26 02:39:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:39:51,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:51,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:51,632 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1459920981, now seen corresponding path program 1 times [2019-11-26 02:39:51,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:51,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669827842] [2019-11-26 02:39:51,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:51,732 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:39:51,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669827842] [2019-11-26 02:39:51,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:51,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:39:51,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356390297] [2019-11-26 02:39:51,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:39:51,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:51,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:39:51,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:39:51,734 INFO L87 Difference]: Start difference. First operand 197 states and 336 transitions. Second operand 3 states. [2019-11-26 02:39:51,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:51,745 INFO L93 Difference]: Finished difference Result 197 states and 336 transitions. [2019-11-26 02:39:51,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:39:51,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-26 02:39:51,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:51,747 INFO L225 Difference]: With dead ends: 197 [2019-11-26 02:39:51,747 INFO L226 Difference]: Without dead ends: 195 [2019-11-26 02:39:51,748 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:39:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-26 02:39:51,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-11-26 02:39:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-26 02:39:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 334 transitions. [2019-11-26 02:39:51,760 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 334 transitions. Word has length 21 [2019-11-26 02:39:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:51,761 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 334 transitions. [2019-11-26 02:39:51,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:39:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 334 transitions. [2019-11-26 02:39:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 02:39:51,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:51,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:51,763 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1987090446, now seen corresponding path program 1 times [2019-11-26 02:39:51,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:51,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986679290] [2019-11-26 02:39:51,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:51,850 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:39:51,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986679290] [2019-11-26 02:39:51,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:51,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:39:51,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863325217] [2019-11-26 02:39:51,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:39:51,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:39:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:39:51,852 INFO L87 Difference]: Start difference. First operand 195 states and 334 transitions. Second operand 3 states. [2019-11-26 02:39:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:51,863 INFO L93 Difference]: Finished difference Result 195 states and 334 transitions. [2019-11-26 02:39:51,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:39:51,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-26 02:39:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:51,865 INFO L225 Difference]: With dead ends: 195 [2019-11-26 02:39:51,866 INFO L226 Difference]: Without dead ends: 193 [2019-11-26 02:39:51,866 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:39:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-26 02:39:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-26 02:39:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-26 02:39:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 332 transitions. [2019-11-26 02:39:51,877 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 332 transitions. Word has length 22 [2019-11-26 02:39:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:51,878 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 332 transitions. [2019-11-26 02:39:51,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:39:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 332 transitions. [2019-11-26 02:39:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:39:51,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:51,880 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:39:51,880 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:51,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:51,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1470262273, now seen corresponding path program 1 times [2019-11-26 02:39:51,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:51,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858856892] [2019-11-26 02:39:51,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:51,972 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:39:51,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858856892] [2019-11-26 02:39:51,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:51,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:39:51,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338177152] [2019-11-26 02:39:51,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:39:51,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:51,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:39:51,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:39:51,974 INFO L87 Difference]: Start difference. First operand 193 states and 332 transitions. Second operand 3 states. [2019-11-26 02:39:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:51,985 INFO L93 Difference]: Finished difference Result 193 states and 332 transitions. [2019-11-26 02:39:51,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:39:51,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-26 02:39:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:51,991 INFO L225 Difference]: With dead ends: 193 [2019-11-26 02:39:51,991 INFO L226 Difference]: Without dead ends: 191 [2019-11-26 02:39:51,992 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:39:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-26 02:39:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-11-26 02:39:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-26 02:39:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 330 transitions. [2019-11-26 02:39:52,008 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 330 transitions. Word has length 23 [2019-11-26 02:39:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:52,008 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 330 transitions. [2019-11-26 02:39:52,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:39:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 330 transitions. [2019-11-26 02:39:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:39:52,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:52,019 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:39:52,019 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:52,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1666509212, now seen corresponding path program 1 times [2019-11-26 02:39:52,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:52,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606656555] [2019-11-26 02:39:52,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:52,110 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:39:52,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606656555] [2019-11-26 02:39:52,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:52,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:39:52,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298077376] [2019-11-26 02:39:52,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:39:52,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:52,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:39:52,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:39:52,112 INFO L87 Difference]: Start difference. First operand 191 states and 330 transitions. Second operand 3 states. [2019-11-26 02:39:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:52,133 INFO L93 Difference]: Finished difference Result 191 states and 330 transitions. [2019-11-26 02:39:52,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:39:52,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-26 02:39:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:52,134 INFO L225 Difference]: With dead ends: 191 [2019-11-26 02:39:52,134 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:39:52,135 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:39:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:39:52,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:39:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:39:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:39:52,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-26 02:39:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:52,136 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:39:52,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:39:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:39:52,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:39:52,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:39:52,446 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-26 02:39:53,412 INFO L444 ceAbstractionStarter]: For program point L7038(line 7038) no Hoare annotation was computed. [2019-11-26 02:39:53,413 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6404) no Hoare annotation was computed. [2019-11-26 02:39:53,413 INFO L440 ceAbstractionStarter]: At program point L6840(lines 6840 6844) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,413 INFO L440 ceAbstractionStarter]: At program point L7039(lines 7039 7043) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,413 INFO L440 ceAbstractionStarter]: At program point L6974(line 6974) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,413 INFO L440 ceAbstractionStarter]: At program point L6380-2(lines 6367 6383) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,414 INFO L440 ceAbstractionStarter]: At program point L6380-1(lines 6367 6383) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,414 INFO L440 ceAbstractionStarter]: At program point L6380(lines 6367 6383) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,414 INFO L440 ceAbstractionStarter]: At program point L6380-3(lines 6367 6383) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,414 INFO L440 ceAbstractionStarter]: At program point L6579(lines 6532 6581) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,414 INFO L444 ceAbstractionStarter]: For program point L6515-1(lines 6515 6519) no Hoare annotation was computed. [2019-11-26 02:39:53,414 INFO L444 ceAbstractionStarter]: For program point L6515(lines 6515 6519) no Hoare annotation was computed. [2019-11-26 02:39:53,414 INFO L444 ceAbstractionStarter]: For program point L6515-2(lines 6515 6519) no Hoare annotation was computed. [2019-11-26 02:39:53,414 INFO L444 ceAbstractionStarter]: For program point L6846(lines 6846 6850) no Hoare annotation was computed. [2019-11-26 02:39:53,415 INFO L444 ceAbstractionStarter]: For program point L7045(line 7045) no Hoare annotation was computed. [2019-11-26 02:39:53,415 INFO L440 ceAbstractionStarter]: At program point L7046(lines 7046 7050) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,415 INFO L440 ceAbstractionStarter]: At program point L6848(lines 6788 6860) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,415 INFO L444 ceAbstractionStarter]: For program point L6982(line 6982) no Hoare annotation was computed. [2019-11-26 02:39:53,415 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6404) no Hoare annotation was computed. [2019-11-26 02:39:53,415 INFO L444 ceAbstractionStarter]: For program point L7052(line 7052) no Hoare annotation was computed. [2019-11-26 02:39:53,415 INFO L440 ceAbstractionStarter]: At program point L6854(lines 6788 6860) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,415 INFO L440 ceAbstractionStarter]: At program point L7053-2(lines 7030 7093) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,415 INFO L440 ceAbstractionStarter]: At program point L7053(lines 7053 7057) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,415 INFO L444 ceAbstractionStarter]: For program point L6989(line 6989) no Hoare annotation was computed. [2019-11-26 02:39:53,415 INFO L444 ceAbstractionStarter]: For program point L6990(lines 6990 7025) no Hoare annotation was computed. [2019-11-26 02:39:53,416 INFO L444 ceAbstractionStarter]: For program point L6792(lines 6792 6795) no Hoare annotation was computed. [2019-11-26 02:39:53,416 INFO L440 ceAbstractionStarter]: At program point L6859(lines 6780 6861) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,416 INFO L440 ceAbstractionStarter]: At program point L6529-2(lines 6501 6531) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,416 INFO L440 ceAbstractionStarter]: At program point L6529-1(lines 6501 6531) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,416 INFO L440 ceAbstractionStarter]: At program point L6529(lines 6501 6531) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,416 INFO L440 ceAbstractionStarter]: At program point L7058-1(lines 7030 7093) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,416 INFO L444 ceAbstractionStarter]: For program point L6993(line 6993) no Hoare annotation was computed. [2019-11-26 02:39:53,416 INFO L440 ceAbstractionStarter]: At program point L6994(lines 6994 6999) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,417 INFO L444 ceAbstractionStarter]: For program point L6400-2(lines 7315 7318) no Hoare annotation was computed. [2019-11-26 02:39:53,417 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:39:53,417 INFO L444 ceAbstractionStarter]: For program point L6400-1(lines 7311 7314) no Hoare annotation was computed. [2019-11-26 02:39:53,417 INFO L444 ceAbstractionStarter]: For program point L6400(lines 7307 7310) no Hoare annotation was computed. [2019-11-26 02:39:53,417 INFO L447 ceAbstractionStarter]: At program point L6400-4(lines 7300 7325) the Hoare annotation is: true [2019-11-26 02:39:53,417 INFO L444 ceAbstractionStarter]: For program point L6400-3(lines 7319 7322) no Hoare annotation was computed. [2019-11-26 02:39:53,417 INFO L440 ceAbstractionStarter]: At program point L6797(lines 6797 6802) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,417 INFO L444 ceAbstractionStarter]: For program point L6403-1(line 6403) no Hoare annotation was computed. [2019-11-26 02:39:53,417 INFO L444 ceAbstractionStarter]: For program point L6403(line 6403) no Hoare annotation was computed. [2019-11-26 02:39:53,417 INFO L444 ceAbstractionStarter]: For program point L6403-4(line 6403) no Hoare annotation was computed. [2019-11-26 02:39:53,418 INFO L444 ceAbstractionStarter]: For program point L6403-3(line 6403) no Hoare annotation was computed. [2019-11-26 02:39:53,418 INFO L444 ceAbstractionStarter]: For program point L6403-2(line 6403) no Hoare annotation was computed. [2019-11-26 02:39:53,418 INFO L440 ceAbstractionStarter]: At program point L7395-1(lines 1 7397) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,418 INFO L440 ceAbstractionStarter]: At program point L7395(lines 1 7397) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,418 INFO L444 ceAbstractionStarter]: For program point L7001(line 7001) no Hoare annotation was computed. [2019-11-26 02:39:53,418 INFO L440 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,418 INFO L440 ceAbstractionStarter]: At program point L7002(lines 7002 7018) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,418 INFO L440 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,419 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6404) no Hoare annotation was computed. [2019-11-26 02:39:53,419 INFO L440 ceAbstractionStarter]: At program point L-1-8(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,419 INFO L440 ceAbstractionStarter]: At program point L-1-11(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,419 INFO L440 ceAbstractionStarter]: At program point L-1-14(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,419 INFO L440 ceAbstractionStarter]: At program point L-1-17(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,419 INFO L440 ceAbstractionStarter]: At program point L-1-20(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,419 INFO L440 ceAbstractionStarter]: At program point L-1-23(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,419 INFO L440 ceAbstractionStarter]: At program point L-1-26(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,420 INFO L440 ceAbstractionStarter]: At program point L-1-29(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,420 INFO L440 ceAbstractionStarter]: At program point L-1-32(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,420 INFO L440 ceAbstractionStarter]: At program point L-1-35(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,420 INFO L440 ceAbstractionStarter]: At program point L7069(line 7069) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,420 INFO L440 ceAbstractionStarter]: At program point L-1-38(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,420 INFO L440 ceAbstractionStarter]: At program point L-1-41(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,420 INFO L440 ceAbstractionStarter]: At program point L-1-44(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,420 INFO L440 ceAbstractionStarter]: At program point L-1-47(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,421 INFO L440 ceAbstractionStarter]: At program point L-1-50(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,421 INFO L440 ceAbstractionStarter]: At program point L-1-53(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,421 INFO L440 ceAbstractionStarter]: At program point L-1-56(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,421 INFO L440 ceAbstractionStarter]: At program point L-1-59(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,421 INFO L440 ceAbstractionStarter]: At program point L-1-62(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,421 INFO L440 ceAbstractionStarter]: At program point L-1-65(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,421 INFO L440 ceAbstractionStarter]: At program point L7004-1(lines 7002 7017) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,421 INFO L444 ceAbstractionStarter]: For program point L7004(lines 7004 7011) no Hoare annotation was computed. [2019-11-26 02:39:53,422 INFO L440 ceAbstractionStarter]: At program point L-1-68(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,422 INFO L440 ceAbstractionStarter]: At program point L6806(lines 6806 6810) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,422 INFO L440 ceAbstractionStarter]: At program point L-1-71(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,422 INFO L440 ceAbstractionStarter]: At program point L6674(lines 6674 6682) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,422 INFO L440 ceAbstractionStarter]: At program point L-1-74(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,422 INFO L440 ceAbstractionStarter]: At program point L-1-77(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,422 INFO L444 ceAbstractionStarter]: For program point L6674-2(lines 6674 6682) no Hoare annotation was computed. [2019-11-26 02:39:53,422 INFO L440 ceAbstractionStarter]: At program point L-1-80(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,422 INFO L447 ceAbstractionStarter]: At program point L6410(lines 6409 6412) the Hoare annotation is: true [2019-11-26 02:39:53,423 INFO L440 ceAbstractionStarter]: At program point L-1-83(line -1) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,423 INFO L447 ceAbstractionStarter]: At program point L6410-3(lines 6409 6412) the Hoare annotation is: true [2019-11-26 02:39:53,423 INFO L447 ceAbstractionStarter]: At program point L6410-2(lines 6409 6412) the Hoare annotation is: true [2019-11-26 02:39:53,423 INFO L447 ceAbstractionStarter]: At program point L6410-1(lines 6409 6412) the Hoare annotation is: true [2019-11-26 02:39:53,423 INFO L444 ceAbstractionStarter]: For program point L6676(lines 6676 6680) no Hoare annotation was computed. [2019-11-26 02:39:53,423 INFO L444 ceAbstractionStarter]: For program point L6612(lines 6612 6615) no Hoare annotation was computed. [2019-11-26 02:39:53,423 INFO L444 ceAbstractionStarter]: For program point L6548(lines 6548 6552) no Hoare annotation was computed. [2019-11-26 02:39:53,423 INFO L440 ceAbstractionStarter]: At program point L7077(line 7077) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,423 INFO L440 ceAbstractionStarter]: At program point L6616(lines 6593 6623) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,424 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6404) no Hoare annotation was computed. [2019-11-26 02:39:53,424 INFO L440 ceAbstractionStarter]: At program point L6815(lines 6815 6819) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,424 INFO L440 ceAbstractionStarter]: At program point L7014(lines 7303 7306) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,424 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6404) no Hoare annotation was computed. [2019-11-26 02:39:53,424 INFO L440 ceAbstractionStarter]: At program point L6622(lines 6582 6624) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,424 INFO L444 ceAbstractionStarter]: For program point L6821(lines 6821 6826) no Hoare annotation was computed. [2019-11-26 02:39:53,424 INFO L444 ceAbstractionStarter]: For program point L7020(line 7020) no Hoare annotation was computed. [2019-11-26 02:39:53,424 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:39:53,424 INFO L444 ceAbstractionStarter]: For program point L7091(line 7091) no Hoare annotation was computed. [2019-11-26 02:39:53,425 INFO L444 ceAbstractionStarter]: For program point L6959(line 6959) no Hoare annotation was computed. [2019-11-26 02:39:53,425 INFO L444 ceAbstractionStarter]: For program point L6960(lines 6960 6987) no Hoare annotation was computed. [2019-11-26 02:39:53,425 INFO L444 ceAbstractionStarter]: For program point L7027(line 7027) no Hoare annotation was computed. [2019-11-26 02:39:53,425 INFO L440 ceAbstractionStarter]: At program point L6697(lines 6642 6703) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,425 INFO L444 ceAbstractionStarter]: For program point L7028(lines 7028 7096) no Hoare annotation was computed. [2019-11-26 02:39:53,425 INFO L444 ceAbstractionStarter]: For program point L6963(line 6963) no Hoare annotation was computed. [2019-11-26 02:39:53,425 INFO L440 ceAbstractionStarter]: At program point L6964(lines 6964 6972) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,425 INFO L444 ceAbstractionStarter]: For program point L7031(line 7031) no Hoare annotation was computed. [2019-11-26 02:39:53,427 INFO L444 ceAbstractionStarter]: For program point L7098(line 7098) no Hoare annotation was computed. [2019-11-26 02:39:53,428 INFO L440 ceAbstractionStarter]: At program point L7032(lines 7032 7036) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,428 INFO L440 ceAbstractionStarter]: At program point L6834(lines 6834 6838) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,428 INFO L440 ceAbstractionStarter]: At program point L6702(lines 6625 6704) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,428 INFO L440 ceAbstractionStarter]: At program point L6768(lines 6723 6776) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,428 INFO L444 ceAbstractionStarter]: For program point L6374(lines 6374 6381) no Hoare annotation was computed. [2019-11-26 02:39:53,429 INFO L444 ceAbstractionStarter]: For program point L6374-3(lines 6374 6381) no Hoare annotation was computed. [2019-11-26 02:39:53,429 INFO L444 ceAbstractionStarter]: For program point L6374-2(lines 6374 6381) no Hoare annotation was computed. [2019-11-26 02:39:53,429 INFO L444 ceAbstractionStarter]: For program point L6374-1(lines 6374 6381) no Hoare annotation was computed. [2019-11-26 02:39:53,429 INFO L440 ceAbstractionStarter]: At program point L7101(lines 6936 7106) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-26 02:39:53,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:39:53 BoogieIcfgContainer [2019-11-26 02:39:53,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:39:53,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:39:53,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:39:53,476 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:39:53,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:39:48" (3/4) ... [2019-11-26 02:39:53,479 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:39:53,532 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 415 nodes and edges [2019-11-26 02:39:53,537 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 167 nodes and edges [2019-11-26 02:39:53,541 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-11-26 02:39:53,546 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 02:39:53,550 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:39:53,789 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4ee133f5-753e-4e3e-8956-2dce22d59fb9/bin/utaipan/witness.graphml [2019-11-26 02:39:53,790 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:39:53,791 INFO L168 Benchmark]: Toolchain (without parser) took 31532.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 322.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -122.2 MB). Peak memory consumption was 200.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:53,792 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:39:53,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1541.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -73.2 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:53,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 996.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:53,793 INFO L168 Benchmark]: Boogie Preprocessor took 171.97 ms. Allocated memory is still 1.2 GB. Free memory was 996.4 MB in the beginning and 985.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:53,794 INFO L168 Benchmark]: RCFGBuilder took 24064.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 88.6 MB). Free memory was 985.7 MB in the beginning and 1.1 GB in the end (delta: -79.1 MB). Peak memory consumption was 255.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:53,794 INFO L168 Benchmark]: TraceAbstraction took 5266.95 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 105.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.0 MB). Peak memory consumption was 258.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:53,795 INFO L168 Benchmark]: Witness Printer took 314.44 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:53,797 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1541.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -73.2 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 168.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 996.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 171.97 ms. Allocated memory is still 1.2 GB. Free memory was 996.4 MB in the beginning and 985.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 24064.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 88.6 MB). Free memory was 985.7 MB in the beginning and 1.1 GB in the end (delta: -79.1 MB). Peak memory consumption was 255.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5266.95 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 105.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.0 MB). Peak memory consumption was 258.8 MB. Max. memory is 11.5 GB. * Witness Printer took 314.44 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6404]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6404]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6404]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6404]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6404]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6409]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7039]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 7032]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 7300]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7030]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 7303]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6974]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6532]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 7069]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6674]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6593]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 7002]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6788]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 7077]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6642]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6964]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6501]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6501]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6501]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6840]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6367]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6994]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6367]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6780]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 7030]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6367]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6788]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6815]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6367]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6625]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6797]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 7053]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 7046]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6723]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 7002]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6409]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6582]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6936]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6409]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6409]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6834]: Loop Invariant Derived loop invariant: (((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 5 error locations. Result: SAFE, OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 1301 SDtfs, 969 SDslu, 320 SDs, 0 SdLazy, 73 SolverSat, 5 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 72 LocationsWithAnnotation, 72 PreInvPairs, 201 NumberOfFragments, 1479 HoareAnnotationTreeSize, 72 FomulaSimplifications, 1514 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 72 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 10078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10/10 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...