./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 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC --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-7b2dab5 [2021-10-11 00:23:24,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:23:24,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:23:24,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:23:24,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:23:24,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:23:24,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:23:24,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:23:24,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:23:24,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:23:24,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:23:24,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:23:24,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:23:24,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:23:24,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:23:24,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:23:24,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:23:24,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:23:24,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:23:24,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:23:24,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:23:24,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:23:24,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:23:24,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:23:24,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:23:24,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:23:24,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:23:24,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:23:24,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:23:24,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:23:24,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:23:24,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:23:24,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:23:24,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:23:24,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:23:24,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:23:24,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:23:24,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:23:24,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:23:24,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:23:24,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:23:24,540 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-10-11 00:23:24,578 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:23:24,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:23:24,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:23:24,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:23:24,580 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:23:24,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:23:24,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:23:24,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:23:24,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:23:24,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:23:24,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:23:24,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:23:24,589 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:23:24,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:23:24,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:23:24,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:23:24,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:23:24,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:23:24,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:23:24,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:23:24,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:23:24,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:23:24,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:23:24,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:23:24,592 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:23:24,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/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_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC 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 [2021-10-11 00:23:24,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:23:24,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:23:24,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:23:24,915 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:23:24,916 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:23:24,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-10-11 00:23:25,003 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/data/2f145b670/0de5f3d418bb431fac10f3725c229b5f/FLAG9526377f6 [2021-10-11 00:23:25,775 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:23:25,777 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-10-11 00:23:25,816 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/data/2f145b670/0de5f3d418bb431fac10f3725c229b5f/FLAG9526377f6 [2021-10-11 00:23:25,886 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/data/2f145b670/0de5f3d418bb431fac10f3725c229b5f [2021-10-11 00:23:25,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:23:25,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:23:25,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:23:25,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:23:25,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:23:25,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:23:25" (1/1) ... [2021-10-11 00:23:25,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef30f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:25, skipping insertion in model container [2021-10-11 00:23:25,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:23:25" (1/1) ... [2021-10-11 00:23:25,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:23:25,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:23:26,863 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2021-10-11 00:23:26,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:23:26,960 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:23:27,136 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2021-10-11 00:23:27,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:23:27,257 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:23:27,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27 WrapperNode [2021-10-11 00:23:27,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:23:27,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:23:27,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:23:27,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:23:27,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27" (1/1) ... [2021-10-11 00:23:27,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27" (1/1) ... [2021-10-11 00:23:27,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:23:27,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:23:27,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:23:27,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:23:27,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27" (1/1) ... [2021-10-11 00:23:27,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27" (1/1) ... [2021-10-11 00:23:27,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27" (1/1) ... [2021-10-11 00:23:27,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27" (1/1) ... [2021-10-11 00:23:27,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27" (1/1) ... [2021-10-11 00:23:27,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27" (1/1) ... [2021-10-11 00:23:27,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27" (1/1) ... [2021-10-11 00:23:27,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:23:27,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:23:27,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:23:27,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:23:27,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:23:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-11 00:23:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:23:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-11 00:23:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-11 00:23:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 00:23:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-11 00:23:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 00:23:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:23:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-11 00:23:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:23:27,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:23:28,218 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 00:23:29,482 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-10-11 00:23:29,482 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-10-11 00:23:29,492 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:23:29,492 INFO L299 CfgBuilder]: Removed 135 assume(true) statements. [2021-10-11 00:23:29,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:23:29 BoogieIcfgContainer [2021-10-11 00:23:29,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:23:29,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:23:29,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:23:29,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:23:29,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:23:25" (1/3) ... [2021-10-11 00:23:29,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a2e4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:23:29, skipping insertion in model container [2021-10-11 00:23:29,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:27" (2/3) ... [2021-10-11 00:23:29,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a2e4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:23:29, skipping insertion in model container [2021-10-11 00:23:29,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:23:29" (3/3) ... [2021-10-11 00:23:29,504 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-10-11 00:23:29,519 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:23:29,523 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-10-11 00:23:29,535 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-11 00:23:29,561 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:23:29,561 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:23:29,561 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:23:29,561 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:23:29,561 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:23:29,562 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:23:29,562 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:23:29,562 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:23:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2021-10-11 00:23:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 00:23:29,585 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:29,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:23:29,586 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]=== [2021-10-11 00:23:29,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1802508012, now seen corresponding path program 1 times [2021-10-11 00:23:29,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:29,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736691976] [2021-10-11 00:23:29,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:30,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736691976] [2021-10-11 00:23:30,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:30,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:23:30,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048083695] [2021-10-11 00:23:30,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:23:30,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:23:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:23:30,062 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2021-10-11 00:23:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:30,167 INFO L93 Difference]: Finished difference Result 360 states and 509 transitions. [2021-10-11 00:23:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:23:30,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-10-11 00:23:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:30,181 INFO L225 Difference]: With dead ends: 360 [2021-10-11 00:23:30,182 INFO L226 Difference]: Without dead ends: 226 [2021-10-11 00:23:30,185 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 [2021-10-11 00:23:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-11 00:23:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2021-10-11 00:23:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2021-10-11 00:23:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 273 transitions. [2021-10-11 00:23:30,240 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 273 transitions. Word has length 11 [2021-10-11 00:23:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:30,241 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 273 transitions. [2021-10-11 00:23:30,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:23:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 273 transitions. [2021-10-11 00:23:30,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 00:23:30,242 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:30,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:23:30,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:23:30,242 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]=== [2021-10-11 00:23:30,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:30,243 INFO L82 PathProgramCache]: Analyzing trace with hash 43172304, now seen corresponding path program 1 times [2021-10-11 00:23:30,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:30,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933133149] [2021-10-11 00:23:30,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:30,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933133149] [2021-10-11 00:23:30,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:30,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:23:30,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452912113] [2021-10-11 00:23:30,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:23:30,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:30,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:23:30,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:23:30,388 INFO L87 Difference]: Start difference. First operand 218 states and 273 transitions. Second operand 3 states. [2021-10-11 00:23:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:30,484 INFO L93 Difference]: Finished difference Result 630 states and 792 transitions. [2021-10-11 00:23:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:23:30,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2021-10-11 00:23:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:30,489 INFO L225 Difference]: With dead ends: 630 [2021-10-11 00:23:30,490 INFO L226 Difference]: Without dead ends: 418 [2021-10-11 00:23:30,492 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 [2021-10-11 00:23:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-10-11 00:23:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 404. [2021-10-11 00:23:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2021-10-11 00:23:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 510 transitions. [2021-10-11 00:23:30,581 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 510 transitions. Word has length 12 [2021-10-11 00:23:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:30,581 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 510 transitions. [2021-10-11 00:23:30,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:23:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 510 transitions. [2021-10-11 00:23:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-11 00:23:30,583 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:30,583 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] [2021-10-11 00:23:30,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:23:30,584 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]=== [2021-10-11 00:23:30,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:30,584 INFO L82 PathProgramCache]: Analyzing trace with hash -803172382, now seen corresponding path program 1 times [2021-10-11 00:23:30,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:30,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138005149] [2021-10-11 00:23:30,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:30,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138005149] [2021-10-11 00:23:30,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:30,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:23:30,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756098298] [2021-10-11 00:23:30,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:23:30,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:30,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:23:30,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:23:30,798 INFO L87 Difference]: Start difference. First operand 404 states and 510 transitions. Second operand 5 states. [2021-10-11 00:23:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:31,011 INFO L93 Difference]: Finished difference Result 922 states and 1192 transitions. [2021-10-11 00:23:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:23:31,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2021-10-11 00:23:31,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:31,018 INFO L225 Difference]: With dead ends: 922 [2021-10-11 00:23:31,018 INFO L226 Difference]: Without dead ends: 525 [2021-10-11 00:23:31,021 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 [2021-10-11 00:23:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-10-11 00:23:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 475. [2021-10-11 00:23:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2021-10-11 00:23:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 611 transitions. [2021-10-11 00:23:31,064 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 611 transitions. Word has length 28 [2021-10-11 00:23:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:31,064 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 611 transitions. [2021-10-11 00:23:31,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:23:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 611 transitions. [2021-10-11 00:23:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-11 00:23:31,067 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:31,067 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] [2021-10-11 00:23:31,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 00:23:31,067 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]=== [2021-10-11 00:23:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:31,068 INFO L82 PathProgramCache]: Analyzing trace with hash 225824829, now seen corresponding path program 1 times [2021-10-11 00:23:31,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:31,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896769830] [2021-10-11 00:23:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:31,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896769830] [2021-10-11 00:23:31,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:31,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 00:23:31,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653271223] [2021-10-11 00:23:31,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 00:23:31,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:31,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 00:23:31,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:23:31,349 INFO L87 Difference]: Start difference. First operand 475 states and 611 transitions. Second operand 7 states. [2021-10-11 00:23:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:32,256 INFO L93 Difference]: Finished difference Result 2911 states and 3713 transitions. [2021-10-11 00:23:32,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-11 00:23:32,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2021-10-11 00:23:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:32,271 INFO L225 Difference]: With dead ends: 2911 [2021-10-11 00:23:32,271 INFO L226 Difference]: Without dead ends: 2445 [2021-10-11 00:23:32,273 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 [2021-10-11 00:23:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2021-10-11 00:23:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 519. [2021-10-11 00:23:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2021-10-11 00:23:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 659 transitions. [2021-10-11 00:23:32,361 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 659 transitions. Word has length 46 [2021-10-11 00:23:32,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:32,361 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 659 transitions. [2021-10-11 00:23:32,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 00:23:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 659 transitions. [2021-10-11 00:23:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-11 00:23:32,364 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:32,364 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] [2021-10-11 00:23:32,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:23:32,364 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]=== [2021-10-11 00:23:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash 248457083, now seen corresponding path program 1 times [2021-10-11 00:23:32,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:32,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724064495] [2021-10-11 00:23:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:32,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724064495] [2021-10-11 00:23:32,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:32,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:23:32,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355742252] [2021-10-11 00:23:32,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:23:32,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:32,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:23:32,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:23:32,507 INFO L87 Difference]: Start difference. First operand 519 states and 659 transitions. Second operand 5 states. [2021-10-11 00:23:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:32,976 INFO L93 Difference]: Finished difference Result 2758 states and 3486 transitions. [2021-10-11 00:23:32,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 00:23:32,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2021-10-11 00:23:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:32,992 INFO L225 Difference]: With dead ends: 2758 [2021-10-11 00:23:32,992 INFO L226 Difference]: Without dead ends: 2491 [2021-10-11 00:23:32,994 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 [2021-10-11 00:23:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2021-10-11 00:23:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 531. [2021-10-11 00:23:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2021-10-11 00:23:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 671 transitions. [2021-10-11 00:23:33,088 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 671 transitions. Word has length 46 [2021-10-11 00:23:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:33,089 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 671 transitions. [2021-10-11 00:23:33,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:23:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 671 transitions. [2021-10-11 00:23:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-11 00:23:33,098 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:33,098 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] [2021-10-11 00:23:33,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:23:33,098 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]=== [2021-10-11 00:23:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:33,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1031406595, now seen corresponding path program 1 times [2021-10-11 00:23:33,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:33,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880669020] [2021-10-11 00:23:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:33,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880669020] [2021-10-11 00:23:33,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:33,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 00:23:33,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223396565] [2021-10-11 00:23:33,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 00:23:33,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:33,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 00:23:33,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:23:33,278 INFO L87 Difference]: Start difference. First operand 531 states and 671 transitions. Second operand 7 states. [2021-10-11 00:23:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:33,659 INFO L93 Difference]: Finished difference Result 1148 states and 1445 transitions. [2021-10-11 00:23:33,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-11 00:23:33,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2021-10-11 00:23:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:33,669 INFO L225 Difference]: With dead ends: 1148 [2021-10-11 00:23:33,671 INFO L226 Difference]: Without dead ends: 875 [2021-10-11 00:23:33,673 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 [2021-10-11 00:23:33,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2021-10-11 00:23:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 535. [2021-10-11 00:23:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2021-10-11 00:23:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 675 transitions. [2021-10-11 00:23:33,743 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 675 transitions. Word has length 46 [2021-10-11 00:23:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:33,744 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 675 transitions. [2021-10-11 00:23:33,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 00:23:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 675 transitions. [2021-10-11 00:23:33,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 00:23:33,745 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:33,746 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] [2021-10-11 00:23:33,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 00:23:33,746 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]=== [2021-10-11 00:23:33,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:33,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2143426174, now seen corresponding path program 1 times [2021-10-11 00:23:33,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:33,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169099656] [2021-10-11 00:23:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:33,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169099656] [2021-10-11 00:23:33,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:33,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:23:33,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680244653] [2021-10-11 00:23:33,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:23:33,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:33,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:23:33,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:23:33,875 INFO L87 Difference]: Start difference. First operand 535 states and 675 transitions. Second operand 5 states. [2021-10-11 00:23:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:34,404 INFO L93 Difference]: Finished difference Result 2870 states and 3617 transitions. [2021-10-11 00:23:34,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 00:23:34,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-10-11 00:23:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:34,420 INFO L225 Difference]: With dead ends: 2870 [2021-10-11 00:23:34,420 INFO L226 Difference]: Without dead ends: 2595 [2021-10-11 00:23:34,422 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 [2021-10-11 00:23:34,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2021-10-11 00:23:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 547. [2021-10-11 00:23:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2021-10-11 00:23:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 687 transitions. [2021-10-11 00:23:34,548 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 687 transitions. Word has length 51 [2021-10-11 00:23:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:34,549 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 687 transitions. [2021-10-11 00:23:34,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:23:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 687 transitions. [2021-10-11 00:23:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 00:23:34,550 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:34,551 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] [2021-10-11 00:23:34,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:23:34,551 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]=== [2021-10-11 00:23:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1471482752, now seen corresponding path program 1 times [2021-10-11 00:23:34,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:34,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255920615] [2021-10-11 00:23:34,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:34,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255920615] [2021-10-11 00:23:34,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:34,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:23:34,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683439138] [2021-10-11 00:23:34,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:23:34,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:34,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:23:34,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:23:34,678 INFO L87 Difference]: Start difference. First operand 547 states and 687 transitions. Second operand 4 states. [2021-10-11 00:23:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:34,810 INFO L93 Difference]: Finished difference Result 1153 states and 1451 transitions. [2021-10-11 00:23:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:23:34,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-10-11 00:23:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:34,815 INFO L225 Difference]: With dead ends: 1153 [2021-10-11 00:23:34,816 INFO L226 Difference]: Without dead ends: 615 [2021-10-11 00:23:34,817 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 [2021-10-11 00:23:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-10-11 00:23:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 376. [2021-10-11 00:23:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2021-10-11 00:23:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 467 transitions. [2021-10-11 00:23:34,881 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 467 transitions. Word has length 51 [2021-10-11 00:23:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:34,882 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 467 transitions. [2021-10-11 00:23:34,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:23:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 467 transitions. [2021-10-11 00:23:34,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 00:23:34,883 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:34,883 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] [2021-10-11 00:23:34,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 00:23:34,884 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]=== [2021-10-11 00:23:34,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:34,885 INFO L82 PathProgramCache]: Analyzing trace with hash -934513600, now seen corresponding path program 1 times [2021-10-11 00:23:34,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:34,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014119823] [2021-10-11 00:23:34,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:34,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014119823] [2021-10-11 00:23:34,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:34,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:23:34,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102147735] [2021-10-11 00:23:34,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:23:34,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:34,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:23:34,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:23:34,996 INFO L87 Difference]: Start difference. First operand 376 states and 467 transitions. Second operand 4 states. [2021-10-11 00:23:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:35,188 INFO L93 Difference]: Finished difference Result 660 states and 818 transitions. [2021-10-11 00:23:35,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:23:35,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-10-11 00:23:35,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:35,192 INFO L225 Difference]: With dead ends: 660 [2021-10-11 00:23:35,192 INFO L226 Difference]: Without dead ends: 656 [2021-10-11 00:23:35,193 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 [2021-10-11 00:23:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2021-10-11 00:23:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 634. [2021-10-11 00:23:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2021-10-11 00:23:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 795 transitions. [2021-10-11 00:23:35,284 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 795 transitions. Word has length 51 [2021-10-11 00:23:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:35,284 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 795 transitions. [2021-10-11 00:23:35,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:23:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 795 transitions. [2021-10-11 00:23:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-11 00:23:35,285 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:35,286 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] [2021-10-11 00:23:35,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 00:23:35,286 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]=== [2021-10-11 00:23:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:35,287 INFO L82 PathProgramCache]: Analyzing trace with hash 259265857, now seen corresponding path program 1 times [2021-10-11 00:23:35,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:35,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009091638] [2021-10-11 00:23:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:35,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009091638] [2021-10-11 00:23:35,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:35,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:23:35,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426224640] [2021-10-11 00:23:35,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:23:35,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:35,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:23:35,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:23:35,397 INFO L87 Difference]: Start difference. First operand 634 states and 795 transitions. Second operand 5 states. [2021-10-11 00:23:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:35,602 INFO L93 Difference]: Finished difference Result 1281 states and 1598 transitions. [2021-10-11 00:23:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:23:35,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2021-10-11 00:23:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:35,607 INFO L225 Difference]: With dead ends: 1281 [2021-10-11 00:23:35,607 INFO L226 Difference]: Without dead ends: 635 [2021-10-11 00:23:35,609 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 [2021-10-11 00:23:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-10-11 00:23:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 580. [2021-10-11 00:23:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2021-10-11 00:23:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 727 transitions. [2021-10-11 00:23:35,707 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 727 transitions. Word has length 52 [2021-10-11 00:23:35,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:35,708 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 727 transitions. [2021-10-11 00:23:35,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:23:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 727 transitions. [2021-10-11 00:23:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-11 00:23:35,709 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:35,709 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] [2021-10-11 00:23:35,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 00:23:35,709 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]=== [2021-10-11 00:23:35,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:35,710 INFO L82 PathProgramCache]: Analyzing trace with hash -489258623, now seen corresponding path program 1 times [2021-10-11 00:23:35,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:35,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764846431] [2021-10-11 00:23:35,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:35,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764846431] [2021-10-11 00:23:35,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:35,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 00:23:35,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073064190] [2021-10-11 00:23:35,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 00:23:35,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:35,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 00:23:35,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:23:35,829 INFO L87 Difference]: Start difference. First operand 580 states and 727 transitions. Second operand 7 states. [2021-10-11 00:23:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:36,213 INFO L93 Difference]: Finished difference Result 859 states and 1071 transitions. [2021-10-11 00:23:36,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-11 00:23:36,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2021-10-11 00:23:36,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:36,219 INFO L225 Difference]: With dead ends: 859 [2021-10-11 00:23:36,219 INFO L226 Difference]: Without dead ends: 833 [2021-10-11 00:23:36,220 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 [2021-10-11 00:23:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-10-11 00:23:36,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 584. [2021-10-11 00:23:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2021-10-11 00:23:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 731 transitions. [2021-10-11 00:23:36,337 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 731 transitions. Word has length 58 [2021-10-11 00:23:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:36,338 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 731 transitions. [2021-10-11 00:23:36,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 00:23:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 731 transitions. [2021-10-11 00:23:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-11 00:23:36,339 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:36,340 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] [2021-10-11 00:23:36,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 00:23:36,340 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]=== [2021-10-11 00:23:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash 123879707, now seen corresponding path program 1 times [2021-10-11 00:23:36,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:36,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119877760] [2021-10-11 00:23:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:36,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119877760] [2021-10-11 00:23:36,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:36,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:23:36,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814182230] [2021-10-11 00:23:36,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:23:36,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:36,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:23:36,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:23:36,514 INFO L87 Difference]: Start difference. First operand 584 states and 731 transitions. Second operand 3 states. [2021-10-11 00:23:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:36,645 INFO L93 Difference]: Finished difference Result 1160 states and 1443 transitions. [2021-10-11 00:23:36,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:23:36,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2021-10-11 00:23:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:36,649 INFO L225 Difference]: With dead ends: 1160 [2021-10-11 00:23:36,650 INFO L226 Difference]: Without dead ends: 613 [2021-10-11 00:23:36,651 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 [2021-10-11 00:23:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-10-11 00:23:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 556. [2021-10-11 00:23:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2021-10-11 00:23:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 685 transitions. [2021-10-11 00:23:36,744 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 685 transitions. Word has length 59 [2021-10-11 00:23:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:36,744 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 685 transitions. [2021-10-11 00:23:36,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:23:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 685 transitions. [2021-10-11 00:23:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-11 00:23:36,745 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:36,746 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] [2021-10-11 00:23:36,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 00:23:36,746 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]=== [2021-10-11 00:23:36,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:36,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2029608918, now seen corresponding path program 1 times [2021-10-11 00:23:36,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:36,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421782534] [2021-10-11 00:23:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:36,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421782534] [2021-10-11 00:23:36,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:36,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:23:36,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617850896] [2021-10-11 00:23:36,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:23:36,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:36,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:23:36,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:23:36,978 INFO L87 Difference]: Start difference. First operand 556 states and 685 transitions. Second operand 5 states. [2021-10-11 00:23:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:37,160 INFO L93 Difference]: Finished difference Result 1106 states and 1363 transitions. [2021-10-11 00:23:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:23:37,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2021-10-11 00:23:37,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:37,164 INFO L225 Difference]: With dead ends: 1106 [2021-10-11 00:23:37,164 INFO L226 Difference]: Without dead ends: 556 [2021-10-11 00:23:37,171 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 [2021-10-11 00:23:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-10-11 00:23:37,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2021-10-11 00:23:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2021-10-11 00:23:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 684 transitions. [2021-10-11 00:23:37,263 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 684 transitions. Word has length 61 [2021-10-11 00:23:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:37,263 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 684 transitions. [2021-10-11 00:23:37,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:23:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 684 transitions. [2021-10-11 00:23:37,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-11 00:23:37,267 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:37,267 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] [2021-10-11 00:23:37,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 00:23:37,268 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]=== [2021-10-11 00:23:37,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:37,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2070283668, now seen corresponding path program 1 times [2021-10-11 00:23:37,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:37,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667510495] [2021-10-11 00:23:37,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:37,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667510495] [2021-10-11 00:23:37,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:37,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:23:37,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026299587] [2021-10-11 00:23:37,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:23:37,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:37,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:23:37,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:23:37,485 INFO L87 Difference]: Start difference. First operand 556 states and 684 transitions. Second operand 4 states. [2021-10-11 00:23:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:37,817 INFO L93 Difference]: Finished difference Result 1528 states and 1890 transitions. [2021-10-11 00:23:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:23:37,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-10-11 00:23:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:37,824 INFO L225 Difference]: With dead ends: 1528 [2021-10-11 00:23:37,824 INFO L226 Difference]: Without dead ends: 1182 [2021-10-11 00:23:37,826 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 [2021-10-11 00:23:37,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2021-10-11 00:23:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 943. [2021-10-11 00:23:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2021-10-11 00:23:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1169 transitions. [2021-10-11 00:23:37,981 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1169 transitions. Word has length 61 [2021-10-11 00:23:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:37,982 INFO L481 AbstractCegarLoop]: Abstraction has 943 states and 1169 transitions. [2021-10-11 00:23:37,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:23:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1169 transitions. [2021-10-11 00:23:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-11 00:23:37,986 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:37,986 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] [2021-10-11 00:23:37,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 00:23:37,987 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]=== [2021-10-11 00:23:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1960369742, now seen corresponding path program 1 times [2021-10-11 00:23:37,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:37,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082709186] [2021-10-11 00:23:37,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:38,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082709186] [2021-10-11 00:23:38,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:38,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:23:38,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211979055] [2021-10-11 00:23:38,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:23:38,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:38,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:23:38,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:23:38,106 INFO L87 Difference]: Start difference. First operand 943 states and 1169 transitions. Second operand 4 states. [2021-10-11 00:23:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:38,238 INFO L93 Difference]: Finished difference Result 1413 states and 1743 transitions. [2021-10-11 00:23:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:23:38,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-10-11 00:23:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:38,243 INFO L225 Difference]: With dead ends: 1413 [2021-10-11 00:23:38,243 INFO L226 Difference]: Without dead ends: 547 [2021-10-11 00:23:38,246 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 [2021-10-11 00:23:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-10-11 00:23:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 526. [2021-10-11 00:23:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2021-10-11 00:23:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 643 transitions. [2021-10-11 00:23:38,364 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 643 transitions. Word has length 67 [2021-10-11 00:23:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:38,364 INFO L481 AbstractCegarLoop]: Abstraction has 526 states and 643 transitions. [2021-10-11 00:23:38,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:23:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 643 transitions. [2021-10-11 00:23:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-11 00:23:38,365 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:38,365 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] [2021-10-11 00:23:38,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 00:23:38,366 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]=== [2021-10-11 00:23:38,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:38,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1965673074, now seen corresponding path program 1 times [2021-10-11 00:23:38,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:38,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806977801] [2021-10-11 00:23:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:38,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806977801] [2021-10-11 00:23:38,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:38,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:23:38,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640802091] [2021-10-11 00:23:38,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:23:38,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:38,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:23:38,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:23:38,532 INFO L87 Difference]: Start difference. First operand 526 states and 643 transitions. Second operand 4 states. [2021-10-11 00:23:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:38,771 INFO L93 Difference]: Finished difference Result 873 states and 1064 transitions. [2021-10-11 00:23:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:23:38,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-10-11 00:23:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:38,777 INFO L225 Difference]: With dead ends: 873 [2021-10-11 00:23:38,777 INFO L226 Difference]: Without dead ends: 866 [2021-10-11 00:23:38,778 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 [2021-10-11 00:23:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2021-10-11 00:23:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 783. [2021-10-11 00:23:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2021-10-11 00:23:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 970 transitions. [2021-10-11 00:23:38,950 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 970 transitions. Word has length 67 [2021-10-11 00:23:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:38,950 INFO L481 AbstractCegarLoop]: Abstraction has 783 states and 970 transitions. [2021-10-11 00:23:38,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:23:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 970 transitions. [2021-10-11 00:23:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-11 00:23:38,952 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:38,952 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] [2021-10-11 00:23:38,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 00:23:38,953 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]=== [2021-10-11 00:23:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:38,953 INFO L82 PathProgramCache]: Analyzing trace with hash 495831049, now seen corresponding path program 1 times [2021-10-11 00:23:38,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:38,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788691165] [2021-10-11 00:23:38,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:39,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788691165] [2021-10-11 00:23:39,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:39,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:23:39,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124454860] [2021-10-11 00:23:39,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:23:39,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:23:39,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:23:39,106 INFO L87 Difference]: Start difference. First operand 783 states and 970 transitions. Second operand 4 states. [2021-10-11 00:23:39,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:39,297 INFO L93 Difference]: Finished difference Result 911 states and 1130 transitions. [2021-10-11 00:23:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:23:39,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-10-11 00:23:39,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:39,303 INFO L225 Difference]: With dead ends: 911 [2021-10-11 00:23:39,303 INFO L226 Difference]: Without dead ends: 902 [2021-10-11 00:23:39,304 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 [2021-10-11 00:23:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2021-10-11 00:23:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 787. [2021-10-11 00:23:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2021-10-11 00:23:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 970 transitions. [2021-10-11 00:23:39,463 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 970 transitions. Word has length 68 [2021-10-11 00:23:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:39,463 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 970 transitions. [2021-10-11 00:23:39,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:23:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 970 transitions. [2021-10-11 00:23:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-11 00:23:39,465 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:39,465 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] [2021-10-11 00:23:39,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 00:23:39,465 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]=== [2021-10-11 00:23:39,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:39,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1259237824, now seen corresponding path program 1 times [2021-10-11 00:23:39,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:39,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125402736] [2021-10-11 00:23:39,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:39,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125402736] [2021-10-11 00:23:39,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742860717] [2021-10-11 00:23:39,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:23:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:40,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-11 00:23:40,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:23:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:40,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-11 00:23:40,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-10-11 00:23:40,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905618181] [2021-10-11 00:23:40,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:23:40,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:23:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:23:40,337 INFO L87 Difference]: Start difference. First operand 787 states and 970 transitions. Second operand 4 states. [2021-10-11 00:23:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:40,505 INFO L93 Difference]: Finished difference Result 1134 states and 1408 transitions. [2021-10-11 00:23:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:23:40,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-10-11 00:23:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:40,509 INFO L225 Difference]: With dead ends: 1134 [2021-10-11 00:23:40,509 INFO L226 Difference]: Without dead ends: 379 [2021-10-11 00:23:40,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:23:40,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-10-11 00:23:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 347. [2021-10-11 00:23:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2021-10-11 00:23:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 404 transitions. [2021-10-11 00:23:40,597 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 404 transitions. Word has length 72 [2021-10-11 00:23:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:40,597 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 404 transitions. [2021-10-11 00:23:40,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:23:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 404 transitions. [2021-10-11 00:23:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-10-11 00:23:40,599 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:40,599 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] [2021-10-11 00:23:40,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-11 00:23:40,827 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]=== [2021-10-11 00:23:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:40,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1340649389, now seen corresponding path program 1 times [2021-10-11 00:23:40,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:40,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502629470] [2021-10-11 00:23:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:40,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502629470] [2021-10-11 00:23:40,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:40,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:23:40,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718287393] [2021-10-11 00:23:40,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:23:40,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:23:40,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:23:40,970 INFO L87 Difference]: Start difference. First operand 347 states and 404 transitions. Second operand 3 states. [2021-10-11 00:23:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:41,047 INFO L93 Difference]: Finished difference Result 572 states and 666 transitions. [2021-10-11 00:23:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:23:41,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2021-10-11 00:23:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:41,050 INFO L225 Difference]: With dead ends: 572 [2021-10-11 00:23:41,050 INFO L226 Difference]: Without dead ends: 270 [2021-10-11 00:23:41,051 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 [2021-10-11 00:23:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-11 00:23:41,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-11 00:23:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2021-10-11 00:23:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 305 transitions. [2021-10-11 00:23:41,130 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 305 transitions. Word has length 81 [2021-10-11 00:23:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:41,130 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 305 transitions. [2021-10-11 00:23:41,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:23:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 305 transitions. [2021-10-11 00:23:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-11 00:23:41,132 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:41,132 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] [2021-10-11 00:23:41,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 00:23:41,132 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]=== [2021-10-11 00:23:41,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:41,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1965874040, now seen corresponding path program 1 times [2021-10-11 00:23:41,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:41,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71185859] [2021-10-11 00:23:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:41,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71185859] [2021-10-11 00:23:41,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:41,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:23:41,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378341201] [2021-10-11 00:23:41,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:23:41,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:41,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:23:41,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:23:41,508 INFO L87 Difference]: Start difference. First operand 270 states and 305 transitions. Second operand 4 states. [2021-10-11 00:23:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:41,650 INFO L93 Difference]: Finished difference Result 272 states and 306 transitions. [2021-10-11 00:23:41,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:23:41,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2021-10-11 00:23:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:41,653 INFO L225 Difference]: With dead ends: 272 [2021-10-11 00:23:41,653 INFO L226 Difference]: Without dead ends: 222 [2021-10-11 00:23:41,653 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 [2021-10-11 00:23:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-11 00:23:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2021-10-11 00:23:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2021-10-11 00:23:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2021-10-11 00:23:41,687 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 83 [2021-10-11 00:23:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:41,688 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2021-10-11 00:23:41,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:23:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2021-10-11 00:23:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-11 00:23:41,689 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:23:41,690 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] [2021-10-11 00:23:41,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-11 00:23:41,690 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]=== [2021-10-11 00:23:41,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:23:41,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2143833696, now seen corresponding path program 1 times [2021-10-11 00:23:41,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:23:41,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498419717] [2021-10-11 00:23:41,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:23:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:23:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:23:42,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498419717] [2021-10-11 00:23:42,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:23:42,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:23:42,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256570764] [2021-10-11 00:23:42,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:23:42,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:23:42,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:23:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:23:42,043 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 5 states. [2021-10-11 00:23:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:23:42,209 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2021-10-11 00:23:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:23:42,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2021-10-11 00:23:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:23:42,210 INFO L225 Difference]: With dead ends: 138 [2021-10-11 00:23:42,210 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 00:23:42,211 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 [2021-10-11 00:23:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 00:23:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 00:23:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 00:23:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 00:23:42,212 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2021-10-11 00:23:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:23:42,212 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:23:42,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:23:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:23:42,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 00:23:42,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-11 00:23:42,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 00:23:42,797 WARN L197 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 149 [2021-10-11 00:23:43,211 WARN L197 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 146 [2021-10-11 00:23:43,436 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 127 [2021-10-11 00:23:43,740 WARN L197 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2021-10-11 00:23:44,424 WARN L197 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 150 [2021-10-11 00:23:44,723 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 97 [2021-10-11 00:23:45,173 WARN L197 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 152 [2021-10-11 00:23:45,416 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 51 [2021-10-11 00:23:45,829 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 155 [2021-10-11 00:23:45,963 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 126 [2021-10-11 00:23:46,263 WARN L197 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 141 [2021-10-11 00:23:46,420 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2021-10-11 00:23:46,719 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 117 [2021-10-11 00:23:46,917 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 131 [2021-10-11 00:23:47,153 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 97 [2021-10-11 00:23:47,326 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 118 [2021-10-11 00:23:47,533 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 137 [2021-10-11 00:23:47,731 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 131 [2021-10-11 00:23:48,515 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2021-10-11 00:23:49,152 WARN L197 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 67 [2021-10-11 00:23:49,815 WARN L197 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2021-10-11 00:23:50,236 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 30 [2021-10-11 00:23:50,670 WARN L197 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2021-10-11 00:23:50,997 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2021-10-11 00:23:51,103 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2021-10-11 00:23:52,032 WARN L197 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 54 [2021-10-11 00:23:52,213 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2021-10-11 00:23:52,396 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 6 [2021-10-11 00:23:52,600 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2021-10-11 00:23:53,258 WARN L197 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 24 [2021-10-11 00:23:53,482 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2021-10-11 00:23:53,738 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 11 [2021-10-11 00:23:54,463 WARN L197 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 73 [2021-10-11 00:23:54,778 WARN L197 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 26 [2021-10-11 00:23:55,398 WARN L197 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 49 [2021-10-11 00:23:55,822 WARN L197 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2021-10-11 00:23:56,220 WARN L197 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 49 [2021-10-11 00:23:56,536 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 23 [2021-10-11 00:23:56,716 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 6 [2021-10-11 00:23:56,871 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 22 [2021-10-11 00:23:57,118 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 22 [2021-10-11 00:23:57,476 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 23 [2021-10-11 00:23:57,846 WARN L197 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 23 [2021-10-11 00:23:58,056 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2021-10-11 00:23:58,561 WARN L197 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 34 [2021-10-11 00:23:58,610 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)) [2021-10-11 00:23:58,610 INFO L262 CegarLoopResult]: For program point L4098-1(lines 4097 4116) no Hoare annotation was computed. [2021-10-11 00:23:58,610 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))) [2021-10-11 00:23:58,611 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,611 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)) [2021-10-11 00:23:58,611 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))))) [2021-10-11 00:23:58,611 INFO L262 CegarLoopResult]: For program point L4264(lines 4264 4266) no Hoare annotation was computed. [2021-10-11 00:23:58,611 INFO L262 CegarLoopResult]: For program point L4099-1(lines 4097 4116) no Hoare annotation was computed. [2021-10-11 00:23:58,612 INFO L262 CegarLoopResult]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2021-10-11 00:23:58,612 INFO L262 CegarLoopResult]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2021-10-11 00:23:58,612 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)) [2021-10-11 00:23:58,612 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)) [2021-10-11 00:23:58,613 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))))))) [2021-10-11 00:23:58,613 INFO L262 CegarLoopResult]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2021-10-11 00:23:58,613 INFO L262 CegarLoopResult]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2021-10-11 00:23:58,614 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))) [2021-10-11 00:23:58,614 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)) [2021-10-11 00:23:58,614 INFO L262 CegarLoopResult]: For program point L4203(line 4203) no Hoare annotation was computed. [2021-10-11 00:23:58,614 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)) [2021-10-11 00:23:58,614 INFO L262 CegarLoopResult]: For program point L4203-4(line 4203) no Hoare annotation was computed. [2021-10-11 00:23:58,614 INFO L262 CegarLoopResult]: For program point L4203-2(line 4203) no Hoare annotation was computed. [2021-10-11 00:23:58,615 INFO L262 CegarLoopResult]: For program point L4203-8(line 4203) no Hoare annotation was computed. [2021-10-11 00:23:58,615 INFO L262 CegarLoopResult]: For program point L4203-6(line 4203) no Hoare annotation was computed. [2021-10-11 00:23:58,615 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)) [2021-10-11 00:23:58,615 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)))) [2021-10-11 00:23:58,616 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)))) [2021-10-11 00:23:58,616 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)))) [2021-10-11 00:23:58,616 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))) [2021-10-11 00:23:58,616 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)))) [2021-10-11 00:23:58,616 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)) [2021-10-11 00:23:58,617 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)))) [2021-10-11 00:23:58,617 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)) [2021-10-11 00:23:58,617 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,617 INFO L262 CegarLoopResult]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2021-10-11 00:23:58,617 INFO L262 CegarLoopResult]: For program point L4106-2(lines 4106 4111) no Hoare annotation was computed. [2021-10-11 00:23:58,618 INFO L262 CegarLoopResult]: For program point L4073(line 4073) no Hoare annotation was computed. [2021-10-11 00:23:58,618 INFO L262 CegarLoopResult]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2021-10-11 00:23:58,618 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)) [2021-10-11 00:23:58,618 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))) [2021-10-11 00:23:58,618 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)))) [2021-10-11 00:23:58,619 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,619 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)))) [2021-10-11 00:23:58,619 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)))) [2021-10-11 00:23:58,619 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)))) [2021-10-11 00:23:58,620 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)) [2021-10-11 00:23:58,620 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)) [2021-10-11 00:23:58,620 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,620 INFO L258 CegarLoopResult]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-10-11 00:23:58,620 INFO L262 CegarLoopResult]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2021-10-11 00:23:58,620 INFO L262 CegarLoopResult]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2021-10-11 00:23:58,620 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,621 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)) [2021-10-11 00:23:58,621 INFO L262 CegarLoopResult]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2021-10-11 00:23:58,621 INFO L262 CegarLoopResult]: For program point L4046(lines 1 4266) no Hoare annotation was computed. [2021-10-11 00:23:58,621 INFO L262 CegarLoopResult]: For program point L4046-2(lines 1 4266) no Hoare annotation was computed. [2021-10-11 00:23:58,621 INFO L262 CegarLoopResult]: For program point L4046-1(lines 1 4266) no Hoare annotation was computed. [2021-10-11 00:23:58,621 INFO L262 CegarLoopResult]: For program point L4046-4(lines 4190 4195) no Hoare annotation was computed. [2021-10-11 00:23:58,621 INFO L262 CegarLoopResult]: For program point L4046-3(lines 1 4266) no Hoare annotation was computed. [2021-10-11 00:23:58,622 INFO L258 CegarLoopResult]: At program point L4046-5(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-10-11 00:23:58,622 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))) [2021-10-11 00:23:58,622 INFO L262 CegarLoopResult]: For program point L3981(line 3981) no Hoare annotation was computed. [2021-10-11 00:23:58,622 INFO L262 CegarLoopResult]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2021-10-11 00:23:58,629 INFO L262 CegarLoopResult]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2021-10-11 00:23:58,630 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)) [2021-10-11 00:23:58,630 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)) [2021-10-11 00:23:58,630 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)) [2021-10-11 00:23:58,630 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)) [2021-10-11 00:23:58,630 INFO L262 CegarLoopResult]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,630 INFO L262 CegarLoopResult]: For program point L4049(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,630 INFO L262 CegarLoopResult]: For program point L4049-3(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,630 INFO L262 CegarLoopResult]: For program point L4049-2(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,631 INFO L262 CegarLoopResult]: For program point L4049-5(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,631 INFO L262 CegarLoopResult]: For program point L4049-4(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,631 INFO L262 CegarLoopResult]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2021-10-11 00:23:58,631 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 00:23:58,631 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)) [2021-10-11 00:23:58,631 INFO L262 CegarLoopResult]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2021-10-11 00:23:58,631 INFO L262 CegarLoopResult]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2021-10-11 00:23:58,632 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))))) [2021-10-11 00:23:58,632 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))) [2021-10-11 00:23:58,632 INFO L262 CegarLoopResult]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2021-10-11 00:23:58,632 INFO L262 CegarLoopResult]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2021-10-11 00:23:58,632 INFO L262 CegarLoopResult]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2021-10-11 00:23:58,633 INFO L262 CegarLoopResult]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2021-10-11 00:23:58,633 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)) [2021-10-11 00:23:58,633 INFO L262 CegarLoopResult]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2021-10-11 00:23:58,633 INFO L262 CegarLoopResult]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2021-10-11 00:23:58,633 INFO L262 CegarLoopResult]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2021-10-11 00:23:58,633 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)))) [2021-10-11 00:23:58,633 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 00:23:58,633 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)) [2021-10-11 00:23:58,633 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))) [2021-10-11 00:23:58,634 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)) [2021-10-11 00:23:58,634 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))) [2021-10-11 00:23:58,634 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)) [2021-10-11 00:23:58,634 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)) [2021-10-11 00:23:58,634 INFO L262 CegarLoopResult]: For program point L4155-1(lines 4154 4173) no Hoare annotation was computed. [2021-10-11 00:23:58,634 INFO L262 CegarLoopResult]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2021-10-11 00:23:58,634 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))) [2021-10-11 00:23:58,634 INFO L262 CegarLoopResult]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2021-10-11 00:23:58,634 INFO L262 CegarLoopResult]: For program point L4156-1(lines 4154 4173) no Hoare annotation was computed. [2021-10-11 00:23:58,634 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)) [2021-10-11 00:23:58,635 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-11 00:23:58,635 INFO L265 CegarLoopResult]: At program point L4058(lines 4058 4059) the Hoare annotation is: true [2021-10-11 00:23:58,635 INFO L265 CegarLoopResult]: At program point L4058-2(lines 4058 4059) the Hoare annotation is: true [2021-10-11 00:23:58,635 INFO L265 CegarLoopResult]: At program point L4058-1(lines 4058 4059) the Hoare annotation is: true [2021-10-11 00:23:58,635 INFO L265 CegarLoopResult]: At program point L4058-3(lines 4058 4059) the Hoare annotation is: true [2021-10-11 00:23:58,635 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)) [2021-10-11 00:23:58,635 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)) [2021-10-11 00:23:58,635 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)) [2021-10-11 00:23:58,635 INFO L262 CegarLoopResult]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2021-10-11 00:23:58,635 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))))))) [2021-10-11 00:23:58,636 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))))))) [2021-10-11 00:23:58,636 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))) [2021-10-11 00:23:58,636 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)))) [2021-10-11 00:23:58,636 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)))) [2021-10-11 00:23:58,636 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)) [2021-10-11 00:23:58,636 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)) [2021-10-11 00:23:58,636 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-11 00:23:58,636 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)) [2021-10-11 00:23:58,636 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-10-11 00:23:58,637 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)) [2021-10-11 00:23:58,637 INFO L262 CegarLoopResult]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2021-10-11 00:23:58,637 INFO L262 CegarLoopResult]: For program point L4130(line 4130) no Hoare annotation was computed. [2021-10-11 00:23:58,637 INFO L262 CegarLoopResult]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2021-10-11 00:23:58,637 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))) [2021-10-11 00:23:58,637 INFO L262 CegarLoopResult]: For program point L4163-2(lines 4163 4168) no Hoare annotation was computed. [2021-10-11 00:23:58,637 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))))))) [2021-10-11 00:23:58,637 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)) [2021-10-11 00:23:58,637 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)) [2021-10-11 00:23:58,637 INFO L262 CegarLoopResult]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2021-10-11 00:23:58,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:23:58 BoogieIcfgContainer [2021-10-11 00:23:58,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:23:58,729 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:23:58,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:23:58,729 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:23:58,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:23:29" (3/4) ... [2021-10-11 00:23:58,733 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 00:23:58,759 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2021-10-11 00:23:58,761 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2021-10-11 00:23:58,763 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-10-11 00:23:58,765 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-11 00:23:58,767 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:23:58,797 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) [2021-10-11 00:23:58,797 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)) [2021-10-11 00:23:58,797 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)) [2021-10-11 00:23:58,798 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)) [2021-10-11 00:23:58,798 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 [2021-10-11 00:23:58,799 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 [2021-10-11 00:23:58,799 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 [2021-10-11 00:23:58,799 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 [2021-10-11 00:23:58,800 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 [2021-10-11 00:23:58,800 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) [2021-10-11 00:23:58,800 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 [2021-10-11 00:23:58,800 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) [2021-10-11 00:23:58,800 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 [2021-10-11 00:23:58,801 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) [2021-10-11 00:23:58,801 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 [2021-10-11 00:23:58,801 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) [2021-10-11 00:23:58,801 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 [2021-10-11 00:23:58,801 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) [2021-10-11 00:23:58,802 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) [2021-10-11 00:23:58,802 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) [2021-10-11 00:23:58,802 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) [2021-10-11 00:23:58,803 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) [2021-10-11 00:23:58,803 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) [2021-10-11 00:23:58,803 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) [2021-10-11 00:23:58,803 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) [2021-10-11 00:23:58,803 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) [2021-10-11 00:23:58,803 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 [2021-10-11 00:23:58,804 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) [2021-10-11 00:23:58,804 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) [2021-10-11 00:23:58,804 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)) [2021-10-11 00:23:58,804 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) [2021-10-11 00:23:58,804 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) [2021-10-11 00:23:58,805 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 [2021-10-11 00:23:58,805 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) [2021-10-11 00:23:58,805 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) [2021-10-11 00:23:58,805 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) [2021-10-11 00:23:58,806 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) [2021-10-11 00:23:58,806 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) [2021-10-11 00:23:58,806 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)) [2021-10-11 00:23:58,806 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 [2021-10-11 00:23:58,806 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 [2021-10-11 00:23:58,807 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 [2021-10-11 00:23:58,807 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 [2021-10-11 00:23:58,807 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 [2021-10-11 00:23:58,807 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 [2021-10-11 00:23:58,807 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 [2021-10-11 00:23:58,807 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 [2021-10-11 00:23:58,808 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 [2021-10-11 00:23:58,808 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 [2021-10-11 00:23:58,808 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 [2021-10-11 00:23:58,808 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 [2021-10-11 00:23:58,809 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 [2021-10-11 00:23:58,809 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 [2021-10-11 00:23:58,809 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 [2021-10-11 00:23:58,809 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 [2021-10-11 00:23:59,021 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3249ab9f-c92e-4fdb-b713-a23f1bcc33e2/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:23:59,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:23:59,023 INFO L168 Benchmark]: Toolchain (without parser) took 33132.09 ms. Allocated memory was 92.3 MB in the beginning and 587.2 MB in the end (delta: 494.9 MB). Free memory was 69.4 MB in the beginning and 330.8 MB in the end (delta: -261.4 MB). Peak memory consumption was 233.6 MB. Max. memory is 16.1 GB. [2021-10-11 00:23:59,023 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 92.3 MB. Free memory was 70.0 MB in the beginning and 69.9 MB in the end (delta: 51.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:23:59,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1367.87 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 69.2 MB in the beginning and 71.7 MB in the end (delta: -2.5 MB). Peak memory consumption was 43.9 MB. Max. memory is 16.1 GB. [2021-10-11 00:23:59,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 160.37 ms. Allocated memory is still 111.1 MB. Free memory was 71.7 MB in the beginning and 65.5 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-11 00:23:59,024 INFO L168 Benchmark]: Boogie Preprocessor took 109.11 ms. Allocated memory is still 111.1 MB. Free memory was 65.5 MB in the beginning and 59.8 MB in the end (delta: 5.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:23:59,025 INFO L168 Benchmark]: RCFGBuilder took 1962.33 ms. Allocated memory was 111.1 MB in the beginning and 159.4 MB in the end (delta: 48.2 MB). Free memory was 59.8 MB in the beginning and 67.6 MB in the end (delta: -7.8 MB). Peak memory consumption was 48.9 MB. Max. memory is 16.1 GB. [2021-10-11 00:23:59,025 INFO L168 Benchmark]: TraceAbstraction took 29232.12 ms. Allocated memory was 159.4 MB in the beginning and 587.2 MB in the end (delta: 427.8 MB). Free memory was 66.5 MB in the beginning and 394.2 MB in the end (delta: -327.7 MB). Peak memory consumption was 307.6 MB. Max. memory is 16.1 GB. [2021-10-11 00:23:59,026 INFO L168 Benchmark]: Witness Printer took 293.33 ms. Allocated memory is still 587.2 MB. Free memory was 393.2 MB in the beginning and 330.8 MB in the end (delta: 62.4 MB). Peak memory consumption was 62.9 MB. Max. memory is 16.1 GB. [2021-10-11 00:23:59,028 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.36 ms. Allocated memory is still 92.3 MB. Free memory was 70.0 MB in the beginning and 69.9 MB in the end (delta: 51.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1367.87 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 69.2 MB in the beginning and 71.7 MB in the end (delta: -2.5 MB). Peak memory consumption was 43.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 160.37 ms. Allocated memory is still 111.1 MB. Free memory was 71.7 MB in the beginning and 65.5 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 109.11 ms. Allocated memory is still 111.1 MB. Free memory was 65.5 MB in the beginning and 59.8 MB in the end (delta: 5.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1962.33 ms. Allocated memory was 111.1 MB in the beginning and 159.4 MB in the end (delta: 48.2 MB). Free memory was 59.8 MB in the beginning and 67.6 MB in the end (delta: -7.8 MB). Peak memory consumption was 48.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 29232.12 ms. Allocated memory was 159.4 MB in the beginning and 587.2 MB in the end (delta: 427.8 MB). Free memory was 66.5 MB in the beginning and 394.2 MB in the end (delta: -327.7 MB). Peak memory consumption was 307.6 MB. Max. memory is 16.1 GB. * Witness Printer took 293.33 ms. Allocated memory is still 587.2 MB. Free memory was 393.2 MB in the beginning and 330.8 MB in the end (delta: 62.4 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: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is 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, 131 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.6s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4273 SDtfs, 5417 SDslu, 7619 SDs, 0 SdLazy, 721 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=943occurred 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: 1.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 7542 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 222 NumberOfFragments, 3416 HoareAnnotationTreeSize, 68 FomulaSimplifications, 61795123 FormulaSimplificationTreeSizeReduction, 5.6s HoareSimplificationTime, 68 FomulaSimplificationsInter, 402356 FormulaSimplificationTreeSizeReductionInter, 10.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1242 NumberOfCodeBlocks, 1242 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1220 ConstructedInterpolants, 0 QuantifiedInterpolants, 170506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1146 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...