./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/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 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 037c3e06567325c0bf033985ce5185fa3b9b862c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 20:47:46,050 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:47:46,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:47:46,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:47:46,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:47:46,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:47:46,070 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:47:46,073 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:47:46,076 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:47:46,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:47:46,082 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:47:46,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:47:46,083 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:47:46,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:47:46,090 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:47:46,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:47:46,097 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:47:46,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:47:46,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:47:46,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:47:46,106 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:47:46,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:47:46,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:47:46,117 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:47:46,117 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:47:46,118 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:47:46,120 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:47:46,124 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:47:46,125 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:47:46,126 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:47:46,126 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:47:46,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:47:46,127 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:47:46,127 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:47:46,128 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:47:46,129 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:47:46,129 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-28 20:47:46,144 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:47:46,144 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:47:46,147 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:47:46,147 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:47:46,150 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:47:46,150 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:47:46,151 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:47:46,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:47:46,151 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:47:46,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:47:46,151 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:47:46,152 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:47:46,152 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:47:46,152 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:47:46,152 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:47:46,152 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:47:46,152 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:47:46,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:47:46,155 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:47:46,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:47:46,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:47:46,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:47:46,156 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:47:46,156 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:47:46,156 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:47:46,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:47:46,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:47:46,156 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-28 20:47:46,157 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 037c3e06567325c0bf033985ce5185fa3b9b862c [2018-11-28 20:47:46,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:47:46,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:47:46,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:47:46,254 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:47:46,254 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:47:46,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i [2018-11-28 20:47:46,324 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e2b614d/0c2490f13f634ccb82c7711f6666076f/FLAG59c1c2f1e [2018-11-28 20:47:46,975 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:47:46,976 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i [2018-11-28 20:47:47,019 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e2b614d/0c2490f13f634ccb82c7711f6666076f/FLAG59c1c2f1e [2018-11-28 20:47:47,122 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e2b614d/0c2490f13f634ccb82c7711f6666076f [2018-11-28 20:47:47,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:47:47,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:47:47,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:47:47,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:47:47,138 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:47:47,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:47:47" (1/1) ... [2018-11-28 20:47:47,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e34831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:47, skipping insertion in model container [2018-11-28 20:47:47,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:47:47" (1/1) ... [2018-11-28 20:47:47,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:47:47,275 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:47:48,346 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:47:48,384 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:47:48,581 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:47:48,661 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:47:48,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48 WrapperNode [2018-11-28 20:47:48,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:47:48,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:47:48,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:47:48,664 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:47:48,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48" (1/1) ... [2018-11-28 20:47:48,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48" (1/1) ... [2018-11-28 20:47:48,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:47:48,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:47:48,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:47:48,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:47:48,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48" (1/1) ... [2018-11-28 20:47:48,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48" (1/1) ... [2018-11-28 20:47:48,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48" (1/1) ... [2018-11-28 20:47:48,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48" (1/1) ... [2018-11-28 20:47:48,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48" (1/1) ... [2018-11-28 20:47:48,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48" (1/1) ... [2018-11-28 20:47:48,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48" (1/1) ... [2018-11-28 20:47:48,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:47:48,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:47:48,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:47:48,915 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:47:48,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:47:49,003 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2018-11-28 20:47:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2018-11-28 20:47:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-28 20:47:49,004 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2018-11-28 20:47:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2018-11-28 20:47:49,004 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2018-11-28 20:47:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-11-28 20:47:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2018-11-28 20:47:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 20:47:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 20:47:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-11-28 20:47:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-11-28 20:47:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 20:47:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2018-11-28 20:47:49,008 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2018-11-28 20:47:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2018-11-28 20:47:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2018-11-28 20:47:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2018-11-28 20:47:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2018-11-28 20:47:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:47:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-11-28 20:47:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-11-28 20:47:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-28 20:47:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-11-28 20:47:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 20:47:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2018-11-28 20:47:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2018-11-28 20:47:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2018-11-28 20:47:49,012 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2018-11-28 20:47:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-11-28 20:47:49,014 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-11-28 20:47:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 20:47:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2018-11-28 20:47:49,014 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2018-11-28 20:47:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2018-11-28 20:47:49,015 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2018-11-28 20:47:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-11-28 20:47:49,015 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-11-28 20:47:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-11-28 20:47:49,015 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-11-28 20:47:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-11-28 20:47:49,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-11-28 20:47:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-11-28 20:47:49,016 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-11-28 20:47:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-11-28 20:47:49,016 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-11-28 20:47:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_external_alloc [2018-11-28 20:47:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-28 20:47:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-28 20:47:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:47:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-28 20:47:49,020 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2018-11-28 20:47:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-11-28 20:47:49,020 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-11-28 20:47:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 20:47:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2018-11-28 20:47:49,021 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2018-11-28 20:47:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-28 20:47:49,022 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2018-11-28 20:47:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2018-11-28 20:47:49,022 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2018-11-28 20:47:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:47:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-11-28 20:47:49,022 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-11-28 20:47:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-28 20:47:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-28 20:47:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-11-28 20:47:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-11-28 20:47:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-28 20:47:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-28 20:47:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2018-11-28 20:47:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2018-11-28 20:47:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-11-28 20:47:49,027 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-11-28 20:47:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2018-11-28 20:47:49,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2018-11-28 20:47:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 20:47:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-11-28 20:47:49,027 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-11-28 20:47:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 20:47:49,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 20:47:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-11-28 20:47:49,028 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-11-28 20:47:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-28 20:47:49,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-28 20:47:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-11-28 20:47:49,028 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-11-28 20:47:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:47:49,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:47:49,032 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2018-11-28 20:47:49,032 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2018-11-28 20:47:49,814 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 20:47:49,814 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 20:47:51,248 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:47:51,249 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 20:47:51,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:47:51 BoogieIcfgContainer [2018-11-28 20:47:51,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:47:51,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:47:51,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:47:51,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:47:51,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:47:47" (1/3) ... [2018-11-28 20:47:51,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a09cf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:47:51, skipping insertion in model container [2018-11-28 20:47:51,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:48" (2/3) ... [2018-11-28 20:47:51,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a09cf2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:47:51, skipping insertion in model container [2018-11-28 20:47:51,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:47:51" (3/3) ... [2018-11-28 20:47:51,258 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i [2018-11-28 20:47:51,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:47:51,279 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 20:47:51,299 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 20:47:51,337 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:47:51,338 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:47:51,338 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:47:51,338 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:47:51,338 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:47:51,338 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:47:51,338 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:47:51,339 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:47:51,339 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:47:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states. [2018-11-28 20:47:51,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 20:47:51,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:51,377 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-11-28 20:47:51,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:51,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash -607468786, now seen corresponding path program 1 times [2018-11-28 20:47:51,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:51,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:51,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:51,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:51,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:47:51,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:51,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:47:51,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:47:51,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:47:51,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:47:51,941 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 3 states. [2018-11-28 20:47:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:52,217 INFO L93 Difference]: Finished difference Result 686 states and 853 transitions. [2018-11-28 20:47:52,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:47:52,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 20:47:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:52,252 INFO L225 Difference]: With dead ends: 686 [2018-11-28 20:47:52,253 INFO L226 Difference]: Without dead ends: 447 [2018-11-28 20:47:52,260 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-11-28 20:47:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-11-28 20:47:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2018-11-28 20:47:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-11-28 20:47:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 510 transitions. [2018-11-28 20:47:52,403 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 510 transitions. Word has length 31 [2018-11-28 20:47:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:52,405 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 510 transitions. [2018-11-28 20:47:52,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:47:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 510 transitions. [2018-11-28 20:47:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 20:47:52,407 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:52,408 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-11-28 20:47:52,409 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:52,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:52,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1651841249, now seen corresponding path program 1 times [2018-11-28 20:47:52,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:52,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:52,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:52,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:47:52,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:52,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:47:52,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:47:52,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:47:52,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:47:52,604 INFO L87 Difference]: Start difference. First operand 443 states and 510 transitions. Second operand 3 states. [2018-11-28 20:47:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:52,779 INFO L93 Difference]: Finished difference Result 1272 states and 1483 transitions. [2018-11-28 20:47:52,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:47:52,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 20:47:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:52,797 INFO L225 Difference]: With dead ends: 1272 [2018-11-28 20:47:52,798 INFO L226 Difference]: Without dead ends: 846 [2018-11-28 20:47:52,806 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-11-28 20:47:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-11-28 20:47:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 839. [2018-11-28 20:47:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-11-28 20:47:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 971 transitions. [2018-11-28 20:47:52,902 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 971 transitions. Word has length 32 [2018-11-28 20:47:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:52,902 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 971 transitions. [2018-11-28 20:47:52,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:47:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 971 transitions. [2018-11-28 20:47:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 20:47:52,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:52,906 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-11-28 20:47:52,906 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:52,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1156961390, now seen corresponding path program 1 times [2018-11-28 20:47:52,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:52,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:52,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:52,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:52,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:47:53,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:53,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:47:53,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:47:53,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:47:53,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:47:53,152 INFO L87 Difference]: Start difference. First operand 839 states and 971 transitions. Second operand 6 states. [2018-11-28 20:47:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:53,344 INFO L93 Difference]: Finished difference Result 1656 states and 1919 transitions. [2018-11-28 20:47:53,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:47:53,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-28 20:47:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:53,352 INFO L225 Difference]: With dead ends: 1656 [2018-11-28 20:47:53,352 INFO L226 Difference]: Without dead ends: 839 [2018-11-28 20:47:53,355 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-11-28 20:47:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-11-28 20:47:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2018-11-28 20:47:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-11-28 20:47:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 970 transitions. [2018-11-28 20:47:53,481 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 970 transitions. Word has length 74 [2018-11-28 20:47:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:53,484 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 970 transitions. [2018-11-28 20:47:53,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:47:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 970 transitions. [2018-11-28 20:47:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 20:47:53,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:53,492 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-11-28 20:47:53,492 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:53,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:53,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1600862064, now seen corresponding path program 1 times [2018-11-28 20:47:53,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:53,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:53,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:53,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:53,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:47:53,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:53,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:47:53,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:47:53,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:47:53,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:47:53,663 INFO L87 Difference]: Start difference. First operand 839 states and 970 transitions. Second operand 3 states. [2018-11-28 20:47:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:53,898 INFO L93 Difference]: Finished difference Result 1687 states and 1972 transitions. [2018-11-28 20:47:53,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:47:53,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-28 20:47:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:53,906 INFO L225 Difference]: With dead ends: 1687 [2018-11-28 20:47:53,906 INFO L226 Difference]: Without dead ends: 874 [2018-11-28 20:47:53,909 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-11-28 20:47:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-28 20:47:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2018-11-28 20:47:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-28 20:47:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1016 transitions. [2018-11-28 20:47:53,956 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1016 transitions. Word has length 74 [2018-11-28 20:47:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:53,957 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1016 transitions. [2018-11-28 20:47:53,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:47:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1016 transitions. [2018-11-28 20:47:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-28 20:47:53,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:53,961 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-11-28 20:47:53,961 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:53,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:53,962 INFO L82 PathProgramCache]: Analyzing trace with hash -460571464, now seen corresponding path program 1 times [2018-11-28 20:47:53,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:53,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:53,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:53,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:54,635 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2018-11-28 20:47:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-28 20:47:54,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:54,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:47:54,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:47:54,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:47:54,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:47:54,665 INFO L87 Difference]: Start difference. First operand 874 states and 1016 transitions. Second operand 5 states. [2018-11-28 20:47:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:54,836 INFO L93 Difference]: Finished difference Result 1449 states and 1689 transitions. [2018-11-28 20:47:54,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:47:54,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-11-28 20:47:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:54,841 INFO L225 Difference]: With dead ends: 1449 [2018-11-28 20:47:54,842 INFO L226 Difference]: Without dead ends: 602 [2018-11-28 20:47:54,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:47:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-28 20:47:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2018-11-28 20:47:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-11-28 20:47:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 692 transitions. [2018-11-28 20:47:54,877 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 692 transitions. Word has length 129 [2018-11-28 20:47:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:54,880 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 692 transitions. [2018-11-28 20:47:54,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:47:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 692 transitions. [2018-11-28 20:47:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-28 20:47:54,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:54,890 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-11-28 20:47:54,890 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:54,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash -109771527, now seen corresponding path program 1 times [2018-11-28 20:47:54,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:54,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:54,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:54,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:54,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:47:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-28 20:47:55,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:47:55,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:47:55,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:47:55,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:47:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:47:55,208 INFO L87 Difference]: Start difference. First operand 602 states and 692 transitions. Second operand 6 states. [2018-11-28 20:47:56,587 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-11-28 20:47:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:47:59,596 INFO L93 Difference]: Finished difference Result 1093 states and 1279 transitions. [2018-11-28 20:47:59,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:47:59,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-11-28 20:47:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:47:59,606 INFO L225 Difference]: With dead ends: 1093 [2018-11-28 20:47:59,606 INFO L226 Difference]: Without dead ends: 1090 [2018-11-28 20:47:59,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:47:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-11-28 20:47:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1051. [2018-11-28 20:47:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2018-11-28 20:47:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1236 transitions. [2018-11-28 20:47:59,671 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1236 transitions. Word has length 129 [2018-11-28 20:47:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:47:59,672 INFO L480 AbstractCegarLoop]: Abstraction has 1051 states and 1236 transitions. [2018-11-28 20:47:59,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:47:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1236 transitions. [2018-11-28 20:47:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-28 20:47:59,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:47:59,674 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-11-28 20:47:59,675 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:47:59,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:47:59,675 INFO L82 PathProgramCache]: Analyzing trace with hash 861966409, now seen corresponding path program 1 times [2018-11-28 20:47:59,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:47:59,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:47:59,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:59,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:47:59,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:47:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 20:48:00,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:48:00,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:48:00,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:48:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:48:00,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:48:00,086 INFO L87 Difference]: Start difference. First operand 1051 states and 1236 transitions. Second operand 5 states. [2018-11-28 20:48:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:00,338 INFO L93 Difference]: Finished difference Result 1939 states and 2291 transitions. [2018-11-28 20:48:00,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:48:00,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-28 20:48:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:00,346 INFO L225 Difference]: With dead ends: 1939 [2018-11-28 20:48:00,346 INFO L226 Difference]: Without dead ends: 1048 [2018-11-28 20:48:00,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:48:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-11-28 20:48:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2018-11-28 20:48:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-11-28 20:48:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1227 transitions. [2018-11-28 20:48:00,417 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1227 transitions. Word has length 132 [2018-11-28 20:48:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:00,417 INFO L480 AbstractCegarLoop]: Abstraction has 1048 states and 1227 transitions. [2018-11-28 20:48:00,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:48:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1227 transitions. [2018-11-28 20:48:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-28 20:48:00,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:00,424 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-11-28 20:48:00,424 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:00,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:00,424 INFO L82 PathProgramCache]: Analyzing trace with hash 863101515, now seen corresponding path program 1 times [2018-11-28 20:48:00,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:00,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:00,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:00,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:00,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 20:48:00,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:48:00,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:48:00,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:48:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:48:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:48:00,753 INFO L87 Difference]: Start difference. First operand 1048 states and 1227 transitions. Second operand 6 states. [2018-11-28 20:48:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:01,032 INFO L93 Difference]: Finished difference Result 2091 states and 2469 transitions. [2018-11-28 20:48:01,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:48:01,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-11-28 20:48:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:01,039 INFO L225 Difference]: With dead ends: 2091 [2018-11-28 20:48:01,039 INFO L226 Difference]: Without dead ends: 1049 [2018-11-28 20:48:01,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:48:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-11-28 20:48:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1014. [2018-11-28 20:48:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-11-28 20:48:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1206 transitions. [2018-11-28 20:48:01,098 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1206 transitions. Word has length 149 [2018-11-28 20:48:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:01,099 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1206 transitions. [2018-11-28 20:48:01,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:48:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1206 transitions. [2018-11-28 20:48:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-28 20:48:01,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:01,102 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-11-28 20:48:01,102 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:01,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash -621751126, now seen corresponding path program 1 times [2018-11-28 20:48:01,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:01,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:01,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:01,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:01,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:01,337 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-28 20:48:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-28 20:48:01,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:48:01,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:48:01,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:48:01,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:48:01,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:48:01,349 INFO L87 Difference]: Start difference. First operand 1014 states and 1206 transitions. Second operand 3 states. [2018-11-28 20:48:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:01,425 INFO L93 Difference]: Finished difference Result 1886 states and 2260 transitions. [2018-11-28 20:48:01,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:48:01,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2018-11-28 20:48:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:01,432 INFO L225 Difference]: With dead ends: 1886 [2018-11-28 20:48:01,433 INFO L226 Difference]: Without dead ends: 952 [2018-11-28 20:48:01,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:48:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-11-28 20:48:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2018-11-28 20:48:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-11-28 20:48:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1111 transitions. [2018-11-28 20:48:01,491 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1111 transitions. Word has length 157 [2018-11-28 20:48:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:01,491 INFO L480 AbstractCegarLoop]: Abstraction has 952 states and 1111 transitions. [2018-11-28 20:48:01,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:48:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1111 transitions. [2018-11-28 20:48:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-28 20:48:01,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:01,496 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-11-28 20:48:01,496 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:01,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:01,496 INFO L82 PathProgramCache]: Analyzing trace with hash -507611057, now seen corresponding path program 1 times [2018-11-28 20:48:01,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:01,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:01,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:01,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-28 20:48:01,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:48:01,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:48:01,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:48:01,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:48:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:48:01,942 INFO L87 Difference]: Start difference. First operand 952 states and 1111 transitions. Second operand 5 states. [2018-11-28 20:48:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:02,030 INFO L93 Difference]: Finished difference Result 1010 states and 1174 transitions. [2018-11-28 20:48:02,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:48:02,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-11-28 20:48:02,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:02,040 INFO L225 Difference]: With dead ends: 1010 [2018-11-28 20:48:02,041 INFO L226 Difference]: Without dead ends: 960 [2018-11-28 20:48:02,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:48:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2018-11-28 20:48:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2018-11-28 20:48:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-11-28 20:48:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1116 transitions. [2018-11-28 20:48:02,092 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1116 transitions. Word has length 159 [2018-11-28 20:48:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:02,093 INFO L480 AbstractCegarLoop]: Abstraction has 960 states and 1116 transitions. [2018-11-28 20:48:02,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:48:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1116 transitions. [2018-11-28 20:48:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-28 20:48:02,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:02,097 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-11-28 20:48:02,097 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:02,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:02,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1150478467, now seen corresponding path program 1 times [2018-11-28 20:48:02,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:02,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:02,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:02,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:02,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:02,649 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-11-28 20:48:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-28 20:48:02,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:48:02,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:48:02,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:48:02,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:48:02,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:48:02,786 INFO L87 Difference]: Start difference. First operand 960 states and 1116 transitions. Second operand 8 states. [2018-11-28 20:48:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:05,954 INFO L93 Difference]: Finished difference Result 1909 states and 2322 transitions. [2018-11-28 20:48:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:48:05,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 160 [2018-11-28 20:48:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:05,964 INFO L225 Difference]: With dead ends: 1909 [2018-11-28 20:48:05,965 INFO L226 Difference]: Without dead ends: 1390 [2018-11-28 20:48:05,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:48:05,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2018-11-28 20:48:06,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1191. [2018-11-28 20:48:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-11-28 20:48:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1379 transitions. [2018-11-28 20:48:06,039 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1379 transitions. Word has length 160 [2018-11-28 20:48:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:06,041 INFO L480 AbstractCegarLoop]: Abstraction has 1191 states and 1379 transitions. [2018-11-28 20:48:06,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:48:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1379 transitions. [2018-11-28 20:48:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-28 20:48:06,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:06,045 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-11-28 20:48:06,045 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:06,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:06,046 INFO L82 PathProgramCache]: Analyzing trace with hash 330919845, now seen corresponding path program 1 times [2018-11-28 20:48:06,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:06,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:06,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:06,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:06,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-28 20:48:06,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:48:06,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:48:06,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:48:06,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:48:06,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:48:06,402 INFO L87 Difference]: Start difference. First operand 1191 states and 1379 transitions. Second operand 5 states. [2018-11-28 20:48:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:06,454 INFO L93 Difference]: Finished difference Result 1818 states and 2103 transitions. [2018-11-28 20:48:06,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:48:06,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2018-11-28 20:48:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:06,464 INFO L225 Difference]: With dead ends: 1818 [2018-11-28 20:48:06,464 INFO L226 Difference]: Without dead ends: 681 [2018-11-28 20:48:06,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:48:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-28 20:48:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2018-11-28 20:48:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-11-28 20:48:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 776 transitions. [2018-11-28 20:48:06,506 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 776 transitions. Word has length 187 [2018-11-28 20:48:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:06,508 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 776 transitions. [2018-11-28 20:48:06,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:48:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 776 transitions. [2018-11-28 20:48:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-28 20:48:06,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:06,512 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-11-28 20:48:06,512 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:06,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1778113404, now seen corresponding path program 1 times [2018-11-28 20:48:06,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:06,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:06,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:06,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:06,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:06,954 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-11-28 20:48:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-28 20:48:07,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:48:07,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:48:07,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:48:07,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:48:07,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:48:07,215 INFO L87 Difference]: Start difference. First operand 681 states and 776 transitions. Second operand 6 states. [2018-11-28 20:48:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:09,194 INFO L93 Difference]: Finished difference Result 1094 states and 1257 transitions. [2018-11-28 20:48:09,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:48:09,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2018-11-28 20:48:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:09,203 INFO L225 Difference]: With dead ends: 1094 [2018-11-28 20:48:09,204 INFO L226 Difference]: Without dead ends: 1089 [2018-11-28 20:48:09,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:48:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-11-28 20:48:09,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1042. [2018-11-28 20:48:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2018-11-28 20:48:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1205 transitions. [2018-11-28 20:48:09,266 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1205 transitions. Word has length 187 [2018-11-28 20:48:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:09,267 INFO L480 AbstractCegarLoop]: Abstraction has 1042 states and 1205 transitions. [2018-11-28 20:48:09,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:48:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1205 transitions. [2018-11-28 20:48:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-28 20:48:09,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:09,271 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-11-28 20:48:09,272 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:09,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash -652122796, now seen corresponding path program 1 times [2018-11-28 20:48:09,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:09,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:09,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:09,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:09,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-28 20:48:09,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:48:09,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:48:09,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:48:09,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:48:09,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:48:09,711 INFO L87 Difference]: Start difference. First operand 1042 states and 1205 transitions. Second operand 5 states. [2018-11-28 20:48:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:09,895 INFO L93 Difference]: Finished difference Result 1100 states and 1265 transitions. [2018-11-28 20:48:09,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:48:09,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2018-11-28 20:48:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:09,903 INFO L225 Difference]: With dead ends: 1100 [2018-11-28 20:48:09,903 INFO L226 Difference]: Without dead ends: 1077 [2018-11-28 20:48:09,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:48:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-11-28 20:48:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1054. [2018-11-28 20:48:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-11-28 20:48:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1216 transitions. [2018-11-28 20:48:09,970 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1216 transitions. Word has length 207 [2018-11-28 20:48:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:09,970 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 1216 transitions. [2018-11-28 20:48:09,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:48:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1216 transitions. [2018-11-28 20:48:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-28 20:48:09,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:09,976 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-11-28 20:48:09,976 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:09,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:09,976 INFO L82 PathProgramCache]: Analyzing trace with hash -268907253, now seen corresponding path program 1 times [2018-11-28 20:48:09,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:09,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:09,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:09,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:09,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-28 20:48:10,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 20:48:10,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:48:10,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:10,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 20:48:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-28 20:48:10,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 20:48:10,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-11-28 20:48:10,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:48:10,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:48:10,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:48:10,808 INFO L87 Difference]: Start difference. First operand 1054 states and 1216 transitions. Second operand 5 states. [2018-11-28 20:48:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:11,093 INFO L93 Difference]: Finished difference Result 1824 states and 2105 transitions. [2018-11-28 20:48:11,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:48:11,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2018-11-28 20:48:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:11,101 INFO L225 Difference]: With dead ends: 1824 [2018-11-28 20:48:11,101 INFO L226 Difference]: Without dead ends: 867 [2018-11-28 20:48:11,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:48:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-11-28 20:48:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 857. [2018-11-28 20:48:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-11-28 20:48:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 970 transitions. [2018-11-28 20:48:11,172 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 970 transitions. Word has length 211 [2018-11-28 20:48:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:11,172 INFO L480 AbstractCegarLoop]: Abstraction has 857 states and 970 transitions. [2018-11-28 20:48:11,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:48:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 970 transitions. [2018-11-28 20:48:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-28 20:48:11,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:11,177 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-11-28 20:48:11,177 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:11,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1820053151, now seen corresponding path program 1 times [2018-11-28 20:48:11,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:11,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:11,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:11,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:11,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:11,539 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-11-28 20:48:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-28 20:48:11,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:48:11,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:48:11,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:48:11,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:48:11,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:48:11,568 INFO L87 Difference]: Start difference. First operand 857 states and 970 transitions. Second operand 3 states. [2018-11-28 20:48:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:11,636 INFO L93 Difference]: Finished difference Result 1127 states and 1276 transitions. [2018-11-28 20:48:11,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:48:11,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2018-11-28 20:48:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:11,642 INFO L225 Difference]: With dead ends: 1127 [2018-11-28 20:48:11,642 INFO L226 Difference]: Without dead ends: 546 [2018-11-28 20:48:11,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:48:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-28 20:48:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2018-11-28 20:48:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-11-28 20:48:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 605 transitions. [2018-11-28 20:48:11,686 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 605 transitions. Word has length 226 [2018-11-28 20:48:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:11,688 INFO L480 AbstractCegarLoop]: Abstraction has 546 states and 605 transitions. [2018-11-28 20:48:11,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:48:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 605 transitions. [2018-11-28 20:48:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-28 20:48:11,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:11,692 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-11-28 20:48:11,692 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:11,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash 434659290, now seen corresponding path program 1 times [2018-11-28 20:48:11,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:11,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:11,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:11,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:12,422 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-11-28 20:48:12,639 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 20:48:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-28 20:48:12,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:48:12,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:48:12,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:48:12,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:48:12,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:48:12,884 INFO L87 Difference]: Start difference. First operand 546 states and 605 transitions. Second operand 8 states. [2018-11-28 20:48:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:14,804 INFO L93 Difference]: Finished difference Result 599 states and 675 transitions. [2018-11-28 20:48:14,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:48:14,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 228 [2018-11-28 20:48:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:14,810 INFO L225 Difference]: With dead ends: 599 [2018-11-28 20:48:14,810 INFO L226 Difference]: Without dead ends: 576 [2018-11-28 20:48:14,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:48:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-11-28 20:48:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 527. [2018-11-28 20:48:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-28 20:48:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 584 transitions. [2018-11-28 20:48:14,850 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 584 transitions. Word has length 228 [2018-11-28 20:48:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:14,851 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 584 transitions. [2018-11-28 20:48:14,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:48:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 584 transitions. [2018-11-28 20:48:14,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-28 20:48:14,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:14,857 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-11-28 20:48:14,857 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:14,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1046113509, now seen corresponding path program 1 times [2018-11-28 20:48:14,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:14,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:14,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:14,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:14,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:15,343 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-28 20:48:15,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:48:15,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:48:15,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:48:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:48:15,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:48:15,347 INFO L87 Difference]: Start difference. First operand 527 states and 584 transitions. Second operand 6 states. [2018-11-28 20:48:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:15,790 INFO L93 Difference]: Finished difference Result 792 states and 881 transitions. [2018-11-28 20:48:15,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:48:15,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2018-11-28 20:48:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:15,797 INFO L225 Difference]: With dead ends: 792 [2018-11-28 20:48:15,797 INFO L226 Difference]: Without dead ends: 483 [2018-11-28 20:48:15,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:48:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-11-28 20:48:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 455. [2018-11-28 20:48:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-11-28 20:48:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 500 transitions. [2018-11-28 20:48:15,834 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 500 transitions. Word has length 264 [2018-11-28 20:48:15,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:15,834 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 500 transitions. [2018-11-28 20:48:15,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:48:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 500 transitions. [2018-11-28 20:48:15,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-28 20:48:15,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:15,841 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-11-28 20:48:15,841 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:15,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash 369042906, now seen corresponding path program 1 times [2018-11-28 20:48:15,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:15,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:15,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:15,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:15,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:16,541 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-11-28 20:48:16,733 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 20:48:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-28 20:48:16,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 20:48:16,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:48:16,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:17,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 20:48:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-28 20:48:17,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 20:48:17,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2018-11-28 20:48:17,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 20:48:17,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 20:48:17,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:48:17,892 INFO L87 Difference]: Start difference. First operand 455 states and 500 transitions. Second operand 15 states. [2018-11-28 20:48:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:19,333 INFO L93 Difference]: Finished difference Result 468 states and 514 transitions. [2018-11-28 20:48:19,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:48:19,341 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 277 [2018-11-28 20:48:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:19,346 INFO L225 Difference]: With dead ends: 468 [2018-11-28 20:48:19,346 INFO L226 Difference]: Without dead ends: 464 [2018-11-28 20:48:19,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 276 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-28 20:48:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-11-28 20:48:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 456. [2018-11-28 20:48:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-28 20:48:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 498 transitions. [2018-11-28 20:48:19,380 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 498 transitions. Word has length 277 [2018-11-28 20:48:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:19,380 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 498 transitions. [2018-11-28 20:48:19,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 20:48:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 498 transitions. [2018-11-28 20:48:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-28 20:48:19,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:48:19,387 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-11-28 20:48:19,388 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:48:19,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:48:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1444749869, now seen corresponding path program 1 times [2018-11-28 20:48:19,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:48:19,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:48:19,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:19,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:19,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:48:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:20,012 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-11-28 20:48:20,201 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 20:48:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-28 20:48:20,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 20:48:20,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:48:20,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:48:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:48:20,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 20:48:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-28 20:48:20,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 20:48:20,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2018-11-28 20:48:20,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 20:48:20,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 20:48:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:48:20,999 INFO L87 Difference]: Start difference. First operand 456 states and 498 transitions. Second operand 15 states. [2018-11-28 20:48:22,973 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-28 20:48:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:48:24,794 INFO L93 Difference]: Finished difference Result 468 states and 511 transitions. [2018-11-28 20:48:24,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:48:24,795 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 278 [2018-11-28 20:48:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:48:24,796 INFO L225 Difference]: With dead ends: 468 [2018-11-28 20:48:24,796 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 20:48:24,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 277 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-28 20:48:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 20:48:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 20:48:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 20:48:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 20:48:24,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 278 [2018-11-28 20:48:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:48:24,800 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 20:48:24,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 20:48:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 20:48:24,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 20:48:24,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 20:48:25,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 20:48:25,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 20:48:25,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 20:48:25,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 20:48:25,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 20:48:25,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 20:48:25,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 20:48:25,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 20:48:26,015 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-11-28 20:48:26,260 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2018-11-28 20:48:26,599 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-11-28 20:48:27,008 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 26 [2018-11-28 20:48:27,391 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-28 20:48:27,569 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-28 20:48:27,894 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2018-11-28 20:48:28,683 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-11-28 20:48:29,701 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2018-11-28 20:48:30,014 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2018-11-28 20:48:30,207 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 26 [2018-11-28 20:48:30,238 INFO L448 ceAbstractionStarter]: For program point L3478(lines 3478 3482) no Hoare annotation was computed. [2018-11-28 20:48:30,238 INFO L448 ceAbstractionStarter]: For program point L3478-2(lines 3475 3482) no Hoare annotation was computed. [2018-11-28 20:48:30,238 INFO L448 ceAbstractionStarter]: For program point L3475(lines 3475 3482) no Hoare annotation was computed. [2018-11-28 20:48:30,238 INFO L448 ceAbstractionStarter]: For program point usb_fill_int_urbFINAL(lines 3463 3486) no Hoare annotation was computed. [2018-11-28 20:48:30,238 INFO L448 ceAbstractionStarter]: For program point usb_fill_int_urbEXIT(lines 3463 3486) no Hoare annotation was computed. [2018-11-28 20:48:30,239 INFO L451 ceAbstractionStarter]: At program point usb_fill_int_urbENTRY(lines 3463 3486) the Hoare annotation is: true [2018-11-28 20:48:30,239 INFO L451 ceAbstractionStarter]: At program point kbtab_initENTRY(lines 3897 3913) the Hoare annotation is: true [2018-11-28 20:48:30,239 INFO L448 ceAbstractionStarter]: For program point L3903(lines 3903 3906) no Hoare annotation was computed. [2018-11-28 20:48:30,239 INFO L448 ceAbstractionStarter]: For program point L3901-1(line 3901) no Hoare annotation was computed. [2018-11-28 20:48:30,239 INFO L451 ceAbstractionStarter]: At program point L3901(line 3901) the Hoare annotation is: true [2018-11-28 20:48:30,240 INFO L448 ceAbstractionStarter]: For program point kbtab_initFINAL(lines 3897 3913) no Hoare annotation was computed. [2018-11-28 20:48:30,240 INFO L451 ceAbstractionStarter]: At program point L3910(lines 3899 3912) the Hoare annotation is: true [2018-11-28 20:48:30,240 INFO L448 ceAbstractionStarter]: For program point kbtab_initEXIT(lines 3897 3913) no Hoare annotation was computed. [2018-11-28 20:48:30,240 INFO L448 ceAbstractionStarter]: For program point input_unregister_deviceEXIT(lines 4212 4214) no Hoare annotation was computed. [2018-11-28 20:48:30,240 INFO L451 ceAbstractionStarter]: At program point input_unregister_deviceENTRY(lines 4212 4214) the Hoare annotation is: true [2018-11-28 20:48:30,240 INFO L448 ceAbstractionStarter]: For program point input_unregister_deviceFINAL(lines 4212 4214) no Hoare annotation was computed. [2018-11-28 20:48:30,240 INFO L448 ceAbstractionStarter]: For program point L4193-1(line 4193) no Hoare annotation was computed. [2018-11-28 20:48:30,240 INFO L451 ceAbstractionStarter]: At program point L4193(line 4193) the Hoare annotation is: true [2018-11-28 20:48:30,240 INFO L448 ceAbstractionStarter]: For program point dev_get_drvdataFINAL(lines 4192 4194) no Hoare annotation was computed. [2018-11-28 20:48:30,240 INFO L451 ceAbstractionStarter]: At program point dev_get_drvdataENTRY(lines 4192 4194) the Hoare annotation is: true [2018-11-28 20:48:30,240 INFO L448 ceAbstractionStarter]: For program point dev_get_drvdataEXIT(lines 4192 4194) no Hoare annotation was computed. [2018-11-28 20:48:30,240 INFO L448 ceAbstractionStarter]: For program point kfreeEXIT(lines 4252 4254) no Hoare annotation was computed. [2018-11-28 20:48:30,241 INFO L451 ceAbstractionStarter]: At program point kfreeENTRY(lines 4252 4254) the Hoare annotation is: true [2018-11-28 20:48:30,241 INFO L448 ceAbstractionStarter]: For program point kfreeFINAL(lines 4252 4254) no Hoare annotation was computed. [2018-11-28 20:48:30,241 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-11-28 20:48:30,241 INFO L448 ceAbstractionStarter]: For program point L3873-1(line 3873) no Hoare annotation was computed. [2018-11-28 20:48:30,241 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-11-28 20:48:30,241 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-11-28 20:48:30,241 INFO L448 ceAbstractionStarter]: For program point L3871-1(line 3871) no Hoare annotation was computed. [2018-11-28 20:48:30,242 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-11-28 20:48:30,242 INFO L448 ceAbstractionStarter]: For program point L3872-1(line 3872) no Hoare annotation was computed. [2018-11-28 20:48:30,242 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-11-28 20:48:30,242 INFO L448 ceAbstractionStarter]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2018-11-28 20:48:30,242 INFO L448 ceAbstractionStarter]: For program point L3868-1(line 3868) no Hoare annotation was computed. [2018-11-28 20:48:30,242 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-11-28 20:48:30,242 INFO L448 ceAbstractionStarter]: For program point kbtab_disconnectEXIT(lines 3863 3878) no Hoare annotation was computed. [2018-11-28 20:48:30,242 INFO L448 ceAbstractionStarter]: For program point kbtab_disconnectFINAL(lines 3863 3878) no Hoare annotation was computed. [2018-11-28 20:48:30,243 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-11-28 20:48:30,243 INFO L448 ceAbstractionStarter]: For program point L4189-1(line 4189) no Hoare annotation was computed. [2018-11-28 20:48:30,243 INFO L451 ceAbstractionStarter]: At program point L4189(line 4189) the Hoare annotation is: true [2018-11-28 20:48:30,243 INFO L451 ceAbstractionStarter]: At program point __kmallocENTRY(lines 4188 4190) the Hoare annotation is: true [2018-11-28 20:48:30,243 INFO L448 ceAbstractionStarter]: For program point __kmallocFINAL(lines 4188 4190) no Hoare annotation was computed. [2018-11-28 20:48:30,243 INFO L448 ceAbstractionStarter]: For program point __kmallocEXIT(lines 4188 4190) no Hoare annotation was computed. [2018-11-28 20:48:30,243 INFO L448 ceAbstractionStarter]: For program point L3962(lines 3962 3965) no Hoare annotation was computed. [2018-11-28 20:48:30,243 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3949 4033) no Hoare annotation was computed. [2018-11-28 20:48:30,244 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-11-28 20:48:30,244 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-11-28 20:48:30,244 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-11-28 20:48:30,244 INFO L448 ceAbstractionStarter]: For program point L3975-1(lines 3973 3978) no Hoare annotation was computed. [2018-11-28 20:48:30,244 INFO L448 ceAbstractionStarter]: For program point L3975(lines 3975 3978) no Hoare annotation was computed. [2018-11-28 20:48:30,244 INFO L448 ceAbstractionStarter]: For program point L4029(line 4029) no Hoare annotation was computed. [2018-11-28 20:48:30,244 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-11-28 20:48:30,245 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-11-28 20:48:30,245 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-11-28 20:48:30,245 INFO L448 ceAbstractionStarter]: For program point L3960(line 3960) no Hoare annotation was computed. [2018-11-28 20:48:30,245 INFO L448 ceAbstractionStarter]: For program point L3993-1(line 3993) no Hoare annotation was computed. [2018-11-28 20:48:30,245 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-11-28 20:48:30,245 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 3989 4017) no Hoare annotation was computed. [2018-11-28 20:48:30,245 INFO L448 ceAbstractionStarter]: For program point L3985(lines 3985 4018) no Hoare annotation was computed. [2018-11-28 20:48:30,245 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 3949 4033) no Hoare annotation was computed. [2018-11-28 20:48:30,245 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 3989 4017) no Hoare annotation was computed. [2018-11-28 20:48:30,245 INFO L448 ceAbstractionStarter]: For program point L3973(lines 3973 3978) no Hoare annotation was computed. [2018-11-28 20:48:30,246 INFO L448 ceAbstractionStarter]: For program point L3969(line 3969) no Hoare annotation was computed. [2018-11-28 20:48:30,246 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-11-28 20:48:30,246 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-11-28 20:48:30,246 INFO L448 ceAbstractionStarter]: For program point L3994-1(lines 3991 4001) no Hoare annotation was computed. [2018-11-28 20:48:30,246 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-11-28 20:48:30,246 INFO L448 ceAbstractionStarter]: For program point L3982(lines 3982 4018) no Hoare annotation was computed. [2018-11-28 20:48:30,246 INFO L448 ceAbstractionStarter]: For program point L4007-1(line 4007) no Hoare annotation was computed. [2018-11-28 20:48:30,246 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-11-28 20:48:30,247 INFO L448 ceAbstractionStarter]: For program point usb_get_intfdataEXIT(lines 3410 3418) no Hoare annotation was computed. [2018-11-28 20:48:30,247 INFO L451 ceAbstractionStarter]: At program point usb_get_intfdataENTRY(lines 3410 3418) the Hoare annotation is: true [2018-11-28 20:48:30,247 INFO L448 ceAbstractionStarter]: For program point usb_get_intfdataFINAL(lines 3410 3418) no Hoare annotation was computed. [2018-11-28 20:48:30,247 INFO L451 ceAbstractionStarter]: At program point L3414(line 3414) the Hoare annotation is: true [2018-11-28 20:48:30,247 INFO L448 ceAbstractionStarter]: For program point L3414-1(line 3414) no Hoare annotation was computed. [2018-11-28 20:48:30,247 INFO L448 ceAbstractionStarter]: For program point strlcatFINAL(lines 4230 4232) no Hoare annotation was computed. [2018-11-28 20:48:30,247 INFO L448 ceAbstractionStarter]: For program point strlcatEXIT(lines 4230 4232) no Hoare annotation was computed. [2018-11-28 20:48:30,247 INFO L451 ceAbstractionStarter]: At program point strlcatENTRY(lines 4230 4232) the Hoare annotation is: true [2018-11-28 20:48:30,247 INFO L448 ceAbstractionStarter]: For program point input_set_abs_paramsEXIT(lines 4209 4211) no Hoare annotation was computed. [2018-11-28 20:48:30,247 INFO L451 ceAbstractionStarter]: At program point input_set_abs_paramsENTRY(lines 4209 4211) the Hoare annotation is: true [2018-11-28 20:48:30,248 INFO L448 ceAbstractionStarter]: For program point input_set_abs_paramsFINAL(lines 4209 4211) no Hoare annotation was computed. [2018-11-28 20:48:30,248 INFO L448 ceAbstractionStarter]: For program point kbtab_exitFINAL(lines 3916 3924) no Hoare annotation was computed. [2018-11-28 20:48:30,248 INFO L451 ceAbstractionStarter]: At program point kbtab_exitENTRY(lines 3916 3924) the Hoare annotation is: true [2018-11-28 20:48:30,248 INFO L448 ceAbstractionStarter]: For program point kbtab_exitEXIT(lines 3916 3924) no Hoare annotation was computed. [2018-11-28 20:48:30,248 INFO L451 ceAbstractionStarter]: At program point input_free_deviceENTRY(lines 4202 4204) the Hoare annotation is: true [2018-11-28 20:48:30,248 INFO L448 ceAbstractionStarter]: For program point input_free_deviceEXIT(lines 4202 4204) no Hoare annotation was computed. [2018-11-28 20:48:30,248 INFO L448 ceAbstractionStarter]: For program point input_free_deviceFINAL(lines 4202 4204) no Hoare annotation was computed. [2018-11-28 20:48:30,248 INFO L451 ceAbstractionStarter]: At program point usb_to_input_idENTRY(lines 3557 3566) the Hoare annotation is: true [2018-11-28 20:48:30,248 INFO L448 ceAbstractionStarter]: For program point usb_to_input_idFINAL(lines 3557 3566) no Hoare annotation was computed. [2018-11-28 20:48:30,248 INFO L448 ceAbstractionStarter]: For program point usb_to_input_idEXIT(lines 3557 3566) no Hoare annotation was computed. [2018-11-28 20:48:30,248 INFO L448 ceAbstractionStarter]: For program point kzallocEXIT(lines 3393 3401) no Hoare annotation was computed. [2018-11-28 20:48:30,249 INFO L451 ceAbstractionStarter]: At program point kzallocENTRY(lines 3393 3401) the Hoare annotation is: true [2018-11-28 20:48:30,249 INFO L448 ceAbstractionStarter]: For program point L3397-1(line 3397) no Hoare annotation was computed. [2018-11-28 20:48:30,249 INFO L448 ceAbstractionStarter]: For program point kzallocFINAL(lines 3393 3401) no Hoare annotation was computed. [2018-11-28 20:48:30,249 INFO L451 ceAbstractionStarter]: At program point L3397(line 3397) the Hoare annotation is: true [2018-11-28 20:48:30,249 INFO L448 ceAbstractionStarter]: For program point ldv_assume_stopFINAL(lines 4043 4049) no Hoare annotation was computed. [2018-11-28 20:48:30,249 INFO L451 ceAbstractionStarter]: At program point ldv_assume_stopENTRY(lines 4043 4049) the Hoare annotation is: true [2018-11-28 20:48:30,249 INFO L448 ceAbstractionStarter]: For program point ldv_assume_stopEXIT(lines 4043 4049) no Hoare annotation was computed. [2018-11-28 20:48:30,249 INFO L451 ceAbstractionStarter]: At program point kmallocENTRY(lines 3383 3392) the Hoare annotation is: true [2018-11-28 20:48:30,249 INFO L451 ceAbstractionStarter]: At program point L3388(line 3388) the Hoare annotation is: true [2018-11-28 20:48:30,249 INFO L448 ceAbstractionStarter]: For program point L3388-1(line 3388) no Hoare annotation was computed. [2018-11-28 20:48:30,249 INFO L448 ceAbstractionStarter]: For program point kmallocFINAL(lines 3383 3392) no Hoare annotation was computed. [2018-11-28 20:48:30,250 INFO L448 ceAbstractionStarter]: For program point kmallocEXIT(lines 3383 3392) no Hoare annotation was computed. [2018-11-28 20:48:30,250 INFO L448 ceAbstractionStarter]: For program point L4094(lines 4094 4099) no Hoare annotation was computed. [2018-11-28 20:48:30,250 INFO L448 ceAbstractionStarter]: For program point L4086(lines 4085 4104) no Hoare annotation was computed. [2018-11-28 20:48:30,250 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-11-28 20:48:30,250 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-11-28 20:48:30,250 INFO L448 ceAbstractionStarter]: For program point usb_free_coherentEXIT(lines 4081 4110) no Hoare annotation was computed. [2018-11-28 20:48:30,250 INFO L448 ceAbstractionStarter]: For program point L4097-1(lines 4094 4099) no Hoare annotation was computed. [2018-11-28 20:48:30,250 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-11-28 20:48:30,250 INFO L451 ceAbstractionStarter]: At program point L4089(line 4089) the Hoare annotation is: true [2018-11-28 20:48:30,251 INFO L448 ceAbstractionStarter]: For program point L4087(lines 4085 4104) no Hoare annotation was computed. [2018-11-28 20:48:30,251 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-11-28 20:48:30,251 INFO L451 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 4218 4220) the Hoare annotation is: true [2018-11-28 20:48:30,251 INFO L448 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 4218 4220) no Hoare annotation was computed. [2018-11-28 20:48:30,251 INFO L448 ceAbstractionStarter]: For program point external_allocFINAL(lines 4248 4250) no Hoare annotation was computed. [2018-11-28 20:48:30,251 INFO L448 ceAbstractionStarter]: For program point external_allocEXIT(lines 4248 4250) no Hoare annotation was computed. [2018-11-28 20:48:30,251 INFO L451 ceAbstractionStarter]: At program point external_allocENTRY(lines 4248 4250) the Hoare annotation is: true [2018-11-28 20:48:30,251 INFO L448 ceAbstractionStarter]: For program point usb_deregisterEXIT(lines 4233 4235) no Hoare annotation was computed. [2018-11-28 20:48:30,251 INFO L448 ceAbstractionStarter]: For program point usb_deregisterFINAL(lines 4233 4235) no Hoare annotation was computed. [2018-11-28 20:48:30,251 INFO L451 ceAbstractionStarter]: At program point usb_deregisterENTRY(lines 4233 4235) the Hoare annotation is: true [2018-11-28 20:48:30,252 INFO L448 ceAbstractionStarter]: For program point usb_alloc_coherentFINAL(lines 4054 4079) no Hoare annotation was computed. [2018-11-28 20:48:30,252 INFO L448 ceAbstractionStarter]: For program point L4063(line 4063) no Hoare annotation was computed. [2018-11-28 20:48:30,252 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-11-28 20:48:30,252 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-11-28 20:48:30,252 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-11-28 20:48:30,252 INFO L448 ceAbstractionStarter]: For program point usb_alloc_coherentEXIT(lines 4054 4079) no Hoare annotation was computed. [2018-11-28 20:48:30,252 INFO L448 ceAbstractionStarter]: For program point L4074(lines 4059 4075) no Hoare annotation was computed. [2018-11-28 20:48:30,252 INFO L448 ceAbstractionStarter]: For program point L4066(lines 4066 4069) no Hoare annotation was computed. [2018-11-28 20:48:30,252 INFO L448 ceAbstractionStarter]: For program point ldv_check_return_valueFINAL(lines 4215 4217) no Hoare annotation was computed. [2018-11-28 20:48:30,252 INFO L448 ceAbstractionStarter]: For program point ldv_check_return_valueEXIT(lines 4215 4217) no Hoare annotation was computed. [2018-11-28 20:48:30,252 INFO L451 ceAbstractionStarter]: At program point ldv_check_return_valueENTRY(lines 4215 4217) the Hoare annotation is: true [2018-11-28 20:48:30,253 INFO L448 ceAbstractionStarter]: For program point L3425-1(line 3425) no Hoare annotation was computed. [2018-11-28 20:48:30,253 INFO L451 ceAbstractionStarter]: At program point L3425(line 3425) the Hoare annotation is: true [2018-11-28 20:48:30,253 INFO L451 ceAbstractionStarter]: At program point usb_set_intfdataENTRY(lines 3421 3429) the Hoare annotation is: true [2018-11-28 20:48:30,253 INFO L448 ceAbstractionStarter]: For program point usb_set_intfdataFINAL(lines 3421 3429) no Hoare annotation was computed. [2018-11-28 20:48:30,253 INFO L448 ceAbstractionStarter]: For program point usb_set_intfdataEXIT(lines 3421 3429) no Hoare annotation was computed. [2018-11-28 20:48:30,253 INFO L451 ceAbstractionStarter]: At program point usb_register_driverENTRY(lines 4240 4242) the Hoare annotation is: true [2018-11-28 20:48:30,253 INFO L448 ceAbstractionStarter]: For program point usb_register_driverFINAL(lines 4240 4242) no Hoare annotation was computed. [2018-11-28 20:48:30,253 INFO L448 ceAbstractionStarter]: For program point usb_register_driverEXIT(lines 4240 4242) no Hoare annotation was computed. [2018-11-28 20:48:30,253 INFO L448 ceAbstractionStarter]: For program point L4223(line 4223) no Hoare annotation was computed. [2018-11-28 20:48:30,254 INFO L448 ceAbstractionStarter]: For program point ldv_undefined_pointerFINAL(lines 4222 4224) no Hoare annotation was computed. [2018-11-28 20:48:30,254 INFO L451 ceAbstractionStarter]: At program point ldv_undefined_pointerENTRY(lines 4222 4224) the Hoare annotation is: true [2018-11-28 20:48:30,254 INFO L448 ceAbstractionStarter]: For program point ldv_undefined_pointerEXIT(lines 4222 4224) no Hoare annotation was computed. [2018-11-28 20:48:30,254 INFO L448 ceAbstractionStarter]: For program point L3801(lines 3801 3804) no Hoare annotation was computed. [2018-11-28 20:48:30,254 INFO L448 ceAbstractionStarter]: For program point L3793(lines 3793 3796) no Hoare annotation was computed. [2018-11-28 20:48:30,254 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-11-28 20:48:30,254 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-11-28 20:48:30,254 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-11-28 20:48:30,254 INFO L448 ceAbstractionStarter]: For program point L3839(lines 3839 3842) no Hoare annotation was computed. [2018-11-28 20:48:30,255 INFO L448 ceAbstractionStarter]: For program point L3806-1(line 3806) no Hoare annotation was computed. [2018-11-28 20:48:30,255 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-11-28 20:48:30,255 INFO L448 ceAbstractionStarter]: For program point L3831-1(line 3831) no Hoare annotation was computed. [2018-11-28 20:48:30,255 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-11-28 20:48:30,255 INFO L448 ceAbstractionStarter]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2018-11-28 20:48:30,255 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-11-28 20:48:30,255 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-11-28 20:48:30,255 INFO L448 ceAbstractionStarter]: For program point L3790(lines 3790 3796) no Hoare annotation was computed. [2018-11-28 20:48:30,256 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-11-28 20:48:30,256 INFO L448 ceAbstractionStarter]: For program point L3819-1(line 3819) no Hoare annotation was computed. [2018-11-28 20:48:30,256 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-11-28 20:48:30,256 INFO L448 ceAbstractionStarter]: For program point L3786-1(line 3786) no Hoare annotation was computed. [2018-11-28 20:48:30,256 INFO L448 ceAbstractionStarter]: For program point L3815-1(line 3815) no Hoare annotation was computed. [2018-11-28 20:48:30,256 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-11-28 20:48:30,256 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-11-28 20:48:30,256 INFO L448 ceAbstractionStarter]: For program point L3844-1(line 3844) no Hoare annotation was computed. [2018-11-28 20:48:30,256 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-11-28 20:48:30,257 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-11-28 20:48:30,257 INFO L448 ceAbstractionStarter]: For program point L3836-1(line 3836) no Hoare annotation was computed. [2018-11-28 20:48:30,257 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-11-28 20:48:30,257 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-11-28 20:48:30,257 INFO L448 ceAbstractionStarter]: For program point L3832-1(lines 3832 3833) no Hoare annotation was computed. [2018-11-28 20:48:30,257 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-11-28 20:48:30,257 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-11-28 20:48:30,258 INFO L448 ceAbstractionStarter]: For program point kbtab_probeFINAL(lines 3770 3862) no Hoare annotation was computed. [2018-11-28 20:48:30,258 INFO L448 ceAbstractionStarter]: For program point L3853-1(line 3853) no Hoare annotation was computed. [2018-11-28 20:48:30,258 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-11-28 20:48:30,258 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-11-28 20:48:30,258 INFO L448 ceAbstractionStarter]: For program point L3849-1(line 3849) no Hoare annotation was computed. [2018-11-28 20:48:30,258 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-11-28 20:48:30,258 INFO L448 ceAbstractionStarter]: For program point L3783-1(line 3783) no Hoare annotation was computed. [2018-11-28 20:48:30,258 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-11-28 20:48:30,259 INFO L448 ceAbstractionStarter]: For program point L3816-1(line 3816) no Hoare annotation was computed. [2018-11-28 20:48:30,259 INFO L448 ceAbstractionStarter]: For program point L3808(lines 3808 3811) no Hoare annotation was computed. [2018-11-28 20:48:30,259 INFO L448 ceAbstractionStarter]: For program point L3829(line 3829) no Hoare annotation was computed. [2018-11-28 20:48:30,259 INFO L448 ceAbstractionStarter]: For program point L3858(line 3858) no Hoare annotation was computed. [2018-11-28 20:48:30,259 INFO L448 ceAbstractionStarter]: For program point kbtab_probeEXIT(lines 3770 3862) no Hoare annotation was computed. [2018-11-28 20:48:30,259 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-11-28 20:48:30,259 INFO L448 ceAbstractionStarter]: For program point L3821-1(line 3821) no Hoare annotation was computed. [2018-11-28 20:48:30,259 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-11-28 20:48:30,259 INFO L448 ceAbstractionStarter]: For program point L3788-1(line 3788) no Hoare annotation was computed. [2018-11-28 20:48:30,260 INFO L448 ceAbstractionStarter]: For program point L3517-1(line 3517) no Hoare annotation was computed. [2018-11-28 20:48:30,260 INFO L451 ceAbstractionStarter]: At program point input_set_drvdataENTRY(lines 3513 3521) the Hoare annotation is: true [2018-11-28 20:48:30,260 INFO L451 ceAbstractionStarter]: At program point L3517(line 3517) the Hoare annotation is: true [2018-11-28 20:48:30,260 INFO L448 ceAbstractionStarter]: For program point input_set_drvdataFINAL(lines 3513 3521) no Hoare annotation was computed. [2018-11-28 20:48:30,260 INFO L448 ceAbstractionStarter]: For program point input_set_drvdataEXIT(lines 3513 3521) no Hoare annotation was computed. [2018-11-28 20:48:30,260 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-11-28 20:48:30,260 INFO L448 ceAbstractionStarter]: For program point L4154-1(lines 4151 4156) no Hoare annotation was computed. [2018-11-28 20:48:30,260 INFO L451 ceAbstractionStarter]: At program point L4146(line 4146) the Hoare annotation is: true [2018-11-28 20:48:30,260 INFO L448 ceAbstractionStarter]: For program point L4144(lines 4142 4161) no Hoare annotation was computed. [2018-11-28 20:48:30,260 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-11-28 20:48:30,260 INFO L448 ceAbstractionStarter]: For program point usb_free_urbEXIT(lines 4138 4167) no Hoare annotation was computed. [2018-11-28 20:48:30,261 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-11-28 20:48:30,261 INFO L448 ceAbstractionStarter]: For program point L4151(lines 4151 4156) no Hoare annotation was computed. [2018-11-28 20:48:30,261 INFO L448 ceAbstractionStarter]: For program point L4143(lines 4142 4161) no Hoare annotation was computed. [2018-11-28 20:48:30,261 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-11-28 20:48:30,261 INFO L448 ceAbstractionStarter]: For program point usb_make_pathEXIT(lines 3437 3451) no Hoare annotation was computed. [2018-11-28 20:48:30,261 INFO L451 ceAbstractionStarter]: At program point usb_make_pathENTRY(lines 3437 3451) the Hoare annotation is: true [2018-11-28 20:48:30,261 INFO L448 ceAbstractionStarter]: For program point L3444(lines 3444 3448) no Hoare annotation was computed. [2018-11-28 20:48:30,261 INFO L448 ceAbstractionStarter]: For program point usb_make_pathFINAL(lines 3437 3451) no Hoare annotation was computed. [2018-11-28 20:48:30,261 INFO L448 ceAbstractionStarter]: For program point L3444-2(lines 3444 3448) no Hoare annotation was computed. [2018-11-28 20:48:30,261 INFO L451 ceAbstractionStarter]: At program point __create_pipeENTRY(lines 3494 3499) the Hoare annotation is: true [2018-11-28 20:48:30,262 INFO L448 ceAbstractionStarter]: For program point __create_pipeFINAL(lines 3494 3499) no Hoare annotation was computed. [2018-11-28 20:48:30,262 INFO L448 ceAbstractionStarter]: For program point __create_pipeEXIT(lines 3494 3499) no Hoare annotation was computed. [2018-11-28 20:48:30,262 INFO L448 ceAbstractionStarter]: For program point input_allocate_deviceFINAL(lines 3500 3502) no Hoare annotation was computed. [2018-11-28 20:48:30,262 INFO L451 ceAbstractionStarter]: At program point input_allocate_deviceENTRY(lines 3500 3502) the Hoare annotation is: true [2018-11-28 20:48:30,262 INFO L448 ceAbstractionStarter]: For program point L3501(line 3501) no Hoare annotation was computed. [2018-11-28 20:48:30,262 INFO L448 ceAbstractionStarter]: For program point input_allocate_deviceEXIT(lines 3500 3502) no Hoare annotation was computed. [2018-11-28 20:48:30,262 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 20:48:30,262 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-11-28 20:48:30,262 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 20:48:30,263 INFO L448 ceAbstractionStarter]: For program point interface_to_usbdevFINAL(lines 3430 3436) no Hoare annotation was computed. [2018-11-28 20:48:30,263 INFO L451 ceAbstractionStarter]: At program point interface_to_usbdevENTRY(lines 3430 3436) the Hoare annotation is: true [2018-11-28 20:48:30,263 INFO L448 ceAbstractionStarter]: For program point interface_to_usbdevEXIT(lines 3430 3436) no Hoare annotation was computed. [2018-11-28 20:48:30,263 INFO L451 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 4169 4186) the Hoare annotation is: true [2018-11-28 20:48:30,263 INFO L448 ceAbstractionStarter]: For program point L4181-1(lines 4169 4186) no Hoare annotation was computed. [2018-11-28 20:48:30,263 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-11-28 20:48:30,263 INFO L448 ceAbstractionStarter]: For program point L4175-1(lines 4171 4185) no Hoare annotation was computed. [2018-11-28 20:48:30,263 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-11-28 20:48:30,263 INFO L448 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 4169 4186) no Hoare annotation was computed. [2018-11-28 20:48:30,263 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-11-28 20:48:30,264 INFO L448 ceAbstractionStarter]: For program point L4123(lines 4123 4126) no Hoare annotation was computed. [2018-11-28 20:48:30,264 INFO L448 ceAbstractionStarter]: For program point L4120(line 4120) no Hoare annotation was computed. [2018-11-28 20:48:30,264 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-11-28 20:48:30,264 INFO L448 ceAbstractionStarter]: For program point usb_alloc_urbFINAL(lines 4112 4136) no Hoare annotation was computed. [2018-11-28 20:48:30,264 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-11-28 20:48:30,264 INFO L448 ceAbstractionStarter]: For program point L4131(lines 4116 4132) no Hoare annotation was computed. [2018-11-28 20:48:30,264 INFO L448 ceAbstractionStarter]: For program point usb_alloc_urbEXIT(lines 4112 4136) no Hoare annotation was computed. [2018-11-28 20:48:30,264 INFO L448 ceAbstractionStarter]: For program point L3457-1(line 3457) no Hoare annotation was computed. [2018-11-28 20:48:30,264 INFO L451 ceAbstractionStarter]: At program point L3457(line 3457) the Hoare annotation is: true [2018-11-28 20:48:30,265 INFO L451 ceAbstractionStarter]: At program point usb_registerENTRY(lines 3453 3461) the Hoare annotation is: true [2018-11-28 20:48:30,265 INFO L448 ceAbstractionStarter]: For program point usb_registerEXIT(lines 3453 3461) no Hoare annotation was computed. [2018-11-28 20:48:30,265 INFO L448 ceAbstractionStarter]: For program point usb_registerFINAL(lines 3453 3461) no Hoare annotation was computed. [2018-11-28 20:48:30,265 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 20:48:30,265 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-11-28 20:48:30,265 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 20:48:30,265 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 20:48:30,265 INFO L448 ceAbstractionStarter]: For program point input_register_deviceFINAL(lines 4206 4208) no Hoare annotation was computed. [2018-11-28 20:48:30,265 INFO L451 ceAbstractionStarter]: At program point input_register_deviceENTRY(lines 4206 4208) the Hoare annotation is: true [2018-11-28 20:48:30,265 INFO L448 ceAbstractionStarter]: For program point input_register_deviceEXIT(lines 4206 4208) no Hoare annotation was computed. [2018-11-28 20:48:30,265 INFO L451 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4034 4039) the Hoare annotation is: true [2018-11-28 20:48:30,266 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4034 4039) no Hoare annotation was computed. [2018-11-28 20:48:30,266 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2018-11-28 20:48:30,266 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4034 4039) no Hoare annotation was computed. [2018-11-28 20:48:30,266 INFO L448 ceAbstractionStarter]: For program point dev_set_drvdataFINAL(lines 4196 4198) no Hoare annotation was computed. [2018-11-28 20:48:30,266 INFO L448 ceAbstractionStarter]: For program point dev_set_drvdataEXIT(lines 4196 4198) no Hoare annotation was computed. [2018-11-28 20:48:30,266 INFO L451 ceAbstractionStarter]: At program point dev_set_drvdataENTRY(lines 4196 4198) the Hoare annotation is: true [2018-11-28 20:48:30,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:48:30 BoogieIcfgContainer [2018-11-28 20:48:30,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:48:30,296 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:48:30,296 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:48:30,297 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:48:30,297 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:47:51" (3/4) ... [2018-11-28 20:48:30,301 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 20:48:30,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2018-11-28 20:48:30,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2018-11-28 20:48:30,319 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_unregister_device [2018-11-28 20:48:30,322 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2018-11-28 20:48:30,322 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2018-11-28 20:48:30,322 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_disconnect [2018-11-28 20:48:30,322 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __kmalloc [2018-11-28 20:48:30,322 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 20:48:30,322 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2018-11-28 20:48:30,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure strlcat [2018-11-28 20:48:30,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2018-11-28 20:48:30,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2018-11-28 20:48:30,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_free_device [2018-11-28 20:48:30,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_to_input_id [2018-11-28 20:48:30,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2018-11-28 20:48:30,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2018-11-28 20:48:30,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2018-11-28 20:48:30,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2018-11-28 20:48:30,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_initialize [2018-11-28 20:48:30,323 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure external_alloc [2018-11-28 20:48:30,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_deregister [2018-11-28 20:48:30,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_coherent [2018-11-28 20:48:30,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_return_value [2018-11-28 20:48:30,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2018-11-28 20:48:30,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_register_driver [2018-11-28 20:48:30,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2018-11-28 20:48:30,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_probe [2018-11-28 20:48:30,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_drvdata [2018-11-28 20:48:30,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2018-11-28 20:48:30,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_make_path [2018-11-28 20:48:30,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2018-11-28 20:48:30,330 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_allocate_device [2018-11-28 20:48:30,330 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 20:48:30,330 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure interface_to_usbdev [2018-11-28 20:48:30,330 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-28 20:48:30,330 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2018-11-28 20:48:30,330 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_register [2018-11-28 20:48:30,331 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_register_device [2018-11-28 20:48:30,331 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-11-28 20:48:30,331 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2018-11-28 20:48:30,368 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 201 nodes and edges [2018-11-28 20:48:30,369 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2018-11-28 20:48:30,372 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2018-11-28 20:48:30,374 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-28 20:48:30,379 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 20:48:30,380 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-28 20:48:30,429 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-11-28 20:48:30,429 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-11-28 20:48:30,430 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-11-28 20:48:30,430 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-11-28 20:48:30,430 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-11-28 20:48:30,431 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-11-28 20:48:30,431 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-11-28 20:48:30,431 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-11-28 20:48:30,431 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-11-28 20:48:30,432 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-11-28 20:48:30,433 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-11-28 20:48:30,435 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-11-28 20:48:30,436 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-11-28 20:48:30,437 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-11-28 20:48:30,547 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:48:30,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:48:30,548 INFO L168 Benchmark]: Toolchain (without parser) took 43419.05 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 625.0 MB). Free memory was 947.2 MB in the beginning and 1.5 GB in the end (delta: -511.5 MB). Peak memory consumption was 113.5 MB. Max. memory is 11.5 GB. [2018-11-28 20:48:30,549 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:48:30,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1532.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:48:30,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:48:30,550 INFO L168 Benchmark]: Boogie Preprocessor took 159.59 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:48:30,550 INFO L168 Benchmark]: RCFGBuilder took 2335.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 936.7 MB in the end (delta: 140.2 MB). Peak memory consumption was 140.2 MB. Max. memory is 11.5 GB. [2018-11-28 20:48:30,550 INFO L168 Benchmark]: TraceAbstraction took 39045.45 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 482.3 MB). Free memory was 936.7 MB in the beginning and 1.5 GB in the end (delta: -538.4 MB). Peak memory consumption was 542.1 MB. Max. memory is 11.5 GB. [2018-11-28 20:48:30,551 INFO L168 Benchmark]: Witness Printer took 250.65 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2018-11-28 20:48:30,553 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1532.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 159.59 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2335.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 936.7 MB in the end (delta: 140.2 MB). Peak memory consumption was 140.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39045.45 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 482.3 MB). Free memory was 936.7 MB in the beginning and 1.5 GB in the end (delta: -538.4 MB). Peak memory consumption was 542.1 MB. Max. memory is 11.5 GB. * Witness Printer took 250.65 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 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, 38.9s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 5755 SDtfs, 5234 SDslu, 10827 SDs, 0 SdLazy, 3872 SolverSat, 2336 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 936 GetRequests, 815 SyntacticMatches, 11 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 8.3s 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: 1.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 449 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 104 LocationsWithAnnotation, 4852 PreInvPairs, 4944 NumberOfFragments, 1769 HoareAnnotationTreeSize, 4852 FomulaSimplifications, 8829 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 104 FomulaSimplificationsInter, 4971 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 4057 NumberOfCodeBlocks, 4057 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 4034 ConstructedInterpolants, 0 QuantifiedInterpolants, 1679646 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5048 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...