./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8ac17e19a3bced8ee496b71c69228aeb3645867a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 04:17:00,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:17:00,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:17:01,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:17:01,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:17:01,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:17:01,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:17:01,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:17:01,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:17:01,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:17:01,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:17:01,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:17:01,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:17:01,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:17:01,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:17:01,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:17:01,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:17:01,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:17:01,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:17:01,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:17:01,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:17:01,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:17:01,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:17:01,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:17:01,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:17:01,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:17:01,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:17:01,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:17:01,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:17:01,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:17:01,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:17:01,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:17:01,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:17:01,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:17:01,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:17:01,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:17:01,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:17:01,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:17:01,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:17:01,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:17:01,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:17:01,077 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-20 04:17:01,099 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:17:01,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:17:01,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:17:01,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:17:01,102 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:17:01,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:17:01,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:17:01,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:17:01,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:17:01,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:17:01,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:17:01,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:17:01,105 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:17:01,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:17:01,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:17:01,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:17:01,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:17:01,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:17:01,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:17:01,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:17:01,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:17:01,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:17:01,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:17:01,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:17:01,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:17:01,108 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 04:17:01,109 INFO L138 SettingsManager]: * To the following directory=dump/ 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_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer 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 -> Automizer 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 -> 8ac17e19a3bced8ee496b71c69228aeb3645867a [2019-11-20 04:17:01,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:17:01,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:17:01,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:17:01,310 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:17:01,310 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:17:01,311 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-20 04:17:01,394 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/data/0fcde4b42/a0e7017e0d5c4c83a35ffadb288c71a0/FLAG3be8de5d4 [2019-11-20 04:17:02,129 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:17:02,130 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-20 04:17:02,161 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/data/0fcde4b42/a0e7017e0d5c4c83a35ffadb288c71a0/FLAG3be8de5d4 [2019-11-20 04:17:02,202 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/data/0fcde4b42/a0e7017e0d5c4c83a35ffadb288c71a0 [2019-11-20 04:17:02,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:17:02,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:17:02,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:17:02,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:17:02,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:17:02,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:17:02" (1/1) ... [2019-11-20 04:17:02,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6365c130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:02, skipping insertion in model container [2019-11-20 04:17:02,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:17:02" (1/1) ... [2019-11-20 04:17:02,226 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:17:02,336 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:17:03,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:17:03,412 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:17:03,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:17:03,673 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:17:03,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03 WrapperNode [2019-11-20 04:17:03,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:17:03,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:17:03,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:17:03,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:17:03,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03" (1/1) ... [2019-11-20 04:17:03,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03" (1/1) ... [2019-11-20 04:17:03,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:17:03,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:17:03,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:17:03,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:17:03,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03" (1/1) ... [2019-11-20 04:17:03,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03" (1/1) ... [2019-11-20 04:17:03,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03" (1/1) ... [2019-11-20 04:17:03,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03" (1/1) ... [2019-11-20 04:17:03,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03" (1/1) ... [2019-11-20 04:17:03,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03" (1/1) ... [2019-11-20 04:17:03,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03" (1/1) ... [2019-11-20 04:17:03,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:17:03,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:17:03,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:17:03,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:17:03,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/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-20 04:17:04,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 04:17:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 04:17:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 04:17:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 04:17:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 04:17:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 04:17:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 04:17:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 04:17:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:17:04,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:17:04,676 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 04:17:05,911 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-11-20 04:17:05,912 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-11-20 04:17:05,914 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:17:05,914 INFO L285 CfgBuilder]: Removed 135 assume(true) statements. [2019-11-20 04:17:05,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:17:05 BoogieIcfgContainer [2019-11-20 04:17:05,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:17:05,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:17:05,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:17:05,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:17:05,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:17:02" (1/3) ... [2019-11-20 04:17:05,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c216ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:17:05, skipping insertion in model container [2019-11-20 04:17:05,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:17:03" (2/3) ... [2019-11-20 04:17:05,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c216ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:17:05, skipping insertion in model container [2019-11-20 04:17:05,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:17:05" (3/3) ... [2019-11-20 04:17:05,926 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-20 04:17:05,938 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:17:05,947 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-20 04:17:05,960 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-20 04:17:05,990 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:17:05,991 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:17:05,991 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:17:05,991 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:17:05,992 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:17:05,992 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:17:05,992 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:17:05,992 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:17:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-20 04:17:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 04:17:06,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:06,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:06,033 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:06,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:06,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1802507212, now seen corresponding path program 1 times [2019-11-20 04:17:06,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:06,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36716972] [2019-11-20 04:17:06,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:06,507 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-20 04:17:06,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36716972] [2019-11-20 04:17:06,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:06,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:17:06,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005917444] [2019-11-20 04:17:06,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:17:06,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:06,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:17:06,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:17:06,549 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-11-20 04:17:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:06,694 INFO L93 Difference]: Finished difference Result 345 states and 479 transitions. [2019-11-20 04:17:06,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:17:06,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-20 04:17:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:06,729 INFO L225 Difference]: With dead ends: 345 [2019-11-20 04:17:06,732 INFO L226 Difference]: Without dead ends: 216 [2019-11-20 04:17:06,736 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-20 04:17:06,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-20 04:17:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208. [2019-11-20 04:17:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-20 04:17:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2019-11-20 04:17:06,833 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 11 [2019-11-20 04:17:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:06,833 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2019-11-20 04:17:06,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:17:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2019-11-20 04:17:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 04:17:06,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:06,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:06,836 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash 43147479, now seen corresponding path program 1 times [2019-11-20 04:17:06,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:06,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794087806] [2019-11-20 04:17:06,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:07,009 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-20 04:17:07,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794087806] [2019-11-20 04:17:07,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:07,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:17:07,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875608929] [2019-11-20 04:17:07,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:17:07,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:07,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:17:07,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:17:07,013 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand 3 states. [2019-11-20 04:17:07,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:07,102 INFO L93 Difference]: Finished difference Result 600 states and 732 transitions. [2019-11-20 04:17:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:17:07,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-20 04:17:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:07,107 INFO L225 Difference]: With dead ends: 600 [2019-11-20 04:17:07,108 INFO L226 Difference]: Without dead ends: 398 [2019-11-20 04:17:07,114 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-20 04:17:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-11-20 04:17:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 384. [2019-11-20 04:17:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-20 04:17:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 470 transitions. [2019-11-20 04:17:07,176 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 470 transitions. Word has length 12 [2019-11-20 04:17:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:07,176 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 470 transitions. [2019-11-20 04:17:07,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:17:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 470 transitions. [2019-11-20 04:17:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 04:17:07,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:07,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:07,179 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:07,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 97836559, now seen corresponding path program 1 times [2019-11-20 04:17:07,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:07,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743957635] [2019-11-20 04:17:07,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:07,328 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-20 04:17:07,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743957635] [2019-11-20 04:17:07,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:07,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:17:07,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978503252] [2019-11-20 04:17:07,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:17:07,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:07,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:17:07,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:17:07,331 INFO L87 Difference]: Start difference. First operand 384 states and 470 transitions. Second operand 5 states. [2019-11-20 04:17:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:07,718 INFO L93 Difference]: Finished difference Result 882 states and 1112 transitions. [2019-11-20 04:17:07,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:17:07,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-20 04:17:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:07,723 INFO L225 Difference]: With dead ends: 882 [2019-11-20 04:17:07,723 INFO L226 Difference]: Without dead ends: 505 [2019-11-20 04:17:07,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 04:17:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-20 04:17:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 455. [2019-11-20 04:17:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-20 04:17:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 571 transitions. [2019-11-20 04:17:07,757 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 571 transitions. Word has length 27 [2019-11-20 04:17:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:07,757 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 571 transitions. [2019-11-20 04:17:07,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:17:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 571 transitions. [2019-11-20 04:17:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 04:17:07,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:07,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:07,763 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:07,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1015401359, now seen corresponding path program 1 times [2019-11-20 04:17:07,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:07,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636587425] [2019-11-20 04:17:07,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:07,948 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-20 04:17:07,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636587425] [2019-11-20 04:17:07,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:07,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:17:07,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440745518] [2019-11-20 04:17:07,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:17:07,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:07,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:17:07,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:07,950 INFO L87 Difference]: Start difference. First operand 455 states and 571 transitions. Second operand 4 states. [2019-11-20 04:17:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:08,042 INFO L93 Difference]: Finished difference Result 915 states and 1147 transitions. [2019-11-20 04:17:08,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:17:08,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-20 04:17:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:08,048 INFO L225 Difference]: With dead ends: 915 [2019-11-20 04:17:08,049 INFO L226 Difference]: Without dead ends: 680 [2019-11-20 04:17:08,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:17:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-11-20 04:17:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 459. [2019-11-20 04:17:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-11-20 04:17:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 575 transitions. [2019-11-20 04:17:08,077 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 575 transitions. Word has length 43 [2019-11-20 04:17:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:08,078 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 575 transitions. [2019-11-20 04:17:08,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:17:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 575 transitions. [2019-11-20 04:17:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 04:17:08,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:08,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:08,091 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:08,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2036405118, now seen corresponding path program 1 times [2019-11-20 04:17:08,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:08,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094340188] [2019-11-20 04:17:08,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:08,252 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-20 04:17:08,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094340188] [2019-11-20 04:17:08,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:08,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:17:08,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207985328] [2019-11-20 04:17:08,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:17:08,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:08,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:17:08,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:08,254 INFO L87 Difference]: Start difference. First operand 459 states and 575 transitions. Second operand 4 states. [2019-11-20 04:17:08,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:08,322 INFO L93 Difference]: Finished difference Result 961 states and 1206 transitions. [2019-11-20 04:17:08,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:17:08,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-20 04:17:08,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:08,327 INFO L225 Difference]: With dead ends: 961 [2019-11-20 04:17:08,327 INFO L226 Difference]: Without dead ends: 511 [2019-11-20 04:17:08,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:17:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-11-20 04:17:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 314. [2019-11-20 04:17:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-20 04:17:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 388 transitions. [2019-11-20 04:17:08,349 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 388 transitions. Word has length 47 [2019-11-20 04:17:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:08,350 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 388 transitions. [2019-11-20 04:17:08,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:17:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 388 transitions. [2019-11-20 04:17:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 04:17:08,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:08,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:08,353 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:08,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:08,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1015336764, now seen corresponding path program 1 times [2019-11-20 04:17:08,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:08,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218360877] [2019-11-20 04:17:08,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:08,500 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-20 04:17:08,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218360877] [2019-11-20 04:17:08,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:08,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:17:08,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2464918] [2019-11-20 04:17:08,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:17:08,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:08,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:17:08,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:08,502 INFO L87 Difference]: Start difference. First operand 314 states and 388 transitions. Second operand 4 states. [2019-11-20 04:17:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:08,609 INFO L93 Difference]: Finished difference Result 554 states and 683 transitions. [2019-11-20 04:17:08,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:17:08,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-20 04:17:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:08,613 INFO L225 Difference]: With dead ends: 554 [2019-11-20 04:17:08,613 INFO L226 Difference]: Without dead ends: 550 [2019-11-20 04:17:08,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-20 04:17:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 528. [2019-11-20 04:17:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-20 04:17:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 660 transitions. [2019-11-20 04:17:08,644 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 660 transitions. Word has length 47 [2019-11-20 04:17:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:08,645 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 660 transitions. [2019-11-20 04:17:08,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:17:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 660 transitions. [2019-11-20 04:17:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 04:17:08,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:08,647 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:08,647 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1949403581, now seen corresponding path program 1 times [2019-11-20 04:17:08,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:08,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332676402] [2019-11-20 04:17:08,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:17:08,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332676402] [2019-11-20 04:17:08,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:08,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:17:08,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845172142] [2019-11-20 04:17:08,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:17:08,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:08,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:17:08,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:17:08,744 INFO L87 Difference]: Start difference. First operand 528 states and 660 transitions. Second operand 5 states. [2019-11-20 04:17:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:08,876 INFO L93 Difference]: Finished difference Result 1079 states and 1338 transitions. [2019-11-20 04:17:08,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 04:17:08,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-20 04:17:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:08,879 INFO L225 Difference]: With dead ends: 1079 [2019-11-20 04:17:08,880 INFO L226 Difference]: Without dead ends: 553 [2019-11-20 04:17:08,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 04:17:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-20 04:17:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 517. [2019-11-20 04:17:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-20 04:17:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 641 transitions. [2019-11-20 04:17:08,922 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 641 transitions. Word has length 49 [2019-11-20 04:17:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:08,923 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 641 transitions. [2019-11-20 04:17:08,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:17:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 641 transitions. [2019-11-20 04:17:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 04:17:08,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:08,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:08,925 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1249342346, now seen corresponding path program 1 times [2019-11-20 04:17:08,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:08,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614532426] [2019-11-20 04:17:08,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:09,079 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-20 04:17:09,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614532426] [2019-11-20 04:17:09,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:09,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:17:09,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696328584] [2019-11-20 04:17:09,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:17:09,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:09,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:17:09,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:17:09,081 INFO L87 Difference]: Start difference. First operand 517 states and 641 transitions. Second operand 3 states. [2019-11-20 04:17:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:09,144 INFO L93 Difference]: Finished difference Result 1001 states and 1237 transitions. [2019-11-20 04:17:09,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:17:09,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-20 04:17:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:09,149 INFO L225 Difference]: With dead ends: 1001 [2019-11-20 04:17:09,149 INFO L226 Difference]: Without dead ends: 518 [2019-11-20 04:17:09,150 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-20 04:17:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-11-20 04:17:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 489. [2019-11-20 04:17:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-11-20 04:17:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 595 transitions. [2019-11-20 04:17:09,190 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 595 transitions. Word has length 54 [2019-11-20 04:17:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:09,191 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 595 transitions. [2019-11-20 04:17:09,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:17:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 595 transitions. [2019-11-20 04:17:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 04:17:09,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:09,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:09,193 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2015730543, now seen corresponding path program 1 times [2019-11-20 04:17:09,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:09,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510036499] [2019-11-20 04:17:09,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:09,340 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-20 04:17:09,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510036499] [2019-11-20 04:17:09,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:09,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:17:09,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704978407] [2019-11-20 04:17:09,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:17:09,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:09,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:17:09,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:09,342 INFO L87 Difference]: Start difference. First operand 489 states and 595 transitions. Second operand 4 states. [2019-11-20 04:17:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:09,449 INFO L93 Difference]: Finished difference Result 730 states and 883 transitions. [2019-11-20 04:17:09,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:17:09,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-20 04:17:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:09,454 INFO L225 Difference]: With dead ends: 730 [2019-11-20 04:17:09,455 INFO L226 Difference]: Without dead ends: 704 [2019-11-20 04:17:09,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:17:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-11-20 04:17:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 493. [2019-11-20 04:17:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-20 04:17:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 599 transitions. [2019-11-20 04:17:09,506 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 599 transitions. Word has length 56 [2019-11-20 04:17:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:09,506 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 599 transitions. [2019-11-20 04:17:09,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:17:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 599 transitions. [2019-11-20 04:17:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 04:17:09,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:09,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:09,508 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash -247920110, now seen corresponding path program 1 times [2019-11-20 04:17:09,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:09,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650688147] [2019-11-20 04:17:09,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:09,678 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-20 04:17:09,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650688147] [2019-11-20 04:17:09,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:09,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:17:09,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703365192] [2019-11-20 04:17:09,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:17:09,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:09,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:17:09,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:17:09,682 INFO L87 Difference]: Start difference. First operand 493 states and 599 transitions. Second operand 5 states. [2019-11-20 04:17:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:09,819 INFO L93 Difference]: Finished difference Result 980 states and 1191 transitions. [2019-11-20 04:17:09,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:17:09,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-20 04:17:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:09,823 INFO L225 Difference]: With dead ends: 980 [2019-11-20 04:17:09,824 INFO L226 Difference]: Without dead ends: 493 [2019-11-20 04:17:09,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 04:17:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-11-20 04:17:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-11-20 04:17:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-20 04:17:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 598 transitions. [2019-11-20 04:17:09,878 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 598 transitions. Word has length 57 [2019-11-20 04:17:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:09,879 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 598 transitions. [2019-11-20 04:17:09,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:17:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 598 transitions. [2019-11-20 04:17:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 04:17:09,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:17:09,881 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:09,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:09,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1290419920, now seen corresponding path program 1 times [2019-11-20 04:17:09,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:09,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321364401] [2019-11-20 04:17:09,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:10,072 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-20 04:17:10,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321364401] [2019-11-20 04:17:10,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:10,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:17:10,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260501655] [2019-11-20 04:17:10,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:17:10,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:10,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:17:10,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:10,075 INFO L87 Difference]: Start difference. First operand 493 states and 598 transitions. Second operand 4 states. [2019-11-20 04:17:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:10,327 INFO L93 Difference]: Finished difference Result 1329 states and 1625 transitions. [2019-11-20 04:17:10,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:17:10,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 04:17:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:10,334 INFO L225 Difference]: With dead ends: 1329 [2019-11-20 04:17:10,334 INFO L226 Difference]: Without dead ends: 1041 [2019-11-20 04:17:10,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-11-20 04:17:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 844. [2019-11-20 04:17:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-20 04:17:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1035 transitions. [2019-11-20 04:17:10,410 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1035 transitions. Word has length 57 [2019-11-20 04:17:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:10,410 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1035 transitions. [2019-11-20 04:17:10,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:17:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1035 transitions. [2019-11-20 04:17:10,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 04:17:10,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:10,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:10,412 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:10,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:10,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1563249264, now seen corresponding path program 1 times [2019-11-20 04:17:10,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:10,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967940229] [2019-11-20 04:17:10,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:10,531 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-20 04:17:10,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967940229] [2019-11-20 04:17:10,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:10,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:17:10,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931820851] [2019-11-20 04:17:10,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:17:10,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:10,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:17:10,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:10,534 INFO L87 Difference]: Start difference. First operand 844 states and 1035 transitions. Second operand 4 states. [2019-11-20 04:17:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:10,627 INFO L93 Difference]: Finished difference Result 1261 states and 1538 transitions. [2019-11-20 04:17:10,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:17:10,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-20 04:17:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:10,631 INFO L225 Difference]: With dead ends: 1261 [2019-11-20 04:17:10,632 INFO L226 Difference]: Without dead ends: 490 [2019-11-20 04:17:10,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:17:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-11-20 04:17:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 469. [2019-11-20 04:17:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-11-20 04:17:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 567 transitions. [2019-11-20 04:17:10,675 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 567 transitions. Word has length 63 [2019-11-20 04:17:10,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:10,675 INFO L462 AbstractCegarLoop]: Abstraction has 469 states and 567 transitions. [2019-11-20 04:17:10,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:17:10,676 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 567 transitions. [2019-11-20 04:17:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 04:17:10,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:10,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:10,677 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:10,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1703797874, now seen corresponding path program 1 times [2019-11-20 04:17:10,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:10,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821913721] [2019-11-20 04:17:10,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:10,812 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-20 04:17:10,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821913721] [2019-11-20 04:17:10,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:10,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:17:10,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219798571] [2019-11-20 04:17:10,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:17:10,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:10,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:17:10,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:10,815 INFO L87 Difference]: Start difference. First operand 469 states and 567 transitions. Second operand 4 states. [2019-11-20 04:17:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:10,977 INFO L93 Difference]: Finished difference Result 771 states and 930 transitions. [2019-11-20 04:17:10,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:17:10,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-20 04:17:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:10,982 INFO L225 Difference]: With dead ends: 771 [2019-11-20 04:17:10,983 INFO L226 Difference]: Without dead ends: 764 [2019-11-20 04:17:10,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-11-20 04:17:11,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 715. [2019-11-20 04:17:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-20 04:17:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 872 transitions. [2019-11-20 04:17:11,060 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 872 transitions. Word has length 63 [2019-11-20 04:17:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:11,061 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 872 transitions. [2019-11-20 04:17:11,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:17:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 872 transitions. [2019-11-20 04:17:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-20 04:17:11,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:11,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:11,068 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash 967629456, now seen corresponding path program 1 times [2019-11-20 04:17:11,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:11,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092842132] [2019-11-20 04:17:11,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:11,185 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-20 04:17:11,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092842132] [2019-11-20 04:17:11,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:11,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:17:11,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103802824] [2019-11-20 04:17:11,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:17:11,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:17:11,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:11,188 INFO L87 Difference]: Start difference. First operand 715 states and 872 transitions. Second operand 4 states. [2019-11-20 04:17:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:11,315 INFO L93 Difference]: Finished difference Result 841 states and 1028 transitions. [2019-11-20 04:17:11,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:17:11,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-20 04:17:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:11,321 INFO L225 Difference]: With dead ends: 841 [2019-11-20 04:17:11,321 INFO L226 Difference]: Without dead ends: 832 [2019-11-20 04:17:11,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:17:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-11-20 04:17:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 719. [2019-11-20 04:17:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-11-20 04:17:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 872 transitions. [2019-11-20 04:17:11,399 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 872 transitions. Word has length 64 [2019-11-20 04:17:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:11,400 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 872 transitions. [2019-11-20 04:17:11,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:17:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 872 transitions. [2019-11-20 04:17:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 04:17:11,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:11,401 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:11,402 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1689795513, now seen corresponding path program 1 times [2019-11-20 04:17:11,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:11,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954258463] [2019-11-20 04:17:11,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:17:11,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954258463] [2019-11-20 04:17:11,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517316818] [2019-11-20 04:17:11,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:17:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:12,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 04:17:12,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:17:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:17:12,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 04:17:12,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-20 04:17:12,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334593395] [2019-11-20 04:17:12,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:17:12,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:12,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:17:12,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:17:12,118 INFO L87 Difference]: Start difference. First operand 719 states and 872 transitions. Second operand 4 states. [2019-11-20 04:17:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:12,219 INFO L93 Difference]: Finished difference Result 1037 states and 1268 transitions. [2019-11-20 04:17:12,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:17:12,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-20 04:17:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:12,223 INFO L225 Difference]: With dead ends: 1037 [2019-11-20 04:17:12,223 INFO L226 Difference]: Without dead ends: 346 [2019-11-20 04:17:12,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:17:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-20 04:17:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 314. [2019-11-20 04:17:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-20 04:17:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 357 transitions. [2019-11-20 04:17:12,279 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 357 transitions. Word has length 68 [2019-11-20 04:17:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:12,279 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 357 transitions. [2019-11-20 04:17:12,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:17:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 357 transitions. [2019-11-20 04:17:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 04:17:12,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:12,281 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:12,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:17:12,488 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:12,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2027570376, now seen corresponding path program 1 times [2019-11-20 04:17:12,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:12,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322869343] [2019-11-20 04:17:12,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:12,721 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-20 04:17:12,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322869343] [2019-11-20 04:17:12,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:12,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:17:12,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554041447] [2019-11-20 04:17:12,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:17:12,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:12,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:17:12,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:17:12,724 INFO L87 Difference]: Start difference. First operand 314 states and 357 transitions. Second operand 3 states. [2019-11-20 04:17:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:12,781 INFO L93 Difference]: Finished difference Result 515 states and 587 transitions. [2019-11-20 04:17:12,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:17:12,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-20 04:17:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:12,784 INFO L225 Difference]: With dead ends: 515 [2019-11-20 04:17:12,784 INFO L226 Difference]: Without dead ends: 242 [2019-11-20 04:17:12,785 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-20 04:17:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-20 04:17:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-20 04:17:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-20 04:17:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2019-11-20 04:17:12,814 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 77 [2019-11-20 04:17:12,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:12,815 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2019-11-20 04:17:12,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:17:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2019-11-20 04:17:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 04:17:12,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:12,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:17:12,817 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1039963939, now seen corresponding path program 1 times [2019-11-20 04:17:12,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:12,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070390247] [2019-11-20 04:17:12,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:13,238 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-20 04:17:13,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070390247] [2019-11-20 04:17:13,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:13,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:17:13,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935224324] [2019-11-20 04:17:13,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:17:13,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:13,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:17:13,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:13,241 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand 4 states. [2019-11-20 04:17:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:13,336 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2019-11-20 04:17:13,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:17:13,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-20 04:17:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:13,338 INFO L225 Difference]: With dead ends: 244 [2019-11-20 04:17:13,338 INFO L226 Difference]: Without dead ends: 211 [2019-11-20 04:17:13,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:17:13,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-20 04:17:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 132. [2019-11-20 04:17:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-20 04:17:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2019-11-20 04:17:13,359 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 79 [2019-11-20 04:17:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:13,359 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2019-11-20 04:17:13,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:17:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2019-11-20 04:17:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 04:17:13,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:17:13,361 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:17:13,361 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:17:13,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:17:13,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1761187395, now seen corresponding path program 1 times [2019-11-20 04:17:13,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:17:13,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136533047] [2019-11-20 04:17:13,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:17:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:17:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:17:13,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136533047] [2019-11-20 04:17:13,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:17:13,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:17:13,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233854124] [2019-11-20 04:17:13,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:17:13,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:17:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:17:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:17:13,521 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 5 states. [2019-11-20 04:17:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:17:13,628 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2019-11-20 04:17:13,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:17:13,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-20 04:17:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:17:13,629 INFO L225 Difference]: With dead ends: 132 [2019-11-20 04:17:13,629 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 04:17:13,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 04:17:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 04:17:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 04:17:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 04:17:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 04:17:13,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2019-11-20 04:17:13,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:17:13,631 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:17:13,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:17:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 04:17:13,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 04:17:13,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 04:17:14,736 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-11-20 04:17:14,890 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-11-20 04:17:15,649 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-11-20 04:17:15,876 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 26 [2019-11-20 04:17:16,377 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-11-20 04:17:16,683 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-11-20 04:17:17,142 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2019-11-20 04:17:17,366 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-11-20 04:17:17,628 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-11-20 04:17:17,972 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2019-11-20 04:17:18,243 INFO L440 ceAbstractionStarter]: At program point L4032(lines 3950 4034) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2019-11-20 04:17:18,243 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,244 INFO L440 ceAbstractionStarter]: At program point L4198(lines 4197 4199) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,244 INFO L444 ceAbstractionStarter]: For program point L4132(lines 4117 4133) no Hoare annotation was computed. [2019-11-20 04:17:18,244 INFO L440 ceAbstractionStarter]: At program point L4198-1(lines 4197 4199) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,244 INFO L440 ceAbstractionStarter]: At program point L4198-2(lines 4197 4199) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-11-20 04:17:18,244 INFO L444 ceAbstractionStarter]: For program point L3802(lines 3802 3805) no Hoare annotation was computed. [2019-11-20 04:17:18,244 INFO L440 ceAbstractionStarter]: At program point L4232(lines 4231 4233) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,245 INFO L444 ceAbstractionStarter]: For program point L4067(lines 4067 4070) no Hoare annotation was computed. [2019-11-20 04:17:18,245 INFO L444 ceAbstractionStarter]: For program point L4035-1(lines 1 4255) no Hoare annotation was computed. [2019-11-20 04:17:18,245 INFO L444 ceAbstractionStarter]: For program point L4035(lines 1 4255) no Hoare annotation was computed. [2019-11-20 04:17:18,245 INFO L444 ceAbstractionStarter]: For program point L4035-3(lines 1 4255) no Hoare annotation was computed. [2019-11-20 04:17:18,245 INFO L444 ceAbstractionStarter]: For program point L4035-2(lines 1 4255) no Hoare annotation was computed. [2019-11-20 04:17:18,245 INFO L440 ceAbstractionStarter]: At program point L4035-5(lines 4170 4187) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2019-11-20 04:17:18,245 INFO L444 ceAbstractionStarter]: For program point L4035-4(lines 4179 4184) no Hoare annotation was computed. [2019-11-20 04:17:18,245 INFO L440 ceAbstractionStarter]: At program point L4135(lines 4113 4137) the Hoare annotation is: (let ((.cse0 (<= ~ldv_coherent_state~0 1)) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (= ~ldv_urb_state~0 0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= ~ldv_urb_state~0 1) (or (not .cse2) (not .cse3)) .cse4 (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) .cse5))) [2019-11-20 04:17:18,246 INFO L444 ceAbstractionStarter]: For program point L3970(line 3970) no Hoare annotation was computed. [2019-11-20 04:17:18,246 INFO L444 ceAbstractionStarter]: For program point L3904(lines 3904 3907) no Hoare annotation was computed. [2019-11-20 04:17:18,246 INFO L440 ceAbstractionStarter]: At program point L4235(lines 4173 4178) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-20 04:17:18,246 INFO L444 ceAbstractionStarter]: For program point L3476(lines 3476 3483) no Hoare annotation was computed. [2019-11-20 04:17:18,246 INFO L444 ceAbstractionStarter]: For program point L4038(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,246 INFO L444 ceAbstractionStarter]: For program point L4038-2(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,246 INFO L444 ceAbstractionStarter]: For program point L4038-1(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,246 INFO L444 ceAbstractionStarter]: For program point L4038-4(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,247 INFO L444 ceAbstractionStarter]: For program point L4038-3(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,247 INFO L444 ceAbstractionStarter]: For program point L3840(lines 3840 3843) no Hoare annotation was computed. [2019-11-20 04:17:18,247 INFO L444 ceAbstractionStarter]: For program point L4038-5(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,247 INFO L440 ceAbstractionStarter]: At program point L4204(lines 4203 4205) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (and (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse1 .cse2))) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse4 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0)))) (and (let ((.cse6 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (<= (+ .cse5 1) 0) (< (* 18446744073709551616 .cse5) .cse6)))) .cse2) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)))) [2019-11-20 04:17:18,247 INFO L440 ceAbstractionStarter]: At program point L3841(lines 3782 3862) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,247 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,247 INFO L444 ceAbstractionStarter]: For program point L3445(lines 3445 3449) no Hoare annotation was computed. [2019-11-20 04:17:18,248 INFO L444 ceAbstractionStarter]: For program point L3445-2(lines 3445 3449) no Hoare annotation was computed. [2019-11-20 04:17:18,248 INFO L440 ceAbstractionStarter]: At program point L4106(lines 4082 4111) the Hoare annotation is: (let ((.cse0 (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (<= (+ .cse6 1) 0) (< (* 18446744073709551616 .cse6) .cse7))))) (.cse1 (= 0 ~ldv_coherent_state~0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) .cse1 .cse2 (= 0 ~res_kbtab_probe_3~0) .cse3))) [2019-11-20 04:17:18,248 INFO L440 ceAbstractionStarter]: At program point L4106-1(lines 4082 4111) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0)))) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-20 04:17:18,248 INFO L444 ceAbstractionStarter]: For program point L3974(lines 3974 3979) no Hoare annotation was computed. [2019-11-20 04:17:18,248 INFO L444 ceAbstractionStarter]: For program point L3809(lines 3809 3812) no Hoare annotation was computed. [2019-11-20 04:17:18,248 INFO L444 ceAbstractionStarter]: For program point L3479(lines 3479 3483) no Hoare annotation was computed. [2019-11-20 04:17:18,249 INFO L444 ceAbstractionStarter]: For program point L3479-2(lines 3476 3483) no Hoare annotation was computed. [2019-11-20 04:17:18,249 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,249 INFO L444 ceAbstractionStarter]: For program point L4075(lines 4060 4076) no Hoare annotation was computed. [2019-11-20 04:17:18,249 INFO L444 ceAbstractionStarter]: For program point L3976(lines 3976 3979) no Hoare annotation was computed. [2019-11-20 04:17:18,249 INFO L444 ceAbstractionStarter]: For program point L3976-1(lines 3974 3979) no Hoare annotation was computed. [2019-11-20 04:17:18,249 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,249 INFO L440 ceAbstractionStarter]: At program point L4208(lines 4207 4209) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,250 INFO L440 ceAbstractionStarter]: At program point L3911(lines 3900 3913) the Hoare annotation is: (let ((.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)) (and (or (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0) (< 0 ULTIMATE.start_kbtab_init_~retval~1)) .cse0 .cse1))) [2019-11-20 04:17:18,250 INFO L440 ceAbstractionStarter]: At program point L4242(lines 4241 4243) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-20 04:17:18,250 INFO L440 ceAbstractionStarter]: At program point L4143loopEntry(lines 4143 4162) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,250 INFO L440 ceAbstractionStarter]: At program point L4143-2loopEntry(lines 4143 4162) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-11-20 04:17:18,250 INFO L440 ceAbstractionStarter]: At program point L3912(lines 3898 3914) the Hoare annotation is: (let ((.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)) (and (or (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0) (< 0 ULTIMATE.start_kbtab_init_~retval~1)) (or (<= 1 |ULTIMATE.start_kbtab_init_#res|) (<= (+ |ULTIMATE.start_kbtab_init_#res| 1) 0)) .cse0 .cse1))) [2019-11-20 04:17:18,250 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,251 INFO L440 ceAbstractionStarter]: At program point L3450(lines 3438 3452) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,251 INFO L440 ceAbstractionStarter]: At program point L3417(lines 3411 3419) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-11-20 04:17:18,251 INFO L444 ceAbstractionStarter]: For program point L4144(lines 4143 4162) no Hoare annotation was computed. [2019-11-20 04:17:18,251 INFO L440 ceAbstractionStarter]: At program point L4078(lines 4055 4080) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_usb_alloc_coherent_#res.base| 0)) (.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse2 (= 0 |ULTIMATE.start_usb_alloc_coherent_#res.offset|)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0) (or (not .cse2) (not .cse3)) .cse4) (and (= 0 ~ldv_coherent_state~0) .cse3 .cse0 .cse1 .cse2 .cse4))) [2019-11-20 04:17:18,251 INFO L444 ceAbstractionStarter]: For program point L4144-1(lines 4143 4162) no Hoare annotation was computed. [2019-11-20 04:17:18,251 INFO L440 ceAbstractionStarter]: At program point L4211(lines 4210 4212) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,251 INFO L440 ceAbstractionStarter]: At program point L4211-1(lines 4210 4212) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,252 INFO L444 ceAbstractionStarter]: For program point L4145-1(lines 4143 4162) no Hoare annotation was computed. [2019-11-20 04:17:18,252 INFO L444 ceAbstractionStarter]: For program point L4145(lines 4143 4162) no Hoare annotation was computed. [2019-11-20 04:17:18,252 INFO L440 ceAbstractionStarter]: At program point L4211-2(lines 4210 4212) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,252 INFO L440 ceAbstractionStarter]: At program point L3485(lines 3464 3487) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,252 INFO L447 ceAbstractionStarter]: At program point L4047-1(lines 4047 4048) the Hoare annotation is: true [2019-11-20 04:17:18,252 INFO L447 ceAbstractionStarter]: At program point L4047(lines 4047 4048) the Hoare annotation is: true [2019-11-20 04:17:18,252 INFO L447 ceAbstractionStarter]: At program point L4047-3(lines 4047 4048) the Hoare annotation is: true [2019-11-20 04:17:18,253 INFO L447 ceAbstractionStarter]: At program point L4047-2(lines 4047 4048) the Hoare annotation is: true [2019-11-20 04:17:18,253 INFO L440 ceAbstractionStarter]: At program point L3520(lines 3514 3522) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,253 INFO L440 ceAbstractionStarter]: At program point L4214(lines 4213 4215) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-11-20 04:17:18,253 INFO L444 ceAbstractionStarter]: For program point L3983(lines 3983 4019) no Hoare annotation was computed. [2019-11-20 04:17:18,253 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 04:17:18,253 INFO L440 ceAbstractionStarter]: At program point L3984(lines 3983 4019) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse4 (<= 1 ~ldv_urb_state~0)) (.cse1 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse3 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse0 (<= ~ldv_coherent_state~0 1) .cse1 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4) (and .cse1 (and (and (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (<= (+ .cse6 1) 0) (< (* 18446744073709551616 .cse6) .cse7)))) .cse5) .cse3)))) [2019-11-20 04:17:18,256 INFO L440 ceAbstractionStarter]: At program point L4017(lines 3969 4020) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse4 (<= 1 ~ldv_urb_state~0)) (.cse1 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse3 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse0 (<= ~ldv_coherent_state~0 1) .cse1 .cse2 (<= ~ldv_urb_state~0 1) .cse3 .cse4) (and .cse1 (and (and (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (<= (+ .cse6 1) 0) (< (* 18446744073709551616 .cse6) .cse7)))) .cse5) .cse3)))) [2019-11-20 04:17:18,256 INFO L440 ceAbstractionStarter]: At program point L3852(lines 3782 3862) the Hoare annotation is: (let ((.cse0 (<= ~ldv_coherent_state~0 1)) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 .cse1 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) .cse2 (= 0 ~res_kbtab_probe_3~0) .cse3))) [2019-11-20 04:17:18,256 INFO L440 ceAbstractionStarter]: At program point L3390(lines 3383 3392) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,257 INFO L440 ceAbstractionStarter]: At program point L3390-1(lines 3383 3392) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,257 INFO L440 ceAbstractionStarter]: At program point L4250(lines 4249 4251) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,257 INFO L440 ceAbstractionStarter]: At program point L4250-3(lines 4249 4251) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,257 INFO L440 ceAbstractionStarter]: At program point L4250-4(lines 4249 4251) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-11-20 04:17:18,257 INFO L440 ceAbstractionStarter]: At program point L4250-1(lines 4249 4251) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,258 INFO L440 ceAbstractionStarter]: At program point L4118loopEntry(lines 4118 4131) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,258 INFO L440 ceAbstractionStarter]: At program point L4217(lines 3997 4000) the Hoare annotation is: (let ((.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0))) (let ((.cse4 (not .cse0)) (.cse5 (not .cse1)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (= 0 ~ldv_coherent_state~0)) (.cse6 (= ~ldv_urb_state~0 0))) (or (and .cse0 (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) .cse1 (<= 1 ~ldv_urb_state~0) .cse2) (and .cse3 (and .cse4 .cse5 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse6 .cse2))) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse4 .cse5 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (< (* 18446744073709551616 .cse7) .cse8) (<= (+ .cse7 1) 0)))) (and (let ((.cse10 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse9 (div .cse10 18446744073709551616))) (or (<= (+ .cse9 1) 0) (< (* 18446744073709551616 .cse9) .cse10)))) .cse2) .cse3 .cse6)))) [2019-11-20 04:17:18,258 INFO L440 ceAbstractionStarter]: At program point L4250-2(lines 4249 4251) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,259 INFO L444 ceAbstractionStarter]: For program point L3986(lines 3986 4019) no Hoare annotation was computed. [2019-11-20 04:17:18,259 INFO L444 ceAbstractionStarter]: For program point L4152(lines 4152 4157) no Hoare annotation was computed. [2019-11-20 04:17:18,259 INFO L440 ceAbstractionStarter]: At program point L4086loopEntry(lines 4086 4105) the Hoare annotation is: (let ((.cse0 (<= ~ldv_coherent_state~0 1)) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 .cse1 (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (< (* 18446744073709551616 .cse4) .cse5) (<= (+ .cse4 1) 0)))) .cse2 (= 0 ~res_kbtab_probe_3~0) .cse3))) [2019-11-20 04:17:18,259 INFO L444 ceAbstractionStarter]: For program point L4152-2(lines 4152 4157) no Hoare annotation was computed. [2019-11-20 04:17:18,259 INFO L444 ceAbstractionStarter]: For program point L4119(line 4119) no Hoare annotation was computed. [2019-11-20 04:17:18,260 INFO L440 ceAbstractionStarter]: At program point L4086-2loopEntry(lines 4086 4105) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-20 04:17:18,260 INFO L440 ceAbstractionStarter]: At program point L3987(lines 3986 4019) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse4 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 ULTIMATE.start_main_~tmp___8~3))) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse0 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse7 (<= 1 ~ldv_coherent_state~0)) (.cse5 (= 0 ~res_kbtab_probe_3~0)) (.cse8 (<= 1 ~ldv_urb_state~0))) (or (and .cse0 (and (and (let ((.cse2 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse1 (div .cse2 18446744073709551616))) (or (<= (+ .cse1 1) 0) (< (* 18446744073709551616 .cse1) .cse2)))) .cse3 .cse4) .cse5)) (and .cse6 .cse0 .cse5 (and .cse3 .cse7 .cse4) .cse8) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) .cse5 .cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse6 (<= ~ldv_coherent_state~0 1) .cse0 .cse7 (<= ~ldv_urb_state~0 1) .cse5 .cse8))) [2019-11-20 04:17:18,260 INFO L444 ceAbstractionStarter]: For program point L4087-1(lines 4086 4105) no Hoare annotation was computed. [2019-11-20 04:17:18,260 INFO L444 ceAbstractionStarter]: For program point L4087(lines 4086 4105) no Hoare annotation was computed. [2019-11-20 04:17:18,261 INFO L440 ceAbstractionStarter]: At program point L4021(lines 3968 4022) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) [2019-11-20 04:17:18,261 INFO L440 ceAbstractionStarter]: At program point L3856(lines 3782 3862) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse0 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and .cse0 (and (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse1 .cse2))) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse4 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0)))) (and (let ((.cse6 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (<= (+ .cse5 1) 0) (< (* 18446744073709551616 .cse5) .cse6)))) .cse2) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)))) [2019-11-20 04:17:18,261 INFO L440 ceAbstractionStarter]: At program point L3460(lines 3454 3462) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-20 04:17:18,261 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 04:17:18,262 INFO L444 ceAbstractionStarter]: For program point L4253(lines 4253 4255) no Hoare annotation was computed. [2019-11-20 04:17:18,262 INFO L440 ceAbstractionStarter]: At program point L4220(lines 4219 4221) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-20 04:17:18,262 INFO L440 ceAbstractionStarter]: At program point L4253-1(lines 1 4255) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0)))) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-20 04:17:18,262 INFO L444 ceAbstractionStarter]: For program point L4088(lines 4086 4105) no Hoare annotation was computed. [2019-11-20 04:17:18,263 INFO L444 ceAbstractionStarter]: For program point L4088-1(lines 4086 4105) no Hoare annotation was computed. [2019-11-20 04:17:18,263 INFO L444 ceAbstractionStarter]: For program point L3791(lines 3791 3797) no Hoare annotation was computed. [2019-11-20 04:17:18,263 INFO L440 ceAbstractionStarter]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,263 INFO L440 ceAbstractionStarter]: At program point L3428-1(lines 3422 3430) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-11-20 04:17:18,263 INFO L440 ceAbstractionStarter]: At program point L4190(lines 4189 4191) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,264 INFO L444 ceAbstractionStarter]: For program point L4124(lines 4124 4127) no Hoare annotation was computed. [2019-11-20 04:17:18,264 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 04:17:18,264 INFO L440 ceAbstractionStarter]: At program point L4190-1(lines 4189 4191) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,264 INFO L444 ceAbstractionStarter]: For program point L3794(lines 3794 3797) no Hoare annotation was computed. [2019-11-20 04:17:18,264 INFO L440 ceAbstractionStarter]: At program point L4224-1(lines 4223 4225) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,265 INFO L440 ceAbstractionStarter]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,265 INFO L440 ceAbstractionStarter]: At program point L3861(lines 3771 3863) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_kbtab_probe_#res| 0))) (let ((.cse0 (not .cse4)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (= 0 ~ldv_coherent_state~0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse5 (= 0 ~res_kbtab_probe_3~0))) (or (and (and .cse0 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (and .cse1 .cse2)) .cse3) (and .cse4 (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) .cse5 (<= 1 ~ldv_urb_state~0) .cse2) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) .cse0 (let ((.cse7 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (< (* 18446744073709551616 .cse6) .cse7) (<= (+ .cse6 1) 0)))) (and (let ((.cse9 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) .cse2) .cse3 .cse1 .cse5)))) [2019-11-20 04:17:18,265 INFO L440 ceAbstractionStarter]: At program point L3498(lines 3495 3500) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,266 INFO L440 ceAbstractionStarter]: At program point L3565(lines 3558 3567) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,266 INFO L440 ceAbstractionStarter]: At program point L3400(lines 3394 3402) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,266 INFO L440 ceAbstractionStarter]: At program point L3400-1(lines 3394 3402) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,266 INFO L440 ceAbstractionStarter]: At program point L4061loopEntry(lines 4061 4074) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,266 INFO L440 ceAbstractionStarter]: At program point L4194(lines 4193 4195) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-11-20 04:17:18,267 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 04:17:18,267 INFO L444 ceAbstractionStarter]: For program point L4062(line 4062) no Hoare annotation was computed. [2019-11-20 04:17:18,267 INFO L444 ceAbstractionStarter]: For program point L4095(lines 4095 4100) no Hoare annotation was computed. [2019-11-20 04:17:18,267 INFO L444 ceAbstractionStarter]: For program point L4095-2(lines 4095 4100) no Hoare annotation was computed. [2019-11-20 04:17:18,267 INFO L444 ceAbstractionStarter]: For program point L3963(lines 3963 3966) no Hoare annotation was computed. [2019-11-20 04:17:18,267 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4038) no Hoare annotation was computed. [2019-11-20 04:17:18,267 INFO L440 ceAbstractionStarter]: At program point L3435(lines 3431 3437) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,267 INFO L440 ceAbstractionStarter]: At program point L3502(lines 3501 3503) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,267 INFO L440 ceAbstractionStarter]: At program point L4163-1(lines 4139 4168) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-11-20 04:17:18,268 INFO L440 ceAbstractionStarter]: At program point L4163(lines 4139 4168) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-11-20 04:17:18,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:17:18 BoogieIcfgContainer [2019-11-20 04:17:18,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:17:18,325 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:17:18,325 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:17:18,326 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:17:18,326 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:17:05" (3/4) ... [2019-11-20 04:17:18,330 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 04:17:18,356 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2019-11-20 04:17:18,359 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2019-11-20 04:17:18,361 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-20 04:17:18,363 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 04:17:18,403 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) || ((((retval + 1 <= 0 || 0 < retval) && (1 <= \result || \result + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) [2019-11-20 04:17:18,403 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) [2019-11-20 04:17:18,404 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) [2019-11-20 04:17:18,404 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_s_kbtab_driver_usb_driver && ((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == res_kbtab_probe_3) || ((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && (!(ldv_s_kbtab_driver_usb_driver == 1) && 1 <= ldv_coherent_state) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 1 <= ldv_urb_state)) || ((((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) [2019-11-20 04:17:18,405 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-11-20 04:17:18,405 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-11-20 04:17:18,405 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-11-20 04:17:18,406 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-11-20 04:17:18,410 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-11-20 04:17:18,410 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-11-20 04:17:18,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-11-20 04:17:18,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-11-20 04:17:18,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-11-20 04:17:18,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-11-20 04:17:18,412 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-11-20 04:17:18,414 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) [2019-11-20 04:17:18,415 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && (!(0 == \result) || !(\result == 0))) && ldv_s_kbtab_driver_usb_driver == 0) || (((((0 == ldv_coherent_state && \result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == \result) && ldv_s_kbtab_driver_usb_driver == 0) [2019-11-20 04:17:18,417 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) || (0 == ldv_coherent_state && ((!(\result == 0) && !(0 == res_kbtab_probe_3)) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && !(0 == res_kbtab_probe_3)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) [2019-11-20 04:17:18,418 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && (!(\result == 0) || !(\result == 0))) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) [2019-11-20 04:17:18,667 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d33275d1-b430-4c24-b5fe-e19538d953f1/bin/uautomizer/witness.graphml [2019-11-20 04:17:18,667 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:17:18,669 INFO L168 Benchmark]: Toolchain (without parser) took 16462.01 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 479.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -122.9 MB). Peak memory consumption was 356.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:17:18,669 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:17:18,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1466.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:17:18,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 164.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:17:18,670 INFO L168 Benchmark]: Boogie Preprocessor took 156.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:17:18,671 INFO L168 Benchmark]: RCFGBuilder took 1919.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.7 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. [2019-11-20 04:17:18,671 INFO L168 Benchmark]: TraceAbstraction took 12407.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 899.7 MB in the beginning and 1.1 GB in the end (delta: -233.2 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB. [2019-11-20 04:17:18,672 INFO L168 Benchmark]: Witness Printer took 342.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. [2019-11-20 04:17:18,674 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 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1466.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 164.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 156.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1919.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.7 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12407.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 899.7 MB in the beginning and 1.1 GB in the end (delta: -233.2 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB. * Witness Printer took 342.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 4143]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 3558]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4193]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4197]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 3771]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4082]: Loop Invariant Derived loop invariant: ((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((((((!(error == 0) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3383]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3464]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4241]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3383]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4197]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4143]: Loop Invariant Derived loop invariant: (((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4197]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3454]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: (((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) || (0 == ldv_coherent_state && ((!(\result == 0) && !(0 == res_kbtab_probe_3)) && error + 12 <= 0) && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((!(error == 0) && !(\result == 0)) && !(0 == res_kbtab_probe_3)) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) - InvariantResult [Line: 4055]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && (!(0 == \result) || !(\result == 0))) && ldv_s_kbtab_driver_usb_driver == 0) || (((((0 == ldv_coherent_state && \result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == \result) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4173]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4118]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4231]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3986]: Loop Invariant Derived loop invariant: (((1 <= ldv_s_kbtab_driver_usb_driver && ((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == res_kbtab_probe_3) || ((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && (!(ldv_s_kbtab_driver_usb_driver == 1) && 1 <= ldv_coherent_state) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 1 <= ldv_urb_state)) || ((((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) - InvariantResult [Line: 4170]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4139]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3411]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4139]: Loop Invariant Derived loop invariant: (((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: (((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3431]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: (((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || ((((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4061]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3900]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) || (((retval + 1 <= 0 || 0 < retval) && 0 == ldv_coherent_state) && ldv_urb_state == 0) - InvariantResult [Line: 4210]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4210]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3983]: Loop Invariant Derived loop invariant: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && error + 12 <= 0 && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) || (((((!(error == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3438]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4210]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3969]: Loop Invariant Derived loop invariant: (((((((\result == 0 && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((((\result == 0 && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (1 <= ldv_s_kbtab_driver_usb_driver && (((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4047]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3501]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4047]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: 0 == ldv_coherent_state && ldv_urb_state == 0 - InvariantResult [Line: 3514]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3950]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3495]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4047]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4203]: Loop Invariant Derived loop invariant: (0 == ldv_coherent_state && error + 12 <= 0 && ldv_urb_state == 0 && ldv_s_kbtab_driver_usb_driver == 0) || (((((!(error == 0) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4189]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3898]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) || ((((retval + 1 <= 0 || 0 < retval) && (1 <= \result || \result + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) - InvariantResult [Line: 4113]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && (!(\result == 0) || !(\result == 0))) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4082]: Loop Invariant Derived loop invariant: (((((\result == 0 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && (18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0)) && 0 == ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4189]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4207]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4047]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 6 error locations. Result: SAFE, OverallTime: 12.2s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, HoareTripleCheckerStatistics: 3030 SDtfs, 1824 SDslu, 4115 SDs, 0 SdLazy, 278 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 1279 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 185 NumberOfFragments, 2134 HoareAnnotationTreeSize, 68 FomulaSimplifications, 128681 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 68 FomulaSimplificationsInter, 5965 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1036 NumberOfCodeBlocks, 1036 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1017 ConstructedInterpolants, 0 QuantifiedInterpolants, 134104 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1066 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 13/16 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...