./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 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/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_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 16535637a9f2a86a18ba3e1653b0268771f12039 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-69874e2 [2020-12-01 15:57:39,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:57:39,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:57:39,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:57:39,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:57:39,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:57:39,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:57:39,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:57:39,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:57:39,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:57:39,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:57:39,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:57:39,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:57:39,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:57:39,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:57:39,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:57:39,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:57:39,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:57:39,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:57:39,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:57:39,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:57:39,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:57:39,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:57:39,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:57:39,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:57:39,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:57:39,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:57:39,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:57:39,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:57:39,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:57:39,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:57:39,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:57:39,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:57:39,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:57:39,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:57:39,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:57:39,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:57:39,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:57:39,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:57:39,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:57:39,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:57:39,308 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-01 15:57:39,365 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:57:39,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:57:39,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:57:39,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:57:39,376 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:57:39,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:57:39,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:57:39,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:57:39,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:57:39,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:57:39,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:57:39,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:57:39,380 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:57:39,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:57:39,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:57:39,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:57:39,381 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:57:39,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:57:39,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:57:39,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:57:39,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:57:39,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:57:39,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:57:39,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:57:39,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:57:39,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:57:39,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-01 15:57:39,385 INFO L138 SettingsManager]: * To the following directory=dump/ WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_a00d06c7-1026-49cc-9d31-e6c15b68af3a/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(reach_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 -> 16535637a9f2a86a18ba3e1653b0268771f12039 [2020-12-01 15:57:39,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:57:39,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:57:39,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:57:39,796 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:57:39,798 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:57:39,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2020-12-01 15:57:39,908 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer/data/d0582cfd8/1f23fc8dc6354dd4bbe80a9374065d7e/FLAG3e9b26111 [2020-12-01 15:57:40,828 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:57:40,829 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2020-12-01 15:57:40,876 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer/data/d0582cfd8/1f23fc8dc6354dd4bbe80a9374065d7e/FLAG3e9b26111 [2020-12-01 15:57:41,333 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer/data/d0582cfd8/1f23fc8dc6354dd4bbe80a9374065d7e [2020-12-01 15:57:41,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:57:41,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:57:41,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:57:41,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:57:41,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:57:41,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:57:41" (1/1) ... [2020-12-01 15:57:41,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6498fe2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:41, skipping insertion in model container [2020-12-01 15:57:41,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:57:41" (1/1) ... [2020-12-01 15:57:41,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:57:41,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:57:42,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:57:42,643 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:57:42,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:57:43,074 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:57:43,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43 WrapperNode [2020-12-01 15:57:43,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:57:43,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:57:43,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:57:43,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:57:43,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43" (1/1) ... [2020-12-01 15:57:43,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43" (1/1) ... [2020-12-01 15:57:43,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:57:43,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:57:43,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:57:43,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:57:43,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43" (1/1) ... [2020-12-01 15:57:43,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43" (1/1) ... [2020-12-01 15:57:43,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43" (1/1) ... [2020-12-01 15:57:43,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43" (1/1) ... [2020-12-01 15:57:43,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43" (1/1) ... [2020-12-01 15:57:43,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43" (1/1) ... [2020-12-01 15:57:43,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43" (1/1) ... [2020-12-01 15:57:43,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:57:43,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:57:43,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:57:43,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:57:43,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/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 [2020-12-01 15:57:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-01 15:57:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:57:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-01 15:57:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-01 15:57:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-01 15:57:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-01 15:57:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-01 15:57:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:57:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-01 15:57:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:57:43,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:57:44,074 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-01 15:57:45,551 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2020-12-01 15:57:45,552 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2020-12-01 15:57:45,564 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:57:45,565 INFO L298 CfgBuilder]: Removed 147 assume(true) statements. [2020-12-01 15:57:45,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:57:45 BoogieIcfgContainer [2020-12-01 15:57:45,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:57:45,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:57:45,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:57:45,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:57:45,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:57:41" (1/3) ... [2020-12-01 15:57:45,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6234ca30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:57:45, skipping insertion in model container [2020-12-01 15:57:45,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:57:43" (2/3) ... [2020-12-01 15:57:45,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6234ca30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:57:45, skipping insertion in model container [2020-12-01 15:57:45,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:57:45" (3/3) ... [2020-12-01 15:57:45,590 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2020-12-01 15:57:45,609 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:57:45,614 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-12-01 15:57:45,629 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-01 15:57:45,677 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:57:45,678 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:57:45,678 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:57:45,678 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:57:45,678 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:57:45,679 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:57:45,679 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:57:45,679 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:57:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2020-12-01 15:57:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 15:57:45,723 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:45,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:57:45,724 INFO L429 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]=== [2020-12-01 15:57:45,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:45,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1339378701, now seen corresponding path program 1 times [2020-12-01 15:57:45,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:45,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573377557] [2020-12-01 15:57:45,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:46,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573377557] [2020-12-01 15:57:46,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:46,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-01 15:57:46,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123285821] [2020-12-01 15:57:46,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:57:46,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:46,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:57:46,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:57:46,410 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2020-12-01 15:57:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:46,572 INFO L93 Difference]: Finished difference Result 398 states and 563 transitions. [2020-12-01 15:57:46,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:57:46,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-12-01 15:57:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:46,604 INFO L225 Difference]: With dead ends: 398 [2020-12-01 15:57:46,616 INFO L226 Difference]: Without dead ends: 246 [2020-12-01 15:57:46,621 INFO L677 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 [2020-12-01 15:57:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-12-01 15:57:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 230. [2020-12-01 15:57:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-01 15:57:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 285 transitions. [2020-12-01 15:57:46,695 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 285 transitions. Word has length 13 [2020-12-01 15:57:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:46,695 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 285 transitions. [2020-12-01 15:57:46,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:57:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 285 transitions. [2020-12-01 15:57:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 15:57:46,697 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:46,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:57:46,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:57:46,698 INFO L429 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]=== [2020-12-01 15:57:46,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:46,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1430290095, now seen corresponding path program 1 times [2020-12-01 15:57:46,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:46,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094478766] [2020-12-01 15:57:46,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:46,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094478766] [2020-12-01 15:57:46,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:46,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-01 15:57:46,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856864675] [2020-12-01 15:57:46,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:57:46,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:46,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:57:46,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:57:46,892 INFO L87 Difference]: Start difference. First operand 230 states and 285 transitions. Second operand 3 states. [2020-12-01 15:57:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:46,985 INFO L93 Difference]: Finished difference Result 664 states and 826 transitions. [2020-12-01 15:57:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:57:46,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-12-01 15:57:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:46,996 INFO L225 Difference]: With dead ends: 664 [2020-12-01 15:57:46,996 INFO L226 Difference]: Without dead ends: 440 [2020-12-01 15:57:47,003 INFO L677 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 [2020-12-01 15:57:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-12-01 15:57:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 416. [2020-12-01 15:57:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-12-01 15:57:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 522 transitions. [2020-12-01 15:57:47,111 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 522 transitions. Word has length 14 [2020-12-01 15:57:47,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:47,111 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 522 transitions. [2020-12-01 15:57:47,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:57:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 522 transitions. [2020-12-01 15:57:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-01 15:57:47,115 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:47,115 INFO L422 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] [2020-12-01 15:57:47,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:57:47,116 INFO L429 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]=== [2020-12-01 15:57:47,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:47,118 INFO L82 PathProgramCache]: Analyzing trace with hash 686850099, now seen corresponding path program 1 times [2020-12-01 15:57:47,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:47,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871440092] [2020-12-01 15:57:47,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:47,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871440092] [2020-12-01 15:57:47,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:47,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:57:47,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102353914] [2020-12-01 15:57:47,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:57:47,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:47,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:57:47,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:57:47,369 INFO L87 Difference]: Start difference. First operand 416 states and 522 transitions. Second operand 5 states. [2020-12-01 15:57:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:47,532 INFO L93 Difference]: Finished difference Result 950 states and 1220 transitions. [2020-12-01 15:57:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:57:47,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-12-01 15:57:47,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:47,545 INFO L225 Difference]: With dead ends: 950 [2020-12-01 15:57:47,545 INFO L226 Difference]: Without dead ends: 541 [2020-12-01 15:57:47,548 INFO L677 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 [2020-12-01 15:57:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-12-01 15:57:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 487. [2020-12-01 15:57:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-12-01 15:57:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 623 transitions. [2020-12-01 15:57:47,603 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 623 transitions. Word has length 30 [2020-12-01 15:57:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:47,603 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 623 transitions. [2020-12-01 15:57:47,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:57:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 623 transitions. [2020-12-01 15:57:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-01 15:57:47,606 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:47,607 INFO L422 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] [2020-12-01 15:57:47,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:57:47,607 INFO L429 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]=== [2020-12-01 15:57:47,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:47,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1666411630, now seen corresponding path program 1 times [2020-12-01 15:57:47,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:47,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670339806] [2020-12-01 15:57:47,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:47,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670339806] [2020-12-01 15:57:47,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:47,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:57:47,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9404784] [2020-12-01 15:57:47,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:57:47,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:47,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:57:47,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:57:47,870 INFO L87 Difference]: Start difference. First operand 487 states and 623 transitions. Second operand 7 states. [2020-12-01 15:57:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:48,904 INFO L93 Difference]: Finished difference Result 3003 states and 3805 transitions. [2020-12-01 15:57:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-01 15:57:48,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2020-12-01 15:57:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:48,923 INFO L225 Difference]: With dead ends: 3003 [2020-12-01 15:57:48,923 INFO L226 Difference]: Without dead ends: 2525 [2020-12-01 15:57:48,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:57:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2020-12-01 15:57:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 531. [2020-12-01 15:57:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2020-12-01 15:57:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 671 transitions. [2020-12-01 15:57:49,016 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 671 transitions. Word has length 48 [2020-12-01 15:57:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:49,016 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 671 transitions. [2020-12-01 15:57:49,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:57:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 671 transitions. [2020-12-01 15:57:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-01 15:57:49,020 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:49,020 INFO L422 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] [2020-12-01 15:57:49,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:57:49,021 INFO L429 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]=== [2020-12-01 15:57:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1941171244, now seen corresponding path program 1 times [2020-12-01 15:57:49,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:49,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20886316] [2020-12-01 15:57:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:49,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20886316] [2020-12-01 15:57:49,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:49,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:57:49,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93941073] [2020-12-01 15:57:49,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:57:49,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:49,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:57:49,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:57:49,260 INFO L87 Difference]: Start difference. First operand 531 states and 671 transitions. Second operand 5 states. [2020-12-01 15:57:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:49,852 INFO L93 Difference]: Finished difference Result 2850 states and 3578 transitions. [2020-12-01 15:57:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 15:57:49,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-12-01 15:57:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:49,876 INFO L225 Difference]: With dead ends: 2850 [2020-12-01 15:57:49,876 INFO L226 Difference]: Without dead ends: 2571 [2020-12-01 15:57:49,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:57:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2020-12-01 15:57:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 543. [2020-12-01 15:57:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-12-01 15:57:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 683 transitions. [2020-12-01 15:57:50,000 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 683 transitions. Word has length 48 [2020-12-01 15:57:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:50,001 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 683 transitions. [2020-12-01 15:57:50,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:57:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 683 transitions. [2020-12-01 15:57:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-01 15:57:50,011 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:50,012 INFO L422 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] [2020-12-01 15:57:50,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:57:50,012 INFO L429 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]=== [2020-12-01 15:57:50,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash 352823342, now seen corresponding path program 1 times [2020-12-01 15:57:50,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:50,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080409974] [2020-12-01 15:57:50,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:50,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080409974] [2020-12-01 15:57:50,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:50,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:57:50,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934053036] [2020-12-01 15:57:50,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:57:50,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:50,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:57:50,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:57:50,237 INFO L87 Difference]: Start difference. First operand 543 states and 683 transitions. Second operand 7 states. [2020-12-01 15:57:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:50,665 INFO L93 Difference]: Finished difference Result 1188 states and 1485 transitions. [2020-12-01 15:57:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-01 15:57:50,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2020-12-01 15:57:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:50,675 INFO L225 Difference]: With dead ends: 1188 [2020-12-01 15:57:50,679 INFO L226 Difference]: Without dead ends: 903 [2020-12-01 15:57:50,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:57:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-12-01 15:57:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 547. [2020-12-01 15:57:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-12-01 15:57:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 687 transitions. [2020-12-01 15:57:50,764 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 687 transitions. Word has length 48 [2020-12-01 15:57:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:50,767 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 687 transitions. [2020-12-01 15:57:50,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:57:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 687 transitions. [2020-12-01 15:57:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-01 15:57:50,772 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:50,772 INFO L422 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] [2020-12-01 15:57:50,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 15:57:50,773 INFO L429 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]=== [2020-12-01 15:57:50,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:50,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1556101667, now seen corresponding path program 1 times [2020-12-01 15:57:50,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:50,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533519162] [2020-12-01 15:57:50,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:51,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533519162] [2020-12-01 15:57:51,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:51,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:57:51,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59568323] [2020-12-01 15:57:51,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:57:51,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:51,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:57:51,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:57:51,022 INFO L87 Difference]: Start difference. First operand 547 states and 687 transitions. Second operand 5 states. [2020-12-01 15:57:51,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:51,675 INFO L93 Difference]: Finished difference Result 2958 states and 3705 transitions. [2020-12-01 15:57:51,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 15:57:51,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-12-01 15:57:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:51,693 INFO L225 Difference]: With dead ends: 2958 [2020-12-01 15:57:51,694 INFO L226 Difference]: Without dead ends: 2671 [2020-12-01 15:57:51,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:57:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2020-12-01 15:57:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 559. [2020-12-01 15:57:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-12-01 15:57:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 699 transitions. [2020-12-01 15:57:51,812 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 699 transitions. Word has length 53 [2020-12-01 15:57:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:51,814 INFO L481 AbstractCegarLoop]: Abstraction has 559 states and 699 transitions. [2020-12-01 15:57:51,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:57:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 699 transitions. [2020-12-01 15:57:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-01 15:57:51,818 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:51,819 INFO L422 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] [2020-12-01 15:57:51,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:57:51,819 INFO L429 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]=== [2020-12-01 15:57:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:51,820 INFO L82 PathProgramCache]: Analyzing trace with hash 855037089, now seen corresponding path program 1 times [2020-12-01 15:57:51,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:51,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786548332] [2020-12-01 15:57:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:52,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786548332] [2020-12-01 15:57:52,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:52,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:57:52,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190697712] [2020-12-01 15:57:52,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:57:52,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:52,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:57:52,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:57:52,009 INFO L87 Difference]: Start difference. First operand 559 states and 699 transitions. Second operand 4 states. [2020-12-01 15:57:52,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:52,154 INFO L93 Difference]: Finished difference Result 1185 states and 1483 transitions. [2020-12-01 15:57:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:57:52,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-12-01 15:57:52,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:52,159 INFO L225 Difference]: With dead ends: 1185 [2020-12-01 15:57:52,160 INFO L226 Difference]: Without dead ends: 635 [2020-12-01 15:57:52,161 INFO L677 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 [2020-12-01 15:57:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-12-01 15:57:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 388. [2020-12-01 15:57:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2020-12-01 15:57:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 479 transitions. [2020-12-01 15:57:52,232 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 479 transitions. Word has length 53 [2020-12-01 15:57:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:52,232 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 479 transitions. [2020-12-01 15:57:52,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:57:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 479 transitions. [2020-12-01 15:57:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-01 15:57:52,234 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:52,234 INFO L422 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] [2020-12-01 15:57:52,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:57:52,234 INFO L429 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]=== [2020-12-01 15:57:52,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:52,235 INFO L82 PathProgramCache]: Analyzing trace with hash -615051935, now seen corresponding path program 1 times [2020-12-01 15:57:52,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:52,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665681396] [2020-12-01 15:57:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:52,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665681396] [2020-12-01 15:57:52,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:52,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:57:52,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312756835] [2020-12-01 15:57:52,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:57:52,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:52,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:57:52,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:57:52,406 INFO L87 Difference]: Start difference. First operand 388 states and 479 transitions. Second operand 4 states. [2020-12-01 15:57:52,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:52,646 INFO L93 Difference]: Finished difference Result 688 states and 846 transitions. [2020-12-01 15:57:52,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:57:52,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-12-01 15:57:52,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:52,652 INFO L225 Difference]: With dead ends: 688 [2020-12-01 15:57:52,652 INFO L226 Difference]: Without dead ends: 680 [2020-12-01 15:57:52,653 INFO L677 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 [2020-12-01 15:57:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-12-01 15:57:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 646. [2020-12-01 15:57:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2020-12-01 15:57:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 807 transitions. [2020-12-01 15:57:52,787 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 807 transitions. Word has length 53 [2020-12-01 15:57:52,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:52,789 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 807 transitions. [2020-12-01 15:57:52,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:57:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 807 transitions. [2020-12-01 15:57:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-01 15:57:52,791 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:52,797 INFO L422 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] [2020-12-01 15:57:52,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:57:52,798 INFO L429 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]=== [2020-12-01 15:57:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash 228612034, now seen corresponding path program 1 times [2020-12-01 15:57:52,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:52,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484889538] [2020-12-01 15:57:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:52,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484889538] [2020-12-01 15:57:52,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:52,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:57:52,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930466117] [2020-12-01 15:57:52,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:57:52,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:52,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:57:52,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:57:52,941 INFO L87 Difference]: Start difference. First operand 646 states and 807 transitions. Second operand 5 states. [2020-12-01 15:57:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:53,209 INFO L93 Difference]: Finished difference Result 1311 states and 1628 transitions. [2020-12-01 15:57:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:57:53,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-12-01 15:57:53,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:53,214 INFO L225 Difference]: With dead ends: 1311 [2020-12-01 15:57:53,214 INFO L226 Difference]: Without dead ends: 653 [2020-12-01 15:57:53,216 INFO L677 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 [2020-12-01 15:57:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-12-01 15:57:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 592. [2020-12-01 15:57:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-12-01 15:57:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 739 transitions. [2020-12-01 15:57:53,340 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 739 transitions. Word has length 54 [2020-12-01 15:57:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:53,340 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 739 transitions. [2020-12-01 15:57:53,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:57:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 739 transitions. [2020-12-01 15:57:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-01 15:57:53,341 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:53,341 INFO L422 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] [2020-12-01 15:57:53,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:57:53,341 INFO L429 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]=== [2020-12-01 15:57:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:53,342 INFO L82 PathProgramCache]: Analyzing trace with hash 351778938, now seen corresponding path program 1 times [2020-12-01 15:57:53,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:53,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701281747] [2020-12-01 15:57:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:53,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701281747] [2020-12-01 15:57:53,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:53,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:57:53,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908990906] [2020-12-01 15:57:53,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:57:53,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:53,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:57:53,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:57:53,501 INFO L87 Difference]: Start difference. First operand 592 states and 739 transitions. Second operand 7 states. [2020-12-01 15:57:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:53,911 INFO L93 Difference]: Finished difference Result 889 states and 1101 transitions. [2020-12-01 15:57:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-01 15:57:53,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2020-12-01 15:57:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:53,923 INFO L225 Difference]: With dead ends: 889 [2020-12-01 15:57:53,923 INFO L226 Difference]: Without dead ends: 857 [2020-12-01 15:57:53,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:57:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2020-12-01 15:57:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 596. [2020-12-01 15:57:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2020-12-01 15:57:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 743 transitions. [2020-12-01 15:57:54,058 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 743 transitions. Word has length 60 [2020-12-01 15:57:54,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:54,059 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 743 transitions. [2020-12-01 15:57:54,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:57:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 743 transitions. [2020-12-01 15:57:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-01 15:57:54,060 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:54,060 INFO L422 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] [2020-12-01 15:57:54,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 15:57:54,061 INFO L429 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]=== [2020-12-01 15:57:54,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:54,061 INFO L82 PathProgramCache]: Analyzing trace with hash -511022652, now seen corresponding path program 1 times [2020-12-01 15:57:54,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:54,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910470104] [2020-12-01 15:57:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:54,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910470104] [2020-12-01 15:57:54,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:54,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:57:54,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483632119] [2020-12-01 15:57:54,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:57:54,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:54,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:57:54,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:57:54,268 INFO L87 Difference]: Start difference. First operand 596 states and 743 transitions. Second operand 3 states. [2020-12-01 15:57:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:54,457 INFO L93 Difference]: Finished difference Result 1192 states and 1475 transitions. [2020-12-01 15:57:54,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:57:54,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-01 15:57:54,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:54,463 INFO L225 Difference]: With dead ends: 1192 [2020-12-01 15:57:54,463 INFO L226 Difference]: Without dead ends: 633 [2020-12-01 15:57:54,465 INFO L677 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 [2020-12-01 15:57:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-12-01 15:57:54,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 568. [2020-12-01 15:57:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2020-12-01 15:57:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 697 transitions. [2020-12-01 15:57:54,584 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 697 transitions. Word has length 61 [2020-12-01 15:57:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:54,584 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 697 transitions. [2020-12-01 15:57:54,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:57:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 697 transitions. [2020-12-01 15:57:54,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-01 15:57:54,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:54,586 INFO L422 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] [2020-12-01 15:57:54,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 15:57:54,586 INFO L429 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]=== [2020-12-01 15:57:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:54,587 INFO L82 PathProgramCache]: Analyzing trace with hash -206387521, now seen corresponding path program 1 times [2020-12-01 15:57:54,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:54,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166883081] [2020-12-01 15:57:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:54,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166883081] [2020-12-01 15:57:54,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:54,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:57:54,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144229742] [2020-12-01 15:57:54,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:57:54,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:54,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:57:54,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:57:54,830 INFO L87 Difference]: Start difference. First operand 568 states and 697 transitions. Second operand 5 states. [2020-12-01 15:57:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:55,022 INFO L93 Difference]: Finished difference Result 1130 states and 1387 transitions. [2020-12-01 15:57:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:57:55,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-12-01 15:57:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:55,027 INFO L225 Difference]: With dead ends: 1130 [2020-12-01 15:57:55,027 INFO L226 Difference]: Without dead ends: 568 [2020-12-01 15:57:55,029 INFO L677 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 [2020-12-01 15:57:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-12-01 15:57:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2020-12-01 15:57:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2020-12-01 15:57:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 696 transitions. [2020-12-01 15:57:55,127 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 696 transitions. Word has length 63 [2020-12-01 15:57:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:55,127 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 696 transitions. [2020-12-01 15:57:55,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:57:55,127 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 696 transitions. [2020-12-01 15:57:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-01 15:57:55,128 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:55,128 INFO L422 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] [2020-12-01 15:57:55,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 15:57:55,129 INFO L429 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]=== [2020-12-01 15:57:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:55,129 INFO L82 PathProgramCache]: Analyzing trace with hash 227341565, now seen corresponding path program 1 times [2020-12-01 15:57:55,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:55,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174945812] [2020-12-01 15:57:55,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:55,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174945812] [2020-12-01 15:57:55,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:55,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:57:55,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186933051] [2020-12-01 15:57:55,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:57:55,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:55,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:57:55,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:57:55,331 INFO L87 Difference]: Start difference. First operand 568 states and 696 transitions. Second operand 4 states. [2020-12-01 15:57:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:55,743 INFO L93 Difference]: Finished difference Result 1566 states and 1928 transitions. [2020-12-01 15:57:55,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:57:55,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-12-01 15:57:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:55,752 INFO L225 Difference]: With dead ends: 1566 [2020-12-01 15:57:55,753 INFO L226 Difference]: Without dead ends: 1208 [2020-12-01 15:57:55,755 INFO L677 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 [2020-12-01 15:57:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-12-01 15:57:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 955. [2020-12-01 15:57:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2020-12-01 15:57:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1181 transitions. [2020-12-01 15:57:55,953 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1181 transitions. Word has length 63 [2020-12-01 15:57:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:55,953 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 1181 transitions. [2020-12-01 15:57:55,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:57:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1181 transitions. [2020-12-01 15:57:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-01 15:57:55,955 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:55,955 INFO L422 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] [2020-12-01 15:57:55,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 15:57:55,955 INFO L429 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]=== [2020-12-01 15:57:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1575329075, now seen corresponding path program 1 times [2020-12-01 15:57:55,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:55,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854550565] [2020-12-01 15:57:55,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:56,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854550565] [2020-12-01 15:57:56,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:56,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:57:56,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500574156] [2020-12-01 15:57:56,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:57:56,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:56,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:57:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:57:56,097 INFO L87 Difference]: Start difference. First operand 955 states and 1181 transitions. Second operand 4 states. [2020-12-01 15:57:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:56,260 INFO L93 Difference]: Finished difference Result 1443 states and 1773 transitions. [2020-12-01 15:57:56,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:57:56,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-12-01 15:57:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:56,265 INFO L225 Difference]: With dead ends: 1443 [2020-12-01 15:57:56,265 INFO L226 Difference]: Without dead ends: 565 [2020-12-01 15:57:56,269 INFO L677 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 [2020-12-01 15:57:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-12-01 15:57:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 538. [2020-12-01 15:57:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-12-01 15:57:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 655 transitions. [2020-12-01 15:57:56,372 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 655 transitions. Word has length 69 [2020-12-01 15:57:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:56,372 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 655 transitions. [2020-12-01 15:57:56,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:57:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 655 transitions. [2020-12-01 15:57:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-01 15:57:56,373 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:56,374 INFO L422 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] [2020-12-01 15:57:56,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 15:57:56,374 INFO L429 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]=== [2020-12-01 15:57:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash -773777933, now seen corresponding path program 1 times [2020-12-01 15:57:56,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:56,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174688520] [2020-12-01 15:57:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:56,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174688520] [2020-12-01 15:57:56,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:56,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:57:56,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098672946] [2020-12-01 15:57:56,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:57:56,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:56,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:57:56,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:57:56,543 INFO L87 Difference]: Start difference. First operand 538 states and 655 transitions. Second operand 4 states. [2020-12-01 15:57:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:56,806 INFO L93 Difference]: Finished difference Result 897 states and 1088 transitions. [2020-12-01 15:57:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:57:56,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-12-01 15:57:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:56,812 INFO L225 Difference]: With dead ends: 897 [2020-12-01 15:57:56,813 INFO L226 Difference]: Without dead ends: 884 [2020-12-01 15:57:56,813 INFO L677 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 [2020-12-01 15:57:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2020-12-01 15:57:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 795. [2020-12-01 15:57:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-12-01 15:57:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 982 transitions. [2020-12-01 15:57:56,965 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 982 transitions. Word has length 69 [2020-12-01 15:57:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:56,965 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 982 transitions. [2020-12-01 15:57:56,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:57:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 982 transitions. [2020-12-01 15:57:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-01 15:57:56,966 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:56,966 INFO L422 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] [2020-12-01 15:57:56,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-01 15:57:56,967 INFO L429 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]=== [2020-12-01 15:57:56,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1556043786, now seen corresponding path program 1 times [2020-12-01 15:57:56,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:56,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698259178] [2020-12-01 15:57:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:57,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698259178] [2020-12-01 15:57:57,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:57,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:57:57,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500237124] [2020-12-01 15:57:57,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:57:57,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:57:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:57:57,094 INFO L87 Difference]: Start difference. First operand 795 states and 982 transitions. Second operand 4 states. [2020-12-01 15:57:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:57,282 INFO L93 Difference]: Finished difference Result 939 states and 1158 transitions. [2020-12-01 15:57:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:57:57,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-12-01 15:57:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:57,289 INFO L225 Difference]: With dead ends: 939 [2020-12-01 15:57:57,289 INFO L226 Difference]: Without dead ends: 926 [2020-12-01 15:57:57,290 INFO L677 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 [2020-12-01 15:57:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2020-12-01 15:57:57,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 799. [2020-12-01 15:57:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-12-01 15:57:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 982 transitions. [2020-12-01 15:57:57,443 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 982 transitions. Word has length 70 [2020-12-01 15:57:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:57,444 INFO L481 AbstractCegarLoop]: Abstraction has 799 states and 982 transitions. [2020-12-01 15:57:57,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:57:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 982 transitions. [2020-12-01 15:57:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-01 15:57:57,445 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:57,446 INFO L422 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, 1, 1, 1, 1, 1, 1] [2020-12-01 15:57:57,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-01 15:57:57,446 INFO L429 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]=== [2020-12-01 15:57:57,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:57,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1441624065, now seen corresponding path program 1 times [2020-12-01 15:57:57,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:57,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443567526] [2020-12-01 15:57:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:57,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443567526] [2020-12-01 15:57:57,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311495816] [2020-12-01 15:57:57,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/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 [2020-12-01 15:57:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:58,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-01 15:57:58,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:57:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:58,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:57:58,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-12-01 15:57:58,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163120638] [2020-12-01 15:57:58,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:57:58,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:58,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:57:58,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:57:58,402 INFO L87 Difference]: Start difference. First operand 799 states and 982 transitions. Second operand 4 states. [2020-12-01 15:57:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:58,586 INFO L93 Difference]: Finished difference Result 1154 states and 1428 transitions. [2020-12-01 15:57:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:57:58,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-01 15:57:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:58,590 INFO L225 Difference]: With dead ends: 1154 [2020-12-01 15:57:58,591 INFO L226 Difference]: Without dead ends: 387 [2020-12-01 15:57:58,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:57:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-12-01 15:57:58,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 355. [2020-12-01 15:57:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-12-01 15:57:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 412 transitions. [2020-12-01 15:57:58,685 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 412 transitions. Word has length 74 [2020-12-01 15:57:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:58,686 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 412 transitions. [2020-12-01 15:57:58,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:57:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 412 transitions. [2020-12-01 15:57:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-01 15:57:58,687 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:58,687 INFO L422 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, 1, 1, 1, 1] [2020-12-01 15:57:58,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-01 15:57:58,903 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:57:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1443427930, now seen corresponding path program 1 times [2020-12-01 15:57:58,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:58,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718036652] [2020-12-01 15:57:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:59,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718036652] [2020-12-01 15:57:59,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:59,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:57:59,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415423244] [2020-12-01 15:57:59,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:57:59,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:59,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:57:59,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:57:59,133 INFO L87 Difference]: Start difference. First operand 355 states and 412 transitions. Second operand 3 states. [2020-12-01 15:57:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:57:59,225 INFO L93 Difference]: Finished difference Result 588 states and 682 transitions. [2020-12-01 15:57:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:57:59,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2020-12-01 15:57:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:57:59,229 INFO L225 Difference]: With dead ends: 588 [2020-12-01 15:57:59,229 INFO L226 Difference]: Without dead ends: 278 [2020-12-01 15:57:59,230 INFO L677 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 [2020-12-01 15:57:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-12-01 15:57:59,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2020-12-01 15:57:59,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2020-12-01 15:57:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 313 transitions. [2020-12-01 15:57:59,299 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 313 transitions. Word has length 83 [2020-12-01 15:57:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:57:59,300 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 313 transitions. [2020-12-01 15:57:59,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:57:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 313 transitions. [2020-12-01 15:57:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-01 15:57:59,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:57:59,305 INFO L422 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, 1, 1, 1, 1, 1, 1] [2020-12-01 15:57:59,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-01 15:57:59,306 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:57:59,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:57:59,307 INFO L82 PathProgramCache]: Analyzing trace with hash -736644159, now seen corresponding path program 1 times [2020-12-01 15:57:59,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:57:59,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966406347] [2020-12-01 15:57:59,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:57:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:57:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:57:59,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966406347] [2020-12-01 15:57:59,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:57:59,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:57:59,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828982803] [2020-12-01 15:57:59,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:57:59,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:57:59,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:57:59,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:57:59,923 INFO L87 Difference]: Start difference. First operand 278 states and 313 transitions. Second operand 4 states. [2020-12-01 15:58:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:58:00,101 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2020-12-01 15:58:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:58:00,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2020-12-01 15:58:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:58:00,103 INFO L225 Difference]: With dead ends: 282 [2020-12-01 15:58:00,104 INFO L226 Difference]: Without dead ends: 224 [2020-12-01 15:58:00,105 INFO L677 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 [2020-12-01 15:58:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-12-01 15:58:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 140. [2020-12-01 15:58:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-12-01 15:58:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2020-12-01 15:58:00,141 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 85 [2020-12-01 15:58:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:58:00,142 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2020-12-01 15:58:00,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:58:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2020-12-01 15:58:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-01 15:58:00,144 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:58:00,144 INFO L422 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, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:58:00,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-01 15:58:00,144 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:58:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:58:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1558509527, now seen corresponding path program 1 times [2020-12-01 15:58:00,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:58:00,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768038602] [2020-12-01 15:58:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:58:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:58:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:58:00,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768038602] [2020-12-01 15:58:00,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:58:00,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:58:00,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885137767] [2020-12-01 15:58:00,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:58:00,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:58:00,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:58:00,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:58:00,517 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 5 states. [2020-12-01 15:58:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:58:00,751 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2020-12-01 15:58:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:58:00,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2020-12-01 15:58:00,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:58:00,752 INFO L225 Difference]: With dead ends: 140 [2020-12-01 15:58:00,753 INFO L226 Difference]: Without dead ends: 0 [2020-12-01 15:58:00,753 INFO L677 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 [2020-12-01 15:58:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-01 15:58:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-01 15:58:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-01 15:58:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-01 15:58:00,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2020-12-01 15:58:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:58:00,755 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-01 15:58:00,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:58:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-01 15:58:00,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-01 15:58:00,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-01 15:58:00,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-01 15:58:01,071 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 84 [2020-12-01 15:58:01,586 WARN L197 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 149 [2020-12-01 15:58:02,047 WARN L197 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 146 [2020-12-01 15:58:02,280 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 127 [2020-12-01 15:58:02,606 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2020-12-01 15:58:03,318 WARN L197 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 150 [2020-12-01 15:58:03,745 WARN L197 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 97 [2020-12-01 15:58:04,189 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 152 [2020-12-01 15:58:04,466 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 51 [2020-12-01 15:58:04,827 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 155 [2020-12-01 15:58:04,986 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 126 [2020-12-01 15:58:05,335 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 141 [2020-12-01 15:58:05,536 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2020-12-01 15:58:05,846 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 117 [2020-12-01 15:58:06,049 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 131 [2020-12-01 15:58:06,359 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 97 [2020-12-01 15:58:06,785 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 137 [2020-12-01 15:58:07,033 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 131 [2020-12-01 15:58:07,219 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 137 [2020-12-01 15:58:07,842 WARN L197 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2020-12-01 15:58:08,509 WARN L197 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 67 [2020-12-01 15:58:09,270 WARN L197 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2020-12-01 15:58:09,767 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 30 [2020-12-01 15:58:10,207 WARN L197 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2020-12-01 15:58:10,512 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2020-12-01 15:58:10,643 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2020-12-01 15:58:11,916 WARN L197 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 54 [2020-12-01 15:58:12,068 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2020-12-01 15:58:12,293 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 6 [2020-12-01 15:58:12,542 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2020-12-01 15:58:13,156 WARN L197 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 24 [2020-12-01 15:58:13,505 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-01 15:58:13,816 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 11 [2020-12-01 15:58:14,708 WARN L197 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 73 [2020-12-01 15:58:15,104 WARN L197 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 26 [2020-12-01 15:58:15,728 WARN L197 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 49 [2020-12-01 15:58:16,112 WARN L197 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2020-12-01 15:58:16,517 WARN L197 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 49 [2020-12-01 15:58:16,822 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 23 [2020-12-01 15:58:16,989 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 6 [2020-12-01 15:58:17,140 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 22 [2020-12-01 15:58:17,476 WARN L197 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 22 [2020-12-01 15:58:17,854 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 23 [2020-12-01 15:58:18,217 WARN L197 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 23 [2020-12-01 15:58:18,424 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2020-12-01 15:58:18,930 WARN L197 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 34 [2020-12-01 15:58:18,984 INFO L258 CegarLoopResult]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0)) [2020-12-01 15:58:18,985 INFO L262 CegarLoopResult]: For program point L4098-1(lines 4097 4116) no Hoare annotation was computed. [2020-12-01 15:58:18,985 INFO L258 CegarLoopResult]: At program point L3867(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) .cse3 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (<= (+ .cse4 1) 0) (< (* 18446744073709551616 .cse4) .cse5)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (< (* 18446744073709551616 .cse6) .cse7) (<= (+ .cse6 1) 0))))) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3))) [2020-12-01 15:58:18,985 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,986 INFO L258 CegarLoopResult]: At program point L3471(lines 3465 3473) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2020-12-01 15:58:18,986 INFO L258 CegarLoopResult]: At program point L4264-1(lines 1 4266) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0))))) [2020-12-01 15:58:18,986 INFO L262 CegarLoopResult]: For program point L4264(lines 4264 4266) no Hoare annotation was computed. [2020-12-01 15:58:18,986 INFO L262 CegarLoopResult]: For program point L4099-1(lines 4097 4116) no Hoare annotation was computed. [2020-12-01 15:58:18,986 INFO L262 CegarLoopResult]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2020-12-01 15:58:18,987 INFO L262 CegarLoopResult]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2020-12-01 15:58:18,987 INFO L258 CegarLoopResult]: At program point L3439-1(lines 3433 3441) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:18,987 INFO L258 CegarLoopResult]: At program point L3439(lines 3433 3441) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:18,988 INFO L258 CegarLoopResult]: At program point L4233(lines 4008 4011) the Hoare annotation is: (let ((.cse5 (= ~ldv_urb_state~0 0)) (.cse6 (= ~ldv_coherent_state~0 0)) (.cse0 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 .cse2 .cse3 (= 0 ~res_kbtab_probe_3~0) .cse4 (<= ~ldv_urb_state~0 1)) (and (<= (+ ~res_kbtab_probe_3~0 12) 0) (<= (+ |ULTIMATE.start_kbtab_probe_#res| 12) 0) .cse5 .cse6 .cse0 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse2) (and .cse5 .cse6 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse0 (or (<= 1 ~res_kbtab_probe_3~0) (<= (+ ~res_kbtab_probe_3~0 1) 0)) .cse1 (or (<= (+ |ULTIMATE.start_kbtab_probe_#res| 1) 0) (<= 1 |ULTIMATE.start_kbtab_probe_#res|)) .cse2 .cse3 .cse4 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (<= (+ .cse7 1) 0) (< (* 18446744073709551616 .cse7) .cse8)))) (let ((.cse10 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse9 (div .cse10 18446744073709551616))) (or (< (* 18446744073709551616 .cse9) .cse10) (<= (+ .cse9 1) 0))))))) [2020-12-01 15:58:18,988 INFO L262 CegarLoopResult]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2020-12-01 15:58:18,988 INFO L262 CegarLoopResult]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2020-12-01 15:58:18,988 INFO L258 CegarLoopResult]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse5 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse9 (= 0 ~res_kbtab_probe_3~0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 .cse3 (or (<= (+ |ULTIMATE.start_kbtab_probe_#res| 1) 0) (<= 1 |ULTIMATE.start_kbtab_probe_#res|)) .cse4 .cse5 .cse6 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (<= (+ .cse7 1) 0) (< (* 18446744073709551616 .cse7) .cse8)))) .cse9 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0))))) (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 (<= ~ldv_urb_state~0 1)) (and (<= (+ |ULTIMATE.start_kbtab_probe_#res| 12) 0) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4))) [2020-12-01 15:58:18,989 INFO L258 CegarLoopResult]: At program point L3509(lines 3506 3511) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:18,989 INFO L262 CegarLoopResult]: For program point L4203(line 4203) no Hoare annotation was computed. [2020-12-01 15:58:18,989 INFO L258 CegarLoopResult]: At program point L4236(lines 4235 4237) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2020-12-01 15:58:18,989 INFO L262 CegarLoopResult]: For program point L4203-4(line 4203) no Hoare annotation was computed. [2020-12-01 15:58:18,989 INFO L262 CegarLoopResult]: For program point L4203-2(line 4203) no Hoare annotation was computed. [2020-12-01 15:58:18,989 INFO L262 CegarLoopResult]: For program point L4203-8(line 4203) no Hoare annotation was computed. [2020-12-01 15:58:18,989 INFO L262 CegarLoopResult]: For program point L4203-6(line 4203) no Hoare annotation was computed. [2020-12-01 15:58:18,990 INFO L258 CegarLoopResult]: At program point L3576(lines 3569 3578) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:18,990 INFO L258 CegarLoopResult]: At program point L3411-1(lines 3405 3413) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-12-01 15:58:18,990 INFO L258 CegarLoopResult]: At program point L3411(lines 3405 3413) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and (= |ULTIMATE.start_kmalloc_#res.base| 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 (= |ULTIMATE.start_kzalloc_#res.base| 0) (= |ULTIMATE.start_kzalloc_#res.offset| 0) (= |ULTIMATE.start___kmalloc_#res.offset| 0) .cse4 (= |ULTIMATE.start___kmalloc_#res.base| 0)) (and .cse0 .cse2 .cse1 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-12-01 15:58:18,990 INFO L258 CegarLoopResult]: At program point L4204-1(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse2 .cse1 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-12-01 15:58:18,991 INFO L258 CegarLoopResult]: At program point L4204-2(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)) (and .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 .cse4))) [2020-12-01 15:58:18,991 INFO L258 CegarLoopResult]: At program point L4204(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse1 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-12-01 15:58:18,991 INFO L258 CegarLoopResult]: At program point L4072loopEntry(lines 4072 4085) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ~res_kbtab_probe_3~0)) [2020-12-01 15:58:18,991 INFO L258 CegarLoopResult]: At program point L4204-3(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (<= ~ldv_coherent_state~0 1)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ~res_kbtab_probe_3~0)))) [2020-12-01 15:58:18,991 INFO L258 CegarLoopResult]: At program point L4204-4(lines 4201 4205) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:18,992 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,992 INFO L262 CegarLoopResult]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2020-12-01 15:58:18,992 INFO L262 CegarLoopResult]: For program point L4106-2(lines 4106 4111) no Hoare annotation was computed. [2020-12-01 15:58:18,992 INFO L262 CegarLoopResult]: For program point L4073(line 4073) no Hoare annotation was computed. [2020-12-01 15:58:18,992 INFO L262 CegarLoopResult]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2020-12-01 15:58:18,992 INFO L258 CegarLoopResult]: At program point L3446(lines 3442 3448) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ~res_kbtab_probe_3~0)) [2020-12-01 15:58:18,993 INFO L258 CegarLoopResult]: At program point L4239(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse5 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~res_kbtab_probe_3~0)) (and .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) .cse5))) [2020-12-01 15:58:18,993 INFO L258 CegarLoopResult]: At program point L4239-1(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (<= ~ldv_coherent_state~0 1)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse7 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~res_kbtab_probe_3~0)))) [2020-12-01 15:58:18,993 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,993 INFO L258 CegarLoopResult]: At program point L3513(lines 3512 3514) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-12-01 15:58:18,994 INFO L258 CegarLoopResult]: At program point L4207(lines 4206 4208) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start___kmalloc_#res.offset| 0) .cse4 (= |ULTIMATE.start___kmalloc_#res.base| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-12-01 15:58:18,994 INFO L258 CegarLoopResult]: At program point L4207-1(lines 4206 4208) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)) (and .cse0 .cse2 .cse1 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse3 .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)))) [2020-12-01 15:58:18,994 INFO L258 CegarLoopResult]: At program point L4174(lines 4150 4179) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0)) [2020-12-01 15:58:18,994 INFO L262 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,994 INFO L258 CegarLoopResult]: At program point L4174-1(lines 4150 4179) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0)) [2020-12-01 15:58:18,994 INFO L262 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,994 INFO L262 CegarLoopResult]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,994 INFO L262 CegarLoopResult]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,994 INFO L262 CegarLoopResult]: For program point L12-6(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,995 INFO L262 CegarLoopResult]: For program point L12-7(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,995 INFO L262 CegarLoopResult]: For program point L12-8(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,995 INFO L262 CegarLoopResult]: For program point L12-10(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,995 INFO L262 CegarLoopResult]: For program point L12-11(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,995 INFO L262 CegarLoopResult]: For program point L12-12(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,995 INFO L262 CegarLoopResult]: For program point L12-14(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,995 INFO L262 CegarLoopResult]: For program point L12-15(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,995 INFO L262 CegarLoopResult]: For program point L12-16(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,995 INFO L262 CegarLoopResult]: For program point L12-18(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,995 INFO L262 CegarLoopResult]: For program point L12-19(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,996 INFO L262 CegarLoopResult]: For program point L12-20(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,996 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,996 INFO L262 CegarLoopResult]: For program point L12-22(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,996 INFO L262 CegarLoopResult]: For program point L12-23(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,996 INFO L258 CegarLoopResult]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2020-12-01 15:58:18,996 INFO L262 CegarLoopResult]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2020-12-01 15:58:18,997 INFO L262 CegarLoopResult]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2020-12-01 15:58:18,997 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:58:18,997 INFO L258 CegarLoopResult]: At program point L4210(lines 4209 4211) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:18,997 INFO L262 CegarLoopResult]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2020-12-01 15:58:18,997 INFO L262 CegarLoopResult]: For program point L4046(lines 1 4266) no Hoare annotation was computed. [2020-12-01 15:58:18,997 INFO L262 CegarLoopResult]: For program point L4046-2(lines 1 4266) no Hoare annotation was computed. [2020-12-01 15:58:18,997 INFO L262 CegarLoopResult]: For program point L4046-1(lines 1 4266) no Hoare annotation was computed. [2020-12-01 15:58:18,998 INFO L262 CegarLoopResult]: For program point L4046-4(lines 4190 4195) no Hoare annotation was computed. [2020-12-01 15:58:18,998 INFO L262 CegarLoopResult]: For program point L4046-3(lines 1 4266) no Hoare annotation was computed. [2020-12-01 15:58:18,998 INFO L258 CegarLoopResult]: At program point L4046-5(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2020-12-01 15:58:18,998 INFO L258 CegarLoopResult]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse13 (= 0 ~res_kbtab_probe_3~0)) (.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse5 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse6 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse7 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse8 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse2 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse9 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse10 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (let ((.cse12 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse11 (div .cse12 18446744073709551616))) (or (<= (+ .cse11 1) 0) (< (* 18446744073709551616 .cse11) .cse12)))) .cse13 (let ((.cse15 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse14 (div .cse15 18446744073709551616))) (or (< (* 18446744073709551616 .cse14) .cse15) (<= (+ .cse14 1) 0))))) (and (not .cse0) (<= 1 ~ldv_urb_state~0) .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 .cse10 .cse13 (<= ~ldv_urb_state~0 1)) (and .cse0 .cse3 .cse4 .cse5 .cse1 .cse6 .cse7 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse8 .cse2 .cse9 .cse10))) [2020-12-01 15:58:18,998 INFO L262 CegarLoopResult]: For program point L3981(line 3981) no Hoare annotation was computed. [2020-12-01 15:58:18,999 INFO L262 CegarLoopResult]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2020-12-01 15:58:18,999 INFO L262 CegarLoopResult]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2020-12-01 15:58:18,999 INFO L258 CegarLoopResult]: At program point L4247(lines 4246 4248) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:18,999 INFO L258 CegarLoopResult]: At program point L4214(lines 4213 4215) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:18,999 INFO L258 CegarLoopResult]: At program point L4214-1(lines 4213 4215) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:18,999 INFO L258 CegarLoopResult]: At program point L4214-2(lines 4213 4215) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,000 INFO L262 CegarLoopResult]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2020-12-01 15:58:19,000 INFO L262 CegarLoopResult]: For program point L4049(line 4049) no Hoare annotation was computed. [2020-12-01 15:58:19,000 INFO L262 CegarLoopResult]: For program point L4049-3(line 4049) no Hoare annotation was computed. [2020-12-01 15:58:19,000 INFO L262 CegarLoopResult]: For program point L4049-2(line 4049) no Hoare annotation was computed. [2020-12-01 15:58:19,000 INFO L262 CegarLoopResult]: For program point L4049-5(line 4049) no Hoare annotation was computed. [2020-12-01 15:58:19,000 INFO L262 CegarLoopResult]: For program point L4049-4(line 4049) no Hoare annotation was computed. [2020-12-01 15:58:19,000 INFO L262 CegarLoopResult]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2020-12-01 15:58:19,001 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-01 15:58:19,001 INFO L258 CegarLoopResult]: At program point L3852(lines 3793 3873) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,001 INFO L262 CegarLoopResult]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2020-12-01 15:58:19,001 INFO L262 CegarLoopResult]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2020-12-01 15:58:19,001 INFO L258 CegarLoopResult]: At program point L4117-1(lines 4093 4122) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0))))) [2020-12-01 15:58:19,002 INFO L258 CegarLoopResult]: At program point L4117(lines 4093 4122) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse5 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse9 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0)))))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (<= (+ .cse7 1) 0) (< (* 18446744073709551616 .cse7) .cse8)))) (= 0 ~res_kbtab_probe_3~0) .cse9) (and .cse0 .cse2 .cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse4 .cse5 .cse6 .cse9))) [2020-12-01 15:58:19,002 INFO L262 CegarLoopResult]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2020-12-01 15:58:19,002 INFO L262 CegarLoopResult]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2020-12-01 15:58:19,002 INFO L262 CegarLoopResult]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2020-12-01 15:58:19,002 INFO L262 CegarLoopResult]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2020-12-01 15:58:19,002 INFO L258 CegarLoopResult]: At program point L4250(lines 4184 4189) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0)) [2020-12-01 15:58:19,003 INFO L262 CegarLoopResult]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2020-12-01 15:58:19,003 INFO L262 CegarLoopResult]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2020-12-01 15:58:19,003 INFO L262 CegarLoopResult]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2020-12-01 15:58:19,003 INFO L258 CegarLoopResult]: At program point L3922(lines 3911 3924) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0))) (or (and (or (< 0 ULTIMATE.start_kbtab_init_~retval~1) (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0)) .cse0 .cse1) (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)))) [2020-12-01 15:58:19,003 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-01 15:58:19,003 INFO L258 CegarLoopResult]: At program point L4154loopEntry(lines 4154 4173) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,004 INFO L258 CegarLoopResult]: At program point L4220(lines 4219 4221) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) .cse3 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (<= (+ .cse4 1) 0) (< (* 18446744073709551616 .cse4) .cse5)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (< (* 18446744073709551616 .cse6) .cse7) (<= (+ .cse6 1) 0))))) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3))) [2020-12-01 15:58:19,004 INFO L258 CegarLoopResult]: At program point L4154-2loopEntry(lines 4154 4173) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,004 INFO L258 CegarLoopResult]: At program point L3923(lines 3909 3925) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0))) (or (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)) (and (or (<= 1 |ULTIMATE.start_kbtab_init_#res|) (<= (+ |ULTIMATE.start_kbtab_init_#res| 1) 0)) (or (< 0 ULTIMATE.start_kbtab_init_~retval~1) (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0)) .cse0 .cse1))) [2020-12-01 15:58:19,004 INFO L258 CegarLoopResult]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,005 INFO L258 CegarLoopResult]: At program point L3461(lines 3449 3463) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,005 INFO L262 CegarLoopResult]: For program point L4155-1(lines 4154 4173) no Hoare annotation was computed. [2020-12-01 15:58:19,005 INFO L262 CegarLoopResult]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2020-12-01 15:58:19,005 INFO L258 CegarLoopResult]: At program point L4089(lines 4066 4091) the Hoare annotation is: (let ((.cse10 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse7 (= 0 ~res_kbtab_probe_3~0)) (.cse8 (= |ULTIMATE.start_usb_alloc_coherent_#res.offset| 0)) (.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse9 (= ~ldv_coherent_state~0 0)) (.cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse5 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_coherent_#res.base| 0))) (or (and .cse0 (<= ~ldv_coherent_state~0 1) .cse1 (<= 1 ~ldv_coherent_state~0) .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse8 .cse9 .cse1 .cse2 .cse10 .cse4 .cse5 .cse3 .cse6 (let ((.cse12 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse11 (div .cse12 18446744073709551616))) (or (<= (+ .cse11 1) 0) (< (* 18446744073709551616 .cse11) .cse12)))) .cse7) (and .cse8 .cse0 .cse1 .cse9 .cse2 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base 0) .cse4 .cse5 .cse6 .cse3))) [2020-12-01 15:58:19,005 INFO L262 CegarLoopResult]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2020-12-01 15:58:19,006 INFO L262 CegarLoopResult]: For program point L4156-1(lines 4154 4173) no Hoare annotation was computed. [2020-12-01 15:58:19,006 INFO L258 CegarLoopResult]: At program point L3496(lines 3475 3498) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,006 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-01 15:58:19,006 INFO L265 CegarLoopResult]: At program point L4058(lines 4058 4059) the Hoare annotation is: true [2020-12-01 15:58:19,006 INFO L265 CegarLoopResult]: At program point L4058-2(lines 4058 4059) the Hoare annotation is: true [2020-12-01 15:58:19,006 INFO L265 CegarLoopResult]: At program point L4058-1(lines 4058 4059) the Hoare annotation is: true [2020-12-01 15:58:19,006 INFO L265 CegarLoopResult]: At program point L4058-3(lines 4058 4059) the Hoare annotation is: true [2020-12-01 15:58:19,007 INFO L258 CegarLoopResult]: At program point L4257(lines 4256 4258) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2020-12-01 15:58:19,007 INFO L258 CegarLoopResult]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,007 INFO L258 CegarLoopResult]: At program point L3531(lines 3525 3533) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,007 INFO L262 CegarLoopResult]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2020-12-01 15:58:19,008 INFO L258 CegarLoopResult]: At program point L4028(lines 3980 4031) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse1 (<= 1 ~ldv_urb_state~0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse9 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse4 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse8 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse7 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 (<= ~ldv_coherent_state~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~ldv_urb_state~0 1)) (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0))))))) [2020-12-01 15:58:19,008 INFO L258 CegarLoopResult]: At program point L3995(lines 3994 4030) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse1 (<= 1 ~ldv_urb_state~0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse9 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse4 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse8 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse7 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 (<= ~ldv_coherent_state~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~ldv_urb_state~0 1)) (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0))))))) [2020-12-01 15:58:19,008 INFO L258 CegarLoopResult]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (<= ~ldv_coherent_state~0 1)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse7 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse9 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) (= 0 ~res_kbtab_probe_3~0)) (and .cse0 .cse2 .cse3 .cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse5 .cse6 .cse7))) [2020-12-01 15:58:19,008 INFO L258 CegarLoopResult]: At program point L3401-1(lines 3394 3403) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2020-12-01 15:58:19,009 INFO L258 CegarLoopResult]: At program point L3401(lines 3394 3403) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)) (and (= |ULTIMATE.start_kmalloc_#res.base| 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start___kmalloc_#res.offset| 0) .cse4 (= |ULTIMATE.start___kmalloc_#res.base| 0)))) [2020-12-01 15:58:19,009 INFO L258 CegarLoopResult]: At program point L4227(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,009 INFO L258 CegarLoopResult]: At program point L4227-1(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,009 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-01 15:58:19,009 INFO L258 CegarLoopResult]: At program point L4227-2(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,010 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-01 15:58:19,010 INFO L258 CegarLoopResult]: At program point L4129loopEntry(lines 4129 4142) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0)) [2020-12-01 15:58:19,010 INFO L262 CegarLoopResult]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2020-12-01 15:58:19,010 INFO L262 CegarLoopResult]: For program point L4130(line 4130) no Hoare annotation was computed. [2020-12-01 15:58:19,010 INFO L262 CegarLoopResult]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2020-12-01 15:58:19,010 INFO L258 CegarLoopResult]: At program point L4097loopEntry(lines 4097 4116) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (<= ~ldv_coherent_state~0 1)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse7 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse9 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) (= 0 ~res_kbtab_probe_3~0)) (and .cse0 .cse2 .cse3 .cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse5 .cse6 .cse7))) [2020-12-01 15:58:19,011 INFO L262 CegarLoopResult]: For program point L4163-2(lines 4163 4168) no Hoare annotation was computed. [2020-12-01 15:58:19,011 INFO L258 CegarLoopResult]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse3 (<= 1 ~ldv_urb_state~0)) (.cse4 (<= 1 ~ldv_coherent_state~0)) (.cse5 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse10 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse6 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse7 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse0 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 ULTIMATE.start_main_~tmp___8~3))) (.cse8 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse9 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) .cse0 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) .cse1) (and .cse2 .cse3 (<= ~ldv_coherent_state~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (<= ~ldv_urb_state~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse0 .cse8 .cse9 .cse1) (and .cse5 .cse10 .cse6 .cse7 .cse0 .cse8 .cse9 .cse1 (let ((.cse12 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse11 (div .cse12 18446744073709551616))) (or (< (* 18446744073709551616 .cse11) .cse12) (<= (+ .cse11 1) 0))))))) [2020-12-01 15:58:19,011 INFO L258 CegarLoopResult]: At program point L4097-2loopEntry(lines 4097 4116) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0)) [2020-12-01 15:58:19,011 INFO L258 CegarLoopResult]: At program point L4230(lines 4229 4231) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2020-12-01 15:58:19,012 INFO L262 CegarLoopResult]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2020-12-01 15:58:19,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:58:19 BoogieIcfgContainer [2020-12-01 15:58:19,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:58:19,139 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:58:19,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:58:19,140 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:58:19,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:57:45" (3/4) ... [2020-12-01 15:58:19,144 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-01 15:58:19,177 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2020-12-01 15:58:19,179 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2020-12-01 15:58:19,181 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-12-01 15:58:19,183 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-01 15:58:19,185 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-01 15:58:19,225 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3) || ((((1 <= \result || \result + 1 <= 0) && (0 < retval || retval + 1 <= 0)) && ldv_urb_state == 0) && ldv_coherent_state == 0) [2020-12-01 15:58:19,226 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2020-12-01 15:58:19,226 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2020-12-01 15:58:19,226 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || ((((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2020-12-01 15:58:19,229 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,229 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,230 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,230 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,230 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,230 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-12-01 15:58:19,230 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,231 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-12-01 15:58:19,231 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,231 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) [2020-12-01 15:58:19,231 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 [2020-12-01 15:58:19,231 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-12-01 15:58:19,232 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 [2020-12-01 15:58:19,232 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) [2020-12-01 15:58:19,232 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) [2020-12-01 15:58:19,232 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-12-01 15:58:19,232 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && kbtab == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) [2020-12-01 15:58:19,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-12-01 15:58:19,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-12-01 15:58:19,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2020-12-01 15:58:19,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2020-12-01 15:58:19,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2020-12-01 15:58:19,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3 [2020-12-01 15:58:19,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || (((((\result + 12 <= 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2020-12-01 15:58:19,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && error + 12 <= 0) && !(\result == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0)) || (((((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) [2020-12-01 15:58:19,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || ((((((res_kbtab_probe_3 + 12 <= 0 && \result + 12 <= 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && (1 <= res_kbtab_probe_3 || res_kbtab_probe_3 + 1 <= 0)) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2020-12-01 15:58:19,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2020-12-01 15:58:19,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && 0 == res_kbtab_probe_3) || (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) [2020-12-01 15:58:19,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3 [2020-12-01 15:58:19,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\result == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((((!(\result == 0) && 1 <= ldv_urb_state) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1)) || (((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) [2020-12-01 15:58:19,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) [2020-12-01 15:58:19,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) || (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) [2020-12-01 15:58:19,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) || ((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) [2020-12-01 15:58:19,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) [2020-12-01 15:58:19,236 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2020-12-01 15:58:19,236 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,236 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,236 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,236 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,237 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,237 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,237 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,237 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,237 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,238 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,238 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,238 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,238 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,239 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 [2020-12-01 15:58:19,239 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,239 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2020-12-01 15:58:19,504 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a00d06c7-1026-49cc-9d31-e6c15b68af3a/bin/uautomizer/witness.graphml [2020-12-01 15:58:19,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:58:19,506 INFO L168 Benchmark]: Toolchain (without parser) took 38167.22 ms. Allocated memory was 90.2 MB in the beginning and 654.3 MB in the end (delta: 564.1 MB). Free memory was 55.3 MB in the beginning and 473.4 MB in the end (delta: -418.1 MB). Peak memory consumption was 144.3 MB. Max. memory is 16.1 GB. [2020-12-01 15:58:19,507 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 90.2 MB. Free memory was 50.4 MB in the beginning and 50.3 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:58:19,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1734.24 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 55.3 MB in the beginning and 74.4 MB in the end (delta: -19.1 MB). Peak memory consumption was 49.9 MB. Max. memory is 16.1 GB. [2020-12-01 15:58:19,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 190.70 ms. Allocated memory is still 113.2 MB. Free memory was 74.4 MB in the beginning and 67.6 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 15:58:19,508 INFO L168 Benchmark]: Boogie Preprocessor took 168.27 ms. Allocated memory is still 113.2 MB. Free memory was 67.6 MB in the beginning and 61.8 MB in the end (delta: 5.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 15:58:19,509 INFO L168 Benchmark]: RCFGBuilder took 2128.88 ms. Allocated memory was 113.2 MB in the beginning and 157.3 MB in the end (delta: 44.0 MB). Free memory was 61.8 MB in the beginning and 61.6 MB in the end (delta: 251.2 kB). Peak memory consumption was 51.5 MB. Max. memory is 16.1 GB. [2020-12-01 15:58:19,509 INFO L168 Benchmark]: TraceAbstraction took 33569.30 ms. Allocated memory was 157.3 MB in the beginning and 654.3 MB in the end (delta: 497.0 MB). Free memory was 61.6 MB in the beginning and 537.3 MB in the end (delta: -475.8 MB). Peak memory consumption was 339.3 MB. Max. memory is 16.1 GB. [2020-12-01 15:58:19,510 INFO L168 Benchmark]: Witness Printer took 365.55 ms. Allocated memory is still 654.3 MB. Free memory was 537.3 MB in the beginning and 473.4 MB in the end (delta: 64.0 MB). Peak memory consumption was 62.9 MB. Max. memory is 16.1 GB. [2020-12-01 15:58:19,514 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 90.2 MB. Free memory was 50.4 MB in the beginning and 50.3 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1734.24 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 55.3 MB in the beginning and 74.4 MB in the end (delta: -19.1 MB). Peak memory consumption was 49.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 190.70 ms. Allocated memory is still 113.2 MB. Free memory was 74.4 MB in the beginning and 67.6 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 168.27 ms. Allocated memory is still 113.2 MB. Free memory was 67.6 MB in the beginning and 61.8 MB in the end (delta: 5.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2128.88 ms. Allocated memory was 113.2 MB in the beginning and 157.3 MB in the end (delta: 44.0 MB). Free memory was 61.8 MB in the beginning and 61.6 MB in the end (delta: 251.2 kB). Peak memory consumption was 51.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 33569.30 ms. Allocated memory was 157.3 MB in the beginning and 654.3 MB in the end (delta: 497.0 MB). Free memory was 61.6 MB in the beginning and 537.3 MB in the end (delta: -475.8 MB). Peak memory consumption was 339.3 MB. Max. memory is 16.1 GB. * Witness Printer took 365.55 ms. Allocated memory is still 654.3 MB. Free memory was 537.3 MB in the beginning and 473.4 MB in the end (delta: 64.0 MB). Peak memory consumption was 62.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 12]: 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: 3569]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: ((((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || (((((\result + 12 <= 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3475]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: (((((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && error + 12 <= 0) && !(\result == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0)) || (((((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 4238]: Loop Invariant Derived loop invariant: (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) || ((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4129]: Loop Invariant Derived loop invariant: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || ((((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 4238]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && 0 == res_kbtab_probe_3) || (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4184]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 && ldv_coherent_state == 0 - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) - InvariantResult [Line: 4246]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3433]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && kbtab == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: (((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) - InvariantResult [Line: 4235]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3442]: Loop Invariant Derived loop invariant: ((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: ((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: (((0 < retval || retval + 1 <= 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) || ((ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4008]: Loop Invariant Derived loop invariant: (((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || ((((((res_kbtab_probe_3 + 12 <= 0 && \result + 12 <= 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && (1 <= res_kbtab_probe_3 || res_kbtab_probe_3 + 1 <= 0)) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) || (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3433]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3994]: Loop Invariant Derived loop invariant: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3512]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 && ldv_coherent_state == 0 - InvariantResult [Line: 3506]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3405]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4124]: Loop Invariant Derived loop invariant: ((((((((((((((\result == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((((!(\result == 0) && 1 <= ldv_urb_state) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1)) || (((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) - InvariantResult [Line: 3909]: Loop Invariant Derived loop invariant: ((ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3) || ((((1 <= \result || \result + 1 <= 0) && (0 < retval || retval + 1 <= 0)) && ldv_urb_state == 0) && ldv_coherent_state == 0) - InvariantResult [Line: 3405]: Loop Invariant Derived loop invariant: (((((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.0s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4599 SDtfs, 5959 SDslu, 8253 SDs, 0 SdLazy, 721 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=955occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 7864 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 222 NumberOfFragments, 3416 HoareAnnotationTreeSize, 68 FomulaSimplifications, 61795123 FormulaSimplificationTreeSizeReduction, 6.4s HoareSimplificationTime, 68 FomulaSimplificationsInter, 402356 FormulaSimplificationTreeSizeReductionInter, 11.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1286 NumberOfCodeBlocks, 1286 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1264 ConstructedInterpolants, 0 QuantifiedInterpolants, 178274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1148 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 13/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...