./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_false-unreach-call.cil.out.i --full-output --architecture 64bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 635dfa2a
Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko_false-unreach-call.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/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 df5576f7e7a8cefe027103c7c7ef877e0a55917f
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko_false-unreach-call.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/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 df5576f7e7a8cefe027103c7c7ef877e0a55917f
....................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Result:
ERROR: ExceptionOrErrorResult: IllegalArgumentException: Indexed Sort BitVec undefined
--- Real Ultimate output ---
This is Ultimate 0.1.23-635dfa2
[2018-12-09 01:33:49,717 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-12-09 01:33:49,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-12-09 01:33:49,724 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-12-09 01:33:49,724 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-12-09 01:33:49,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-12-09 01:33:49,725 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-12-09 01:33:49,726 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-12-09 01:33:49,727 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-12-09 01:33:49,727 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-12-09 01:33:49,728 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-12-09 01:33:49,728 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-12-09 01:33:49,728 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-12-09 01:33:49,729 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-12-09 01:33:49,729 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-12-09 01:33:49,730 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-12-09 01:33:49,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-12-09 01:33:49,731 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-12-09 01:33:49,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-12-09 01:33:49,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-12-09 01:33:49,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-12-09 01:33:49,734 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-12-09 01:33:49,735 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-12-09 01:33:49,735 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-12-09 01:33:49,735 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-12-09 01:33:49,735 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-12-09 01:33:49,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-12-09 01:33:49,736 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-12-09 01:33:49,736 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-12-09 01:33:49,737 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-12-09 01:33:49,737 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-12-09 01:33:49,737 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-12-09 01:33:49,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-12-09 01:33:49,738 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2018-12-09 01:33:49,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-12-09 01:33:49,738 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-12-09 01:33:49,738 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf
[2018-12-09 01:33:49,745 INFO L110 SettingsManager]: Loading preferences was successful
[2018-12-09 01:33:49,745 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-12-09 01:33:49,746 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-12-09 01:33:49,746 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS
[2018-12-09 01:33:49,746 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-12-09 01:33:49,746 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-12-09 01:33:49,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-12-09 01:33:49,747 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-12-09 01:33:49,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-12-09 01:33:49,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2018-12-09 01:33:49,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-12-09 01:33:49,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2018-12-09 01:33:49,747 INFO L133 SettingsManager]: * Check if freed pointer was valid=false
[2018-12-09 01:33:49,747 INFO L133 SettingsManager]: * Use constant arrays=true
[2018-12-09 01:33:49,747 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2018-12-09 01:33:49,747 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults:
[2018-12-09 01:33:49,747 INFO L133 SettingsManager]: * Timeout in seconds=1000000
[2018-12-09 01:33:49,747 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-12-09 01:33:49,748 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-12-09 01:33:49,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000
[2018-12-09 01:33:49,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-12-09 01:33:49,748 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-12-09 01:33:49,748 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-12-09 01:33:49,748 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN
[2018-12-09 01:33:49,748 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-12-09 01:33:49,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-12-09 01:33:49,748 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-12-09 01:33:49,748 INFO L133 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/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/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 -> df5576f7e7a8cefe027103c7c7ef877e0a55917f
[2018-12-09 01:33:49,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-12-09 01:33:49,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-12-09 01:33:49,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-12-09 01:33:49,778 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-12-09 01:33:49,779 INFO L276 PluginConnector]: CDTParser initialized
[2018-12-09 01:33:49,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko_false-unreach-call.cil.out.i
[2018-12-09 01:33:49,823 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/data/8161c4a73/00910b60049740d0bd6b69404ca5f3bf/FLAG1ea12333c
[2018-12-09 01:33:50,243 INFO L307 CDTParser]: Found 1 translation units.
[2018-12-09 01:33:50,243 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko_false-unreach-call.cil.out.i
[2018-12-09 01:33:50,259 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/data/8161c4a73/00910b60049740d0bd6b69404ca5f3bf/FLAG1ea12333c
[2018-12-09 01:33:50,267 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/data/8161c4a73/00910b60049740d0bd6b69404ca5f3bf
[2018-12-09 01:33:50,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-12-09 01:33:50,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2018-12-09 01:33:50,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-12-09 01:33:50,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-12-09 01:33:50,273 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-12-09 01:33:50,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:33:50" (1/1) ...
[2018-12-09 01:33:50,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11df9d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:50, skipping insertion in model container
[2018-12-09 01:33:50,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:33:50" (1/1) ...
[2018-12-09 01:33:50,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2018-12-09 01:33:50,332 INFO L176 MainTranslator]: Built tables and reachable declarations
[2018-12-09 01:33:51,026 INFO L203 PostProcessor]: Analyzing one entry point: main
[2018-12-09 01:33:51,051 INFO L191 MainTranslator]: Completed pre-run
[2018-12-09 01:33:51,194 INFO L203 PostProcessor]: Analyzing one entry point: main
[2018-12-09 01:33:51,303 INFO L195 MainTranslator]: Completed translation
[2018-12-09 01:33:51,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:51 WrapperNode
[2018-12-09 01:33:51,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-12-09 01:33:51,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-12-09 01:33:51,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-12-09 01:33:51,304 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2018-12-09 01:33:51,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:51" (1/1) ...
[2018-12-09 01:33:51,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:51" (1/1) ...
[2018-12-09 01:33:51,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-12-09 01:33:51,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-12-09 01:33:51,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-12-09 01:33:51,378 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-12-09 01:33:51,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:51" (1/1) ...
[2018-12-09 01:33:51,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:51" (1/1) ...
[2018-12-09 01:33:51,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:51" (1/1) ...
[2018-12-09 01:33:51,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:51" (1/1) ...
[2018-12-09 01:33:51,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:51" (1/1) ...
[2018-12-09 01:33:51,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:51" (1/1) ...
[2018-12-09 01:33:51,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:51" (1/1) ...
[2018-12-09 01:33:51,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-12-09 01:33:51,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-12-09 01:33:51,442 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-12-09 01:33:51,442 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-12-09 01:33:51,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:51" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/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
[2018-12-09 01:33:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set
[2018-12-09 01:33:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set
[2018-12-09 01:33:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init
[2018-12-09 01:33:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init
[2018-12-09 01:33:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2018-12-09 01:33:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb
[2018-12-09 01:33:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb
[2018-12-09 01:33:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-12-09 01:33:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$
[2018-12-09 01:33:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$
[2018-12-09 01:33:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2018-12-09 01:33:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc
[2018-12-09 01:33:51,479 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc
[2018-12-09 01:33:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue
[2018-12-09 01:33:51,479 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue
[2018-12-09 01:33:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd
[2018-12-09 01:33:51,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd
[2018-12-09 01:33:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe
[2018-12-09 01:33:51,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe
[2018-12-09 01:33:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit
[2018-12-09 01:33:51,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit
[2018-12-09 01:33:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs
[2018-12-09 01:33:51,480 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs
[2018-12-09 01:33:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure kfree
[2018-12-09 01:33:51,480 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree
[2018-12-09 01:33:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor
[2018-12-09 01:33:51,480 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor
[2018-12-09 01:33:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2018-12-09 01:33:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb
[2018-12-09 01:33:51,481 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb
[2018-12-09 01:33:51,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop
[2018-12-09 01:33:51,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop
[2018-12-09 01:33:51,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value
[2018-12-09 01:33:51,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value
[2018-12-09 01:33:51,481 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue
[2018-12-09 01:33:51,481 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue
[2018-12-09 01:33:51,481 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg
[2018-12-09 01:33:51,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg
[2018-12-09 01:33:51,481 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs
[2018-12-09 01:33:51,481 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs
[2018-12-09 01:33:51,481 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb
[2018-12-09 01:33:51,481 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb
[2018-12-09 01:33:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-12-09 01:33:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode
[2018-12-09 01:33:51,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode
[2018-12-09 01:33:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent
[2018-12-09 01:33:51,482 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent
[2018-12-09 01:33:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent
[2018-12-09 01:33:51,482 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent
[2018-12-09 01:33:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-12-09 01:33:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec
[2018-12-09 01:33:51,482 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec
[2018-12-09 01:33:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb
[2018-12-09 01:33:51,482 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb
[2018-12-09 01:33:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb
[2018-12-09 01:33:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb
[2018-12-09 01:33:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert
[2018-12-09 01:33:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert
[2018-12-09 01:33:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-12-09 01:33:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2018-12-09 01:33:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc
[2018-12-09 01:33:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc
[2018-12-09 01:33:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach
[2018-12-09 01:33:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach
[2018-12-09 01:33:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv
[2018-12-09 01:33:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv
[2018-12-09 01:33:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb
[2018-12-09 01:33:51,484 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb
[2018-12-09 01:33:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata
[2018-12-09 01:33:51,484 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata
[2018-12-09 01:33:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue
[2018-12-09 01:33:51,484 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue
[2018-12-09 01:33:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer
[2018-12-09 01:33:51,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer
[2018-12-09 01:33:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev
[2018-12-09 01:33:51,484 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev
[2018-12-09 01:33:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2018-12-09 01:33:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev
[2018-12-09 01:33:51,484 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev
[2018-12-09 01:33:51,485 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb
[2018-12-09 01:33:51,485 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb
[2018-12-09 01:33:51,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int
[2018-12-09 01:33:51,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-12-09 01:33:51,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-12-09 01:33:52,031 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code
[2018-12-09 01:33:52,031 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2018-12-09 01:34:17,036 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-12-09 01:34:17,036 INFO L280 CfgBuilder]: Removed 100 assue(true) statements.
[2018-12-09 01:34:17,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:34:17 BoogieIcfgContainer
[2018-12-09 01:34:17,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-12-09 01:34:17,037 INFO L113 PluginConnector]: ------------------------CodeCheck----------------------------
[2018-12-09 01:34:17,037 INFO L271 PluginConnector]: Initializing CodeCheck...
[2018-12-09 01:34:17,047 INFO L276 PluginConnector]: CodeCheck initialized
[2018-12-09 01:34:17,047 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:34:17" (1/1) ...
[2018-12-09 01:34:17,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-12-09 01:34:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 326 states and 455 transitions.
[2018-12-09 01:34:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 455 transitions.
[2018-12-09 01:34:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-12-09 01:34:17,090 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 326 states and 451 transitions.
[2018-12-09 01:34:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 451 transitions.
[2018-12-09 01:34:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2018-12-09 01:34:17,440 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 328 states and 453 transitions.
[2018-12-09 01:34:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 453 transitions.
[2018-12-09 01:34:17,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-12-09 01:34:17,700 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 328 states and 452 transitions.
[2018-12-09 01:34:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 452 transitions.
[2018-12-09 01:34:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-12-09 01:34:17,734 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 333 states and 473 transitions.
[2018-12-09 01:34:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 473 transitions.
[2018-12-09 01:34:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-12-09 01:34:17,780 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 338 states and 494 transitions.
[2018-12-09 01:34:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 494 transitions.
[2018-12-09 01:34:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-12-09 01:34:17,825 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 343 states and 513 transitions.
[2018-12-09 01:34:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 513 transitions.
[2018-12-09 01:34:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-12-09 01:34:17,936 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 347 states and 520 transitions.
[2018-12-09 01:34:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 520 transitions.
[2018-12-09 01:34:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-12-09 01:34:18,017 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 348 states and 520 transitions.
[2018-12-09 01:34:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 520 transitions.
[2018-12-09 01:34:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-12-09 01:34:18,059 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 352 states and 527 transitions.
[2018-12-09 01:34:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 527 transitions.
[2018-12-09 01:34:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-12-09 01:34:18,120 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 356 states and 538 transitions.
[2018-12-09 01:34:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 538 transitions.
[2018-12-09 01:34:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-12-09 01:34:18,300 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 362 states and 550 transitions.
[2018-12-09 01:34:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 550 transitions.
[2018-12-09 01:34:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-12-09 01:34:18,349 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 365 states and 556 transitions.
[2018-12-09 01:34:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 556 transitions.
[2018-12-09 01:34:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-12-09 01:34:18,439 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 366 states and 557 transitions.
[2018-12-09 01:34:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 557 transitions.
[2018-12-09 01:34:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-12-09 01:34:18,470 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 369 states and 563 transitions.
[2018-12-09 01:34:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 563 transitions.
[2018-12-09 01:34:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-12-09 01:34:18,531 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 370 states and 564 transitions.
[2018-12-09 01:34:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 564 transitions.
[2018-12-09 01:34:18,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-12-09 01:34:18,560 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 372 states and 567 transitions.
[2018-12-09 01:34:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 567 transitions.
[2018-12-09 01:34:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-12-09 01:34:18,632 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 376 states and 576 transitions.
[2018-12-09 01:34:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 576 transitions.
[2018-12-09 01:34:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-12-09 01:34:18,695 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 380 states and 585 transitions.
[2018-12-09 01:34:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 585 transitions.
[2018-12-09 01:34:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-12-09 01:34:18,759 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 387 states and 596 transitions.
[2018-12-09 01:34:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 596 transitions.
[2018-12-09 01:34:18,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-12-09 01:34:18,820 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 388 states and 596 transitions.
[2018-12-09 01:34:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 596 transitions.
[2018-12-09 01:34:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-12-09 01:34:18,866 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 395 states and 607 transitions.
[2018-12-09 01:34:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 607 transitions.
[2018-12-09 01:34:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-12-09 01:34:18,936 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 398 states and 613 transitions.
[2018-12-09 01:34:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 613 transitions.
[2018-12-09 01:34:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-12-09 01:34:18,978 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 399 states and 614 transitions.
[2018-12-09 01:34:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 614 transitions.
[2018-12-09 01:34:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-12-09 01:34:19,013 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 400 states and 615 transitions.
[2018-12-09 01:34:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 615 transitions.
[2018-12-09 01:34:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-12-09 01:34:19,042 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 404 states and 624 transitions.
[2018-12-09 01:34:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 624 transitions.
[2018-12-09 01:34:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-12-09 01:34:19,089 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 405 states and 624 transitions.
[2018-12-09 01:34:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 624 transitions.
[2018-12-09 01:34:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-12-09 01:34:19,121 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 409 states and 632 transitions.
[2018-12-09 01:34:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 632 transitions.
[2018-12-09 01:34:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-12-09 01:34:19,160 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 409 states and 631 transitions.
[2018-12-09 01:34:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 631 transitions.
[2018-12-09 01:34:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-12-09 01:34:19,190 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 418 states and 646 transitions.
[2018-12-09 01:34:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 646 transitions.
[2018-12-09 01:34:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-12-09 01:34:19,246 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 421 states and 651 transitions.
[2018-12-09 01:34:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 651 transitions.
[2018-12-09 01:34:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-12-09 01:34:19,555 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 422 states and 652 transitions.
[2018-12-09 01:34:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 652 transitions.
[2018-12-09 01:34:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-12-09 01:34:19,610 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 431 states and 667 transitions.
[2018-12-09 01:34:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 667 transitions.
[2018-12-09 01:34:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-12-09 01:34:19,681 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 432 states and 668 transitions.
[2018-12-09 01:34:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 668 transitions.
[2018-12-09 01:34:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2018-12-09 01:34:19,728 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 437 states and 676 transitions.
[2018-12-09 01:34:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 676 transitions.
[2018-12-09 01:34:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2018-12-09 01:34:20,118 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 437 states and 674 transitions.
[2018-12-09 01:34:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 674 transitions.
[2018-12-09 01:34:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-12-09 01:34:20,169 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-12-09 01:34:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 442 states and 683 transitions.
[2018-12-09 01:34:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 683 transitions.
[2018-12-09 01:34:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-12-09 01:34:20,497 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 453 states and 707 transitions.
[2018-12-09 01:34:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 707 transitions.
[2018-12-09 01:34:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-12-09 01:34:21,255 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 456 states and 717 transitions.
[2018-12-09 01:34:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 717 transitions.
[2018-12-09 01:34:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-12-09 01:34:21,385 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 456 states and 716 transitions.
[2018-12-09 01:34:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 716 transitions.
[2018-12-09 01:34:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-12-09 01:34:21,436 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 459 states and 726 transitions.
[2018-12-09 01:34:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 726 transitions.
[2018-12-09 01:34:21,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-12-09 01:34:21,583 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2018-12-09 01:34:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 461 states and 728 transitions.
[2018-12-09 01:34:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 728 transitions.
[2018-12-09 01:34:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-12-09 01:34:21,689 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 463 states and 731 transitions.
[2018-12-09 01:34:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 731 transitions.
[2018-12-09 01:34:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2018-12-09 01:34:21,821 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2018-12-09 01:34:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 465 states and 733 transitions.
[2018-12-09 01:34:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 733 transitions.
[2018-12-09 01:34:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-12-09 01:34:21,872 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 478 states and 762 transitions.
[2018-12-09 01:34:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 762 transitions.
[2018-12-09 01:34:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-12-09 01:34:22,016 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-12-09 01:34:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 484 states and 777 transitions.
[2018-12-09 01:34:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 777 transitions.
[2018-12-09 01:34:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-12-09 01:34:22,449 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 485 states and 778 transitions.
[2018-12-09 01:34:22,511 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 778 transitions.
[2018-12-09 01:34:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2018-12-09 01:34:22,512 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 486 states and 778 transitions.
[2018-12-09 01:34:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 778 transitions.
[2018-12-09 01:34:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2018-12-09 01:34:22,566 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 486 states and 777 transitions.
[2018-12-09 01:34:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 777 transitions.
[2018-12-09 01:34:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-12-09 01:34:22,618 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 488 states and 780 transitions.
[2018-12-09 01:34:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 780 transitions.
[2018-12-09 01:34:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2018-12-09 01:34:22,777 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-12-09 01:34:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 490 states and 783 transitions.
[2018-12-09 01:34:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 783 transitions.
[2018-12-09 01:34:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-12-09 01:34:22,814 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 490 states and 781 transitions.
[2018-12-09 01:34:22,846 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 781 transitions.
[2018-12-09 01:34:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2018-12-09 01:34:22,847 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-12-09 01:34:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 492 states and 784 transitions.
[2018-12-09 01:34:22,886 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 784 transitions.
[2018-12-09 01:34:22,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-12-09 01:34:22,887 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 494 states and 787 transitions.
[2018-12-09 01:34:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 787 transitions.
[2018-12-09 01:34:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-12-09 01:34:23,048 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 496 states and 790 transitions.
[2018-12-09 01:34:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 790 transitions.
[2018-12-09 01:34:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2018-12-09 01:34:23,284 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 505 states and 805 transitions.
[2018-12-09 01:34:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 805 transitions.
[2018-12-09 01:34:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-12-09 01:34:23,793 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2018-12-09 01:34:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 506 states and 809 transitions.
[2018-12-09 01:34:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 809 transitions.
[2018-12-09 01:34:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-12-09 01:34:24,019 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-12-09 01:34:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 509 states and 815 transitions.
[2018-12-09 01:34:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 815 transitions.
[2018-12-09 01:34:24,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-12-09 01:34:24,194 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2018-12-09 01:34:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 514 states and 828 transitions.
[2018-12-09 01:34:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 828 transitions.
[2018-12-09 01:34:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-12-09 01:34:24,379 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2018-12-09 01:34:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 519 states and 841 transitions.
[2018-12-09 01:34:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 841 transitions.
[2018-12-09 01:34:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2018-12-09 01:34:24,506 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 536 states and 873 transitions.
[2018-12-09 01:34:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 873 transitions.
[2018-12-09 01:34:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2018-12-09 01:34:26,721 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-12-09 01:34:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 537 states and 875 transitions.
[2018-12-09 01:34:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 875 transitions.
[2018-12-09 01:34:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2018-12-09 01:34:26,940 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-12-09 01:34:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 542 states and 885 transitions.
[2018-12-09 01:34:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 885 transitions.
[2018-12-09 01:34:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-12-09 01:34:27,576 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 544 states and 887 transitions.
[2018-12-09 01:34:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 887 transitions.
[2018-12-09 01:34:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-12-09 01:34:27,896 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2018-12-09 01:34:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 545 states and 888 transitions.
[2018-12-09 01:34:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 888 transitions.
[2018-12-09 01:34:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-12-09 01:34:27,937 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-12-09 01:34:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 546 states and 890 transitions.
[2018-12-09 01:34:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 890 transitions.
[2018-12-09 01:34:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2018-12-09 01:34:28,350 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 546 states and 889 transitions.
[2018-12-09 01:34:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 889 transitions.
[2018-12-09 01:34:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2018-12-09 01:34:28,379 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 549 states and 896 transitions.
[2018-12-09 01:34:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 896 transitions.
[2018-12-09 01:34:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-12-09 01:34:28,784 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2018-12-09 01:34:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 552 states and 902 transitions.
[2018-12-09 01:34:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions.
[2018-12-09 01:34:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2018-12-09 01:34:28,916 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-12-09 01:34:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 553 states and 904 transitions.
[2018-12-09 01:34:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 904 transitions.
[2018-12-09 01:34:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2018-12-09 01:34:29,283 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 553 states and 903 transitions.
[2018-12-09 01:34:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 903 transitions.
[2018-12-09 01:34:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-12-09 01:34:29,890 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 556 states and 906 transitions.
[2018-12-09 01:34:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 906 transitions.
[2018-12-09 01:34:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-12-09 01:34:29,953 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2018-12-09 01:34:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 558 states and 907 transitions.
[2018-12-09 01:34:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 907 transitions.
[2018-12-09 01:34:30,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2018-12-09 01:34:30,265 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:30,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 560 states and 909 transitions.
[2018-12-09 01:34:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 909 transitions.
[2018-12-09 01:34:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2018-12-09 01:34:30,614 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2018-12-09 01:34:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 561 states and 909 transitions.
[2018-12-09 01:34:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 909 transitions.
[2018-12-09 01:34:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2018-12-09 01:34:30,648 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-12-09 01:34:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 562 states and 910 transitions.
[2018-12-09 01:34:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 910 transitions.
[2018-12-09 01:34:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-12-09 01:34:31,131 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2018-12-09 01:34:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 563 states and 910 transitions.
[2018-12-09 01:34:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 910 transitions.
[2018-12-09 01:34:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2018-12-09 01:34:31,171 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-12-09 01:34:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 564 states and 912 transitions.
[2018-12-09 01:34:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 912 transitions.
[2018-12-09 01:34:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2018-12-09 01:34:31,644 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-12-09 01:34:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 572 states and 934 transitions.
[2018-12-09 01:34:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 934 transitions.
[2018-12-09 01:34:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-12-09 01:34:36,397 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 575 states and 940 transitions.
[2018-12-09 01:34:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 940 transitions.
[2018-12-09 01:34:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2018-12-09 01:34:37,022 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 577 states and 942 transitions.
[2018-12-09 01:34:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 942 transitions.
[2018-12-09 01:34:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2018-12-09 01:34:37,453 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2018-12-09 01:34:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 578 states and 943 transitions.
[2018-12-09 01:34:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 943 transitions.
[2018-12-09 01:34:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2018-12-09 01:34:37,497 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-12-09 01:34:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 579 states and 945 transitions.
[2018-12-09 01:34:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 945 transitions.
[2018-12-09 01:34:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2018-12-09 01:34:38,622 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-12-09 01:34:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 582 states and 949 transitions.
[2018-12-09 01:34:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 949 transitions.
[2018-12-09 01:34:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2018-12-09 01:34:40,718 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2018-12-09 01:34:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 584 states and 950 transitions.
[2018-12-09 01:34:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 950 transitions.
[2018-12-09 01:34:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-12-09 01:34:41,116 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-12-09 01:34:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 585 states and 951 transitions.
[2018-12-09 01:34:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 951 transitions.
[2018-12-09 01:34:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2018-12-09 01:34:42,219 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 587 states and 953 transitions.
[2018-12-09 01:34:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 953 transitions.
[2018-12-09 01:34:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2018-12-09 01:34:42,700 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-12-09 01:34:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 588 states and 954 transitions.
[2018-12-09 01:34:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 954 transitions.
[2018-12-09 01:34:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2018-12-09 01:34:43,242 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 591 states and 960 transitions.
[2018-12-09 01:34:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 960 transitions.
[2018-12-09 01:34:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2018-12-09 01:34:43,889 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2018-12-09 01:34:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 592 states and 961 transitions.
[2018-12-09 01:34:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 961 transitions.
[2018-12-09 01:34:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2018-12-09 01:34:44,838 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2018-12-09 01:34:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 594 states and 962 transitions.
[2018-12-09 01:34:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 962 transitions.
[2018-12-09 01:34:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2018-12-09 01:34:45,270 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 596 states and 964 transitions.
[2018-12-09 01:34:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 964 transitions.
[2018-12-09 01:34:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2018-12-09 01:34:45,766 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2018-12-09 01:34:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 597 states and 965 transitions.
[2018-12-09 01:34:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 965 transitions.
[2018-12-09 01:34:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2018-12-09 01:34:46,690 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 597 states and 964 transitions.
[2018-12-09 01:34:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 964 transitions.
[2018-12-09 01:34:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2018-12-09 01:34:48,158 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2018-12-09 01:34:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 598 states and 965 transitions.
[2018-12-09 01:34:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 965 transitions.
[2018-12-09 01:34:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2018-12-09 01:34:49,201 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-12-09 01:34:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 601 states and 971 transitions.
[2018-12-09 01:34:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 971 transitions.
[2018-12-09 01:34:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2018-12-09 01:34:49,926 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-12-09 01:34:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 603 states and 973 transitions.
[2018-12-09 01:34:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 973 transitions.
[2018-12-09 01:34:50,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2018-12-09 01:34:50,476 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-12-09 01:34:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2018-12-09 01:34:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:34:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 604 states and 974 transitions.
[2018-12-09 01:34:54,058 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 974 transitions.
[2018-12-09 01:34:54,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2018-12-09 01:34:54,059 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:34:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-12-09 01:34:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-12-09 01:34:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-12-09 01:34:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-12-09 01:34:54,962 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 98 iterations.
[2018-12-09 01:34:55,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 01:34:55 ImpRootNode
[2018-12-09 01:34:55,079 INFO L132 PluginConnector]: ------------------------ END CodeCheck----------------------------
[2018-12-09 01:34:55,079 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2018-12-09 01:34:55,079 INFO L271 PluginConnector]: Initializing Witness Printer...
[2018-12-09 01:34:55,079 INFO L276 PluginConnector]: Witness Printer initialized
[2018-12-09 01:34:55,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:34:17" (3/4) ...
[2018-12-09 01:34:55,082 INFO L147 WitnessPrinter]: No result that supports witness generation found
[2018-12-09 01:34:55,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-12-09 01:34:55,082 INFO L168 Benchmark]: Toolchain (without parser) took 64812.90 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 945.0 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 314.5 MB. Max. memory is 11.5 GB.
[2018-12-09 01:34:55,083 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-12-09 01:34:55,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1032.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 945.0 MB in the beginning and 926.9 MB in the end (delta: 18.1 MB). Peak memory consumption was 168.9 MB. Max. memory is 11.5 GB.
[2018-12-09 01:34:55,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.24 ms. Allocated memory is still 1.2 GB. Free memory was 926.9 MB in the beginning and 916.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2018-12-09 01:34:55,084 INFO L168 Benchmark]: Boogie Preprocessor took 63.33 ms. Allocated memory is still 1.2 GB. Free memory was 916.2 MB in the beginning and 902.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB.
[2018-12-09 01:34:55,084 INFO L168 Benchmark]: RCFGBuilder took 25595.16 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 902.8 MB in the beginning and 1.9 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB.
[2018-12-09 01:34:55,085 INFO L168 Benchmark]: CodeCheck took 38041.62 ms. Allocated memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 33.0 MB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -538.0 MB). There was no memory consumed. Max. memory is 11.5 GB.
[2018-12-09 01:34:55,085 INFO L168 Benchmark]: Witness Printer took 3.08 ms. Allocated memory is still 2.8 GB. Free memory is still 2.4 GB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-12-09 01:34:55,087 INFO L336 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, 422 locations, 1 error locations. UNSAFE Result, 37.8s OverallTime, 98 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -2132803456 SDtfs, -1369246168 SDslu, -1133029840 SDs, 0 SdLazy, 714522844 SolverSat, -1289212876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 65.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49800 GetRequests, 49265 SyntacticMatches, 165 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59073 ImplicationChecksByTransitivity, 30.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 5094 NumberOfCodeBlocks, 5094 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 4921 ConstructedInterpolants, 0 QuantifiedInterpolants, 483012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 77 PerfectInterpolantSequences, 674/958 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available
- UnprovableResult [Line: 6742]: 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 5131, overapproximation of bitwiseAnd at line 6091.
Possible FailurePath:
[L5137] static struct lock_class_key __key___7 ;
[L5138] static struct lock_class_key __key___8 ;
[L5278-L5291] 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'};
[L5292-L5311] 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'};
[L5312-L5317] 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'};
[L5318-L5320] 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}};
[L6235-L6275] 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};
[L6276-L6280] 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};
[L6531-L6549] 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};
[L6602] int LDV_IN_INTERRUPT ;
[L6603] static int res_ems_usb_open_10 ;
[L6604] static int res_ems_usb_close_12 ;
[L6605] static int res_ems_usb_probe_16 ;
[L6755] int ldv_urb_state = 0;
[L6756] int ldv_coherent_state = 0;
[L6607] struct net_device *var_group1 ;
[L6608] struct sk_buff *var_group2 ;
[L6609] struct usb_interface *var_group3 ;
[L6610] struct usb_device_id const *var_ems_usb_probe_16_p1 ;
[L6611] int tmp___7 ;
[L6612] int ldv_s_ems_usb_netdev_ops_net_device_ops ;
[L6613] int ldv_s_ems_usb_driver_usb_driver ;
[L6614] int tmp___8 ;
[L6615] int tmp___9 ;
[L6618] LDV_IN_INTERRUPT = 1
VAL [__key___7={82:0}, __key___8={138:0}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6620] CALL, EXPR ems_usb_init()
VAL [__key___7={82:0}, __key___8={138:0}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6553] int err ;
[L5128] int tmp___7 ;
[L5131] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb")
[L7012] return __VERIFIER_nondet_int();
[L5131] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb")
[L5133] return (tmp___7);
[L6557] err = usb_register(& ems_usb_driver)
[L6559] COND FALSE !(\read(err))
[L6566] return (0);
[L6620] RET, EXPR ems_usb_init()
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6620] tmp___7 = ems_usb_init()
[L6622] COND FALSE !(\read(tmp___7))
[L6626] ldv_s_ems_usb_netdev_ops_net_device_ops = 0
[L6627] ldv_s_ems_usb_driver_usb_driver = 0
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6629] COND TRUE 1
[L6632] tmp___9 = __VERIFIER_nondet_int()
[L6634] COND TRUE \read(tmp___9)
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6643] tmp___8 = __VERIFIER_nondet_int()
[L6645] COND FALSE !(tmp___8 == 0)
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6648] COND FALSE !(tmp___8 == 1)
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6651] COND TRUE tmp___8 == 2
[L6036] struct ems_usb *dev ;
[L6037] void *tmp___7 ;
[L6038] struct ems_tx_urb_context *context ;
[L6039] struct net_device_stats *stats ;
[L6040] struct can_frame *cf ;
[L6041] struct ems_cpc_msg *msg ;
[L6042] struct urb *urb ;
[L6043] u8 *buf ;
[L6044] int i ;
[L6045] int err ;
[L6046] size_t size ;
[L6047] int tmp___8 ;
[L6048] void *tmp___9 ;
[L6049] unsigned int tmp___10 ;
[L6050] int tmp___11 ;
[L6051] long tmp___12 ;
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6054] CALL, EXPR netdev_priv((struct net_device const *)netdev)
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, dev={0:-2659}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L4964] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL)));
[L6054] RET, EXPR netdev_priv((struct net_device const *)netdev)
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6054] tmp___7 = netdev_priv((struct net_device const *)netdev)
[L6055] dev = (struct ems_usb *)tmp___7
[L6056] context = (struct ems_tx_urb_context *)((void *)0)
[L6057] stats = & netdev->stats
[L6058] EXPR skb->data
[L6058] cf = (struct can_frame *)skb->data
[L6059] size = 15UL + sizeof(struct cpc_can_msg )
[L5240] struct can_frame const *cf ;
[L5241] int tmp___7 ;
[L5242] long tmp___8 ;
[L5244] EXPR skb->data
[L5244] cf = (struct can_frame const *)((struct can_frame *)skb->data)
[L5245] EXPR skb->len
[L5245] COND FALSE !((unsigned long )skb->len != sizeof(*cf))
[L5248] EXPR cf->can_dlc
[L5248] COND FALSE !((int const )cf->can_dlc > 8)
[L5251] tmp___7 = 0
[L5254] tmp___8 = __builtin_expect((long )tmp___7, 0L)
[L5256] COND FALSE !(\read(tmp___8))
[L5264] return (0);
[L6060] tmp___8 = can_dropped_invalid_skb(netdev, skb)
[L6062] COND FALSE !(\read(tmp___8))
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6067] CALL, EXPR usb_alloc_urb(0, 32U)
VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6818] void *arbitrary_memory ;
[L6819] void *tmp___7 ;
VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6822] COND TRUE 1
VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6825] CALL, EXPR ldv_undefined_pointer()
VAL [\old(ldv_urb_state)=0, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6969] CALL, EXPR external_alloc()
VAL [\old(ldv_urb_state)=0, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L7030] return __VERIFIER_nondet_pointer();
[L6969] RET, EXPR external_alloc()
VAL [\old(ldv_urb_state)=0, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158:0}, external_alloc()={186:-1}, 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]
[L6969] return (void *)external_alloc();
[L6825] RET, EXPR ldv_undefined_pointer()
VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={186:-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]
[L6825] tmp___7 = ldv_undefined_pointer()
[L6826] arbitrary_memory = tmp___7
[L6828] COND FALSE !(! arbitrary_memory)
[L6832] ldv_urb_state = ldv_urb_state + 1
[L6833] return ((struct urb *)arbitrary_memory);
VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=32, \result={186:-1}, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, arbitrary_memory={186:-1}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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={186:-1}]
[L6067] RET, EXPR usb_alloc_urb(0, 32U)
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6067] urb = usb_alloc_urb(0, 32U)
[L6069] COND FALSE !(! urb)
[L6077] EXPR dev->udev
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6077] 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={82:0}, __key___8={138:0}, __this_module={166:165}, dev={206:207}, dma={186:103}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6761] void *arbitrary_memory ;
[L6762] void *tmp___7 ;
VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, dev={206:207}, dev={206:207}, dma={186:103}, dma={186:103}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6765] COND TRUE 1
VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, dev={206:207}, dev={206:207}, dma={186:103}, dma={186:103}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6768] CALL, EXPR ldv_undefined_pointer()
VAL [\old(ldv_coherent_state)=0, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6969] CALL, EXPR external_alloc()
VAL [\old(ldv_coherent_state)=0, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L7030] return __VERIFIER_nondet_pointer();
[L6969] RET, EXPR external_alloc()
VAL [\old(ldv_coherent_state)=0, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158:0}, external_alloc()={0:-29}, 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]
[L6969] return (void *)external_alloc();
[L6768] RET, EXPR ldv_undefined_pointer()
VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, dev={206:207}, dev={206:207}, dma={186:103}, dma={186:103}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={0:-29}, 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]
[L6768] tmp___7 = ldv_undefined_pointer()
[L6769] arbitrary_memory = tmp___7
[L6771] COND FALSE !(! arbitrary_memory)
[L6775] ldv_coherent_state = ldv_coherent_state + 1
[L6776] return (arbitrary_memory);
VAL [\old(ldv_coherent_state)=0, \old(mem_flags)=32, \old(size)=28, \result={0:-29}, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, arbitrary_memory={0:-29}, dev={206:207}, dev={206:207}, dma={186:103}, dma={186:103}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=32, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0, size=28, tmp___7={0:-29}]
[L6077] RET, EXPR usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma)
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6077] tmp___9 = usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma)
[L6078] buf = (u8 *)tmp___9
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6080] COND FALSE !(! buf)
[L6088] msg = (struct ems_cpc_msg *)(buf + 4)
[L6089] EXPR cf->can_id
[L6089] msg->msg.can_msg.id = cf->can_id & 536870911U
[L6090] EXPR cf->can_dlc
[L6090] msg->msg.can_msg.length = cf->can_dlc
[L6091] EXPR cf->can_id
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6091] COND TRUE cf->can_id & 1073741824U
[L6092] EXPR cf->can_id
[L6092] COND TRUE cf->can_id & 2147483648U
[L6093] msg->type = (u8 )16
[L6097] msg->length = (u8 )5
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6120] EXPR msg->msg.can_msg.id
[L6120] msg->msg.can_msg.id = msg->msg.can_msg.id
[L6121] i = 0
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6123] COND TRUE 1
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6125] COND TRUE i < 10
[L6129] EXPR dev->tx_contexts[i].echo_index
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6129] COND TRUE dev->tx_contexts[i].echo_index == 10U
[L6130] context = & dev->tx_contexts[i]
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6139] COND TRUE ! context
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6141] FCALL usb_unanchor_urb(urb)
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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] EXPR dev->udev
[L6142] EXPR urb->transfer_dma
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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] CALL usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma)
VAL [\old(dma)=211, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, addr={0:-29}, dev={206:207}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6790] COND TRUE 1
VAL [\old(dma)=211, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, addr={0:-29}, addr={0:-29}, dev={206:207}, dev={206:207}, dma=211, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6792] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0)))
VAL [\old(dma)=211, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, addr={0:-29}, addr={0:-29}, dev={206:207}, dev={206:207}, dma=211, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6798] COND TRUE \read(*addr)
VAL [\old(dma)=211, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, addr={0:-29}, addr={0:-29}, dev={206:207}, dev={206:207}, dma=211, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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 ldv_coherent_state >= 1
VAL [\old(dma)=211, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, addr={0:-29}, addr={0:-29}, dev={206:207}, dev={206:207}, dma=211, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6805] ldv_coherent_state = ldv_coherent_state - 1
VAL [\old(dma)=211, \old(ldv_coherent_state)=1, \old(size)=28, __key___7={82:0}, __key___8={138:0}, __this_module={166:165}, addr={0:-29}, addr={0:-29}, dev={206:207}, dev={206:207}, dma=211, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6142] RET usb_free_coherent(dev->udev, size, (void *)buf, urb->transfer_dma)
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6143] netdev->dev.parent
[L6145] return ((netdev_tx_t )16);
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6629] COND TRUE 1
[L6632] tmp___9 = __VERIFIER_nondet_int()
[L6634] COND FALSE !(\read(tmp___9))
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6636] COND FALSE !(! (ldv_s_ems_usb_netdev_ops_net_device_ops == 0))
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6638] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0))
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6730] FCALL ems_usb_exit()
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6877] COND FALSE !(ldv_urb_state == 0)
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6880] CALL ldv_blast_assert()
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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]
[L6742] __VERIFIER_error()
VAL [__key___7={82:0}, __key___8={138:0}, __this_module={166:165}, ems_usb_bittiming_const={93:0}, ems_usb_driver={162:0}, ems_usb_netdev_ops={73:0}, ems_usb_table={158: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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB.
* CACSL2BoogieTranslator took 1032.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 945.0 MB in the beginning and 926.9 MB in the end (delta: 18.1 MB). Peak memory consumption was 168.9 MB. Max. memory is 11.5 GB.
* Boogie Procedure Inliner took 74.24 ms. Allocated memory is still 1.2 GB. Free memory was 926.9 MB in the beginning and 916.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 63.33 ms. Allocated memory is still 1.2 GB. Free memory was 916.2 MB in the beginning and 902.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB.
* RCFGBuilder took 25595.16 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 902.8 MB in the beginning and 1.9 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB.
* CodeCheck took 38041.62 ms. Allocated memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 33.0 MB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -538.0 MB). There was no memory consumed. Max. memory is 11.5 GB.
* Witness Printer took 3.08 ms. Allocated memory is still 2.8 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: unable to determine feasibility of some traces
Received shutdown request...
### Bit-precise run ###
This is Ultimate 0.1.23-635dfa2
[2018-12-09 01:34:56,369 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-12-09 01:34:56,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-12-09 01:34:56,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-12-09 01:34:56,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-12-09 01:34:56,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-12-09 01:34:56,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-12-09 01:34:56,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-12-09 01:34:56,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-12-09 01:34:56,379 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-12-09 01:34:56,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-12-09 01:34:56,380 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-12-09 01:34:56,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-12-09 01:34:56,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-12-09 01:34:56,381 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-12-09 01:34:56,382 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-12-09 01:34:56,382 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-12-09 01:34:56,383 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-12-09 01:34:56,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-12-09 01:34:56,385 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-12-09 01:34:56,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-12-09 01:34:56,386 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-12-09 01:34:56,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-12-09 01:34:56,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-12-09 01:34:56,387 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-12-09 01:34:56,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-12-09 01:34:56,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-12-09 01:34:56,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-12-09 01:34:56,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-12-09 01:34:56,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-12-09 01:34:56,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-12-09 01:34:56,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-12-09 01:34:56,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-12-09 01:34:56,390 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2018-12-09 01:34:56,390 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-12-09 01:34:56,391 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-12-09 01:34:56,391 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf
[2018-12-09 01:34:56,398 INFO L110 SettingsManager]: Loading preferences was successful
[2018-12-09 01:34:56,398 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-12-09 01:34:56,399 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-12-09 01:34:56,399 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS
[2018-12-09 01:34:56,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-12-09 01:34:56,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-12-09 01:34:56,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-12-09 01:34:56,399 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-12-09 01:34:56,399 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2018-12-09 01:34:56,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-12-09 01:34:56,399 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2018-12-09 01:34:56,400 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true
[2018-12-09 01:34:56,400 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2018-12-09 01:34:56,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false
[2018-12-09 01:34:56,400 INFO L133 SettingsManager]: * Use constant arrays=true
[2018-12-09 01:34:56,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2018-12-09 01:34:56,400 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults:
[2018-12-09 01:34:56,400 INFO L133 SettingsManager]: * Timeout in seconds=1000000
[2018-12-09 01:34:56,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-12-09 01:34:56,400 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-12-09 01:34:56,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000
[2018-12-09 01:34:56,400 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-12-09 01:34:56,400 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-12-09 01:34:56,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-12-09 01:34:56,401 INFO L133 SettingsManager]: * Use separate solver for trace checks=false
[2018-12-09 01:34:56,401 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS
[2018-12-09 01:34:56,401 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-12-09 01:34:56,401 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt
[2018-12-09 01:34:56,401 INFO L133 SettingsManager]: * Logic for external solver=AUFBV
[2018-12-09 01:34:56,401 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-12-09 01:34:56,401 INFO L133 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/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/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 -> df5576f7e7a8cefe027103c7c7ef877e0a55917f
[2018-12-09 01:34:56,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-12-09 01:34:56,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-12-09 01:34:56,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-12-09 01:34:56,428 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-12-09 01:34:56,429 INFO L276 PluginConnector]: CDTParser initialized
[2018-12-09 01:34:56,429 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko_false-unreach-call.cil.out.i
[2018-12-09 01:34:56,463 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/data/d91b2804b/31f99e7eb0cc4e1081a8c43032b8c1d5/FLAGdee0f7112
[2018-12-09 01:34:56,994 INFO L307 CDTParser]: Found 1 translation units.
[2018-12-09 01:34:56,994 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko_false-unreach-call.cil.out.i
[2018-12-09 01:34:57,010 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/data/d91b2804b/31f99e7eb0cc4e1081a8c43032b8c1d5/FLAGdee0f7112
[2018-12-09 01:34:57,497 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/ukojak/data/d91b2804b/31f99e7eb0cc4e1081a8c43032b8c1d5
[2018-12-09 01:34:57,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-12-09 01:34:57,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2018-12-09 01:34:57,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-12-09 01:34:57,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-12-09 01:34:57,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-12-09 01:34:57,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:34:57" (1/1) ...
[2018-12-09 01:34:57,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e62c4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:57, skipping insertion in model container
[2018-12-09 01:34:57,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:34:57" (1/1) ...
[2018-12-09 01:34:57,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2018-12-09 01:34:57,555 INFO L176 MainTranslator]: Built tables and reachable declarations
[2018-12-09 01:34:58,312 INFO L203 PostProcessor]: Analyzing one entry point: main
[2018-12-09 01:34:58,338 INFO L191 MainTranslator]: Completed pre-run
[2018-12-09 01:34:58,501 INFO L203 PostProcessor]: Analyzing one entry point: main
[2018-12-09 01:34:58,617 INFO L195 MainTranslator]: Completed translation
[2018-12-09 01:34:58,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:58 WrapperNode
[2018-12-09 01:34:58,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-12-09 01:34:58,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-12-09 01:34:58,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-12-09 01:34:58,618 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2018-12-09 01:34:58,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:58" (1/1) ...
[2018-12-09 01:34:58,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:58" (1/1) ...
[2018-12-09 01:34:58,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-12-09 01:34:58,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-12-09 01:34:58,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-12-09 01:34:58,722 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-12-09 01:34:58,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:58" (1/1) ...
[2018-12-09 01:34:58,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:58" (1/1) ...
[2018-12-09 01:34:58,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:58" (1/1) ...
[2018-12-09 01:34:58,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:58" (1/1) ...
[2018-12-09 01:34:58,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:58" (1/1) ...
[2018-12-09 01:34:58,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:58" (1/1) ...
[2018-12-09 01:34:58,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:58" (1/1) ...
[2018-12-09 01:34:58,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-12-09 01:34:58,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-12-09 01:34:58,810 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-12-09 01:34:58,810 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-12-09 01:34:58,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:58" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93fb7446-0345-4dba-b377-95e9561f044d/bin-2019/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
[2018-12-09 01:34:58,854 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set
[2018-12-09 01:34:58,855 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set
[2018-12-09 01:34:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1
[2018-12-09 01:34:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init
[2018-12-09 01:34:58,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init
[2018-12-09 01:34:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb
[2018-12-09 01:34:58,855 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb
[2018-12-09 01:34:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8
[2018-12-09 01:34:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-12-09 01:34:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2018-12-09 01:34:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$
[2018-12-09 01:34:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$
[2018-12-09 01:34:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc
[2018-12-09 01:34:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc
[2018-12-09 01:34:58,857 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue
[2018-12-09 01:34:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue
[2018-12-09 01:34:58,857 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd
[2018-12-09 01:34:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd
[2018-12-09 01:34:58,857 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe
[2018-12-09 01:34:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe
[2018-12-09 01:34:58,858 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit
[2018-12-09 01:34:58,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit
[2018-12-09 01:34:58,858 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs
[2018-12-09 01:34:58,858 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs
[2018-12-09 01:34:58,858 INFO L130 BoogieDeclarations]: Found specification of procedure kfree
[2018-12-09 01:34:58,858 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree
[2018-12-09 01:34:58,858 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor
[2018-12-09 01:34:58,858 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor
[2018-12-09 01:34:58,859 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb
[2018-12-09 01:34:58,859 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb
[2018-12-09 01:34:58,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop
[2018-12-09 01:34:58,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop
[2018-12-09 01:34:58,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4
[2018-12-09 01:34:58,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2
[2018-12-09 01:34:58,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1
[2018-12-09 01:34:58,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8
[2018-12-09 01:34:58,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value
[2018-12-09 01:34:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value
[2018-12-09 01:34:58,860 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue
[2018-12-09 01:34:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue
[2018-12-09 01:34:58,860 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg
[2018-12-09 01:34:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg
[2018-12-09 01:34:58,860 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs
[2018-12-09 01:34:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs
[2018-12-09 01:34:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb
[2018-12-09 01:34:58,861 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb
[2018-12-09 01:34:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-12-09 01:34:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8
[2018-12-09 01:34:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode
[2018-12-09 01:34:58,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode
[2018-12-09 01:34:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2
[2018-12-09 01:34:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4
[2018-12-09 01:34:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent
[2018-12-09 01:34:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent
[2018-12-09 01:34:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent
[2018-12-09 01:34:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent
[2018-12-09 01:34:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-12-09 01:34:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec
[2018-12-09 01:34:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec
[2018-12-09 01:34:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb
[2018-12-09 01:34:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb
[2018-12-09 01:34:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb
[2018-12-09 01:34:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb
[2018-12-09 01:34:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8
[2018-12-09 01:34:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1
[2018-12-09 01:34:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert
[2018-12-09 01:34:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert
[2018-12-09 01:34:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-12-09 01:34:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2018-12-09 01:34:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2018-12-09 01:34:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2
[2018-12-09 01:34:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2018-12-09 01:34:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4
[2018-12-09 01:34:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8
[2018-12-09 01:34:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc
[2018-12-09 01:34:58,865 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc
[2018-12-09 01:34:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach
[2018-12-09 01:34:58,865 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach
[2018-12-09 01:34:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv
[2018-12-09 01:34:58,865 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv
[2018-12-09 01:34:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb
[2018-12-09 01:34:58,865 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb
[2018-12-09 01:34:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata
[2018-12-09 01:34:58,865 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata
[2018-12-09 01:34:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue
[2018-12-09 01:34:58,866 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue
[2018-12-09 01:34:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer
[2018-12-09 01:34:58,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer
[2018-12-09 01:34:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev
[2018-12-09 01:34:58,866 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev
[2018-12-09 01:34:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1
[2018-12-09 01:34:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev
[2018-12-09 01:34:58,867 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev
[2018-12-09 01:34:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb
[2018-12-09 01:34:58,867 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb
[2018-12-09 01:34:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-12-09 01:34:58,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-12-09 01:35:01,964 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code
[2018-12-09 01:35:01,964 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2018-12-09 01:36:47,633 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-12-09 01:36:47,634 INFO L280 CfgBuilder]: Removed 100 assue(true) statements.
[2018-12-09 01:36:47,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:36:47 BoogieIcfgContainer
[2018-12-09 01:36:47,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-12-09 01:36:47,634 INFO L113 PluginConnector]: ------------------------CodeCheck----------------------------
[2018-12-09 01:36:47,634 INFO L271 PluginConnector]: Initializing CodeCheck...
[2018-12-09 01:36:47,641 INFO L276 PluginConnector]: CodeCheck initialized
[2018-12-09 01:36:47,641 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:36:47" (1/1) ...
[2018-12-09 01:36:47,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-12-09 01:36:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available
[2018-12-09 01:36:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 326 states and 455 transitions.
[2018-12-09 01:36:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 455 transitions.
[2018-12-09 01:36:47,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-12-09 01:36:47,683 INFO L431 CodeCheckObserver]: Error Path is FOUND.
[2018-12-09 01:36:47,710 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception:
java.lang.IllegalArgumentException: Indexed Sort BitVec undefined
at de.uni_freiburg.informatik.ultimate.logic.SortSymbol.checkArity(SortSymbol.java:153)
at de.uni_freiburg.informatik.ultimate.logic.SortSymbol.getSort(SortSymbol.java:177)
at de.uni_freiburg.informatik.ultimate.logic.Theory.getSort(Theory.java:1243)
at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:287)
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.TermTransferrer.transferSort(TermTransferrer.java:128)
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.TermTransferrer.convertApplicationTerm(TermTransferrer.java:162)
at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:320)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113)
at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253)
at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.SmtSymbols.transferSymbols(SmtSymbols.java:129)
at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:453)
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)
[2018-12-09 01:36:47,712 INFO L168 Benchmark]: Toolchain (without parser) took 110213.56 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 932.5 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 498.9 MB. Max. memory is 11.5 GB.
[2018-12-09 01:36:47,714 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-12-09 01:36:47,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1117.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 932.5 MB in the beginning and 941.0 MB in the end (delta: -8.5 MB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB.
[2018-12-09 01:36:47,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.18 ms. Allocated memory is still 1.2 GB. Free memory was 941.0 MB in the beginning and 924.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB.
[2018-12-09 01:36:47,715 INFO L168 Benchmark]: Boogie Preprocessor took 87.37 ms. Allocated memory is still 1.2 GB. Free memory was 924.9 MB in the beginning and 914.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2018-12-09 01:36:47,716 INFO L168 Benchmark]: RCFGBuilder took 108824.23 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 914.2 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB.
[2018-12-09 01:36:47,716 INFO L168 Benchmark]: CodeCheck took 77.75 ms. Allocated memory is still 3.0 GB. Free memory is still 2.4 GB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-12-09 01:36:47,719 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck:
- ExceptionOrErrorResult: IllegalArgumentException: Indexed Sort BitVec undefined
de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: IllegalArgumentException: Indexed Sort BitVec undefined: de.uni_freiburg.informatik.ultimate.logic.SortSymbol.checkArity(SortSymbol.java:153)
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB.
* CACSL2BoogieTranslator took 1117.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 932.5 MB in the beginning and 941.0 MB in the end (delta: -8.5 MB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB.
* Boogie Procedure Inliner took 104.18 ms. Allocated memory is still 1.2 GB. Free memory was 941.0 MB in the beginning and 924.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB.
* Boogie Preprocessor took 87.37 ms. Allocated memory is still 1.2 GB. Free memory was 924.9 MB in the beginning and 914.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
* RCFGBuilder took 108824.23 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 914.2 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB.
* CodeCheck took 77.75 ms. Allocated memory is still 3.0 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.
Received shutdown request...