./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-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_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6b79800b0012dbc4aca68e544b1d0e24c4a91e91 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 05:23:03,186 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:23:03,187 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:23:03,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:23:03,193 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:23:03,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:23:03,194 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:23:03,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:23:03,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:23:03,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:23:03,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:23:03,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:23:03,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:23:03,198 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:23:03,199 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:23:03,199 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:23:03,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:23:03,200 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:23:03,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:23:03,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:23:03,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:23:03,203 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:23:03,204 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:23:03,204 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:23:03,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:23:03,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:23:03,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:23:03,206 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:23:03,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:23:03,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:23:03,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:23:03,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:23:03,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:23:03,207 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:23:03,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:23:03,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:23:03,208 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2018-12-09 05:23:03,215 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:23:03,215 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:23:03,216 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:23:03,216 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:23:03,216 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:23:03,216 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:23:03,216 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 05:23:03,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:23:03,216 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:23:03,217 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:23:03,217 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:23:03,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:23:03,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:23:03,217 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:23:03,217 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:23:03,217 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:23:03,217 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:23:03,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:23:03,218 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:23:03,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:23:03,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:23:03,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:23:03,218 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:23:03,218 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:23:03,218 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 05:23:03,218 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:23:03,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:23:03,219 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 05:23:03,219 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_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b79800b0012dbc4aca68e544b1d0e24c4a91e91 [2018-12-09 05:23:03,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:23:03,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:23:03,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:23:03,250 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:23:03,250 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:23:03,250 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i [2018-12-09 05:23:03,294 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/data/0b6b52d36/6bb925f2dc8c4e2099b5830444001bad/FLAG53076970f [2018-12-09 05:23:03,715 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:23:03,716 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i [2018-12-09 05:23:03,728 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/data/0b6b52d36/6bb925f2dc8c4e2099b5830444001bad/FLAG53076970f [2018-12-09 05:23:04,048 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/data/0b6b52d36/6bb925f2dc8c4e2099b5830444001bad [2018-12-09 05:23:04,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:23:04,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:23:04,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:23:04,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:23:04,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:23:04,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:23:04" (1/1) ... [2018-12-09 05:23:04,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2497f548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04, skipping insertion in model container [2018-12-09 05:23:04,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:23:04" (1/1) ... [2018-12-09 05:23:04,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:23:04,189 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:23:04,612 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:23:04,627 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:23:04,704 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:23:04,727 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:23:04,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04 WrapperNode [2018-12-09 05:23:04,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:23:04,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:23:04,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:23:04,728 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:23:04,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04" (1/1) ... [2018-12-09 05:23:04,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04" (1/1) ... [2018-12-09 05:23:04,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:23:04,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:23:04,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:23:04,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:23:04,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04" (1/1) ... [2018-12-09 05:23:04,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04" (1/1) ... [2018-12-09 05:23:04,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04" (1/1) ... [2018-12-09 05:23:04,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04" (1/1) ... [2018-12-09 05:23:04,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04" (1/1) ... [2018-12-09 05:23:04,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04" (1/1) ... [2018-12-09 05:23:04,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04" (1/1) ... [2018-12-09 05:23:04,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:23:04,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:23:04,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:23:04,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:23:04,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:23:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2018-12-09 05:23:04,840 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2018-12-09 05:23:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-12-09 05:23:04,840 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2018-12-09 05:23:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2018-12-09 05:23:04,840 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2018-12-09 05:23:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-12-09 05:23:04,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2018-12-09 05:23:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 05:23:04,841 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 05:23:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-12-09 05:23:04,841 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-12-09 05:23:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 05:23:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2018-12-09 05:23:04,842 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2018-12-09 05:23:04,842 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2018-12-09 05:23:04,842 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2018-12-09 05:23:04,842 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2018-12-09 05:23:04,842 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2018-12-09 05:23:04,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:23:04,842 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-12-09 05:23:04,842 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-12-09 05:23:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-12-09 05:23:04,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-12-09 05:23:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 05:23:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2018-12-09 05:23:04,843 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2018-12-09 05:23:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2018-12-09 05:23:04,843 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2018-12-09 05:23:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-12-09 05:23:04,843 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-12-09 05:23:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 05:23:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2018-12-09 05:23:04,844 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2018-12-09 05:23:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2018-12-09 05:23:04,844 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2018-12-09 05:23:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-12-09 05:23:04,844 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-12-09 05:23:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-12-09 05:23:04,844 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-12-09 05:23:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-12-09 05:23:04,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-12-09 05:23:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-12-09 05:23:04,845 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-12-09 05:23:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-12-09 05:23:04,845 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-12-09 05:23:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-12-09 05:23:04,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-12-09 05:23:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 05:23:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-12-09 05:23:04,846 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2018-12-09 05:23:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-12-09 05:23:04,846 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-12-09 05:23:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 05:23:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2018-12-09 05:23:04,846 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2018-12-09 05:23:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-12-09 05:23:04,846 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2018-12-09 05:23:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2018-12-09 05:23:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2018-12-09 05:23:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 05:23:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-12-09 05:23:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-12-09 05:23:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-12-09 05:23:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-12-09 05:23:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-12-09 05:23:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-12-09 05:23:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-12-09 05:23:04,848 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-12-09 05:23:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2018-12-09 05:23:04,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2018-12-09 05:23:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-12-09 05:23:04,848 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-12-09 05:23:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2018-12-09 05:23:04,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2018-12-09 05:23:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 05:23:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-12-09 05:23:04,849 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-12-09 05:23:04,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 05:23:04,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 05:23:04,849 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-12-09 05:23:04,849 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-12-09 05:23:04,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-12-09 05:23:04,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-12-09 05:23:04,849 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-12-09 05:23:04,849 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-12-09 05:23:04,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:23:04,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:23:04,850 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2018-12-09 05:23:04,850 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2018-12-09 05:23:05,062 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 05:23:05,062 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 05:23:05,490 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:23:05,490 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 05:23:05,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:23:05 BoogieIcfgContainer [2018-12-09 05:23:05,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:23:05,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:23:05,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:23:05,494 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:23:05,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:23:04" (1/3) ... [2018-12-09 05:23:05,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7be6b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:23:05, skipping insertion in model container [2018-12-09 05:23:05,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:23:04" (2/3) ... [2018-12-09 05:23:05,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7be6b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:23:05, skipping insertion in model container [2018-12-09 05:23:05,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:23:05" (3/3) ... [2018-12-09 05:23:05,497 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i [2018-12-09 05:23:05,505 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:23:05,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 05:23:05,525 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 05:23:05,548 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 05:23:05,549 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:23:05,549 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:23:05,549 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:23:05,549 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:23:05,549 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:23:05,549 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:23:05,549 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:23:05,549 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:23:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states. [2018-12-09 05:23:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 05:23:05,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:05,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:05,569 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:05,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:05,572 INFO L82 PathProgramCache]: Analyzing trace with hash -607468786, now seen corresponding path program 1 times [2018-12-09 05:23:05,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:05,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:05,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:05,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:05,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:05,784 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 05:23:05,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:05,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:23:05,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:23:05,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:23:05,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:05,803 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 3 states. [2018-12-09 05:23:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:05,887 INFO L93 Difference]: Finished difference Result 686 states and 853 transitions. [2018-12-09 05:23:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:23:05,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 05:23:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:05,898 INFO L225 Difference]: With dead ends: 686 [2018-12-09 05:23:05,898 INFO L226 Difference]: Without dead ends: 447 [2018-12-09 05:23:05,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:05,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-09 05:23:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2018-12-09 05:23:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-12-09 05:23:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 510 transitions. [2018-12-09 05:23:05,950 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 510 transitions. Word has length 31 [2018-12-09 05:23:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:05,951 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 510 transitions. [2018-12-09 05:23:05,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:23:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 510 transitions. [2018-12-09 05:23:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 05:23:05,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:05,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:05,952 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:05,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1651841249, now seen corresponding path program 1 times [2018-12-09 05:23:05,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:05,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:05,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:06,008 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 05:23:06,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:06,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:23:06,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:23:06,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:23:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:06,010 INFO L87 Difference]: Start difference. First operand 443 states and 510 transitions. Second operand 3 states. [2018-12-09 05:23:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:06,041 INFO L93 Difference]: Finished difference Result 1272 states and 1483 transitions. [2018-12-09 05:23:06,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:23:06,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 05:23:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:06,045 INFO L225 Difference]: With dead ends: 1272 [2018-12-09 05:23:06,045 INFO L226 Difference]: Without dead ends: 846 [2018-12-09 05:23:06,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-12-09 05:23:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 839. [2018-12-09 05:23:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-12-09 05:23:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 971 transitions. [2018-12-09 05:23:06,081 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 971 transitions. Word has length 32 [2018-12-09 05:23:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:06,082 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 971 transitions. [2018-12-09 05:23:06,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:23:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 971 transitions. [2018-12-09 05:23:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 05:23:06,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:06,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:06,084 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:06,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:06,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1156961390, now seen corresponding path program 1 times [2018-12-09 05:23:06,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:06,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:06,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:06,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:06,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:06,157 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 05:23:06,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:06,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:06,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:06,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:06,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:06,158 INFO L87 Difference]: Start difference. First operand 839 states and 971 transitions. Second operand 6 states. [2018-12-09 05:23:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:06,210 INFO L93 Difference]: Finished difference Result 1656 states and 1919 transitions. [2018-12-09 05:23:06,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:23:06,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-09 05:23:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:06,215 INFO L225 Difference]: With dead ends: 1656 [2018-12-09 05:23:06,215 INFO L226 Difference]: Without dead ends: 839 [2018-12-09 05:23:06,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:06,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-09 05:23:06,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2018-12-09 05:23:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-12-09 05:23:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 970 transitions. [2018-12-09 05:23:06,259 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 970 transitions. Word has length 74 [2018-12-09 05:23:06,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:06,259 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 970 transitions. [2018-12-09 05:23:06,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:06,259 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 970 transitions. [2018-12-09 05:23:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 05:23:06,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:06,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:06,261 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:06,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:06,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1600862064, now seen corresponding path program 1 times [2018-12-09 05:23:06,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:06,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:06,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:06,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:06,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:06,339 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 05:23:06,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:06,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:23:06,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:23:06,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:23:06,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:06,340 INFO L87 Difference]: Start difference. First operand 839 states and 970 transitions. Second operand 3 states. [2018-12-09 05:23:06,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:06,389 INFO L93 Difference]: Finished difference Result 1687 states and 1972 transitions. [2018-12-09 05:23:06,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:23:06,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-09 05:23:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:06,393 INFO L225 Difference]: With dead ends: 1687 [2018-12-09 05:23:06,393 INFO L226 Difference]: Without dead ends: 874 [2018-12-09 05:23:06,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-12-09 05:23:06,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2018-12-09 05:23:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-12-09 05:23:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1016 transitions. [2018-12-09 05:23:06,425 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1016 transitions. Word has length 74 [2018-12-09 05:23:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:06,426 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1016 transitions. [2018-12-09 05:23:06,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:23:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1016 transitions. [2018-12-09 05:23:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-09 05:23:06,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:06,428 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:06,428 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:06,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:06,429 INFO L82 PathProgramCache]: Analyzing trace with hash -460571464, now seen corresponding path program 1 times [2018-12-09 05:23:06,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:06,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:06,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:06,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:06,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 05:23:06,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:06,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:23:06,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:06,557 INFO L87 Difference]: Start difference. First operand 874 states and 1016 transitions. Second operand 5 states. [2018-12-09 05:23:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:06,592 INFO L93 Difference]: Finished difference Result 1449 states and 1689 transitions. [2018-12-09 05:23:06,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:23:06,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-12-09 05:23:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:06,595 INFO L225 Difference]: With dead ends: 1449 [2018-12-09 05:23:06,595 INFO L226 Difference]: Without dead ends: 602 [2018-12-09 05:23:06,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-12-09 05:23:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2018-12-09 05:23:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-09 05:23:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 692 transitions. [2018-12-09 05:23:06,613 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 692 transitions. Word has length 129 [2018-12-09 05:23:06,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:06,613 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 692 transitions. [2018-12-09 05:23:06,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 692 transitions. [2018-12-09 05:23:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-09 05:23:06,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:06,615 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:06,615 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:06,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash -109771527, now seen corresponding path program 1 times [2018-12-09 05:23:06,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:06,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:06,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:06,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 05:23:06,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:06,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:06,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:06,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:06,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:06,699 INFO L87 Difference]: Start difference. First operand 602 states and 692 transitions. Second operand 6 states. [2018-12-09 05:23:07,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:07,386 INFO L93 Difference]: Finished difference Result 1093 states and 1279 transitions. [2018-12-09 05:23:07,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:23:07,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-12-09 05:23:07,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:07,389 INFO L225 Difference]: With dead ends: 1093 [2018-12-09 05:23:07,389 INFO L226 Difference]: Without dead ends: 1090 [2018-12-09 05:23:07,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:23:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-12-09 05:23:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1051. [2018-12-09 05:23:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2018-12-09 05:23:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1236 transitions. [2018-12-09 05:23:07,421 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1236 transitions. Word has length 129 [2018-12-09 05:23:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:07,422 INFO L480 AbstractCegarLoop]: Abstraction has 1051 states and 1236 transitions. [2018-12-09 05:23:07,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1236 transitions. [2018-12-09 05:23:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 05:23:07,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:07,423 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:07,424 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:07,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:07,424 INFO L82 PathProgramCache]: Analyzing trace with hash 861966409, now seen corresponding path program 1 times [2018-12-09 05:23:07,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:07,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:07,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:07,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:07,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 05:23:07,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:07,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:23:07,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:07,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:07,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:07,521 INFO L87 Difference]: Start difference. First operand 1051 states and 1236 transitions. Second operand 5 states. [2018-12-09 05:23:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:07,563 INFO L93 Difference]: Finished difference Result 1939 states and 2291 transitions. [2018-12-09 05:23:07,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:23:07,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-12-09 05:23:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:07,566 INFO L225 Difference]: With dead ends: 1939 [2018-12-09 05:23:07,566 INFO L226 Difference]: Without dead ends: 1048 [2018-12-09 05:23:07,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-12-09 05:23:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2018-12-09 05:23:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-12-09 05:23:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1227 transitions. [2018-12-09 05:23:07,600 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1227 transitions. Word has length 132 [2018-12-09 05:23:07,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:07,601 INFO L480 AbstractCegarLoop]: Abstraction has 1048 states and 1227 transitions. [2018-12-09 05:23:07,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1227 transitions. [2018-12-09 05:23:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 05:23:07,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:07,602 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:07,603 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:07,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:07,603 INFO L82 PathProgramCache]: Analyzing trace with hash 863101515, now seen corresponding path program 1 times [2018-12-09 05:23:07,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:07,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:07,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:07,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:07,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:07,690 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 05:23:07,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:07,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:07,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:07,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:07,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:07,691 INFO L87 Difference]: Start difference. First operand 1048 states and 1227 transitions. Second operand 6 states. [2018-12-09 05:23:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:07,779 INFO L93 Difference]: Finished difference Result 2091 states and 2469 transitions. [2018-12-09 05:23:07,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:23:07,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-12-09 05:23:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:07,784 INFO L225 Difference]: With dead ends: 2091 [2018-12-09 05:23:07,784 INFO L226 Difference]: Without dead ends: 1049 [2018-12-09 05:23:07,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-12-09 05:23:07,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1014. [2018-12-09 05:23:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-12-09 05:23:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1206 transitions. [2018-12-09 05:23:07,835 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1206 transitions. Word has length 149 [2018-12-09 05:23:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:07,836 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1206 transitions. [2018-12-09 05:23:07,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1206 transitions. [2018-12-09 05:23:07,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 05:23:07,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:07,838 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:07,838 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:07,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:07,838 INFO L82 PathProgramCache]: Analyzing trace with hash -621751126, now seen corresponding path program 1 times [2018-12-09 05:23:07,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:07,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:07,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:07,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:07,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 05:23:07,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:07,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:23:07,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:23:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:23:07,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:07,949 INFO L87 Difference]: Start difference. First operand 1014 states and 1206 transitions. Second operand 3 states. [2018-12-09 05:23:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:07,978 INFO L93 Difference]: Finished difference Result 1886 states and 2260 transitions. [2018-12-09 05:23:07,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:23:07,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2018-12-09 05:23:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:07,981 INFO L225 Difference]: With dead ends: 1886 [2018-12-09 05:23:07,981 INFO L226 Difference]: Without dead ends: 952 [2018-12-09 05:23:07,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-12-09 05:23:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2018-12-09 05:23:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-12-09 05:23:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1111 transitions. [2018-12-09 05:23:08,009 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1111 transitions. Word has length 157 [2018-12-09 05:23:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:08,009 INFO L480 AbstractCegarLoop]: Abstraction has 952 states and 1111 transitions. [2018-12-09 05:23:08,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:23:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1111 transitions. [2018-12-09 05:23:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 05:23:08,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:08,010 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:08,010 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:08,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:08,011 INFO L82 PathProgramCache]: Analyzing trace with hash -507611057, now seen corresponding path program 1 times [2018-12-09 05:23:08,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:08,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:08,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:08,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:08,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 05:23:08,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:08,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:23:08,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:08,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:08,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:08,095 INFO L87 Difference]: Start difference. First operand 952 states and 1111 transitions. Second operand 5 states. [2018-12-09 05:23:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:08,123 INFO L93 Difference]: Finished difference Result 1010 states and 1174 transitions. [2018-12-09 05:23:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:23:08,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-12-09 05:23:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:08,126 INFO L225 Difference]: With dead ends: 1010 [2018-12-09 05:23:08,126 INFO L226 Difference]: Without dead ends: 960 [2018-12-09 05:23:08,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2018-12-09 05:23:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2018-12-09 05:23:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-12-09 05:23:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1116 transitions. [2018-12-09 05:23:08,151 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1116 transitions. Word has length 159 [2018-12-09 05:23:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:08,151 INFO L480 AbstractCegarLoop]: Abstraction has 960 states and 1116 transitions. [2018-12-09 05:23:08,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1116 transitions. [2018-12-09 05:23:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-09 05:23:08,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:08,152 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:08,152 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:08,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:08,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1150478467, now seen corresponding path program 1 times [2018-12-09 05:23:08,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:08,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:08,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 05:23:08,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:08,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 05:23:08,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 05:23:08,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 05:23:08,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:23:08,292 INFO L87 Difference]: Start difference. First operand 960 states and 1116 transitions. Second operand 8 states. [2018-12-09 05:23:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:09,164 INFO L93 Difference]: Finished difference Result 1909 states and 2322 transitions. [2018-12-09 05:23:09,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 05:23:09,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 160 [2018-12-09 05:23:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:09,169 INFO L225 Difference]: With dead ends: 1909 [2018-12-09 05:23:09,169 INFO L226 Difference]: Without dead ends: 1390 [2018-12-09 05:23:09,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-09 05:23:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2018-12-09 05:23:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1191. [2018-12-09 05:23:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-12-09 05:23:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1379 transitions. [2018-12-09 05:23:09,208 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1379 transitions. Word has length 160 [2018-12-09 05:23:09,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:09,208 INFO L480 AbstractCegarLoop]: Abstraction has 1191 states and 1379 transitions. [2018-12-09 05:23:09,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 05:23:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1379 transitions. [2018-12-09 05:23:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-09 05:23:09,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:09,210 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:09,210 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:09,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:09,210 INFO L82 PathProgramCache]: Analyzing trace with hash 330919845, now seen corresponding path program 1 times [2018-12-09 05:23:09,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:09,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:09,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:09,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:09,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 05:23:09,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:09,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:23:09,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:09,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:09,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:09,327 INFO L87 Difference]: Start difference. First operand 1191 states and 1379 transitions. Second operand 5 states. [2018-12-09 05:23:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:09,356 INFO L93 Difference]: Finished difference Result 1818 states and 2103 transitions. [2018-12-09 05:23:09,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:23:09,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2018-12-09 05:23:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:09,358 INFO L225 Difference]: With dead ends: 1818 [2018-12-09 05:23:09,358 INFO L226 Difference]: Without dead ends: 681 [2018-12-09 05:23:09,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-12-09 05:23:09,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2018-12-09 05:23:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-12-09 05:23:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 776 transitions. [2018-12-09 05:23:09,378 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 776 transitions. Word has length 187 [2018-12-09 05:23:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:09,378 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 776 transitions. [2018-12-09 05:23:09,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:09,379 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 776 transitions. [2018-12-09 05:23:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-09 05:23:09,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:09,380 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:09,380 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:09,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:09,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1778113404, now seen corresponding path program 1 times [2018-12-09 05:23:09,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:09,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:09,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:09,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:09,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 05:23:09,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:09,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:09,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:09,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:09,479 INFO L87 Difference]: Start difference. First operand 681 states and 776 transitions. Second operand 6 states. [2018-12-09 05:23:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:10,149 INFO L93 Difference]: Finished difference Result 1094 states and 1257 transitions. [2018-12-09 05:23:10,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:23:10,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2018-12-09 05:23:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:10,153 INFO L225 Difference]: With dead ends: 1094 [2018-12-09 05:23:10,153 INFO L226 Difference]: Without dead ends: 1089 [2018-12-09 05:23:10,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:23:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-12-09 05:23:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1042. [2018-12-09 05:23:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2018-12-09 05:23:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1205 transitions. [2018-12-09 05:23:10,189 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1205 transitions. Word has length 187 [2018-12-09 05:23:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:10,189 INFO L480 AbstractCegarLoop]: Abstraction has 1042 states and 1205 transitions. [2018-12-09 05:23:10,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1205 transitions. [2018-12-09 05:23:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-09 05:23:10,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:10,191 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:10,191 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:10,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:10,191 INFO L82 PathProgramCache]: Analyzing trace with hash -652122796, now seen corresponding path program 1 times [2018-12-09 05:23:10,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:10,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:10,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:10,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:10,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-09 05:23:10,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:10,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:23:10,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:10,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:10,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:10,286 INFO L87 Difference]: Start difference. First operand 1042 states and 1205 transitions. Second operand 5 states. [2018-12-09 05:23:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:10,347 INFO L93 Difference]: Finished difference Result 1100 states and 1265 transitions. [2018-12-09 05:23:10,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:23:10,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2018-12-09 05:23:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:10,351 INFO L225 Difference]: With dead ends: 1100 [2018-12-09 05:23:10,351 INFO L226 Difference]: Without dead ends: 1077 [2018-12-09 05:23:10,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-12-09 05:23:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1054. [2018-12-09 05:23:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-12-09 05:23:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1216 transitions. [2018-12-09 05:23:10,384 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1216 transitions. Word has length 207 [2018-12-09 05:23:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:10,384 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 1216 transitions. [2018-12-09 05:23:10,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1216 transitions. [2018-12-09 05:23:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 05:23:10,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:10,386 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:10,386 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:10,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:10,386 INFO L82 PathProgramCache]: Analyzing trace with hash -268907253, now seen corresponding path program 1 times [2018-12-09 05:23:10,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:10,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:10,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:10,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:10,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-09 05:23:10,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:23:10,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:23:10,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:10,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:23:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-09 05:23:10,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 05:23:10,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-12-09 05:23:10,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:10,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:10,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:10,692 INFO L87 Difference]: Start difference. First operand 1054 states and 1216 transitions. Second operand 5 states. [2018-12-09 05:23:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:10,775 INFO L93 Difference]: Finished difference Result 1824 states and 2105 transitions. [2018-12-09 05:23:10,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:23:10,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2018-12-09 05:23:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:10,779 INFO L225 Difference]: With dead ends: 1824 [2018-12-09 05:23:10,779 INFO L226 Difference]: Without dead ends: 867 [2018-12-09 05:23:10,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-09 05:23:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 857. [2018-12-09 05:23:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-12-09 05:23:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 970 transitions. [2018-12-09 05:23:10,815 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 970 transitions. Word has length 211 [2018-12-09 05:23:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:10,816 INFO L480 AbstractCegarLoop]: Abstraction has 857 states and 970 transitions. [2018-12-09 05:23:10,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 970 transitions. [2018-12-09 05:23:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-09 05:23:10,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:10,817 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:10,818 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:10,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:10,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1820053151, now seen corresponding path program 1 times [2018-12-09 05:23:10,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:10,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:10,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:10,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:10,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 05:23:10,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:10,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:23:10,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:23:10,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:23:10,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:10,937 INFO L87 Difference]: Start difference. First operand 857 states and 970 transitions. Second operand 3 states. [2018-12-09 05:23:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:10,975 INFO L93 Difference]: Finished difference Result 1127 states and 1276 transitions. [2018-12-09 05:23:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:23:10,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2018-12-09 05:23:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:10,977 INFO L225 Difference]: With dead ends: 1127 [2018-12-09 05:23:10,977 INFO L226 Difference]: Without dead ends: 546 [2018-12-09 05:23:10,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-12-09 05:23:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2018-12-09 05:23:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-12-09 05:23:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 605 transitions. [2018-12-09 05:23:10,998 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 605 transitions. Word has length 226 [2018-12-09 05:23:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:10,998 INFO L480 AbstractCegarLoop]: Abstraction has 546 states and 605 transitions. [2018-12-09 05:23:10,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:23:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 605 transitions. [2018-12-09 05:23:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-09 05:23:11,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:11,000 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:11,000 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:11,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:11,001 INFO L82 PathProgramCache]: Analyzing trace with hash 434659290, now seen corresponding path program 1 times [2018-12-09 05:23:11,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:11,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:11,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:11,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:11,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 05:23:11,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:11,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 05:23:11,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 05:23:11,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 05:23:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:23:11,245 INFO L87 Difference]: Start difference. First operand 546 states and 605 transitions. Second operand 8 states. [2018-12-09 05:23:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:12,007 INFO L93 Difference]: Finished difference Result 599 states and 675 transitions. [2018-12-09 05:23:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 05:23:12,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 228 [2018-12-09 05:23:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:12,008 INFO L225 Difference]: With dead ends: 599 [2018-12-09 05:23:12,008 INFO L226 Difference]: Without dead ends: 576 [2018-12-09 05:23:12,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-09 05:23:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-12-09 05:23:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 527. [2018-12-09 05:23:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-12-09 05:23:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 584 transitions. [2018-12-09 05:23:12,027 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 584 transitions. Word has length 228 [2018-12-09 05:23:12,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:12,027 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 584 transitions. [2018-12-09 05:23:12,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 05:23:12,027 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 584 transitions. [2018-12-09 05:23:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-12-09 05:23:12,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:12,029 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:12,029 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:12,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:12,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1046113509, now seen corresponding path program 1 times [2018-12-09 05:23:12,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:12,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:12,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:12,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:12,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-09 05:23:12,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:12,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:12,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:12,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:12,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:12,119 INFO L87 Difference]: Start difference. First operand 527 states and 584 transitions. Second operand 6 states. [2018-12-09 05:23:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:12,170 INFO L93 Difference]: Finished difference Result 792 states and 881 transitions. [2018-12-09 05:23:12,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:23:12,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2018-12-09 05:23:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:12,171 INFO L225 Difference]: With dead ends: 792 [2018-12-09 05:23:12,171 INFO L226 Difference]: Without dead ends: 483 [2018-12-09 05:23:12,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-12-09 05:23:12,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 455. [2018-12-09 05:23:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-12-09 05:23:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 500 transitions. [2018-12-09 05:23:12,187 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 500 transitions. Word has length 264 [2018-12-09 05:23:12,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:12,187 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 500 transitions. [2018-12-09 05:23:12,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 500 transitions. [2018-12-09 05:23:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-12-09 05:23:12,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:12,189 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:12,189 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:12,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:12,189 INFO L82 PathProgramCache]: Analyzing trace with hash 369042906, now seen corresponding path program 1 times [2018-12-09 05:23:12,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:12,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:12,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:12,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:12,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-09 05:23:12,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:23:12,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:23:12,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:12,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:23:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-12-09 05:23:12,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:23:12,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2018-12-09 05:23:12,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 05:23:12,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 05:23:12,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-09 05:23:12,720 INFO L87 Difference]: Start difference. First operand 455 states and 500 transitions. Second operand 15 states. [2018-12-09 05:23:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:13,261 INFO L93 Difference]: Finished difference Result 468 states and 514 transitions. [2018-12-09 05:23:13,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:23:13,261 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 277 [2018-12-09 05:23:13,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:13,263 INFO L225 Difference]: With dead ends: 468 [2018-12-09 05:23:13,263 INFO L226 Difference]: Without dead ends: 464 [2018-12-09 05:23:13,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 276 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-12-09 05:23:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-12-09 05:23:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 456. [2018-12-09 05:23:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-12-09 05:23:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 498 transitions. [2018-12-09 05:23:13,290 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 498 transitions. Word has length 277 [2018-12-09 05:23:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:13,291 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 498 transitions. [2018-12-09 05:23:13,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 05:23:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 498 transitions. [2018-12-09 05:23:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-12-09 05:23:13,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:13,294 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:13,295 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:13,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1444749869, now seen corresponding path program 1 times [2018-12-09 05:23:13,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:13,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:13,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:13,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:13,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-09 05:23:13,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:23:13,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:23:13,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:13,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:23:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-12-09 05:23:13,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:23:13,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2018-12-09 05:23:13,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 05:23:13,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 05:23:13,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-09 05:23:13,791 INFO L87 Difference]: Start difference. First operand 456 states and 498 transitions. Second operand 15 states. [2018-12-09 05:23:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:14,325 INFO L93 Difference]: Finished difference Result 468 states and 511 transitions. [2018-12-09 05:23:14,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:23:14,325 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 278 [2018-12-09 05:23:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:14,326 INFO L225 Difference]: With dead ends: 468 [2018-12-09 05:23:14,326 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 05:23:14,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 277 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-12-09 05:23:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 05:23:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 05:23:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 05:23:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 05:23:14,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 278 [2018-12-09 05:23:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:14,328 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 05:23:14,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 05:23:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 05:23:14,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 05:23:14,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 05:23:14,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 05:23:14,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 05:23:14,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 05:23:14,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 05:23:14,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 05:23:14,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 05:23:14,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 05:23:14,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 05:23:16,111 INFO L448 ceAbstractionStarter]: For program point L3478(lines 3478 3482) no Hoare annotation was computed. [2018-12-09 05:23:16,111 INFO L448 ceAbstractionStarter]: For program point L3478-2(lines 3475 3482) no Hoare annotation was computed. [2018-12-09 05:23:16,111 INFO L448 ceAbstractionStarter]: For program point L3475(lines 3475 3482) no Hoare annotation was computed. [2018-12-09 05:23:16,111 INFO L448 ceAbstractionStarter]: For program point usb_fill_int_urbFINAL(lines 3463 3486) no Hoare annotation was computed. [2018-12-09 05:23:16,111 INFO L448 ceAbstractionStarter]: For program point usb_fill_int_urbEXIT(lines 3463 3486) no Hoare annotation was computed. [2018-12-09 05:23:16,111 INFO L451 ceAbstractionStarter]: At program point usb_fill_int_urbENTRY(lines 3463 3486) the Hoare annotation is: true [2018-12-09 05:23:16,111 INFO L451 ceAbstractionStarter]: At program point kbtab_initENTRY(lines 3897 3913) the Hoare annotation is: true [2018-12-09 05:23:16,111 INFO L448 ceAbstractionStarter]: For program point L3903(lines 3903 3906) no Hoare annotation was computed. [2018-12-09 05:23:16,111 INFO L448 ceAbstractionStarter]: For program point L3901-1(line 3901) no Hoare annotation was computed. [2018-12-09 05:23:16,111 INFO L451 ceAbstractionStarter]: At program point L3901(line 3901) the Hoare annotation is: true [2018-12-09 05:23:16,111 INFO L448 ceAbstractionStarter]: For program point kbtab_initFINAL(lines 3897 3913) no Hoare annotation was computed. [2018-12-09 05:23:16,111 INFO L451 ceAbstractionStarter]: At program point L3910(lines 3899 3912) the Hoare annotation is: true [2018-12-09 05:23:16,111 INFO L448 ceAbstractionStarter]: For program point kbtab_initEXIT(lines 3897 3913) no Hoare annotation was computed. [2018-12-09 05:23:16,111 INFO L448 ceAbstractionStarter]: For program point input_unregister_deviceEXIT(lines 4212 4214) no Hoare annotation was computed. [2018-12-09 05:23:16,112 INFO L451 ceAbstractionStarter]: At program point input_unregister_deviceENTRY(lines 4212 4214) the Hoare annotation is: true [2018-12-09 05:23:16,112 INFO L448 ceAbstractionStarter]: For program point input_unregister_deviceFINAL(lines 4212 4214) no Hoare annotation was computed. [2018-12-09 05:23:16,112 INFO L448 ceAbstractionStarter]: For program point L4193-1(line 4193) no Hoare annotation was computed. [2018-12-09 05:23:16,112 INFO L451 ceAbstractionStarter]: At program point L4193(line 4193) the Hoare annotation is: true [2018-12-09 05:23:16,112 INFO L448 ceAbstractionStarter]: For program point dev_get_drvdataFINAL(lines 4192 4194) no Hoare annotation was computed. [2018-12-09 05:23:16,112 INFO L451 ceAbstractionStarter]: At program point dev_get_drvdataENTRY(lines 4192 4194) the Hoare annotation is: true [2018-12-09 05:23:16,112 INFO L448 ceAbstractionStarter]: For program point dev_get_drvdataEXIT(lines 4192 4194) no Hoare annotation was computed. [2018-12-09 05:23:16,112 INFO L448 ceAbstractionStarter]: For program point kfreeEXIT(lines 4252 4254) no Hoare annotation was computed. [2018-12-09 05:23:16,112 INFO L451 ceAbstractionStarter]: At program point kfreeENTRY(lines 4252 4254) the Hoare annotation is: true [2018-12-09 05:23:16,112 INFO L448 ceAbstractionStarter]: For program point kfreeFINAL(lines 4252 4254) no Hoare annotation was computed. [2018-12-09 05:23:16,112 INFO L444 ceAbstractionStarter]: At program point L3872(line 3872) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_urb_state~0 1) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-12-09 05:23:16,112 INFO L448 ceAbstractionStarter]: For program point L3873-1(line 3873) no Hoare annotation was computed. [2018-12-09 05:23:16,112 INFO L444 ceAbstractionStarter]: At program point L3873(line 3873) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1)) [2018-12-09 05:23:16,112 INFO L444 ceAbstractionStarter]: At program point L3870(line 3870) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_urb_state~0 1) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-12-09 05:23:16,112 INFO L448 ceAbstractionStarter]: For program point L3871-1(line 3871) no Hoare annotation was computed. [2018-12-09 05:23:16,112 INFO L444 ceAbstractionStarter]: At program point L3871(line 3871) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_urb_state~0 1) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-12-09 05:23:16,112 INFO L448 ceAbstractionStarter]: For program point L3872-1(line 3872) no Hoare annotation was computed. [2018-12-09 05:23:16,113 INFO L444 ceAbstractionStarter]: At program point L3868(line 3868) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_urb_state~0 1) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-12-09 05:23:16,113 INFO L448 ceAbstractionStarter]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2018-12-09 05:23:16,113 INFO L448 ceAbstractionStarter]: For program point L3868-1(line 3868) no Hoare annotation was computed. [2018-12-09 05:23:16,113 INFO L444 ceAbstractionStarter]: At program point kbtab_disconnectENTRY(lines 3863 3878) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_urb_state~0 1) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-12-09 05:23:16,113 INFO L448 ceAbstractionStarter]: For program point kbtab_disconnectEXIT(lines 3863 3878) no Hoare annotation was computed. [2018-12-09 05:23:16,113 INFO L448 ceAbstractionStarter]: For program point kbtab_disconnectFINAL(lines 3863 3878) no Hoare annotation was computed. [2018-12-09 05:23:16,113 INFO L444 ceAbstractionStarter]: At program point L3874(line 3874) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-12-09 05:23:16,113 INFO L448 ceAbstractionStarter]: For program point L4189-1(line 4189) no Hoare annotation was computed. [2018-12-09 05:23:16,113 INFO L451 ceAbstractionStarter]: At program point L4189(line 4189) the Hoare annotation is: true [2018-12-09 05:23:16,113 INFO L451 ceAbstractionStarter]: At program point __kmallocENTRY(lines 4188 4190) the Hoare annotation is: true [2018-12-09 05:23:16,113 INFO L448 ceAbstractionStarter]: For program point __kmallocFINAL(lines 4188 4190) no Hoare annotation was computed. [2018-12-09 05:23:16,113 INFO L448 ceAbstractionStarter]: For program point __kmallocEXIT(lines 4188 4190) no Hoare annotation was computed. [2018-12-09 05:23:16,113 INFO L448 ceAbstractionStarter]: For program point L3962(lines 3962 3965) no Hoare annotation was computed. [2018-12-09 05:23:16,113 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3949 4033) no Hoare annotation was computed. [2018-12-09 05:23:16,113 INFO L444 ceAbstractionStarter]: At program point L4020(lines 3967 4021) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,113 INFO L444 ceAbstractionStarter]: At program point L4016(lines 3968 4019) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (= 0 ~ldv_coherent_state~0) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2018-12-09 05:23:16,113 INFO L444 ceAbstractionStarter]: At program point L3983(lines 3982 4018) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (= 0 ~ldv_coherent_state~0) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point L3975-1(lines 3973 3978) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point L3975(lines 3975 3978) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point L4029(line 4029) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L444 ceAbstractionStarter]: At program point L4025(lines 3956 4032) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,114 INFO L444 ceAbstractionStarter]: At program point L3959-1(line 3959) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,114 INFO L444 ceAbstractionStarter]: At program point L3959(line 3959) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point L3960(line 3960) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point L3993-1(line 3993) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L444 ceAbstractionStarter]: At program point L3993(line 3993) the Hoare annotation is: (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= main_~ldv_s_kbtab_driver_usb_driver~0 0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 3989 4017) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point L3985(lines 3985 4018) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 3949 4033) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 3989 4017) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point L3973(lines 3973 3978) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point L3969(line 3969) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 3949 4033) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,114 INFO L444 ceAbstractionStarter]: At program point L3994(line 3994) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0)) (.cse1 (= main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (and (= 0 ~ldv_coherent_state~0) (and (not .cse0) .cse1 (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))))) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2018-12-09 05:23:16,114 INFO L448 ceAbstractionStarter]: For program point L3994-1(lines 3991 4001) no Hoare annotation was computed. [2018-12-09 05:23:16,114 INFO L444 ceAbstractionStarter]: At program point L3986(lines 3985 4018) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (= 0 ~ldv_coherent_state~0) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point L3982(lines 3982 4018) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point L4007-1(line 4007) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L444 ceAbstractionStarter]: At program point L4007(line 4007) the Hoare annotation is: (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point usb_get_intfdataEXIT(lines 3410 3418) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L451 ceAbstractionStarter]: At program point usb_get_intfdataENTRY(lines 3410 3418) the Hoare annotation is: true [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point usb_get_intfdataFINAL(lines 3410 3418) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L451 ceAbstractionStarter]: At program point L3414(line 3414) the Hoare annotation is: true [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point L3414-1(line 3414) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point strlcatFINAL(lines 4230 4232) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point strlcatEXIT(lines 4230 4232) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L451 ceAbstractionStarter]: At program point strlcatENTRY(lines 4230 4232) the Hoare annotation is: true [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point input_set_abs_paramsEXIT(lines 4209 4211) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L451 ceAbstractionStarter]: At program point input_set_abs_paramsENTRY(lines 4209 4211) the Hoare annotation is: true [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point input_set_abs_paramsFINAL(lines 4209 4211) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point kbtab_exitFINAL(lines 3916 3924) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L451 ceAbstractionStarter]: At program point kbtab_exitENTRY(lines 3916 3924) the Hoare annotation is: true [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point kbtab_exitEXIT(lines 3916 3924) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L451 ceAbstractionStarter]: At program point input_free_deviceENTRY(lines 4202 4204) the Hoare annotation is: true [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point input_free_deviceEXIT(lines 4202 4204) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point input_free_deviceFINAL(lines 4202 4204) no Hoare annotation was computed. [2018-12-09 05:23:16,115 INFO L451 ceAbstractionStarter]: At program point usb_to_input_idENTRY(lines 3557 3566) the Hoare annotation is: true [2018-12-09 05:23:16,115 INFO L448 ceAbstractionStarter]: For program point usb_to_input_idFINAL(lines 3557 3566) no Hoare annotation was computed. [2018-12-09 05:23:16,116 INFO L448 ceAbstractionStarter]: For program point usb_to_input_idEXIT(lines 3557 3566) no Hoare annotation was computed. [2018-12-09 05:23:16,116 INFO L448 ceAbstractionStarter]: For program point kzallocEXIT(lines 3393 3401) no Hoare annotation was computed. [2018-12-09 05:23:16,116 INFO L451 ceAbstractionStarter]: At program point kzallocENTRY(lines 3393 3401) the Hoare annotation is: true [2018-12-09 05:23:16,116 INFO L448 ceAbstractionStarter]: For program point L3397-1(line 3397) no Hoare annotation was computed. [2018-12-09 05:23:16,116 INFO L448 ceAbstractionStarter]: For program point kzallocFINAL(lines 3393 3401) no Hoare annotation was computed. [2018-12-09 05:23:16,116 INFO L451 ceAbstractionStarter]: At program point L3397(line 3397) the Hoare annotation is: true [2018-12-09 05:23:16,116 INFO L448 ceAbstractionStarter]: For program point ldv_assume_stopFINAL(lines 4043 4049) no Hoare annotation was computed. [2018-12-09 05:23:16,116 INFO L451 ceAbstractionStarter]: At program point ldv_assume_stopENTRY(lines 4043 4049) the Hoare annotation is: true [2018-12-09 05:23:16,116 INFO L448 ceAbstractionStarter]: For program point ldv_assume_stopEXIT(lines 4043 4049) no Hoare annotation was computed. [2018-12-09 05:23:16,116 INFO L451 ceAbstractionStarter]: At program point kmallocENTRY(lines 3383 3392) the Hoare annotation is: true [2018-12-09 05:23:16,116 INFO L451 ceAbstractionStarter]: At program point L3388(line 3388) the Hoare annotation is: true [2018-12-09 05:23:16,116 INFO L448 ceAbstractionStarter]: For program point L3388-1(line 3388) no Hoare annotation was computed. [2018-12-09 05:23:16,116 INFO L448 ceAbstractionStarter]: For program point kmallocFINAL(lines 3383 3392) no Hoare annotation was computed. [2018-12-09 05:23:16,117 INFO L448 ceAbstractionStarter]: For program point kmallocEXIT(lines 3383 3392) no Hoare annotation was computed. [2018-12-09 05:23:16,117 INFO L448 ceAbstractionStarter]: For program point L4094(lines 4094 4099) no Hoare annotation was computed. [2018-12-09 05:23:16,117 INFO L448 ceAbstractionStarter]: For program point L4086(lines 4085 4104) no Hoare annotation was computed. [2018-12-09 05:23:16,117 INFO L444 ceAbstractionStarter]: At program point usb_free_coherentENTRY(lines 4081 4110) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) (.cse1 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 .cse1 (not (= ~res_kbtab_probe_3~0 0))) (or .cse0 .cse1 (not (= 0 ~ldv_urb_state~0))))) [2018-12-09 05:23:16,117 INFO L444 ceAbstractionStarter]: At program point L4105(lines 4081 4110) the Hoare annotation is: (let ((.cse0 (let ((.cse2 (+ ~ldv_coherent_state~0 1))) (and (<= .cse2 |old(~ldv_coherent_state~0)|) (< 0 .cse2) (let ((.cse4 (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0))))))) (.cse1 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 .cse1 (not (= ~res_kbtab_probe_3~0 0))) (or .cse0 .cse1 (not (= 0 ~ldv_urb_state~0))))) [2018-12-09 05:23:16,117 INFO L448 ceAbstractionStarter]: For program point usb_free_coherentEXIT(lines 4081 4110) no Hoare annotation was computed. [2018-12-09 05:23:16,117 INFO L448 ceAbstractionStarter]: For program point L4097-1(lines 4094 4099) no Hoare annotation was computed. [2018-12-09 05:23:16,117 INFO L444 ceAbstractionStarter]: At program point L4097(line 4097) the Hoare annotation is: (let ((.cse0 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 (not (= ~res_kbtab_probe_3~0 0))) (or .cse0 (not (= 0 ~ldv_urb_state~0))))) [2018-12-09 05:23:16,117 INFO L451 ceAbstractionStarter]: At program point L4089(line 4089) the Hoare annotation is: true [2018-12-09 05:23:16,117 INFO L448 ceAbstractionStarter]: For program point L4087(lines 4085 4104) no Hoare annotation was computed. [2018-12-09 05:23:16,117 INFO L444 ceAbstractionStarter]: At program point L4085loopEntry(lines 4085 4104) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) (.cse1 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 .cse1 (not (= ~res_kbtab_probe_3~0 0))) (or .cse0 .cse1 (not (= 0 ~ldv_urb_state~0))))) [2018-12-09 05:23:16,118 INFO L451 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 4218 4220) the Hoare annotation is: true [2018-12-09 05:23:16,118 INFO L448 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 4218 4220) no Hoare annotation was computed. [2018-12-09 05:23:16,118 INFO L448 ceAbstractionStarter]: For program point external_allocFINAL(lines 4248 4250) no Hoare annotation was computed. [2018-12-09 05:23:16,118 INFO L448 ceAbstractionStarter]: For program point external_allocEXIT(lines 4248 4250) no Hoare annotation was computed. [2018-12-09 05:23:16,118 INFO L451 ceAbstractionStarter]: At program point external_allocENTRY(lines 4248 4250) the Hoare annotation is: true [2018-12-09 05:23:16,118 INFO L448 ceAbstractionStarter]: For program point usb_deregisterEXIT(lines 4233 4235) no Hoare annotation was computed. [2018-12-09 05:23:16,118 INFO L448 ceAbstractionStarter]: For program point usb_deregisterFINAL(lines 4233 4235) no Hoare annotation was computed. [2018-12-09 05:23:16,118 INFO L451 ceAbstractionStarter]: At program point usb_deregisterENTRY(lines 4233 4235) the Hoare annotation is: true [2018-12-09 05:23:16,118 INFO L448 ceAbstractionStarter]: For program point usb_alloc_coherentFINAL(lines 4054 4079) no Hoare annotation was computed. [2018-12-09 05:23:16,118 INFO L448 ceAbstractionStarter]: For program point L4063(line 4063) no Hoare annotation was computed. [2018-12-09 05:23:16,118 INFO L444 ceAbstractionStarter]: At program point L4060loopEntry(lines 4060 4073) the Hoare annotation is: (or (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,118 INFO L444 ceAbstractionStarter]: At program point L4061(line 4061) the Hoare annotation is: (or (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,118 INFO L444 ceAbstractionStarter]: At program point usb_alloc_coherentENTRY(lines 4054 4079) the Hoare annotation is: (or (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,119 INFO L448 ceAbstractionStarter]: For program point usb_alloc_coherentEXIT(lines 4054 4079) no Hoare annotation was computed. [2018-12-09 05:23:16,119 INFO L448 ceAbstractionStarter]: For program point L4074(lines 4059 4075) no Hoare annotation was computed. [2018-12-09 05:23:16,119 INFO L448 ceAbstractionStarter]: For program point L4066(lines 4066 4069) no Hoare annotation was computed. [2018-12-09 05:23:16,119 INFO L448 ceAbstractionStarter]: For program point ldv_check_return_valueFINAL(lines 4215 4217) no Hoare annotation was computed. [2018-12-09 05:23:16,119 INFO L448 ceAbstractionStarter]: For program point ldv_check_return_valueEXIT(lines 4215 4217) no Hoare annotation was computed. [2018-12-09 05:23:16,119 INFO L451 ceAbstractionStarter]: At program point ldv_check_return_valueENTRY(lines 4215 4217) the Hoare annotation is: true [2018-12-09 05:23:16,119 INFO L448 ceAbstractionStarter]: For program point L3425-1(line 3425) no Hoare annotation was computed. [2018-12-09 05:23:16,119 INFO L451 ceAbstractionStarter]: At program point L3425(line 3425) the Hoare annotation is: true [2018-12-09 05:23:16,119 INFO L451 ceAbstractionStarter]: At program point usb_set_intfdataENTRY(lines 3421 3429) the Hoare annotation is: true [2018-12-09 05:23:16,119 INFO L448 ceAbstractionStarter]: For program point usb_set_intfdataFINAL(lines 3421 3429) no Hoare annotation was computed. [2018-12-09 05:23:16,119 INFO L448 ceAbstractionStarter]: For program point usb_set_intfdataEXIT(lines 3421 3429) no Hoare annotation was computed. [2018-12-09 05:23:16,119 INFO L451 ceAbstractionStarter]: At program point usb_register_driverENTRY(lines 4240 4242) the Hoare annotation is: true [2018-12-09 05:23:16,119 INFO L448 ceAbstractionStarter]: For program point usb_register_driverFINAL(lines 4240 4242) no Hoare annotation was computed. [2018-12-09 05:23:16,120 INFO L448 ceAbstractionStarter]: For program point usb_register_driverEXIT(lines 4240 4242) no Hoare annotation was computed. [2018-12-09 05:23:16,120 INFO L448 ceAbstractionStarter]: For program point L4223(line 4223) no Hoare annotation was computed. [2018-12-09 05:23:16,120 INFO L448 ceAbstractionStarter]: For program point ldv_undefined_pointerFINAL(lines 4222 4224) no Hoare annotation was computed. [2018-12-09 05:23:16,120 INFO L451 ceAbstractionStarter]: At program point ldv_undefined_pointerENTRY(lines 4222 4224) the Hoare annotation is: true [2018-12-09 05:23:16,120 INFO L448 ceAbstractionStarter]: For program point ldv_undefined_pointerEXIT(lines 4222 4224) no Hoare annotation was computed. [2018-12-09 05:23:16,120 INFO L448 ceAbstractionStarter]: For program point L3801(lines 3801 3804) no Hoare annotation was computed. [2018-12-09 05:23:16,120 INFO L448 ceAbstractionStarter]: For program point L3793(lines 3793 3796) no Hoare annotation was computed. [2018-12-09 05:23:16,120 INFO L444 ceAbstractionStarter]: At program point L3855(lines 3781 3861) the Hoare annotation is: (or (and (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) (not (= 0 kbtab_probe_~error~0)) (and (< 0 (+ ~ldv_coherent_state~0 1)) (<= ~ldv_coherent_state~0 0))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,120 INFO L444 ceAbstractionStarter]: At program point L3851(lines 3781 3861) the Hoare annotation is: (or (and (and (<= 1 ~ldv_coherent_state~0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) (not (= 0 kbtab_probe_~error~0))) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,120 INFO L444 ceAbstractionStarter]: At program point L3806(line 3806) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,120 INFO L448 ceAbstractionStarter]: For program point L3839(lines 3839 3842) no Hoare annotation was computed. [2018-12-09 05:23:16,120 INFO L448 ceAbstractionStarter]: For program point L3806-1(line 3806) no Hoare annotation was computed. [2018-12-09 05:23:16,121 INFO L444 ceAbstractionStarter]: At program point L3798(line 3798) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,121 INFO L448 ceAbstractionStarter]: For program point L3831-1(line 3831) no Hoare annotation was computed. [2018-12-09 05:23:16,121 INFO L444 ceAbstractionStarter]: At program point L3831(line 3831) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,121 INFO L448 ceAbstractionStarter]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2018-12-09 05:23:16,121 INFO L444 ceAbstractionStarter]: At program point L3827-1(line 3827) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,121 INFO L444 ceAbstractionStarter]: At program point L3827(line 3827) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,121 INFO L448 ceAbstractionStarter]: For program point L3790(lines 3790 3796) no Hoare annotation was computed. [2018-12-09 05:23:16,121 INFO L444 ceAbstractionStarter]: At program point L3786(line 3786) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,121 INFO L448 ceAbstractionStarter]: For program point L3819-1(line 3819) no Hoare annotation was computed. [2018-12-09 05:23:16,121 INFO L444 ceAbstractionStarter]: At program point L3819(line 3819) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,121 INFO L448 ceAbstractionStarter]: For program point L3786-1(line 3786) no Hoare annotation was computed. [2018-12-09 05:23:16,121 INFO L448 ceAbstractionStarter]: For program point L3815-1(line 3815) no Hoare annotation was computed. [2018-12-09 05:23:16,121 INFO L444 ceAbstractionStarter]: At program point L3815(line 3815) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,121 INFO L444 ceAbstractionStarter]: At program point L3844(line 3844) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,122 INFO L448 ceAbstractionStarter]: For program point L3844-1(line 3844) no Hoare annotation was computed. [2018-12-09 05:23:16,122 INFO L444 ceAbstractionStarter]: At program point L3840(lines 3781 3861) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (not (= 0 kbtab_probe_~error~0)) (<= 1 ~ldv_urb_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,122 INFO L444 ceAbstractionStarter]: At program point L3836(line 3836) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,122 INFO L448 ceAbstractionStarter]: For program point L3836-1(line 3836) no Hoare annotation was computed. [2018-12-09 05:23:16,122 INFO L444 ceAbstractionStarter]: At program point L3832(lines 3832 3833) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,122 INFO L444 ceAbstractionStarter]: At program point kbtab_probeENTRY(lines 3770 3862) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,122 INFO L448 ceAbstractionStarter]: For program point L3832-1(lines 3832 3833) no Hoare annotation was computed. [2018-12-09 05:23:16,122 INFO L444 ceAbstractionStarter]: At program point L3828(line 3828) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,122 INFO L444 ceAbstractionStarter]: At program point L3857(line 3857) the Hoare annotation is: (or (and (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) (not (= 0 kbtab_probe_~error~0)) (and (< 0 (+ ~ldv_coherent_state~0 1)) (<= ~ldv_coherent_state~0 0))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,122 INFO L448 ceAbstractionStarter]: For program point kbtab_probeFINAL(lines 3770 3862) no Hoare annotation was computed. [2018-12-09 05:23:16,122 INFO L448 ceAbstractionStarter]: For program point L3853-1(line 3853) no Hoare annotation was computed. [2018-12-09 05:23:16,122 INFO L444 ceAbstractionStarter]: At program point L3853(line 3853) the Hoare annotation is: (or (and (and (<= 1 ~ldv_coherent_state~0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) (not (= 0 kbtab_probe_~error~0))) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,122 INFO L444 ceAbstractionStarter]: At program point L3816(line 3816) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,122 INFO L448 ceAbstractionStarter]: For program point L3849-1(line 3849) no Hoare annotation was computed. [2018-12-09 05:23:16,122 INFO L444 ceAbstractionStarter]: At program point L3849(line 3849) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (not (= 0 kbtab_probe_~error~0)) (<= 1 ~ldv_urb_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,122 INFO L448 ceAbstractionStarter]: For program point L3783-1(line 3783) no Hoare annotation was computed. [2018-12-09 05:23:16,122 INFO L444 ceAbstractionStarter]: At program point L3783(line 3783) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,122 INFO L448 ceAbstractionStarter]: For program point L3816-1(line 3816) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point L3808(lines 3808 3811) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point L3829(line 3829) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point L3858(line 3858) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point kbtab_probeEXIT(lines 3770 3862) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L444 ceAbstractionStarter]: At program point L3788(line 3788) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point L3821-1(line 3821) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L444 ceAbstractionStarter]: At program point L3821(line 3821) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point L3788-1(line 3788) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point L3517-1(line 3517) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L451 ceAbstractionStarter]: At program point input_set_drvdataENTRY(lines 3513 3521) the Hoare annotation is: true [2018-12-09 05:23:16,123 INFO L451 ceAbstractionStarter]: At program point L3517(line 3517) the Hoare annotation is: true [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point input_set_drvdataFINAL(lines 3513 3521) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point input_set_drvdataEXIT(lines 3513 3521) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L444 ceAbstractionStarter]: At program point L4154(line 4154) the Hoare annotation is: (or (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1)) [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point L4154-1(lines 4151 4156) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L451 ceAbstractionStarter]: At program point L4146(line 4146) the Hoare annotation is: true [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point L4144(lines 4142 4161) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L444 ceAbstractionStarter]: At program point L4142loopEntry(lines 4142 4161) the Hoare annotation is: (or (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1) (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0)) [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point usb_free_urbEXIT(lines 4138 4167) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L444 ceAbstractionStarter]: At program point usb_free_urbENTRY(lines 4138 4167) the Hoare annotation is: (or (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1) (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0)) [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point L4151(lines 4151 4156) no Hoare annotation was computed. [2018-12-09 05:23:16,123 INFO L448 ceAbstractionStarter]: For program point L4143(lines 4142 4161) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L444 ceAbstractionStarter]: At program point L4162(lines 4138 4167) the Hoare annotation is: (or (let ((.cse0 (+ ~ldv_urb_state~0 1))) (and (< 0 .cse0) (<= .cse0 |old(~ldv_urb_state~0)|) (let ((.cse1 (div (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset) 18446744073709551616))) (or (<= (+ .cse1 1) 0) (< (* 18446744073709551616 .cse1) (+ usb_free_urb_~urb.offset usb_free_urb_~urb.base)))))) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1)) [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point usb_make_pathEXIT(lines 3437 3451) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L451 ceAbstractionStarter]: At program point usb_make_pathENTRY(lines 3437 3451) the Hoare annotation is: true [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point L3444(lines 3444 3448) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point usb_make_pathFINAL(lines 3437 3451) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point L3444-2(lines 3444 3448) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L451 ceAbstractionStarter]: At program point __create_pipeENTRY(lines 3494 3499) the Hoare annotation is: true [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point __create_pipeFINAL(lines 3494 3499) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point __create_pipeEXIT(lines 3494 3499) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point input_allocate_deviceFINAL(lines 3500 3502) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L451 ceAbstractionStarter]: At program point input_allocate_deviceENTRY(lines 3500 3502) the Hoare annotation is: true [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point L3501(line 3501) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point input_allocate_deviceEXIT(lines 3500 3502) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0) (= ~ldv_coherent_state~0 |old(~ldv_coherent_state~0)|)) [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point interface_to_usbdevFINAL(lines 3430 3436) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L451 ceAbstractionStarter]: At program point interface_to_usbdevENTRY(lines 3430 3436) the Hoare annotation is: true [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point interface_to_usbdevEXIT(lines 3430 3436) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L451 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 4169 4186) the Hoare annotation is: true [2018-12-09 05:23:16,124 INFO L448 ceAbstractionStarter]: For program point L4181-1(lines 4169 4186) no Hoare annotation was computed. [2018-12-09 05:23:16,124 INFO L444 ceAbstractionStarter]: At program point L4181(line 4181) the Hoare annotation is: (or (not (= 0 ~ldv_urb_state~0)) (not (= 0 ~ldv_coherent_state~0))) [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point L4175-1(lines 4171 4185) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L444 ceAbstractionStarter]: At program point L4175(line 4175) the Hoare annotation is: (or (not (= 0 ~ldv_urb_state~0)) (not (= 0 ~ldv_coherent_state~0))) [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 4169 4186) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L444 ceAbstractionStarter]: At program point usb_alloc_urbENTRY(lines 4112 4136) the Hoare annotation is: (or (< 1 ~ldv_coherent_state~0) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (= 0 ~ldv_urb_state~0) (not (= 0 |old(~ldv_urb_state~0)|))) [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point L4123(lines 4123 4126) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point L4120(line 4120) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L444 ceAbstractionStarter]: At program point L4118(line 4118) the Hoare annotation is: (or (< 1 ~ldv_coherent_state~0) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (= 0 ~ldv_urb_state~0) (not (= 0 |old(~ldv_urb_state~0)|))) [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point usb_alloc_urbFINAL(lines 4112 4136) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L444 ceAbstractionStarter]: At program point L4117loopEntry(lines 4117 4130) the Hoare annotation is: (or (< 1 ~ldv_coherent_state~0) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (= 0 ~ldv_urb_state~0) (not (= 0 |old(~ldv_urb_state~0)|))) [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point L4131(lines 4116 4132) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point usb_alloc_urbEXIT(lines 4112 4136) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point L3457-1(line 3457) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L451 ceAbstractionStarter]: At program point L3457(line 3457) the Hoare annotation is: true [2018-12-09 05:23:16,125 INFO L451 ceAbstractionStarter]: At program point usb_registerENTRY(lines 3453 3461) the Hoare annotation is: true [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point usb_registerEXIT(lines 3453 3461) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point usb_registerFINAL(lines 3453 3461) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0)) [2018-12-09 05:23:16,125 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L448 ceAbstractionStarter]: For program point input_register_deviceFINAL(lines 4206 4208) no Hoare annotation was computed. [2018-12-09 05:23:16,125 INFO L451 ceAbstractionStarter]: At program point input_register_deviceENTRY(lines 4206 4208) the Hoare annotation is: true [2018-12-09 05:23:16,126 INFO L448 ceAbstractionStarter]: For program point input_register_deviceEXIT(lines 4206 4208) no Hoare annotation was computed. [2018-12-09 05:23:16,126 INFO L451 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4034 4039) the Hoare annotation is: true [2018-12-09 05:23:16,126 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2018-12-09 05:23:16,126 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4034 4039) no Hoare annotation was computed. [2018-12-09 05:23:16,126 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4034 4039) no Hoare annotation was computed. [2018-12-09 05:23:16,126 INFO L448 ceAbstractionStarter]: For program point dev_set_drvdataFINAL(lines 4196 4198) no Hoare annotation was computed. [2018-12-09 05:23:16,126 INFO L448 ceAbstractionStarter]: For program point dev_set_drvdataEXIT(lines 4196 4198) no Hoare annotation was computed. [2018-12-09 05:23:16,126 INFO L451 ceAbstractionStarter]: At program point dev_set_drvdataENTRY(lines 4196 4198) the Hoare annotation is: true [2018-12-09 05:23:16,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:23:16 BoogieIcfgContainer [2018-12-09 05:23:16,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:23:16,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:23:16,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:23:16,147 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:23:16,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:23:05" (3/4) ... [2018-12-09 05:23:16,150 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 05:23:16,156 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2018-12-09 05:23:16,156 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_unregister_device [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_disconnect [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __kmalloc [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure strlcat [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_free_device [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_to_input_id [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2018-12-09 05:23:16,157 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_initialize [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure external_alloc [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_deregister [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_coherent [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_return_value [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_register_driver [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_probe [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_drvdata [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_make_path [2018-12-09 05:23:16,158 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2018-12-09 05:23:16,159 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_allocate_device [2018-12-09 05:23:16,159 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 05:23:16,159 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure interface_to_usbdev [2018-12-09 05:23:16,159 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-12-09 05:23:16,159 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2018-12-09 05:23:16,159 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_register [2018-12-09 05:23:16,159 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_register_device [2018-12-09 05:23:16,159 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-12-09 05:23:16,159 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2018-12-09 05:23:16,169 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 201 nodes and edges [2018-12-09 05:23:16,170 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2018-12-09 05:23:16,171 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2018-12-09 05:23:16,171 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-12-09 05:23:16,172 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 05:23:16,172 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 05:23:16,198 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-12-09 05:23:16,198 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) [2018-12-09 05:23:16,198 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-12-09 05:23:16,199 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(res_kbtab_probe_3 == 0)) && ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) [2018-12-09 05:23:16,199 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 < ldv_urb_state + 1 && ldv_urb_state + 1 <= \old(ldv_urb_state)) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1 [2018-12-09 05:23:16,199 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= ldv_coherent_state && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && !(0 == error)) && ldv_coherent_state <= \old(ldv_coherent_state) + 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-12-09 05:23:16,199 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && !(0 == error)) && 0 < ldv_coherent_state + 1 && ldv_coherent_state <= 0) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-12-09 05:23:16,199 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) [2018-12-09 05:23:16,199 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) [2018-12-09 05:23:16,200 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == \old(ldv_coherent_state) || \old(ldv_coherent_state) < 1) || !(res_kbtab_probe_3 == 0)) && ((ldv_coherent_state == \old(ldv_coherent_state) || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) [2018-12-09 05:23:16,201 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1) || \old(ldv_urb_state) == ldv_urb_state [2018-12-09 05:23:16,201 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state == \old(ldv_coherent_state) || !(res_kbtab_probe_3 == 0)) || !(0 == ldv_urb_state)) || !(0 == \old(ldv_coherent_state)) [2018-12-09 05:23:16,202 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 < ldv_coherent_state || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || 0 == ldv_urb_state) || !(0 == \old(ldv_urb_state)) [2018-12-09 05:23:16,203 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_coherent_state && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && !(0 == error)) && 1 <= ldv_urb_state) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-12-09 05:23:16,259 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cdbde10e-8e67-4474-8ef6-bb054a0a75dd/bin-2019/uautomizer/witness.graphml [2018-12-09 05:23:16,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:23:16,260 INFO L168 Benchmark]: Toolchain (without parser) took 12204.96 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 609.2 MB). Free memory was 947.9 MB in the beginning and 879.5 MB in the end (delta: 68.5 MB). Peak memory consumption was 677.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:23:16,261 INFO L168 Benchmark]: CDTParser took 0.17 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 05:23:16,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 76.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:23:16,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 05:23:16,261 INFO L168 Benchmark]: Boogie Preprocessor took 44.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 05:23:16,261 INFO L168 Benchmark]: RCFGBuilder took 692.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 943.6 MB in the end (delta: 136.3 MB). Peak memory consumption was 136.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:23:16,262 INFO L168 Benchmark]: TraceAbstraction took 10654.40 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 460.8 MB). Free memory was 943.6 MB in the beginning and 894.7 MB in the end (delta: 48.9 MB). Peak memory consumption was 617.1 MB. Max. memory is 11.5 GB. [2018-12-09 05:23:16,262 INFO L168 Benchmark]: Witness Printer took 112.65 ms. Allocated memory is still 1.6 GB. Free memory was 894.7 MB in the beginning and 879.5 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:23:16,263 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 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 669.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 76.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 692.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 943.6 MB in the end (delta: 136.3 MB). Peak memory consumption was 136.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10654.40 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 460.8 MB). Free memory was 943.6 MB in the beginning and 894.7 MB in the end (delta: 48.9 MB). Peak memory consumption was 617.1 MB. Max. memory is 11.5 GB. * Witness Printer took 112.65 ms. Allocated memory is still 1.6 GB. Free memory was 894.7 MB in the beginning and 879.5 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3967]: Loop Invariant Derived loop invariant: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: (((((1 <= ldv_coherent_state && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && !(0 == error)) && ldv_coherent_state <= \old(ldv_coherent_state) + 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_coherent_state && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && !(0 == error)) && 1 <= ldv_urb_state) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4138]: Loop Invariant Derived loop invariant: ((((0 < ldv_urb_state + 1 && ldv_urb_state + 1 <= \old(ldv_urb_state)) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1 - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: (((((ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && !(0 == error)) && 0 < ldv_coherent_state + 1 && ldv_coherent_state <= 0) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4117]: Loop Invariant Derived loop invariant: (((1 < ldv_coherent_state || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || 0 == ldv_urb_state) || !(0 == \old(ldv_urb_state)) - InvariantResult [Line: 4142]: Loop Invariant Derived loop invariant: ((ldv_coherent_state < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1) || \old(ldv_urb_state) == ldv_urb_state - InvariantResult [Line: 3985]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3956]: Loop Invariant Derived loop invariant: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4081]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(res_kbtab_probe_3 == 0)) && ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3982]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4060]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == \old(ldv_coherent_state) || !(res_kbtab_probe_3 == 0)) || !(0 == ldv_urb_state)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4043]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3899]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4085]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == \old(ldv_coherent_state) || \old(ldv_coherent_state) < 1) || !(res_kbtab_probe_3 == 0)) && ((ldv_coherent_state == \old(ldv_coherent_state) || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 41 procedures, 257 locations, 1 error locations. SAFE Result, 10.5s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 5755 SDtfs, 5234 SDslu, 10827 SDs, 0 SdLazy, 3872 SolverSat, 2336 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 936 GetRequests, 815 SyntacticMatches, 11 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1191occurred in iteration=11, traceCheckStatistics: No data available, 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: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 449 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 104 LocationsWithAnnotation, 4852 PreInvPairs, 4944 NumberOfFragments, 1769 HoareAnnotationTreeSize, 4852 FomulaSimplifications, 8829 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 104 FomulaSimplificationsInter, 4971 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 4057 NumberOfCodeBlocks, 4057 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 4034 ConstructedInterpolants, 0 QuantifiedInterpolants, 1679646 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5090 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 949/978 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...