./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5446a6bcb7b41f40bef72cbbdd61d96122ada54f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5446a6bcb7b41f40bef72cbbdd61d96122ada54f ............................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort BitVec not declared --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-02 05:22:47,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 05:22:47,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 05:22:47,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 05:22:47,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 05:22:47,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 05:22:47,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 05:22:47,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 05:22:47,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 05:22:47,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 05:22:47,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 05:22:47,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 05:22:47,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 05:22:47,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 05:22:47,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 05:22:47,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 05:22:47,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 05:22:47,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 05:22:47,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 05:22:47,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 05:22:47,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 05:22:47,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 05:22:47,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 05:22:47,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 05:22:47,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 05:22:47,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 05:22:47,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 05:22:47,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 05:22:47,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 05:22:47,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 05:22:47,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 05:22:47,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 05:22:47,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 05:22:47,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 05:22:47,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 05:22:47,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 05:22:47,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 05:22:47,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 05:22:47,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 05:22:47,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 05:22:47,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 05:22:47,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf [2019-12-02 05:22:47,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 05:22:47,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 05:22:47,436 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 05:22:47,436 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 05:22:47,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 05:22:47,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 05:22:47,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 05:22:47,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 05:22:47,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 05:22:47,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 05:22:47,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 05:22:47,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 05:22:47,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 05:22:47,437 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 05:22:47,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 05:22:47,438 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 05:22:47,438 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 05:22:47,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 05:22:47,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 05:22:47,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 05:22:47,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 05:22:47,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 05:22:47,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 05:22:47,438 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 05:22:47,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 05:22:47,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 05:22:47,439 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-02 05:22:47,439 INFO L138 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> 5446a6bcb7b41f40bef72cbbdd61d96122ada54f [2019-12-02 05:22:47,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 05:22:47,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 05:22:47,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 05:22:47,548 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 05:22:47,548 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 05:22:47,548 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-12-02 05:22:47,586 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/data/d5c19af4f/16da72f5ff394d36ad25316a3413e0f5/FLAGfced0aa8b [2019-12-02 05:22:48,061 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 05:22:48,061 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-12-02 05:22:48,081 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/data/d5c19af4f/16da72f5ff394d36ad25316a3413e0f5/FLAGfced0aa8b [2019-12-02 05:22:48,090 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/data/d5c19af4f/16da72f5ff394d36ad25316a3413e0f5 [2019-12-02 05:22:48,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 05:22:48,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 05:22:48,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 05:22:48,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 05:22:48,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 05:22:48,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:22:48" (1/1) ... [2019-12-02 05:22:48,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60529c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:48, skipping insertion in model container [2019-12-02 05:22:48,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:22:48" (1/1) ... [2019-12-02 05:22:48,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 05:22:48,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 05:22:48,908 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-02 05:22:48,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 05:22:48,938 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 05:22:49,100 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-02 05:22:49,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 05:22:49,311 INFO L208 MainTranslator]: Completed translation [2019-12-02 05:22:49,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:49 WrapperNode [2019-12-02 05:22:49,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 05:22:49,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 05:22:49,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 05:22:49,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 05:22:49,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:49" (1/1) ... [2019-12-02 05:22:49,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:49" (1/1) ... [2019-12-02 05:22:49,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 05:22:49,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 05:22:49,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 05:22:49,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 05:22:49,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:49" (1/1) ... [2019-12-02 05:22:49,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:49" (1/1) ... [2019-12-02 05:22:49,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:49" (1/1) ... [2019-12-02 05:22:49,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:49" (1/1) ... [2019-12-02 05:22:49,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:49" (1/1) ... [2019-12-02 05:22:49,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:49" (1/1) ... [2019-12-02 05:22:49,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:49" (1/1) ... [2019-12-02 05:22:49,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 05:22:49,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 05:22:49,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 05:22:49,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 05:22:49,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:22:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2019-12-02 05:22:49,604 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2019-12-02 05:22:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2019-12-02 05:22:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2019-12-02 05:22:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2019-12-02 05:22:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-12-02 05:22:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-12-02 05:22:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-12-02 05:22:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-02 05:22:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-02 05:22:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-02 05:22:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2019-12-02 05:22:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2019-12-02 05:22:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2019-12-02 05:22:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2019-12-02 05:22:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-12-02 05:22:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-12-02 05:22:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-02 05:22:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2019-12-02 05:22:49,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2019-12-02 05:22:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2019-12-02 05:22:49,607 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2019-12-02 05:22:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-02 05:22:49,607 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-12-02 05:22:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2019-12-02 05:22:49,607 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2019-12-02 05:22:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-02 05:22:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2019-12-02 05:22:49,607 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2019-12-02 05:22:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-12-02 05:22:49,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-12-02 05:22:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-12-02 05:22:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-12-02 05:22:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2019-12-02 05:22:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2019-12-02 05:22:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2019-12-02 05:22:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2019-12-02 05:22:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2019-12-02 05:22:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2019-12-02 05:22:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2019-12-02 05:22:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2019-12-02 05:22:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-02 05:22:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-02 05:22:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2019-12-02 05:22:49,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2019-12-02 05:22:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-12-02 05:22:49,609 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-12-02 05:22:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-12-02 05:22:49,609 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-12-02 05:22:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-02 05:22:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2019-12-02 05:22:49,609 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2019-12-02 05:22:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-12-02 05:22:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-12-02 05:22:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2019-12-02 05:22:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2019-12-02 05:22:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-12-02 05:22:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-12-02 05:22:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-02 05:22:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-02 05:22:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-12-02 05:22:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-12-02 05:22:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2019-12-02 05:22:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2019-12-02 05:22:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-12-02 05:22:49,629 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-12-02 05:22:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2019-12-02 05:22:49,629 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2019-12-02 05:22:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-12-02 05:22:49,629 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-12-02 05:22:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2019-12-02 05:22:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2019-12-02 05:22:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-12-02 05:22:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-12-02 05:22:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2019-12-02 05:22:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2019-12-02 05:22:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-02 05:22:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2019-12-02 05:22:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2019-12-02 05:22:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-12-02 05:22:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-12-02 05:22:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-12-02 05:22:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 05:22:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 05:22:49,989 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-12-02 05:22:50,148 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-02 05:23:16,677 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2019-12-02 05:23:16,677 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2019-12-02 05:23:18,221 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 05:23:18,221 INFO L287 CfgBuilder]: Removed 100 assume(true) statements. [2019-12-02 05:23:18,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:23:18 BoogieIcfgContainer [2019-12-02 05:23:18,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 05:23:18,222 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 05:23:18,223 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 05:23:18,229 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 05:23:18,229 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:23:18" (1/1) ... [2019-12-02 05:23:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 05:23:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 317 states and 443 transitions. [2019-12-02 05:23:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 443 transitions. [2019-12-02 05:23:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-02 05:23:18,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 317 states and 439 transitions. [2019-12-02 05:23:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 439 transitions. [2019-12-02 05:23:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-02 05:23:18,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 319 states and 441 transitions. [2019-12-02 05:23:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 441 transitions. [2019-12-02 05:23:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-02 05:23:19,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 319 states and 440 transitions. [2019-12-02 05:23:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 440 transitions. [2019-12-02 05:23:19,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-02 05:23:19,100 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 324 states and 461 transitions. [2019-12-02 05:23:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 461 transitions. [2019-12-02 05:23:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-02 05:23:19,172 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 329 states and 482 transitions. [2019-12-02 05:23:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 482 transitions. [2019-12-02 05:23:19,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-02 05:23:19,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 334 states and 501 transitions. [2019-12-02 05:23:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 501 transitions. [2019-12-02 05:23:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-02 05:23:19,391 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 338 states and 508 transitions. [2019-12-02 05:23:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 508 transitions. [2019-12-02 05:23:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-02 05:23:19,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 339 states and 508 transitions. [2019-12-02 05:23:19,530 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 508 transitions. [2019-12-02 05:23:19,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-02 05:23:19,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 343 states and 515 transitions. [2019-12-02 05:23:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 515 transitions. [2019-12-02 05:23:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-02 05:23:19,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 347 states and 526 transitions. [2019-12-02 05:23:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 526 transitions. [2019-12-02 05:23:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-02 05:23:19,871 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 353 states and 538 transitions. [2019-12-02 05:23:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 538 transitions. [2019-12-02 05:23:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-02 05:23:19,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 356 states and 544 transitions. [2019-12-02 05:23:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 544 transitions. [2019-12-02 05:23:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-02 05:23:20,035 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 361 states and 552 transitions. [2019-12-02 05:23:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 552 transitions. [2019-12-02 05:23:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-02 05:23:20,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 362 states and 553 transitions. [2019-12-02 05:23:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 553 transitions. [2019-12-02 05:23:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-02 05:23:20,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 365 states and 559 transitions. [2019-12-02 05:23:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 559 transitions. [2019-12-02 05:23:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-02 05:23:20,263 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 370 states and 567 transitions. [2019-12-02 05:23:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 567 transitions. [2019-12-02 05:23:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-02 05:23:20,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 371 states and 568 transitions. [2019-12-02 05:23:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 568 transitions. [2019-12-02 05:23:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-02 05:23:20,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 05:23:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 373 states and 571 transitions. [2019-12-02 05:23:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 571 transitions. [2019-12-02 05:23:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-02 05:23:20,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 377 states and 580 transitions. [2019-12-02 05:23:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 580 transitions. [2019-12-02 05:23:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-02 05:23:20,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 381 states and 589 transitions. [2019-12-02 05:23:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 589 transitions. [2019-12-02 05:23:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-02 05:23:20,631 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 382 states and 589 transitions. [2019-12-02 05:23:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 589 transitions. [2019-12-02 05:23:20,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-02 05:23:20,675 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 384 states and 592 transitions. [2019-12-02 05:23:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 592 transitions. [2019-12-02 05:23:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-02 05:23:20,729 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 05:23:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 387 states and 597 transitions. [2019-12-02 05:23:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 597 transitions. [2019-12-02 05:23:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-02 05:23:20,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 05:23:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 388 states and 597 transitions. [2019-12-02 05:23:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 597 transitions. [2019-12-02 05:23:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-02 05:23:20,814 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 05:23:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 392 states and 606 transitions. [2019-12-02 05:23:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 606 transitions. [2019-12-02 05:23:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-02 05:23:20,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 396 states and 614 transitions. [2019-12-02 05:23:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 614 transitions. [2019-12-02 05:23:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-02 05:23:20,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 399 states and 619 transitions. [2019-12-02 05:23:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 619 transitions. [2019-12-02 05:23:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 05:23:21,290 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 399 states and 616 transitions. [2019-12-02 05:23:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 616 transitions. [2019-12-02 05:23:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 05:23:21,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 408 states and 631 transitions. [2019-12-02 05:23:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 631 transitions. [2019-12-02 05:23:21,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-02 05:23:21,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 409 states and 632 transitions. [2019-12-02 05:23:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 632 transitions. [2019-12-02 05:23:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-02 05:23:21,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 418 states and 647 transitions. [2019-12-02 05:23:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 647 transitions. [2019-12-02 05:23:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-02 05:23:21,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 419 states and 648 transitions. [2019-12-02 05:23:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 648 transitions. [2019-12-02 05:23:21,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-02 05:23:21,583 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 424 states and 657 transitions. [2019-12-02 05:23:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 657 transitions. [2019-12-02 05:23:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-02 05:23:22,352 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 429 states and 666 transitions. [2019-12-02 05:23:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 666 transitions. [2019-12-02 05:23:22,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-02 05:23:22,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-02 05:23:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 440 states and 691 transitions. [2019-12-02 05:23:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 691 transitions. [2019-12-02 05:23:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-02 05:23:24,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 05:23:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 445 states and 701 transitions. [2019-12-02 05:23:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 701 transitions. [2019-12-02 05:23:24,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-02 05:23:24,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-02 05:23:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 448 states and 711 transitions. [2019-12-02 05:23:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 711 transitions. [2019-12-02 05:23:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-02 05:23:24,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:25,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 448 states and 710 transitions. [2019-12-02 05:23:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-12-02 05:23:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-02 05:23:25,045 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-02 05:23:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 451 states and 720 transitions. [2019-12-02 05:23:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 720 transitions. [2019-12-02 05:23:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-02 05:23:25,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 05:23:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 453 states and 722 transitions. [2019-12-02 05:23:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 722 transitions. [2019-12-02 05:23:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-02 05:23:25,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-02 05:23:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 458 states and 732 transitions. [2019-12-02 05:23:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 732 transitions. [2019-12-02 05:23:25,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-02 05:23:25,960 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 458 states and 731 transitions. [2019-12-02 05:23:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 731 transitions. [2019-12-02 05:23:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-02 05:23:26,008 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 460 states and 734 transitions. [2019-12-02 05:23:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 734 transitions. [2019-12-02 05:23:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-02 05:23:26,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 05:23:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 462 states and 736 transitions. [2019-12-02 05:23:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 736 transitions. [2019-12-02 05:23:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-02 05:23:26,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 464 states and 739 transitions. [2019-12-02 05:23:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 739 transitions. [2019-12-02 05:23:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-02 05:23:26,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 05:23:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 477 states and 766 transitions. [2019-12-02 05:23:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 766 transitions. [2019-12-02 05:23:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-02 05:23:26,709 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 477 states and 764 transitions. [2019-12-02 05:23:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 764 transitions. [2019-12-02 05:23:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-02 05:23:26,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 05:23:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 478 states and 765 transitions. [2019-12-02 05:23:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 765 transitions. [2019-12-02 05:23:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-02 05:23:26,810 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 05:23:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 479 states and 765 transitions. [2019-12-02 05:23:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 765 transitions. [2019-12-02 05:23:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-02 05:23:26,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 481 states and 768 transitions. [2019-12-02 05:23:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 768 transitions. [2019-12-02 05:23:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-02 05:23:27,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 483 states and 771 transitions. [2019-12-02 05:23:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 771 transitions. [2019-12-02 05:23:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-02 05:23:27,382 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 500 states and 804 transitions. [2019-12-02 05:23:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 804 transitions. [2019-12-02 05:23:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-02 05:23:29,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-02 05:23:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 502 states and 807 transitions. [2019-12-02 05:23:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 807 transitions. [2019-12-02 05:23:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-02 05:23:29,548 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 504 states and 809 transitions. [2019-12-02 05:23:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 809 transitions. [2019-12-02 05:23:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-02 05:23:29,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-02 05:23:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 506 states and 812 transitions. [2019-12-02 05:23:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 812 transitions. [2019-12-02 05:23:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-02 05:23:29,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 506 states and 811 transitions. [2019-12-02 05:23:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 811 transitions. [2019-12-02 05:23:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-02 05:23:30,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 509 states and 818 transitions. [2019-12-02 05:23:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 818 transitions. [2019-12-02 05:23:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-02 05:23:30,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 510 states and 820 transitions. [2019-12-02 05:23:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 820 transitions. [2019-12-02 05:23:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-02 05:23:30,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 510 states and 819 transitions. [2019-12-02 05:23:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 819 transitions. [2019-12-02 05:23:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-02 05:23:31,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 513 states and 822 transitions. [2019-12-02 05:23:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 822 transitions. [2019-12-02 05:23:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-02 05:23:31,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-02 05:23:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 515 states and 823 transitions. [2019-12-02 05:23:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 823 transitions. [2019-12-02 05:23:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-02 05:23:32,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 517 states and 825 transitions. [2019-12-02 05:23:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 825 transitions. [2019-12-02 05:23:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-02 05:23:32,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-02 05:23:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 526 states and 840 transitions. [2019-12-02 05:23:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 840 transitions. [2019-12-02 05:23:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-02 05:23:33,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 05:23:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 532 states and 857 transitions. [2019-12-02 05:23:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 857 transitions. [2019-12-02 05:23:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-02 05:23:34,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 05:23:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 535 states and 863 transitions. [2019-12-02 05:23:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 863 transitions. [2019-12-02 05:23:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-02 05:23:34,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 05:23:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 540 states and 876 transitions. [2019-12-02 05:23:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 876 transitions. [2019-12-02 05:23:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-02 05:23:34,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 541 states and 878 transitions. [2019-12-02 05:23:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 878 transitions. [2019-12-02 05:23:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-02 05:23:35,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 05:23:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 549 states and 902 transitions. [2019-12-02 05:23:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 902 transitions. [2019-12-02 05:23:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-02 05:23:39,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 552 states and 908 transitions. [2019-12-02 05:23:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 908 transitions. [2019-12-02 05:23:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-02 05:23:40,666 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 554 states and 910 transitions. [2019-12-02 05:23:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 910 transitions. [2019-12-02 05:23:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-02 05:23:41,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 555 states and 911 transitions. [2019-12-02 05:23:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 911 transitions. [2019-12-02 05:23:41,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-02 05:23:41,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-02 05:23:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 558 states and 916 transitions. [2019-12-02 05:23:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 916 transitions. [2019-12-02 05:23:46,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-02 05:23:46,787 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-02 05:23:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 560 states and 917 transitions. [2019-12-02 05:23:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 917 transitions. [2019-12-02 05:23:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-02 05:23:47,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:23:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 561 states and 918 transitions. [2019-12-02 05:23:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 918 transitions. [2019-12-02 05:23:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-02 05:23:47,945 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 563 states and 920 transitions. [2019-12-02 05:23:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 920 transitions. [2019-12-02 05:23:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-02 05:23:48,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 05:23:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 564 states and 922 transitions. [2019-12-02 05:23:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 922 transitions. [2019-12-02 05:23:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-02 05:23:49,200 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 567 states and 928 transitions. [2019-12-02 05:23:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 928 transitions. [2019-12-02 05:23:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-02 05:23:50,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 05:23:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 568 states and 930 transitions. [2019-12-02 05:23:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 930 transitions. [2019-12-02 05:23:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-02 05:23:51,532 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-02 05:23:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 570 states and 931 transitions. [2019-12-02 05:23:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 931 transitions. [2019-12-02 05:23:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-02 05:23:52,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 572 states and 933 transitions. [2019-12-02 05:23:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 933 transitions. [2019-12-02 05:23:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-02 05:23:52,741 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-02 05:23:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 573 states and 935 transitions. [2019-12-02 05:23:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 935 transitions. [2019-12-02 05:23:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-02 05:23:54,328 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 573 states and 934 transitions. [2019-12-02 05:23:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 934 transitions. [2019-12-02 05:23:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-02 05:23:55,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-02 05:23:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 574 states and 935 transitions. [2019-12-02 05:23:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 935 transitions. [2019-12-02 05:23:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-02 05:23:57,477 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 577 states and 941 transitions. [2019-12-02 05:23:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 941 transitions. [2019-12-02 05:23:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-02 05:23:58,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:23:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:23:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 579 states and 943 transitions. [2019-12-02 05:23:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 943 transitions. [2019-12-02 05:23:59,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-02 05:23:59,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:23:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:24:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 05:24:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:24:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 580 states and 944 transitions. [2019-12-02 05:24:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 944 transitions. [2019-12-02 05:24:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-02 05:24:02,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:24:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:24:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 05:24:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:24:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 598 states and 984 transitions. [2019-12-02 05:24:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 984 transitions. [2019-12-02 05:24:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-02 05:24:03,127 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:24:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 05:24:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 05:24:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 05:24:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 05:24:04,914 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 88 iterations. [2019-12-02 05:24:05,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 05:24:05 ImpRootNode [2019-12-02 05:24:05,055 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-02 05:24:05,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-02 05:24:05,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-02 05:24:05,056 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-02 05:24:05,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:23:18" (3/4) ... [2019-12-02 05:24:05,059 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-02 05:24:05,059 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-02 05:24:05,061 INFO L168 Benchmark]: Toolchain (without parser) took 76967.51 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 931.7 MB in the beginning and 806.3 MB in the end (delta: 125.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-02 05:24:05,062 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 05:24:05,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1218.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 931.7 MB in the beginning and 882.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 177.1 MB. Max. memory is 11.5 GB. [2019-12-02 05:24:05,063 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.22 ms. Allocated memory is still 1.1 GB. Free memory was 882.3 MB in the beginning and 871.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-02 05:24:05,063 INFO L168 Benchmark]: Boogie Preprocessor took 108.18 ms. Allocated memory is still 1.1 GB. Free memory was 871.5 MB in the beginning and 860.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-02 05:24:05,064 INFO L168 Benchmark]: RCFGBuilder took 28670.07 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 860.8 MB in the beginning and 790.5 MB in the end (delta: 70.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-02 05:24:05,065 INFO L168 Benchmark]: CodeCheck took 46832.77 ms. Allocated memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: -159.9 MB). Free memory was 790.5 MB in the beginning and 806.3 MB in the end (delta: -15.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 05:24:05,065 INFO L168 Benchmark]: Witness Printer took 3.94 ms. Allocated memory is still 2.5 GB. Free memory is still 806.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 05:24:05,068 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 35 procedures, 318 locations, 1 error locations. Result: UNSAFE, OverallTime: 46.6s, OverallIterations: 88, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -1730150046 SDtfs, 169736334 SDslu, 888581298 SDs, 0 SdLazy, 1867363086 SolverSat, 835996778 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42057 GetRequests, 41528 SyntacticMatches, 155 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59040 ImplicationChecksByTransitivity, 36.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 4249 NumberOfCodeBlocks, 4249 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 4092 ConstructedInterpolants, 0 QuantifiedInterpolants, 397650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 87 InterpolantComputations, 68 PerfectInterpolantSequences, 417/657 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 6743]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of large string literal at line 5132, overapproximation of bitwiseAnd at line 6092. Possible FailurePath: [L5138] static struct lock_class_key __key___7 ; [L5139] static struct lock_class_key __key___8 ; [L5279-L5292] static char const __mod_author31[46] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'S', (char const )'e', (char const )'b', (char const )'a', (char const )'s', (char const )'t', (char const )'i', (char const )'a', (char const )'n', (char const )' ', (char const )'H', (char const )'a', (char const )'a', (char const )'s', (char const )' ', (char const )'<', (char const )'h', (char const )'a', (char const )'a', (char const )'s', (char const )'@', (char const )'e', (char const )'m', (char const )'s', (char const )'-', (char const )'w', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )'.', (char const )'c', (char const )'o', (char const )'m', (char const )'>', (char const )'\000'}; [L5293-L5312] static char const __mod_description32[70] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'N', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )' ', (char const )'f', (char const )'o', (char const )'r', (char const )' ', (char const )'E', (char const )'M', (char const )'S', (char const )' ', (char const )'D', (char const )'r', (char const )'.', (char const )' ', (char const )'T', (char const )'h', (char const )'o', (char const )'m', (char const )'a', (char const )'s', (char const )' ', (char const )'W', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )' ', (char const )'C', (char const )'A', (char const )'N', (char const )'/', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'i', (char const )'n', (char const )'t', (char const )'e', (char const )'r', (char const )'f', (char const )'a', (char const )'c', (char const )'e', (char const )'s', (char const )'\000'}; [L5313-L5318] static char const __mod_license33[15] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )' ', (char const )'v', (char const )'2', (char const )'\000'}; [L5319-L5321] static struct usb_device_id ems_usb_table[1] = { {(__u16 )3, (__u16 )4822, (__u16 )1092, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6236-L6276] static struct net_device_ops const ems_usb_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & ems_usb_open, & ems_usb_close, & ems_usb_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , void *addr ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, (int (*)(struct net_device *dev , int new_mtu ))0, (int (*)(struct net_device *dev , struct neigh_parms * ))0, (void (*)(struct net_device *dev ))0, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6277-L6281] static struct can_bittiming_const ems_usb_bittiming_const = {{(char )'e', (char )'m', (char )'s', (char )'_', (char )'u', (char )'s', (char )'b', (char )'\000', (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}, (__u32 )1, (__u32 )16, (__u32 )1, (__u32 )8, (__u32 )4, (__u32 )1, (__u32 )64, (__u32 )1}; [L6532-L6550] static struct usb_driver ems_usb_driver = {"ems_usb", & ems_usb_probe, & ems_usb_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(ems_usb_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6603] int LDV_IN_INTERRUPT ; [L6604] static int res_ems_usb_open_10 ; [L6605] static int res_ems_usb_close_12 ; [L6606] static int res_ems_usb_probe_16 ; [L6756] int ldv_urb_state = 0; [L6757] int ldv_coherent_state = 0; [L6608] struct net_device *var_group1 ; [L6609] struct sk_buff *var_group2 ; [L6610] struct usb_interface *var_group3 ; [L6611] struct usb_device_id const *var_ems_usb_probe_16_p1 ; [L6612] int tmp___7 ; [L6613] int ldv_s_ems_usb_netdev_ops_net_device_ops ; [L6614] int ldv_s_ems_usb_driver_usb_driver ; [L6615] int tmp___8 ; [L6616] int tmp___9 ; [L6619] LDV_IN_INTERRUPT = 1 VAL [__key___7={54598:0}, __key___8={19357:0}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6621] CALL, EXPR ems_usb_init() VAL [__key___7={54598:0}, __key___8={19357:0}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6554] int err ; [L5129] int tmp___7 ; [L5132] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L7007] return __VERIFIER_nondet_int(); [L5132] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb") [L5134] return (tmp___7); [L6558] err = usb_register(& ems_usb_driver) [L6560] COND FALSE !(\read(err)) [L6567] return (0); [L6621] RET, EXPR ems_usb_init() VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6621] tmp___7 = ems_usb_init() [L6623] COND FALSE !(\read(tmp___7)) [L6627] ldv_s_ems_usb_netdev_ops_net_device_ops = 0 [L6628] ldv_s_ems_usb_driver_usb_driver = 0 VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6630] COND TRUE 1 [L6633] tmp___9 = __VERIFIER_nondet_int() [L6635] COND TRUE \read(tmp___9) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6644] tmp___8 = __VERIFIER_nondet_int() [L6646] COND FALSE !(tmp___8 == 0) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6649] COND FALSE !(tmp___8 == 1) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6652] COND TRUE tmp___8 == 2 [L6037] struct ems_usb *dev ; [L6038] void *tmp___7 ; [L6039] struct ems_tx_urb_context *context ; [L6040] struct net_device_stats *stats ; [L6041] struct can_frame *cf ; [L6042] struct ems_cpc_msg *msg ; [L6043] struct urb *urb ; [L6044] u8 *buf ; [L6045] int i ; [L6046] int err ; [L6047] size_t size ; [L6048] int tmp___8 ; [L6049] void *tmp___9 ; [L6050] unsigned int tmp___10 ; [L6051] int tmp___11 ; [L6052] long tmp___12 ; VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6055] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, dev={0:-522}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L4965] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); [L6055] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6055] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6056] dev = (struct ems_usb *)tmp___7 [L6057] context = (struct ems_tx_urb_context *)((void *)0) [L6058] stats = & netdev->stats [L6059] EXPR skb->data [L6059] cf = (struct can_frame *)skb->data [L6060] size = 15UL + sizeof(struct cpc_can_msg ) [L5241] struct can_frame const *cf ; [L5242] int tmp___7 ; [L5243] long tmp___8 ; [L5245] EXPR skb->data [L5245] cf = (struct can_frame const *)((struct can_frame *)skb->data) [L5246] EXPR skb->len [L5246] COND FALSE !((unsigned long )skb->len != sizeof(*cf)) [L5249] EXPR cf->can_dlc [L5249] COND FALSE !((int const )cf->can_dlc > 8) [L5252] tmp___7 = 0 [L5255] tmp___8 = __builtin_expect((long )tmp___7, 0L) [L5257] COND FALSE !(\read(tmp___8)) [L5265] return (0); [L6061] tmp___8 = can_dropped_invalid_skb(netdev, skb) [L6063] COND FALSE !(\read(tmp___8)) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6068] CALL, EXPR usb_alloc_urb(0, 32U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6819] void *arbitrary_memory ; [L6820] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6823] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6826] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=0, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6964] return ldv_malloc(0UL); [L6826] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={0:-95}, ldv_urb_state=0, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6826] tmp___7 = ldv_undefined_pointer() [L6827] arbitrary_memory = tmp___7 [L6829] COND FALSE !(! arbitrary_memory) [L6833] ldv_urb_state = ldv_urb_state + 1 [L6834] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, \result={0:-95}, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, arbitrary_memory={0:-95}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, tmp___7={0:-95}] [L6068] RET, EXPR usb_alloc_urb(0, 32U) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6068] urb = usb_alloc_urb(0, 32U) [L6070] COND FALSE !(! urb) [L6078] EXPR dev->udev VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6078] CALL, EXPR usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, dev={182:185}, dma={0:9}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6762] void *arbitrary_memory ; [L6763] void *tmp___7 ; VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, dev={182:185}, dev={182:185}, dma={0:9}, dma={0:9}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6766] COND TRUE 1 VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, dev={182:185}, dev={182:185}, dma={0:9}, dma={0:9}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6769] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_coherent_state)=0, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6964] return ldv_malloc(0UL); [L6769] RET, EXPR ldv_undefined_pointer() VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, dev={182:185}, dev={182:185}, dma={0:9}, dma={0:9}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={0:-5}, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6769] tmp___7 = ldv_undefined_pointer() [L6770] arbitrary_memory = tmp___7 [L6772] COND FALSE !(! arbitrary_memory) [L6776] ldv_coherent_state = ldv_coherent_state + 1 [L6777] return (arbitrary_memory); VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, \result={0:-5}, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, arbitrary_memory={0:-5}, dev={182:185}, dev={182:185}, dma={0:9}, dma={0:9}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, tmp___7={0:-5}] [L6078] RET, EXPR usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6078] tmp___9 = usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) [L6079] buf = (u8 *)tmp___9 VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6081] COND FALSE !(! buf) [L6089] msg = (struct ems_cpc_msg *)(buf + 4) [L6090] EXPR cf->can_id [L6090] msg->msg.can_msg.id = cf->can_id & 536870911U [L6091] EXPR cf->can_dlc [L6091] msg->msg.can_msg.length = cf->can_dlc [L6092] EXPR cf->can_id VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6092] COND TRUE cf->can_id & 1073741824U [L6093] EXPR cf->can_id [L6093] COND TRUE cf->can_id & 2147483648U [L6094] msg->type = (u8 )16 [L6098] msg->length = (u8 )5 VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6121] EXPR msg->msg.can_msg.id [L6121] msg->msg.can_msg.id = msg->msg.can_msg.id [L6122] i = 0 VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6124] COND TRUE 1 VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6126] COND TRUE i < 10 [L6130] EXPR dev->tx_contexts[i].echo_index VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6130] COND TRUE dev->tx_contexts[i].echo_index == 10U [L6131] context = & dev->tx_contexts[i] VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6140] COND TRUE ! context VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6142] FCALL usb_unanchor_urb(urb) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6143] EXPR dev->udev [L6143] EXPR urb->transfer_dma VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6143] CALL usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma) VAL [\old(dma)=183, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, addr={0:-5}, dev={182:185}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6791] COND TRUE 1 VAL [\old(dma)=183, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, addr={0:-5}, addr={0:-5}, dev={182:185}, dev={182:185}, dma=183, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6793] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0))) VAL [\old(dma)=183, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, addr={0:-5}, addr={0:-5}, dev={182:185}, dev={182:185}, dma=183, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6799] COND TRUE \read(*addr) VAL [\old(dma)=183, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, addr={0:-5}, addr={0:-5}, dev={182:185}, dev={182:185}, dma=183, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6800] COND TRUE ldv_coherent_state >= 1 VAL [\old(dma)=183, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, addr={0:-5}, addr={0:-5}, dev={182:185}, dev={182:185}, dma=183, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6806] ldv_coherent_state = ldv_coherent_state - 1 VAL [\old(dma)=183, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, addr={0:-5}, addr={0:-5}, dev={182:185}, dev={182:185}, dma=183, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28] [L6143] RET usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6144] netdev->dev.parent [L6146] return ((netdev_tx_t )16); VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6630] COND TRUE 1 [L6633] tmp___9 = __VERIFIER_nondet_int() [L6635] COND FALSE !(\read(tmp___9)) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6637] COND FALSE !(! (ldv_s_ems_usb_netdev_ops_net_device_ops == 0)) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6639] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6731] FCALL ems_usb_exit() VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6878] COND FALSE !(ldv_urb_state == 0) VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6881] CALL ldv_blast_assert() VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6743] __VERIFIER_error() VAL [__key___7={54598:0}, __key___8={19357:0}, __this_module={153:154}, ems_usb_bittiming_const={19355:0}, ems_usb_driver={21526:0}, ems_usb_netdev_ops={30994:0}, ems_usb_table={30999:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1218.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 931.7 MB in the beginning and 882.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 177.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.22 ms. Allocated memory is still 1.1 GB. Free memory was 882.3 MB in the beginning and 871.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 108.18 ms. Allocated memory is still 1.1 GB. Free memory was 871.5 MB in the beginning and 860.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 28670.07 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 860.8 MB in the beginning and 790.5 MB in the end (delta: 70.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * CodeCheck took 46832.77 ms. Allocated memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: -159.9 MB). Free memory was 790.5 MB in the beginning and 806.3 MB in the end (delta: -15.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.94 ms. Allocated memory is still 2.5 GB. Free memory is still 806.3 MB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-02 05:24:06,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 05:24:06,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 05:24:06,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 05:24:06,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 05:24:06,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 05:24:06,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 05:24:06,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 05:24:06,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 05:24:06,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 05:24:06,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 05:24:06,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 05:24:06,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 05:24:06,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 05:24:06,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 05:24:06,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 05:24:06,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 05:24:06,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 05:24:06,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 05:24:06,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 05:24:06,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 05:24:06,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 05:24:06,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 05:24:06,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 05:24:06,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 05:24:06,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 05:24:06,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 05:24:06,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 05:24:06,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 05:24:06,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 05:24:06,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 05:24:06,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 05:24:06,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 05:24:06,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 05:24:06,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 05:24:06,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 05:24:06,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 05:24:06,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 05:24:06,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 05:24:06,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 05:24:06,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 05:24:06,487 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf [2019-12-02 05:24:06,497 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 05:24:06,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 05:24:06,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 05:24:06,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 05:24:06,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 05:24:06,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 05:24:06,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 05:24:06,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 05:24:06,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 05:24:06,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 05:24:06,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 05:24:06,500 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-02 05:24:06,500 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-02 05:24:06,500 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-02 05:24:06,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 05:24:06,500 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 05:24:06,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 05:24:06,500 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 05:24:06,501 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 05:24:06,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 05:24:06,501 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 05:24:06,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 05:24:06,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 05:24:06,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 05:24:06,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 05:24:06,501 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-02 05:24:06,502 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-02 05:24:06,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 05:24:06,502 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2019-12-02 05:24:06,502 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-02 05:24:06,502 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-12-02 05:24:06,502 INFO L138 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> 5446a6bcb7b41f40bef72cbbdd61d96122ada54f [2019-12-02 05:24:06,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 05:24:06,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 05:24:06,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 05:24:06,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 05:24:06,678 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 05:24:06,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-12-02 05:24:06,723 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/data/182824ba5/f700d4bae1f4426a8d81b9f2b2ee2f78/FLAG2423caad3 [2019-12-02 05:24:07,227 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 05:24:07,227 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-12-02 05:24:07,248 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/data/182824ba5/f700d4bae1f4426a8d81b9f2b2ee2f78/FLAG2423caad3 [2019-12-02 05:24:07,748 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/data/182824ba5/f700d4bae1f4426a8d81b9f2b2ee2f78 [2019-12-02 05:24:07,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 05:24:07,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 05:24:07,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 05:24:07,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 05:24:07,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 05:24:07,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:24:07" (1/1) ... [2019-12-02 05:24:07,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5258ce92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:07, skipping insertion in model container [2019-12-02 05:24:07,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:24:07" (1/1) ... [2019-12-02 05:24:07,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 05:24:07,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 05:24:08,573 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-02 05:24:08,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 05:24:08,607 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-02 05:24:08,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 05:24:08,765 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-02 05:24:08,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 05:24:08,783 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 05:24:08,944 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-02 05:24:08,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 05:24:09,110 INFO L208 MainTranslator]: Completed translation [2019-12-02 05:24:09,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:09 WrapperNode [2019-12-02 05:24:09,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 05:24:09,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 05:24:09,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 05:24:09,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 05:24:09,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:09" (1/1) ... [2019-12-02 05:24:09,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:09" (1/1) ... [2019-12-02 05:24:09,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 05:24:09,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 05:24:09,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 05:24:09,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 05:24:09,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:09" (1/1) ... [2019-12-02 05:24:09,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:09" (1/1) ... [2019-12-02 05:24:09,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:09" (1/1) ... [2019-12-02 05:24:09,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:09" (1/1) ... [2019-12-02 05:24:09,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:09" (1/1) ... [2019-12-02 05:24:09,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:09" (1/1) ... [2019-12-02 05:24:09,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:09" (1/1) ... [2019-12-02 05:24:09,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 05:24:09,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 05:24:09,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 05:24:09,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 05:24:09,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:24:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d10d3f9c-fef7-4f54-b77d-a8a5c6a4fdb2/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2019-12-02 05:24:09,375 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2019-12-02 05:24:09,375 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2019-12-02 05:24:09,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-02 05:24:09,375 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2019-12-02 05:24:09,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2019-12-02 05:24:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-12-02 05:24:09,376 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-12-02 05:24:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-12-02 05:24:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-02 05:24:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-02 05:24:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-02 05:24:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2019-12-02 05:24:09,376 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2019-12-02 05:24:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2019-12-02 05:24:09,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2019-12-02 05:24:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-12-02 05:24:09,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-12-02 05:24:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-02 05:24:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2019-12-02 05:24:09,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2019-12-02 05:24:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2019-12-02 05:24:09,377 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2019-12-02 05:24:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-02 05:24:09,377 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-12-02 05:24:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2019-12-02 05:24:09,377 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2019-12-02 05:24:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2019-12-02 05:24:09,377 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2019-12-02 05:24:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-12-02 05:24:09,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-12-02 05:24:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-02 05:24:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2019-12-02 05:24:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2019-12-02 05:24:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2019-12-02 05:24:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-12-02 05:24:09,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-12-02 05:24:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2019-12-02 05:24:09,378 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2019-12-02 05:24:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2019-12-02 05:24:09,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2019-12-02 05:24:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2019-12-02 05:24:09,378 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2019-12-02 05:24:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2019-12-02 05:24:09,379 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2019-12-02 05:24:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-02 05:24:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-02 05:24:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2019-12-02 05:24:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2019-12-02 05:24:09,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2019-12-02 05:24:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2019-12-02 05:24:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-02 05:24:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-12-02 05:24:09,379 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-12-02 05:24:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-12-02 05:24:09,379 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-12-02 05:24:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-02 05:24:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2019-12-02 05:24:09,380 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2019-12-02 05:24:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-12-02 05:24:09,380 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-12-02 05:24:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2019-12-02 05:24:09,380 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2019-12-02 05:24:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-12-02 05:24:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-12-02 05:24:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-12-02 05:24:09,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-12-02 05:24:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-02 05:24:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-02 05:24:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-02 05:24:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2019-12-02 05:24:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-12-02 05:24:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-12-02 05:24:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2019-12-02 05:24:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-12-02 05:24:09,381 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-12-02 05:24:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2019-12-02 05:24:09,381 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2019-12-02 05:24:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-12-02 05:24:09,382 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-12-02 05:24:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2019-12-02 05:24:09,382 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2019-12-02 05:24:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-12-02 05:24:09,382 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-12-02 05:24:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2019-12-02 05:24:09,382 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2019-12-02 05:24:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-12-02 05:24:09,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-12-02 05:24:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2019-12-02 05:24:09,383 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2019-12-02 05:24:09,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2019-12-02 05:24:09,383 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2019-12-02 05:24:09,383 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2019-12-02 05:24:09,383 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-12-02 05:24:09,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-12-02 05:24:09,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 05:24:09,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 05:24:12,288 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-12-02 05:24:22,462 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-02 05:25:13,069 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2019-12-02 05:25:13,069 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2019-12-02 05:26:18,391 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 05:26:18,392 INFO L287 CfgBuilder]: Removed 100 assume(true) statements. [2019-12-02 05:26:18,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:26:18 BoogieIcfgContainer [2019-12-02 05:26:18,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 05:26:18,393 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 05:26:18,393 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 05:26:18,400 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 05:26:18,400 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:26:18" (1/1) ... [2019-12-02 05:26:18,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 05:26:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:26:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 317 states and 443 transitions. [2019-12-02 05:26:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 443 transitions. [2019-12-02 05:26:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-02 05:26:18,439 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:26:18,472 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort BitVec not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableSortSymbol.defineOrDeclare(DeclarableSortSymbol.java:79) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:145) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:170) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferAllSymbols(SmtFunctionsAndAxioms.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:448) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-02 05:26:18,475 INFO L168 Benchmark]: Toolchain (without parser) took 130723.43 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-02 05:26:18,476 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 05:26:18,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1359.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 940.2 MB in the beginning and 801.8 MB in the end (delta: 138.3 MB). Peak memory consumption was 286.8 MB. Max. memory is 11.5 GB. [2019-12-02 05:26:18,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 801.8 MB in the beginning and 1.2 GB in the end (delta: -413.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-12-02 05:26:18,478 INFO L168 Benchmark]: Boogie Preprocessor took 95.70 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-12-02 05:26:18,479 INFO L168 Benchmark]: RCFGBuilder took 129064.50 ms. Allocated memory was 1.3 GB in the beginning and 3.4 GB in the end (delta: 2.1 GB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 127.2 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-02 05:26:18,479 INFO L168 Benchmark]: CodeCheck took 80.32 ms. Allocated memory is still 3.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 05:26:18,482 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: SMTLIBException: Sort BitVec not declared de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: SMTLIBException: Sort BitVec not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1359.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 940.2 MB in the beginning and 801.8 MB in the end (delta: 138.3 MB). Peak memory consumption was 286.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 121.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 801.8 MB in the beginning and 1.2 GB in the end (delta: -413.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.70 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 129064.50 ms. Allocated memory was 1.3 GB in the beginning and 3.4 GB in the end (delta: 2.1 GB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 127.2 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * CodeCheck took 80.32 ms. Allocated memory is still 3.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...