./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/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_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/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 e8b9896441fc09cb2618e7fba2cab285ebc0cfce ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/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_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/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 e8b9896441fc09cb2618e7fba2cab285ebc0cfce ........................................................................................................................................................................................................................................................................................................ 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.24-678e011 [2019-11-20 00:55:25,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:55:25,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:55:25,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:55:25,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:55:25,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:55:25,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:55:25,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:55:25,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:55:25,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:55:25,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:55:25,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:55:25,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:55:25,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:55:25,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:55:25,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:55:25,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:55:25,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:55:25,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:55:25,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:55:25,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:55:25,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:55:25,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:55:25,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:55:25,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:55:25,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:55:25,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:55:25,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:55:25,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:55:25,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:55:25,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:55:25,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:55:25,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:55:25,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:55:25,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:55:25,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:55:25,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:55:25,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:55:25,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:55:25,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:55:25,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:55:25,152 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf [2019-11-20 00:55:25,176 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:55:25,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:55:25,177 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 00:55:25,177 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 00:55:25,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:55:25,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:55:25,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:55:25,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:55:25,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:55:25,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:55:25,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:55:25,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:55:25,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:55:25,179 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:55:25,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:55:25,179 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 00:55:25,179 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 00:55:25,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:55:25,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:55:25,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 00:55:25,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:55:25,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:55:25,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:55:25,181 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 00:55:25,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:55:25,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:55:25,181 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 00:55:25,181 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_fe48b32d-1ec4-4322-b886-f61844f6cbe3/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 -> e8b9896441fc09cb2618e7fba2cab285ebc0cfce [2019-11-20 00:55:25,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:55:25,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:55:25,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:55:25,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:55:25,374 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:55:25,375 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-11-20 00:55:25,432 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/data/a977b64d7/f8d2fd16a08b43afa50ada86d94f8a32/FLAGdefbe863e [2019-11-20 00:55:26,231 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:55:26,232 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-11-20 00:55:26,280 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/data/a977b64d7/f8d2fd16a08b43afa50ada86d94f8a32/FLAGdefbe863e [2019-11-20 00:55:26,738 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/data/a977b64d7/f8d2fd16a08b43afa50ada86d94f8a32 [2019-11-20 00:55:26,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:55:26,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:55:26,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:55:26,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:55:26,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:55:26,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:55:26" (1/1) ... [2019-11-20 00:55:26,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e8ef01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:26, skipping insertion in model container [2019-11-20 00:55:26,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:55:26" (1/1) ... [2019-11-20 00:55:26,761 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:55:26,868 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:55:28,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:55:28,500 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:55:28,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:55:29,104 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:55:29,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:29 WrapperNode [2019-11-20 00:55:29,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:55:29,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:55:29,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:55:29,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:55:29,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:29" (1/1) ... [2019-11-20 00:55:29,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:29" (1/1) ... [2019-11-20 00:55:29,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:55:29,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:55:29,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:55:29,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:55:29,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:29" (1/1) ... [2019-11-20 00:55:29,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:29" (1/1) ... [2019-11-20 00:55:29,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:29" (1/1) ... [2019-11-20 00:55:29,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:29" (1/1) ... [2019-11-20 00:55:29,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:29" (1/1) ... [2019-11-20 00:55:29,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:29" (1/1) ... [2019-11-20 00:55:29,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:29" (1/1) ... [2019-11-20 00:55:29,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:55:29,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:55:29,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:55:29,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:55:29,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:55:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/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-11-20 00:55:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2019-11-20 00:55:29,571 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2019-11-20 00:55:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2019-11-20 00:55:29,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2019-11-20 00:55:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-20 00:55:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-11-20 00:55:29,573 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-11-20 00:55:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-20 00:55:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-20 00:55:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 00:55:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-11-20 00:55:29,577 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-11-20 00:55:29,577 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2019-11-20 00:55:29,578 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2019-11-20 00:55:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2019-11-20 00:55:29,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2019-11-20 00:55:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-11-20 00:55:29,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-11-20 00:55:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2019-11-20 00:55:29,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2019-11-20 00:55:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2019-11-20 00:55:29,579 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2019-11-20 00:55:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-20 00:55:29,579 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-11-20 00:55:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2019-11-20 00:55:29,580 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2019-11-20 00:55:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 00:55:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2019-11-20 00:55:29,580 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2019-11-20 00:55:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-11-20 00:55:29,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-11-20 00:55:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-11-20 00:55:29,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-11-20 00:55:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2019-11-20 00:55:29,581 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2019-11-20 00:55:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2019-11-20 00:55:29,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2019-11-20 00:55:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2019-11-20 00:55:29,582 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2019-11-20 00:55:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2019-11-20 00:55:29,582 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2019-11-20 00:55:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 00:55:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:55:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2019-11-20 00:55:29,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2019-11-20 00:55:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-11-20 00:55:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-11-20 00:55:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-11-20 00:55:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-11-20 00:55:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 00:55:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2019-11-20 00:55:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2019-11-20 00:55:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-11-20 00:55:29,585 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-11-20 00:55:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2019-11-20 00:55:29,585 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2019-11-20 00:55:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-11-20 00:55:29,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-11-20 00:55:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:55:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 00:55:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-11-20 00:55:29,587 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-11-20 00:55:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2019-11-20 00:55:29,587 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2019-11-20 00:55:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-11-20 00:55:29,588 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-11-20 00:55:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2019-11-20 00:55:29,589 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2019-11-20 00:55:29,590 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-11-20 00:55:29,590 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-11-20 00:55:29,590 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2019-11-20 00:55:29,591 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2019-11-20 00:55:29,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-11-20 00:55:29,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-11-20 00:55:29,592 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2019-11-20 00:55:29,592 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2019-11-20 00:55:29,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 00:55:29,592 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2019-11-20 00:55:29,592 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2019-11-20 00:55:29,593 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-11-20 00:55:29,593 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-11-20 00:55:29,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-20 00:55:29,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:55:29,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:55:30,499 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-11-20 00:55:30,827 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 00:56:00,085 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2019-11-20 00:56:00,085 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2019-11-20 00:56:02,966 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:56:02,966 INFO L285 CfgBuilder]: Removed 100 assume(true) statements. [2019-11-20 00:56:02,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:56:02 BoogieIcfgContainer [2019-11-20 00:56:02,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:56:02,968 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 00:56:02,968 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 00:56:02,977 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 00:56:02,977 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:56:02" (1/1) ... [2019-11-20 00:56:02,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:56:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 326 states and 455 transitions. [2019-11-20 00:56:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 455 transitions. [2019-11-20 00:56:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 00:56:03,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 326 states and 451 transitions. [2019-11-20 00:56:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 451 transitions. [2019-11-20 00:56:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 00:56:03,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 328 states and 453 transitions. [2019-11-20 00:56:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 453 transitions. [2019-11-20 00:56:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 00:56:04,319 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 328 states and 452 transitions. [2019-11-20 00:56:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 452 transitions. [2019-11-20 00:56:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 00:56:04,398 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 333 states and 473 transitions. [2019-11-20 00:56:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 473 transitions. [2019-11-20 00:56:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 00:56:04,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 338 states and 494 transitions. [2019-11-20 00:56:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 494 transitions. [2019-11-20 00:56:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 00:56:04,687 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 343 states and 513 transitions. [2019-11-20 00:56:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 513 transitions. [2019-11-20 00:56:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 00:56:04,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 347 states and 520 transitions. [2019-11-20 00:56:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 520 transitions. [2019-11-20 00:56:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 00:56:05,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 348 states and 520 transitions. [2019-11-20 00:56:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 520 transitions. [2019-11-20 00:56:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 00:56:05,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 352 states and 527 transitions. [2019-11-20 00:56:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 527 transitions. [2019-11-20 00:56:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 00:56:05,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 356 states and 538 transitions. [2019-11-20 00:56:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 538 transitions. [2019-11-20 00:56:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 00:56:05,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 362 states and 550 transitions. [2019-11-20 00:56:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 550 transitions. [2019-11-20 00:56:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 00:56:05,905 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 365 states and 556 transitions. [2019-11-20 00:56:06,096 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 556 transitions. [2019-11-20 00:56:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 00:56:06,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 366 states and 557 transitions. [2019-11-20 00:56:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 557 transitions. [2019-11-20 00:56:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 00:56:06,205 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 369 states and 563 transitions. [2019-11-20 00:56:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 563 transitions. [2019-11-20 00:56:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 00:56:06,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 370 states and 564 transitions. [2019-11-20 00:56:06,463 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 564 transitions. [2019-11-20 00:56:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 00:56:06,467 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:56:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 372 states and 567 transitions. [2019-11-20 00:56:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 567 transitions. [2019-11-20 00:56:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 00:56:06,638 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 376 states and 576 transitions. [2019-11-20 00:56:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 576 transitions. [2019-11-20 00:56:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 00:56:06,762 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 383 states and 587 transitions. [2019-11-20 00:56:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 587 transitions. [2019-11-20 00:56:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 00:56:06,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 387 states and 596 transitions. [2019-11-20 00:56:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 596 transitions. [2019-11-20 00:56:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 00:56:06,972 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 388 states and 596 transitions. [2019-11-20 00:56:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 596 transitions. [2019-11-20 00:56:07,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 00:56:07,052 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 395 states and 607 transitions. [2019-11-20 00:56:07,168 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 607 transitions. [2019-11-20 00:56:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 00:56:07,169 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:56:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 398 states and 613 transitions. [2019-11-20 00:56:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 613 transitions. [2019-11-20 00:56:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 00:56:07,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:56:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 399 states and 614 transitions. [2019-11-20 00:56:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 614 transitions. [2019-11-20 00:56:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 00:56:07,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 400 states and 615 transitions. [2019-11-20 00:56:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 615 transitions. [2019-11-20 00:56:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 00:56:07,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 401 states and 615 transitions. [2019-11-20 00:56:07,518 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 615 transitions. [2019-11-20 00:56:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 00:56:07,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:56:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 405 states and 624 transitions. [2019-11-20 00:56:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 624 transitions. [2019-11-20 00:56:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 00:56:07,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 409 states and 632 transitions. [2019-11-20 00:56:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 632 transitions. [2019-11-20 00:56:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 00:56:07,721 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 409 states and 631 transitions. [2019-11-20 00:56:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 631 transitions. [2019-11-20 00:56:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 00:56:07,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 418 states and 646 transitions. [2019-11-20 00:56:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 646 transitions. [2019-11-20 00:56:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 00:56:07,927 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 421 states and 651 transitions. [2019-11-20 00:56:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 651 transitions. [2019-11-20 00:56:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 00:56:08,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 422 states and 652 transitions. [2019-11-20 00:56:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 652 transitions. [2019-11-20 00:56:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 00:56:08,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 431 states and 667 transitions. [2019-11-20 00:56:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 667 transitions. [2019-11-20 00:56:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 00:56:08,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 432 states and 668 transitions. [2019-11-20 00:56:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 668 transitions. [2019-11-20 00:56:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 00:56:09,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 437 states and 676 transitions. [2019-11-20 00:56:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 676 transitions. [2019-11-20 00:56:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 00:56:09,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 437 states and 674 transitions. [2019-11-20 00:56:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 674 transitions. [2019-11-20 00:56:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 00:56:09,945 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:56:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 442 states and 683 transitions. [2019-11-20 00:56:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 683 transitions. [2019-11-20 00:56:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 00:56:10,467 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 453 states and 707 transitions. [2019-11-20 00:56:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 707 transitions. [2019-11-20 00:56:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 00:56:12,252 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 456 states and 717 transitions. [2019-11-20 00:56:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 717 transitions. [2019-11-20 00:56:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 00:56:12,498 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 456 states and 716 transitions. [2019-11-20 00:56:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 716 transitions. [2019-11-20 00:56:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 00:56:12,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 459 states and 726 transitions. [2019-11-20 00:56:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 726 transitions. [2019-11-20 00:56:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 00:56:12,823 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:56:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 461 states and 728 transitions. [2019-11-20 00:56:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 728 transitions. [2019-11-20 00:56:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 00:56:13,054 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 463 states and 731 transitions. [2019-11-20 00:56:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 731 transitions. [2019-11-20 00:56:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 00:56:13,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:56:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 465 states and 733 transitions. [2019-11-20 00:56:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 733 transitions. [2019-11-20 00:56:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 00:56:13,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:13,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-11-20 00:56:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 474 states and 750 transitions. [2019-11-20 00:56:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 750 transitions. [2019-11-20 00:56:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 00:56:13,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:56:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 478 states and 762 transitions. [2019-11-20 00:56:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 762 transitions. [2019-11-20 00:56:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 00:56:13,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:56:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 484 states and 777 transitions. [2019-11-20 00:56:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 777 transitions. [2019-11-20 00:56:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 00:56:14,808 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:56:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 485 states and 778 transitions. [2019-11-20 00:56:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 778 transitions. [2019-11-20 00:56:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 00:56:14,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:56:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 486 states and 778 transitions. [2019-11-20 00:56:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 778 transitions. [2019-11-20 00:56:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 00:56:14,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:56:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 486 states and 777 transitions. [2019-11-20 00:56:15,077 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 777 transitions. [2019-11-20 00:56:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-20 00:56:15,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:56:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 488 states and 780 transitions. [2019-11-20 00:56:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 780 transitions. [2019-11-20 00:56:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 00:56:15,365 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:56:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:15,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 490 states and 783 transitions. [2019-11-20 00:56:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 783 transitions. [2019-11-20 00:56:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:56:15,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 490 states and 781 transitions. [2019-11-20 00:56:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 781 transitions. [2019-11-20 00:56:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 00:56:15,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:56:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 492 states and 784 transitions. [2019-11-20 00:56:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 784 transitions. [2019-11-20 00:56:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 00:56:15,694 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:56:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 507 states and 808 transitions. [2019-11-20 00:56:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 808 transitions. [2019-11-20 00:56:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 00:56:17,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 509 states and 811 transitions. [2019-11-20 00:56:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 811 transitions. [2019-11-20 00:56:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-20 00:56:17,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 518 states and 826 transitions. [2019-11-20 00:56:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 826 transitions. [2019-11-20 00:56:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 00:56:18,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:56:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 521 states and 832 transitions. [2019-11-20 00:56:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 832 transitions. [2019-11-20 00:56:18,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 00:56:18,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 00:56:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 527 states and 849 transitions. [2019-11-20 00:56:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 849 transitions. [2019-11-20 00:56:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 00:56:19,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 00:56:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 532 states and 862 transitions. [2019-11-20 00:56:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 862 transitions. [2019-11-20 00:56:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 00:56:19,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:56:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 547 states and 887 transitions. [2019-11-20 00:56:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 887 transitions. [2019-11-20 00:56:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 00:56:22,065 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 564 states and 919 transitions. [2019-11-20 00:56:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 919 transitions. [2019-11-20 00:56:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 00:56:25,365 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 572 states and 936 transitions. [2019-11-20 00:56:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 936 transitions. [2019-11-20 00:56:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 00:56:26,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:56:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 575 states and 942 transitions. [2019-11-20 00:56:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 942 transitions. [2019-11-20 00:56:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 00:56:26,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:56:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 576 states and 943 transitions. [2019-11-20 00:56:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 943 transitions. [2019-11-20 00:56:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 00:56:26,989 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 00:56:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 577 states and 943 transitions. [2019-11-20 00:56:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 943 transitions. [2019-11-20 00:56:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 00:56:27,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 00:56:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 578 states and 943 transitions. [2019-11-20 00:56:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 943 transitions. [2019-11-20 00:56:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 00:56:27,139 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 00:56:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 579 states and 944 transitions. [2019-11-20 00:56:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 944 transitions. [2019-11-20 00:56:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-20 00:56:27,219 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 581 states and 949 transitions. [2019-11-20 00:56:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 949 transitions. [2019-11-20 00:56:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 00:56:28,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 592 states and 972 transitions. [2019-11-20 00:56:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 972 transitions. [2019-11-20 00:56:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:56:30,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:56:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 593 states and 973 transitions. [2019-11-20 00:56:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 973 transitions. [2019-11-20 00:56:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-20 00:56:30,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 00:56:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 600 states and 985 transitions. [2019-11-20 00:56:32,664 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 985 transitions. [2019-11-20 00:56:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 00:56:32,665 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 603 states and 992 transitions. [2019-11-20 00:56:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 992 transitions. [2019-11-20 00:56:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 00:56:33,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 603 states and 991 transitions. [2019-11-20 00:56:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 991 transitions. [2019-11-20 00:56:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 00:56:33,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 00:56:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 607 states and 1000 transitions. [2019-11-20 00:56:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1000 transitions. [2019-11-20 00:56:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-20 00:56:33,722 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:56:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 609 states and 1001 transitions. [2019-11-20 00:56:33,834 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1001 transitions. [2019-11-20 00:56:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 00:56:33,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 609 states and 1000 transitions. [2019-11-20 00:56:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1000 transitions. [2019-11-20 00:56:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 00:56:34,933 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:56:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 611 states and 1001 transitions. [2019-11-20 00:56:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1001 transitions. [2019-11-20 00:56:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 00:56:35,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 614 states and 1004 transitions. [2019-11-20 00:56:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1004 transitions. [2019-11-20 00:56:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 00:56:35,851 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:56:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 617 states and 1010 transitions. [2019-11-20 00:56:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1010 transitions. [2019-11-20 00:56:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-20 00:56:37,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 00:56:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 621 states and 1019 transitions. [2019-11-20 00:56:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1019 transitions. [2019-11-20 00:56:38,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 00:56:38,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 00:56:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 622 states and 1019 transitions. [2019-11-20 00:56:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1019 transitions. [2019-11-20 00:56:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 00:56:38,452 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 00:56:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 623 states and 1019 transitions. [2019-11-20 00:56:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1019 transitions. [2019-11-20 00:56:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-20 00:56:38,537 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:56:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 631 states and 1040 transitions. [2019-11-20 00:56:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1040 transitions. [2019-11-20 00:56:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 00:56:44,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 634 states and 1046 transitions. [2019-11-20 00:56:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1046 transitions. [2019-11-20 00:56:46,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 00:56:46,259 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 00:56:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 637 states and 1049 transitions. [2019-11-20 00:56:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1049 transitions. [2019-11-20 00:56:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-20 00:56:46,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:56:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 640 states and 1053 transitions. [2019-11-20 00:56:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1053 transitions. [2019-11-20 00:56:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-20 00:56:49,890 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:56:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 642 states and 1054 transitions. [2019-11-20 00:56:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1054 transitions. [2019-11-20 00:56:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 00:56:50,780 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 645 states and 1060 transitions. [2019-11-20 00:56:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1060 transitions. [2019-11-20 00:56:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 00:56:52,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 00:56:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 647 states and 1061 transitions. [2019-11-20 00:56:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1061 transitions. [2019-11-20 00:56:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 00:56:52,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:56:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 647 states and 1060 transitions. [2019-11-20 00:56:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1060 transitions. [2019-11-20 00:56:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 00:56:54,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:56:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 651 states and 1071 transitions. [2019-11-20 00:56:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1071 transitions. [2019-11-20 00:56:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 00:56:54,989 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:56:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:56:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 655 states and 1078 transitions. [2019-11-20 00:56:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1078 transitions. [2019-11-20 00:56:58,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 00:56:58,778 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:56:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:56:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:57:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:57:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 658 states and 1084 transitions. [2019-11-20 00:57:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1084 transitions. [2019-11-20 00:57:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 00:57:00,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:57:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:57:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:57:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:57:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 667 states and 1098 transitions. [2019-11-20 00:57:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1098 transitions. [2019-11-20 00:57:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 00:57:00,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:57:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:57:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 00:57:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:57:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 673 states and 1107 transitions. [2019-11-20 00:57:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1107 transitions. [2019-11-20 00:57:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 00:57:00,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:57:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:57:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:57:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:57:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:57:02,720 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 96 iterations. [2019-11-20 00:57:02,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 12:57:02 ImpRootNode [2019-11-20 00:57:02,965 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 00:57:02,965 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:57:02,966 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:57:02,966 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:57:02,966 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:56:02" (3/4) ... [2019-11-20 00:57:02,970 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 00:57:02,970 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:57:02,972 INFO L168 Benchmark]: Toolchain (without parser) took 96228.28 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 939.2 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 884.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:57:02,973 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:57:02,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2360.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 939.2 MB in the beginning and 935.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 177.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:57:02,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 191.08 ms. Allocated memory is still 1.2 GB. Free memory was 935.9 MB in the beginning and 925.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:57:02,986 INFO L168 Benchmark]: Boogie Preprocessor took 179.85 ms. Allocated memory is still 1.2 GB. Free memory was 925.2 MB in the beginning and 914.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:57:02,987 INFO L168 Benchmark]: RCFGBuilder took 33490.42 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 914.4 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-20 00:57:02,987 INFO L168 Benchmark]: CodeCheck took 59997.24 ms. Allocated memory was 3.1 GB in the beginning and 3.3 GB in the end (delta: 184.5 MB). Free memory was 2.9 GB in the beginning and 2.3 GB in the end (delta: 593.4 MB). Peak memory consumption was 777.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:57:02,990 INFO L168 Benchmark]: Witness Printer took 4.44 ms. Allocated memory is still 3.3 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:57:02,992 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 36 procedures, 327 locations, 1 error locations. Result: UNSAFE, OverallTime: 59.7s, OverallIterations: 96, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -543600002 SDtfs, 1269169856 SDslu, 1865216384 SDs, 0 SdLazy, 201757456 SolverSat, -1528697484 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 117.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49320 GetRequests, 48795 SyntacticMatches, 139 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64169 ImplicationChecksByTransitivity, 44.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.5s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 4891 NumberOfCodeBlocks, 4891 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 4720 ConstructedInterpolants, 0 QuantifiedInterpolants, 520508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 91 PerfectInterpolantSequences, 723/773 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={10624:0}, __key___8={19085:0}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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") [L7013] 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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, dev={0:-3499}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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] [L6970] CALL, EXPR external_alloc() VAL [\old(ldv_urb_state)=0, __key___7={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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] [L7031] return __VERIFIER_nondet_pointer(); [L6970] RET, EXPR external_alloc() VAL [\old(ldv_urb_state)=0, __key___7={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933:0}, external_alloc()={1253:-3345}, 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] [L6970] return (void *)external_alloc(); [L6826] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={1253:-3345}, 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={1253:-3345}, __key___7={10624:0}, __key___8={19085:0}, __this_module={155:154}, arbitrary_memory={1253:-3345}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={1253:-3345}] [L6068] RET, EXPR usb_alloc_urb(0, 32U) VAL [__key___7={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, dev={186:185}, dma={1253:-3241}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, dev={186:185}, dev={186:185}, dma={1253:-3241}, dma={1253:-3241}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, dev={186:185}, dev={186:185}, dma={1253:-3241}, dma={1253:-3241}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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] [L6970] CALL, EXPR external_alloc() VAL [\old(ldv_coherent_state)=0, __key___7={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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] [L7031] return __VERIFIER_nondet_pointer(); [L6970] RET, EXPR external_alloc() VAL [\old(ldv_coherent_state)=0, __key___7={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933:0}, external_alloc()={1253:-3259}, 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] [L6970] return (void *)external_alloc(); [L6769] RET, EXPR ldv_undefined_pointer() VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={10624:0}, __key___8={19085:0}, __this_module={155:154}, dev={186:185}, dev={186:185}, dma={1253:-3241}, dma={1253:-3241}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={1253:-3259}, 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={1253:-3259}, __key___7={10624:0}, __key___8={19085:0}, __this_module={155:154}, arbitrary_memory={1253:-3259}, dev={186:185}, dev={186:185}, dma={1253:-3241}, dma={1253:-3241}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={1253:-3259}] [L6078] RET, EXPR usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) VAL [__key___7={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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 FALSE !(cf->can_id & 2147483648U) [L6096] msg->type = (u8 )13 [L6098] msg->length = (u8 )5 VAL [__key___7={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, addr={1253:-3259}, dev={186:185}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, addr={1253:-3259}, addr={1253:-3259}, dev={186:185}, dev={186:185}, dma=183, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, addr={1253:-3259}, addr={1253:-3259}, dev={186:185}, dev={186:185}, dma=183, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, addr={1253:-3259}, addr={1253:-3259}, dev={186:185}, dev={186:185}, dma=183, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, addr={1253:-3259}, addr={1253:-3259}, dev={186:185}, dev={186:185}, dma=183, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, addr={1253:-3259}, addr={1253:-3259}, dev={186:185}, dev={186:185}, dma=183, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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={10624:0}, __key___8={19085:0}, __this_module={155:154}, ems_usb_bittiming_const={39228:0}, ems_usb_driver={61056:0}, ems_usb_netdev_ops={60807:0}, ems_usb_table={28933: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.80 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 2360.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 939.2 MB in the beginning and 935.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 177.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 191.08 ms. Allocated memory is still 1.2 GB. Free memory was 935.9 MB in the beginning and 925.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 179.85 ms. Allocated memory is still 1.2 GB. Free memory was 925.2 MB in the beginning and 914.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 33490.42 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 914.4 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * CodeCheck took 59997.24 ms. Allocated memory was 3.1 GB in the beginning and 3.3 GB in the end (delta: 184.5 MB). Free memory was 2.9 GB in the beginning and 2.3 GB in the end (delta: 593.4 MB). Peak memory consumption was 777.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.44 ms. Allocated memory is still 3.3 GB. Free memory is still 2.3 GB. 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.24-678e011 [2019-11-20 00:57:04,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:57:04,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:57:04,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:57:04,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:57:04,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:57:04,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:57:04,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:57:04,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:57:04,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:57:04,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:57:04,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:57:04,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:57:04,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:57:04,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:57:04,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:57:04,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:57:04,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:57:04,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:57:04,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:57:04,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:57:04,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:57:04,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:57:04,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:57:04,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:57:04,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:57:04,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:57:04,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:57:04,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:57:04,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:57:04,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:57:04,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:57:04,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:57:04,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:57:04,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:57:04,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:57:04,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:57:04,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:57:04,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:57:04,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:57:04,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:57:04,972 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf [2019-11-20 00:57:04,986 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:57:04,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:57:04,987 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 00:57:04,987 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 00:57:04,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:57:04,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:57:04,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:57:04,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:57:04,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:57:04,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:57:04,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:57:04,989 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 00:57:04,990 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 00:57:04,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:57:04,990 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:57:04,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:57:04,991 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 00:57:04,991 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 00:57:04,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:57:04,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:57:04,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 00:57:04,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:57:04,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:57:04,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:57:04,993 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-20 00:57:04,993 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 00:57:04,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:57:04,993 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2019-11-20 00:57:04,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 00:57:04,994 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-11-20 00:57:04,994 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_fe48b32d-1ec4-4322-b886-f61844f6cbe3/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 -> e8b9896441fc09cb2618e7fba2cab285ebc0cfce [2019-11-20 00:57:05,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:57:05,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:57:05,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:57:05,263 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:57:05,263 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:57:05,264 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-11-20 00:57:05,323 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/data/2e97ce4f5/07ff5850018b4e7aba33fc34a409ada6/FLAGfe7c58bbd [2019-11-20 00:57:06,025 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:57:06,026 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2019-11-20 00:57:06,058 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/data/2e97ce4f5/07ff5850018b4e7aba33fc34a409ada6/FLAGfe7c58bbd [2019-11-20 00:57:06,341 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/bin/ukojak/data/2e97ce4f5/07ff5850018b4e7aba33fc34a409ada6 [2019-11-20 00:57:06,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:57:06,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:57:06,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:57:06,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:57:06,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:57:06,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:57:06" (1/1) ... [2019-11-20 00:57:06,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df87040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:06, skipping insertion in model container [2019-11-20 00:57:06,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:57:06" (1/1) ... [2019-11-20 00:57:06,362 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:57:06,480 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:57:07,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:57:07,943 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:57:08,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:57:08,610 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:57:08,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:08 WrapperNode [2019-11-20 00:57:08,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:57:08,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:57:08,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:57:08,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:57:08,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:08" (1/1) ... [2019-11-20 00:57:08,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:08" (1/1) ... [2019-11-20 00:57:08,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:57:08,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:57:08,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:57:08,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:57:08,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:08" (1/1) ... [2019-11-20 00:57:08,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:08" (1/1) ... [2019-11-20 00:57:08,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:08" (1/1) ... [2019-11-20 00:57:08,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:08" (1/1) ... [2019-11-20 00:57:08,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:08" (1/1) ... [2019-11-20 00:57:08,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:08" (1/1) ... [2019-11-20 00:57:08,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:08" (1/1) ... [2019-11-20 00:57:08,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:57:08,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:57:08,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:57:08,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:57:08,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe48b32d-1ec4-4322-b886-f61844f6cbe3/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-11-20 00:57:09,065 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2019-11-20 00:57:09,065 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2019-11-20 00:57:09,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 00:57:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2019-11-20 00:57:09,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2019-11-20 00:57:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-11-20 00:57:09,066 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-11-20 00:57:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-20 00:57:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 00:57:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-20 00:57:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-20 00:57:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-11-20 00:57:09,067 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-11-20 00:57:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2019-11-20 00:57:09,067 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2019-11-20 00:57:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2019-11-20 00:57:09,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2019-11-20 00:57:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-11-20 00:57:09,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-11-20 00:57:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2019-11-20 00:57:09,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2019-11-20 00:57:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2019-11-20 00:57:09,069 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2019-11-20 00:57:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-20 00:57:09,069 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-11-20 00:57:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2019-11-20 00:57:09,069 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2019-11-20 00:57:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2019-11-20 00:57:09,069 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2019-11-20 00:57:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-11-20 00:57:09,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-11-20 00:57:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-20 00:57:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2019-11-20 00:57:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2019-11-20 00:57:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2019-11-20 00:57:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-11-20 00:57:09,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-11-20 00:57:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2019-11-20 00:57:09,070 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2019-11-20 00:57:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2019-11-20 00:57:09,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2019-11-20 00:57:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2019-11-20 00:57:09,071 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2019-11-20 00:57:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2019-11-20 00:57:09,071 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2019-11-20 00:57:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 00:57:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:57:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2019-11-20 00:57:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2019-11-20 00:57:09,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2019-11-20 00:57:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2019-11-20 00:57:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-20 00:57:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-11-20 00:57:09,072 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-11-20 00:57:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-11-20 00:57:09,073 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-11-20 00:57:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 00:57:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2019-11-20 00:57:09,073 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2019-11-20 00:57:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-11-20 00:57:09,074 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-11-20 00:57:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2019-11-20 00:57:09,074 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2019-11-20 00:57:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-20 00:57:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-20 00:57:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-11-20 00:57:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-11-20 00:57:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:57:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 00:57:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 00:57:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2019-11-20 00:57:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-20 00:57:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-11-20 00:57:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2019-11-20 00:57:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-11-20 00:57:09,077 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-11-20 00:57:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2019-11-20 00:57:09,077 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2019-11-20 00:57:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-11-20 00:57:09,077 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-11-20 00:57:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2019-11-20 00:57:09,078 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2019-11-20 00:57:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-11-20 00:57:09,078 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-11-20 00:57:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2019-11-20 00:57:09,079 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2019-11-20 00:57:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-11-20 00:57:09,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-11-20 00:57:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2019-11-20 00:57:09,079 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2019-11-20 00:57:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2019-11-20 00:57:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2019-11-20 00:57:09,080 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2019-11-20 00:57:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-11-20 00:57:09,080 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-11-20 00:57:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:57:09,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:57:12,184 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-11-20 00:57:12,552 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 00:58:03,862 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2019-11-20 00:58:03,862 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2019-11-20 00:59:02,448 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:59:02,448 INFO L285 CfgBuilder]: Removed 100 assume(true) statements. [2019-11-20 00:59:02,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:59:02 BoogieIcfgContainer [2019-11-20 00:59:02,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:59:02,450 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 00:59:02,450 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 00:59:02,460 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 00:59:02,461 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:59:02" (1/1) ... [2019-11-20 00:59:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:59:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:59:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 326 states and 455 transitions. [2019-11-20 00:59:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 455 transitions. [2019-11-20 00:59:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 00:59:02,540 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:59:02,591 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-11-20 00:59:02,600 INFO L168 Benchmark]: Toolchain (without parser) took 116251.03 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 949.6 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 755.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:59:02,601 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:59:02,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2264.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 949.6 MB in the beginning and 919.5 MB in the end (delta: 30.1 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:59:02,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 212.87 ms. Allocated memory is still 1.2 GB. Free memory was 919.5 MB in the beginning and 906.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:59:02,605 INFO L168 Benchmark]: Boogie Preprocessor took 148.82 ms. Allocated memory is still 1.2 GB. Free memory was 906.4 MB in the beginning and 893.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:59:02,605 INFO L168 Benchmark]: RCFGBuilder took 113474.66 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 893.3 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-20 00:59:02,606 INFO L168 Benchmark]: CodeCheck took 145.84 ms. Allocated memory is still 3.3 GB. Free memory is still 2.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:59:02,616 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 2264.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 949.6 MB in the beginning and 919.5 MB in the end (delta: 30.1 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 212.87 ms. Allocated memory is still 1.2 GB. Free memory was 919.5 MB in the beginning and 906.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 148.82 ms. Allocated memory is still 1.2 GB. Free memory was 906.4 MB in the beginning and 893.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 113474.66 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 893.3 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * CodeCheck took 145.84 ms. Allocated memory is still 3.3 GB. Free memory is still 2.4 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forcibly destroying the process Received shutdown request...