./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c4ab3a1b7a928c9fbfa3f31e196dab10da7fc09a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:08:42,316 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:08:42,317 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:08:42,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:08:42,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:08:42,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:08:42,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:08:42,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:08:42,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:08:42,330 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:08:42,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:08:42,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:08:42,332 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:08:42,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:08:42,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:08:42,333 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:08:42,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:08:42,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:08:42,336 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:08:42,337 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:08:42,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:08:42,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:08:42,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:08:42,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:08:42,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:08:42,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:08:42,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:08:42,343 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:08:42,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:08:42,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:08:42,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:08:42,345 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:08:42,345 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:08:42,345 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:08:42,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:08:42,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:08:42,346 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-22 23:08:42,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:08:42,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:08:42,356 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:08:42,356 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:08:42,357 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:08:42,357 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:08:42,357 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:08:42,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:08:42,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:08:42,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:08:42,357 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:08:42,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:08:42,358 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:08:42,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:08:42,358 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:08:42,358 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:08:42,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:08:42,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:08:42,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:08:42,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:08:42,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:08:42,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:08:42,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:08:42,359 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:08:42,360 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:08:42,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:08:42,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:08:42,360 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 23:08:42,360 INFO L133 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c4ab3a1b7a928c9fbfa3f31e196dab10da7fc09a [2018-11-22 23:08:42,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:08:42,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:08:42,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:08:42,401 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:08:42,401 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:08:42,402 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-22 23:08:42,451 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/data/02fc1dfd6/a4b5816b3a9a44e798a28ae034d84cbf/FLAG829778b99 [2018-11-22 23:08:42,955 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:08:42,956 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-22 23:08:42,974 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/data/02fc1dfd6/a4b5816b3a9a44e798a28ae034d84cbf/FLAG829778b99 [2018-11-22 23:08:43,477 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/data/02fc1dfd6/a4b5816b3a9a44e798a28ae034d84cbf [2018-11-22 23:08:43,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:08:43,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:08:43,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:08:43,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:08:43,486 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:08:43,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:08:43" (1/1) ... [2018-11-22 23:08:43,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fe7c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:43, skipping insertion in model container [2018-11-22 23:08:43,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:08:43" (1/1) ... [2018-11-22 23:08:43,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:08:43,559 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:08:44,113 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:08:44,135 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:08:44,243 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:08:44,275 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:08:44,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44 WrapperNode [2018-11-22 23:08:44,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:08:44,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:08:44,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:08:44,277 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:08:44,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44" (1/1) ... [2018-11-22 23:08:44,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44" (1/1) ... [2018-11-22 23:08:44,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:08:44,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:08:44,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:08:44,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:08:44,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44" (1/1) ... [2018-11-22 23:08:44,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44" (1/1) ... [2018-11-22 23:08:44,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44" (1/1) ... [2018-11-22 23:08:44,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44" (1/1) ... [2018-11-22 23:08:44,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44" (1/1) ... [2018-11-22 23:08:44,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44" (1/1) ... [2018-11-22 23:08:44,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44" (1/1) ... [2018-11-22 23:08:44,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:08:44,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:08:44,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:08:44,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:08:44,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:08:44,433 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2018-11-22 23:08:44,434 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2018-11-22 23:08:44,434 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-22 23:08:44,434 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2018-11-22 23:08:44,434 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2018-11-22 23:08:44,435 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-11-22 23:08:44,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:08:44,435 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:08:44,435 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-11-22 23:08:44,435 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-11-22 23:08:44,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 23:08:44,435 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2018-11-22 23:08:44,436 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2018-11-22 23:08:44,436 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2018-11-22 23:08:44,436 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2018-11-22 23:08:44,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:08:44,437 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-11-22 23:08:44,437 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-11-22 23:08:44,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-22 23:08:44,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:08:44,437 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2018-11-22 23:08:44,437 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-11-22 23:08:44,437 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-11-22 23:08:44,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 23:08:44,438 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2018-11-22 23:08:44,438 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2018-11-22 23:08:44,438 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2018-11-22 23:08:44,438 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-11-22 23:08:44,438 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-11-22 23:08:44,438 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-11-22 23:08:44,438 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-11-22 23:08:44,438 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-11-22 23:08:44,439 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-11-22 23:08:44,439 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-11-22 23:08:44,439 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-11-22 23:08:44,439 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-11-22 23:08:44,439 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-11-22 23:08:44,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-22 23:08:44,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-22 23:08:44,439 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-22 23:08:44,439 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-11-22 23:08:44,439 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-11-22 23:08:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-22 23:08:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2018-11-22 23:08:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-22 23:08:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2018-11-22 23:08:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:08:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-11-22 23:08:44,440 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-11-22 23:08:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-22 23:08:44,440 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-22 23:08:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-11-22 23:08:44,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-11-22 23:08:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-22 23:08:44,441 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-22 23:08:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2018-11-22 23:08:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-11-22 23:08:44,441 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-11-22 23:08:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2018-11-22 23:08:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-22 23:08:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-11-22 23:08:44,442 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-11-22 23:08:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:08:44,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:08:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-11-22 23:08:44,442 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-11-22 23:08:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-22 23:08:44,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-22 23:08:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-11-22 23:08:44,442 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-11-22 23:08:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:08:44,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:08:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2018-11-22 23:08:44,782 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-22 23:08:44,783 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-22 23:08:45,308 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:08:45,308 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-22 23:08:45,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:08:45 BoogieIcfgContainer [2018-11-22 23:08:45,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:08:45,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:08:45,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:08:45,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:08:45,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:08:43" (1/3) ... [2018-11-22 23:08:45,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d3fd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:08:45, skipping insertion in model container [2018-11-22 23:08:45,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:08:44" (2/3) ... [2018-11-22 23:08:45,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d3fd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:08:45, skipping insertion in model container [2018-11-22 23:08:45,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:08:45" (3/3) ... [2018-11-22 23:08:45,316 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-22 23:08:45,323 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:08:45,330 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:08:45,343 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:08:45,369 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:08:45,370 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:08:45,370 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:08:45,370 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:08:45,371 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:08:45,371 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:08:45,371 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:08:45,371 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:08:45,371 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:08:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states. [2018-11-22 23:08:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 23:08:45,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:45,398 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] [2018-11-22 23:08:45,400 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:45,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1063820110, now seen corresponding path program 1 times [2018-11-22 23:08:45,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:45,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:45,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:45,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:45,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:45,703 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-22 23:08:45,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:45,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:08:45,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:08:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:08:45,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:08:45,720 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 3 states. [2018-11-22 23:08:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:45,803 INFO L93 Difference]: Finished difference Result 474 states and 620 transitions. [2018-11-22 23:08:45,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:08:45,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-22 23:08:45,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:45,819 INFO L225 Difference]: With dead ends: 474 [2018-11-22 23:08:45,820 INFO L226 Difference]: Without dead ends: 303 [2018-11-22 23:08:45,824 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-22 23:08:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-22 23:08:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2018-11-22 23:08:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-22 23:08:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 352 transitions. [2018-11-22 23:08:45,892 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 352 transitions. Word has length 23 [2018-11-22 23:08:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:45,893 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 352 transitions. [2018-11-22 23:08:45,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:08:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 352 transitions. [2018-11-22 23:08:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 23:08:45,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:45,894 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] [2018-11-22 23:08:45,895 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:45,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1381458738, now seen corresponding path program 1 times [2018-11-22 23:08:45,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:45,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:45,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:45,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:45,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:45,989 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-22 23:08:45,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:45,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:08:45,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:08:45,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:08:45,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:08:45,993 INFO L87 Difference]: Start difference. First operand 299 states and 352 transitions. Second operand 3 states. [2018-11-22 23:08:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:46,079 INFO L93 Difference]: Finished difference Result 856 states and 1025 transitions. [2018-11-22 23:08:46,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:08:46,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-22 23:08:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:46,084 INFO L225 Difference]: With dead ends: 856 [2018-11-22 23:08:46,084 INFO L226 Difference]: Without dead ends: 569 [2018-11-22 23:08:46,087 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-22 23:08:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-11-22 23:08:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 562. [2018-11-22 23:08:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-11-22 23:08:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 666 transitions. [2018-11-22 23:08:46,128 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 666 transitions. Word has length 24 [2018-11-22 23:08:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:46,129 INFO L480 AbstractCegarLoop]: Abstraction has 562 states and 666 transitions. [2018-11-22 23:08:46,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:08:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 666 transitions. [2018-11-22 23:08:46,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-22 23:08:46,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:46,131 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] [2018-11-22 23:08:46,131 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:46,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash -160909395, now seen corresponding path program 1 times [2018-11-22 23:08:46,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:46,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:46,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:46,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:46,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:08:46,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:46,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:08:46,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:08:46,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:08:46,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:08:46,222 INFO L87 Difference]: Start difference. First operand 562 states and 666 transitions. Second operand 3 states. [2018-11-22 23:08:46,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:46,273 INFO L93 Difference]: Finished difference Result 1141 states and 1371 transitions. [2018-11-22 23:08:46,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:08:46,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-22 23:08:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:46,276 INFO L225 Difference]: With dead ends: 1141 [2018-11-22 23:08:46,276 INFO L226 Difference]: Without dead ends: 597 [2018-11-22 23:08:46,279 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-22 23:08:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-11-22 23:08:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2018-11-22 23:08:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2018-11-22 23:08:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 712 transitions. [2018-11-22 23:08:46,306 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 712 transitions. Word has length 46 [2018-11-22 23:08:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:46,306 INFO L480 AbstractCegarLoop]: Abstraction has 597 states and 712 transitions. [2018-11-22 23:08:46,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:08:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 712 transitions. [2018-11-22 23:08:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-22 23:08:46,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:46,308 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:46,309 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:46,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:46,309 INFO L82 PathProgramCache]: Analyzing trace with hash -314336580, now seen corresponding path program 1 times [2018-11-22 23:08:46,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:46,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:46,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:46,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:46,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:46,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:08:46,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:08:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:08:46,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:08:46,435 INFO L87 Difference]: Start difference. First operand 597 states and 712 transitions. Second operand 5 states. [2018-11-22 23:08:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:46,482 INFO L93 Difference]: Finished difference Result 903 states and 1081 transitions. [2018-11-22 23:08:46,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:08:46,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-11-22 23:08:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:46,485 INFO L225 Difference]: With dead ends: 903 [2018-11-22 23:08:46,485 INFO L226 Difference]: Without dead ends: 605 [2018-11-22 23:08:46,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:08:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-11-22 23:08:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2018-11-22 23:08:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-11-22 23:08:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 720 transitions. [2018-11-22 23:08:46,509 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 720 transitions. Word has length 81 [2018-11-22 23:08:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:46,510 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 720 transitions. [2018-11-22 23:08:46,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:08:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 720 transitions. [2018-11-22 23:08:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-22 23:08:46,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:46,513 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:46,513 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:46,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash -612322190, now seen corresponding path program 1 times [2018-11-22 23:08:46,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:46,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:46,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:46,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:46,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:46,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:46,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:08:46,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:08:46,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:08:46,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:08:46,657 INFO L87 Difference]: Start difference. First operand 605 states and 720 transitions. Second operand 5 states. [2018-11-22 23:08:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:46,699 INFO L93 Difference]: Finished difference Result 999 states and 1193 transitions. [2018-11-22 23:08:46,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:08:46,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-11-22 23:08:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:46,702 INFO L225 Difference]: With dead ends: 999 [2018-11-22 23:08:46,702 INFO L226 Difference]: Without dead ends: 413 [2018-11-22 23:08:46,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:08:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-11-22 23:08:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-11-22 23:08:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-11-22 23:08:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 485 transitions. [2018-11-22 23:08:46,720 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 485 transitions. Word has length 85 [2018-11-22 23:08:46,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:46,720 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 485 transitions. [2018-11-22 23:08:46,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:08:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 485 transitions. [2018-11-22 23:08:46,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-22 23:08:46,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:46,722 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:46,722 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:46,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:46,724 INFO L82 PathProgramCache]: Analyzing trace with hash 632442291, now seen corresponding path program 1 times [2018-11-22 23:08:46,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:46,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:46,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:46,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:46,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:46,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:46,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 23:08:46,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:08:46,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:08:46,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:08:46,853 INFO L87 Difference]: Start difference. First operand 413 states and 485 transitions. Second operand 6 states. [2018-11-22 23:08:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:47,563 INFO L93 Difference]: Finished difference Result 752 states and 890 transitions. [2018-11-22 23:08:47,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:08:47,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-22 23:08:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:47,567 INFO L225 Difference]: With dead ends: 752 [2018-11-22 23:08:47,567 INFO L226 Difference]: Without dead ends: 749 [2018-11-22 23:08:47,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:08:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-11-22 23:08:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 719. [2018-11-22 23:08:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-11-22 23:08:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 858 transitions. [2018-11-22 23:08:47,601 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 858 transitions. Word has length 85 [2018-11-22 23:08:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:47,601 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 858 transitions. [2018-11-22 23:08:47,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:08:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 858 transitions. [2018-11-22 23:08:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-22 23:08:47,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:47,604 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:47,605 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:47,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:47,605 INFO L82 PathProgramCache]: Analyzing trace with hash -576204133, now seen corresponding path program 1 times [2018-11-22 23:08:47,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:47,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:47,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:47,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:47,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:47,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:47,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 23:08:47,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:08:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:08:47,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:08:47,709 INFO L87 Difference]: Start difference. First operand 719 states and 858 transitions. Second operand 6 states. [2018-11-22 23:08:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:47,829 INFO L93 Difference]: Finished difference Result 1429 states and 1720 transitions. [2018-11-22 23:08:47,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:08:47,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-22 23:08:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:47,833 INFO L225 Difference]: With dead ends: 1429 [2018-11-22 23:08:47,833 INFO L226 Difference]: Without dead ends: 720 [2018-11-22 23:08:47,835 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-22 23:08:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-11-22 23:08:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 699. [2018-11-22 23:08:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-11-22 23:08:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 845 transitions. [2018-11-22 23:08:47,870 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 845 transitions. Word has length 89 [2018-11-22 23:08:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:47,870 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 845 transitions. [2018-11-22 23:08:47,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:08:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 845 transitions. [2018-11-22 23:08:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-22 23:08:47,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:47,871 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:47,872 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:47,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1389575044, now seen corresponding path program 1 times [2018-11-22 23:08:47,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:47,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:47,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:47,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:47,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:47,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:47,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:08:47,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:08:47,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:08:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:08:47,966 INFO L87 Difference]: Start difference. First operand 699 states and 845 transitions. Second operand 5 states. [2018-11-22 23:08:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:48,004 INFO L93 Difference]: Finished difference Result 750 states and 903 transitions. [2018-11-22 23:08:48,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:08:48,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-11-22 23:08:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:48,008 INFO L225 Difference]: With dead ends: 750 [2018-11-22 23:08:48,008 INFO L226 Difference]: Without dead ends: 707 [2018-11-22 23:08:48,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:08:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-22 23:08:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 704. [2018-11-22 23:08:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-11-22 23:08:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 845 transitions. [2018-11-22 23:08:48,039 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 845 transitions. Word has length 98 [2018-11-22 23:08:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:48,039 INFO L480 AbstractCegarLoop]: Abstraction has 704 states and 845 transitions. [2018-11-22 23:08:48,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:08:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 845 transitions. [2018-11-22 23:08:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-22 23:08:48,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:48,040 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:48,040 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:48,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:48,041 INFO L82 PathProgramCache]: Analyzing trace with hash 127439361, now seen corresponding path program 1 times [2018-11-22 23:08:48,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:48,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:48,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:48,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:48,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:48,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:48,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:08:48,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:08:48,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:08:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:08:48,133 INFO L87 Difference]: Start difference. First operand 704 states and 845 transitions. Second operand 3 states. [2018-11-22 23:08:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:48,166 INFO L93 Difference]: Finished difference Result 1304 states and 1589 transitions. [2018-11-22 23:08:48,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:08:48,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-22 23:08:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:48,170 INFO L225 Difference]: With dead ends: 1304 [2018-11-22 23:08:48,170 INFO L226 Difference]: Without dead ends: 657 [2018-11-22 23:08:48,172 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-22 23:08:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-22 23:08:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2018-11-22 23:08:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-22 23:08:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 779 transitions. [2018-11-22 23:08:48,208 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 779 transitions. Word has length 99 [2018-11-22 23:08:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:48,208 INFO L480 AbstractCegarLoop]: Abstraction has 657 states and 779 transitions. [2018-11-22 23:08:48,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:08:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 779 transitions. [2018-11-22 23:08:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-22 23:08:48,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:48,210 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:48,210 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:48,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash 822282022, now seen corresponding path program 1 times [2018-11-22 23:08:48,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:48,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:48,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:48,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:48,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:48,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:48,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 23:08:48,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:08:48,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:08:48,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:08:48,316 INFO L87 Difference]: Start difference. First operand 657 states and 779 transitions. Second operand 6 states. [2018-11-22 23:08:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:48,375 INFO L93 Difference]: Finished difference Result 1300 states and 1543 transitions. [2018-11-22 23:08:48,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:08:48,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-11-22 23:08:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:48,379 INFO L225 Difference]: With dead ends: 1300 [2018-11-22 23:08:48,379 INFO L226 Difference]: Without dead ends: 657 [2018-11-22 23:08:48,381 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-22 23:08:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-22 23:08:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2018-11-22 23:08:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-22 23:08:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 778 transitions. [2018-11-22 23:08:48,411 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 778 transitions. Word has length 101 [2018-11-22 23:08:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:48,411 INFO L480 AbstractCegarLoop]: Abstraction has 657 states and 778 transitions. [2018-11-22 23:08:48,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:08:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 778 transitions. [2018-11-22 23:08:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-22 23:08:48,412 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:48,412 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:48,413 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:48,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:48,413 INFO L82 PathProgramCache]: Analyzing trace with hash -172411676, now seen corresponding path program 1 times [2018-11-22 23:08:48,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:48,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:48,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:48,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:48,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:48,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:48,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 23:08:48,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 23:08:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 23:08:48,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:08:48,621 INFO L87 Difference]: Start difference. First operand 657 states and 778 transitions. Second operand 8 states. [2018-11-22 23:08:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:49,466 INFO L93 Difference]: Finished difference Result 1338 states and 1676 transitions. [2018-11-22 23:08:49,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 23:08:49,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-11-22 23:08:49,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:49,475 INFO L225 Difference]: With dead ends: 1338 [2018-11-22 23:08:49,476 INFO L226 Difference]: Without dead ends: 986 [2018-11-22 23:08:49,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-22 23:08:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-11-22 23:08:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 801. [2018-11-22 23:08:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-22 23:08:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 950 transitions. [2018-11-22 23:08:49,526 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 950 transitions. Word has length 101 [2018-11-22 23:08:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:49,526 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 950 transitions. [2018-11-22 23:08:49,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 23:08:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 950 transitions. [2018-11-22 23:08:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-22 23:08:49,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:49,529 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:49,529 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:49,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:49,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1698966308, now seen corresponding path program 1 times [2018-11-22 23:08:49,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:49,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:49,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:49,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:49,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:49,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:49,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:08:49,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:08:49,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:08:49,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:08:49,667 INFO L87 Difference]: Start difference. First operand 801 states and 950 transitions. Second operand 5 states. [2018-11-22 23:08:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:49,705 INFO L93 Difference]: Finished difference Result 1221 states and 1448 transitions. [2018-11-22 23:08:49,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:08:49,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-11-22 23:08:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:49,708 INFO L225 Difference]: With dead ends: 1221 [2018-11-22 23:08:49,708 INFO L226 Difference]: Without dead ends: 459 [2018-11-22 23:08:49,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:08:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-11-22 23:08:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2018-11-22 23:08:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-11-22 23:08:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 534 transitions. [2018-11-22 23:08:49,733 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 534 transitions. Word has length 115 [2018-11-22 23:08:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:49,733 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 534 transitions. [2018-11-22 23:08:49,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:08:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 534 transitions. [2018-11-22 23:08:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-22 23:08:49,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:49,734 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:49,735 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:49,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:49,735 INFO L82 PathProgramCache]: Analyzing trace with hash 674272387, now seen corresponding path program 1 times [2018-11-22 23:08:49,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:49,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:49,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:49,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:49,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:49,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:49,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 23:08:49,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:08:49,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:08:49,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:08:49,889 INFO L87 Difference]: Start difference. First operand 459 states and 534 transitions. Second operand 6 states. [2018-11-22 23:08:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:50,593 INFO L93 Difference]: Finished difference Result 744 states and 873 transitions. [2018-11-22 23:08:50,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:08:50,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-11-22 23:08:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:50,597 INFO L225 Difference]: With dead ends: 744 [2018-11-22 23:08:50,597 INFO L226 Difference]: Without dead ends: 739 [2018-11-22 23:08:50,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:08:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-11-22 23:08:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 706. [2018-11-22 23:08:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2018-11-22 23:08:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 835 transitions. [2018-11-22 23:08:50,638 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 835 transitions. Word has length 115 [2018-11-22 23:08:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:50,638 INFO L480 AbstractCegarLoop]: Abstraction has 706 states and 835 transitions. [2018-11-22 23:08:50,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:08:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 835 transitions. [2018-11-22 23:08:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-22 23:08:50,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:50,640 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:50,640 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:50,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1118586308, now seen corresponding path program 1 times [2018-11-22 23:08:50,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:50,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:50,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:50,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:50,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:50,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:50,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:08:50,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:08:50,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:08:50,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:08:50,735 INFO L87 Difference]: Start difference. First operand 706 states and 835 transitions. Second operand 5 states. [2018-11-22 23:08:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:50,800 INFO L93 Difference]: Finished difference Result 744 states and 875 transitions. [2018-11-22 23:08:50,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:08:50,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2018-11-22 23:08:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:50,804 INFO L225 Difference]: With dead ends: 744 [2018-11-22 23:08:50,804 INFO L226 Difference]: Without dead ends: 727 [2018-11-22 23:08:50,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:08:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-11-22 23:08:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 710. [2018-11-22 23:08:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-11-22 23:08:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 838 transitions. [2018-11-22 23:08:50,847 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 838 transitions. Word has length 123 [2018-11-22 23:08:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:50,848 INFO L480 AbstractCegarLoop]: Abstraction has 710 states and 838 transitions. [2018-11-22 23:08:50,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:08:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 838 transitions. [2018-11-22 23:08:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-22 23:08:50,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:50,849 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:50,849 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:50,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1360481179, now seen corresponding path program 1 times [2018-11-22 23:08:50,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:50,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:50,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:50,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:50,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:50,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:08:50,967 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:08:50,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:51,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:51,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:08:51,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-11-22 23:08:51,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:08:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:08:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:08:51,238 INFO L87 Difference]: Start difference. First operand 710 states and 838 transitions. Second operand 5 states. [2018-11-22 23:08:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:51,345 INFO L93 Difference]: Finished difference Result 1228 states and 1449 transitions. [2018-11-22 23:08:51,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 23:08:51,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-11-22 23:08:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:51,349 INFO L225 Difference]: With dead ends: 1228 [2018-11-22 23:08:51,350 INFO L226 Difference]: Without dead ends: 584 [2018-11-22 23:08:51,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:08:51,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-11-22 23:08:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 578. [2018-11-22 23:08:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-22 23:08:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 668 transitions. [2018-11-22 23:08:51,394 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 668 transitions. Word has length 127 [2018-11-22 23:08:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:51,395 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 668 transitions. [2018-11-22 23:08:51,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:08:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 668 transitions. [2018-11-22 23:08:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-22 23:08:51,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:51,397 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:51,397 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:51,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:51,398 INFO L82 PathProgramCache]: Analyzing trace with hash -429679308, now seen corresponding path program 1 times [2018-11-22 23:08:51,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:51,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:51,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:51,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:51,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:08:51,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:08:51,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:08:51,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:08:51,520 INFO L87 Difference]: Start difference. First operand 578 states and 668 transitions. Second operand 3 states. [2018-11-22 23:08:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:51,552 INFO L93 Difference]: Finished difference Result 767 states and 884 transitions. [2018-11-22 23:08:51,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:08:51,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-11-22 23:08:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:51,554 INFO L225 Difference]: With dead ends: 767 [2018-11-22 23:08:51,554 INFO L226 Difference]: Without dead ends: 367 [2018-11-22 23:08:51,555 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-22 23:08:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-22 23:08:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-11-22 23:08:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-22 23:08:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 413 transitions. [2018-11-22 23:08:51,579 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 413 transitions. Word has length 139 [2018-11-22 23:08:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:51,580 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 413 transitions. [2018-11-22 23:08:51,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:08:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 413 transitions. [2018-11-22 23:08:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-22 23:08:51,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:51,582 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:51,582 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:51,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1097020249, now seen corresponding path program 1 times [2018-11-22 23:08:51,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:51,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:51,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:51,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:51,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:52,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:52,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 23:08:52,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 23:08:52,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 23:08:52,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:08:52,007 INFO L87 Difference]: Start difference. First operand 367 states and 413 transitions. Second operand 8 states. [2018-11-22 23:08:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:53,014 INFO L93 Difference]: Finished difference Result 417 states and 477 transitions. [2018-11-22 23:08:53,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 23:08:53,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 141 [2018-11-22 23:08:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:53,018 INFO L225 Difference]: With dead ends: 417 [2018-11-22 23:08:53,018 INFO L226 Difference]: Without dead ends: 397 [2018-11-22 23:08:53,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-22 23:08:53,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-11-22 23:08:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 351. [2018-11-22 23:08:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-22 23:08:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 395 transitions. [2018-11-22 23:08:53,044 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 395 transitions. Word has length 141 [2018-11-22 23:08:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:53,045 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 395 transitions. [2018-11-22 23:08:53,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 23:08:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 395 transitions. [2018-11-22 23:08:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-22 23:08:53,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:53,047 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 23:08:53,047 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:53,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:53,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1827721186, now seen corresponding path program 1 times [2018-11-22 23:08:53,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:53,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:53,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:53,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:53,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:08:53,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:08:53,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 23:08:53,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:08:53,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:08:53,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:08:53,300 INFO L87 Difference]: Start difference. First operand 351 states and 395 transitions. Second operand 6 states. [2018-11-22 23:08:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:53,397 INFO L93 Difference]: Finished difference Result 535 states and 602 transitions. [2018-11-22 23:08:53,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:08:53,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2018-11-22 23:08:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:53,400 INFO L225 Difference]: With dead ends: 535 [2018-11-22 23:08:53,400 INFO L226 Difference]: Without dead ends: 328 [2018-11-22 23:08:53,401 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-22 23:08:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-22 23:08:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 309. [2018-11-22 23:08:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-22 23:08:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 343 transitions. [2018-11-22 23:08:53,427 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 343 transitions. Word has length 160 [2018-11-22 23:08:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:53,427 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 343 transitions. [2018-11-22 23:08:53,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:08:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 343 transitions. [2018-11-22 23:08:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-22 23:08:53,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:53,429 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-22 23:08:53,429 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:53,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:53,429 INFO L82 PathProgramCache]: Analyzing trace with hash -514829893, now seen corresponding path program 1 times [2018-11-22 23:08:53,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:53,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:53,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-22 23:08:53,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:08:53,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:08:53,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:53,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-22 23:08:54,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:08:54,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2018-11-22 23:08:54,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-22 23:08:54,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 23:08:54,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-22 23:08:54,205 INFO L87 Difference]: Start difference. First operand 309 states and 343 transitions. Second operand 15 states. [2018-11-22 23:08:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:54,931 INFO L93 Difference]: Finished difference Result 317 states and 351 transitions. [2018-11-22 23:08:54,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 23:08:54,932 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 169 [2018-11-22 23:08:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:54,933 INFO L225 Difference]: With dead ends: 317 [2018-11-22 23:08:54,933 INFO L226 Difference]: Without dead ends: 313 [2018-11-22 23:08:54,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-22 23:08:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-22 23:08:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 307. [2018-11-22 23:08:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-22 23:08:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 339 transitions. [2018-11-22 23:08:54,958 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 339 transitions. Word has length 169 [2018-11-22 23:08:54,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:54,958 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 339 transitions. [2018-11-22 23:08:54,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-22 23:08:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 339 transitions. [2018-11-22 23:08:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-22 23:08:54,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:08:54,960 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-22 23:08:54,960 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:08:54,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:08:54,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1219998721, now seen corresponding path program 1 times [2018-11-22 23:08:54,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:08:54,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:08:54,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:54,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:54,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:08:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-22 23:08:55,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:08:55,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:08:55,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:08:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:08:55,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:08:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-22 23:08:55,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:08:55,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-11-22 23:08:55,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-22 23:08:55,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 23:08:55,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-22 23:08:55,624 INFO L87 Difference]: Start difference. First operand 307 states and 339 transitions. Second operand 14 states. [2018-11-22 23:08:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:08:56,313 INFO L93 Difference]: Finished difference Result 310 states and 342 transitions. [2018-11-22 23:08:56,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 23:08:56,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 170 [2018-11-22 23:08:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:08:56,315 INFO L225 Difference]: With dead ends: 310 [2018-11-22 23:08:56,315 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 23:08:56,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-22 23:08:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 23:08:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 23:08:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 23:08:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 23:08:56,317 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2018-11-22 23:08:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:08:56,317 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:08:56,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-22 23:08:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 23:08:56,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 23:08:56,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 23:08:56,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:08:56,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:08:56,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:08:56,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:08:56,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:08:56,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:08:58,197 INFO L448 ceAbstractionStarter]: For program point L3489(lines 3489 3493) no Hoare annotation was computed. [2018-11-22 23:08:58,197 INFO L448 ceAbstractionStarter]: For program point L3486(lines 3486 3493) no Hoare annotation was computed. [2018-11-22 23:08:58,198 INFO L448 ceAbstractionStarter]: For program point L3489-2(lines 3486 3493) no Hoare annotation was computed. [2018-11-22 23:08:58,198 INFO L448 ceAbstractionStarter]: For program point usb_fill_int_urbFINAL(lines 3473 3497) no Hoare annotation was computed. [2018-11-22 23:08:58,198 INFO L448 ceAbstractionStarter]: For program point usb_fill_int_urbEXIT(lines 3473 3497) no Hoare annotation was computed. [2018-11-22 23:08:58,198 INFO L451 ceAbstractionStarter]: At program point usb_fill_int_urbENTRY(lines 3473 3497) the Hoare annotation is: true [2018-11-22 23:08:58,198 INFO L451 ceAbstractionStarter]: At program point kbtab_initENTRY(lines 3928 3946) the Hoare annotation is: true [2018-11-22 23:08:58,198 INFO L448 ceAbstractionStarter]: For program point L3935(lines 3935 3939) no Hoare annotation was computed. [2018-11-22 23:08:58,198 INFO L448 ceAbstractionStarter]: For program point L3933-1(line 3933) no Hoare annotation was computed. [2018-11-22 23:08:58,198 INFO L451 ceAbstractionStarter]: At program point L3933(line 3933) the Hoare annotation is: true [2018-11-22 23:08:58,198 INFO L448 ceAbstractionStarter]: For program point kbtab_initFINAL(lines 3928 3946) no Hoare annotation was computed. [2018-11-22 23:08:58,199 INFO L451 ceAbstractionStarter]: At program point L3943(lines 3931 3945) the Hoare annotation is: true [2018-11-22 23:08:58,199 INFO L448 ceAbstractionStarter]: For program point kbtab_initEXIT(lines 3928 3946) no Hoare annotation was computed. [2018-11-22 23:08:58,199 INFO L444 ceAbstractionStarter]: At program point L3904(line 3904) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~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-22 23:08:58,199 INFO L448 ceAbstractionStarter]: For program point kbtab_disconnectFINAL(lines 3893 3909) no Hoare annotation was computed. [2018-11-22 23:08:58,199 INFO L448 ceAbstractionStarter]: For program point L3903-1(line 3903) no Hoare annotation was computed. [2018-11-22 23:08:58,199 INFO L444 ceAbstractionStarter]: At program point L3903(line 3903) 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_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-22 23:08:58,199 INFO L448 ceAbstractionStarter]: For program point L3904-1(line 3904) no Hoare annotation was computed. [2018-11-22 23:08:58,199 INFO L448 ceAbstractionStarter]: For program point L3901-1(line 3901) no Hoare annotation was computed. [2018-11-22 23:08:58,199 INFO L444 ceAbstractionStarter]: At program point L3901(line 3901) 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_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-22 23:08:58,199 INFO L448 ceAbstractionStarter]: For program point L3899-1(line 3899) no Hoare annotation was computed. [2018-11-22 23:08:58,200 INFO L444 ceAbstractionStarter]: At program point L3899(line 3899) 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_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-22 23:08:58,200 INFO L444 ceAbstractionStarter]: At program point kbtab_disconnectENTRY(lines 3893 3909) 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_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-22 23:08:58,200 INFO L448 ceAbstractionStarter]: For program point kbtab_disconnectEXIT(lines 3893 3909) no Hoare annotation was computed. [2018-11-22 23:08:58,200 INFO L448 ceAbstractionStarter]: For program point L3999(lines 3999 4003) no Hoare annotation was computed. [2018-11-22 23:08:58,200 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3985 4076) no Hoare annotation was computed. [2018-11-22 23:08:58,200 INFO L448 ceAbstractionStarter]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2018-11-22 23:08:58,200 INFO L444 ceAbstractionStarter]: At program point L4049(line 4049) 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-22 23:08:58,200 INFO L448 ceAbstractionStarter]: For program point L4033-1(line 4033) no Hoare annotation was computed. [2018-11-22 23:08:58,200 INFO L444 ceAbstractionStarter]: At program point L4033(line 4033) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= main_~ldv_s_kbtab_driver_usb_driver~0 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-22 23:08:58,201 INFO L448 ceAbstractionStarter]: For program point L4025(lines 4025 4061) no Hoare annotation was computed. [2018-11-22 23:08:58,201 INFO L444 ceAbstractionStarter]: At program point L4063(lines 4005 4064) 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-22 23:08:58,201 INFO L448 ceAbstractionStarter]: For program point L3997-1(line 3997) no Hoare annotation was computed. [2018-11-22 23:08:58,201 INFO L444 ceAbstractionStarter]: At program point L3997(line 3997) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~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-22 23:08:58,201 INFO L444 ceAbstractionStarter]: At program point L4026(lines 4025 4061) 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-22 23:08:58,201 INFO L444 ceAbstractionStarter]: At program point L4059(lines 4006 4062) 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-22 23:08:58,201 INFO L448 ceAbstractionStarter]: For program point L4022(lines 4022 4061) no Hoare annotation was computed. [2018-11-22 23:08:58,201 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 4029 4060) no Hoare annotation was computed. [2018-11-22 23:08:58,201 INFO L448 ceAbstractionStarter]: For program point L4014(lines 4014 4018) no Hoare annotation was computed. [2018-11-22 23:08:58,201 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 3985 4076) no Hoare annotation was computed. [2018-11-22 23:08:58,202 INFO L448 ceAbstractionStarter]: For program point L4014-1(lines 4011 4018) no Hoare annotation was computed. [2018-11-22 23:08:58,202 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 4029 4060) no Hoare annotation was computed. [2018-11-22 23:08:58,202 INFO L448 ceAbstractionStarter]: For program point L4072(line 4072) no Hoare annotation was computed. [2018-11-22 23:08:58,202 INFO L444 ceAbstractionStarter]: At program point L4068(lines 3993 4075) 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-22 23:08:58,202 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 3985 4076) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~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-22 23:08:58,202 INFO L444 ceAbstractionStarter]: At program point L4023(lines 4022 4061) 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-22 23:08:58,202 INFO L448 ceAbstractionStarter]: For program point L4011(lines 4011 4018) no Hoare annotation was computed. [2018-11-22 23:08:58,202 INFO L448 ceAbstractionStarter]: For program point L4007(line 4007) no Hoare annotation was computed. [2018-11-22 23:08:58,202 INFO L448 ceAbstractionStarter]: For program point L4036(lines 4036 4040) no Hoare annotation was computed. [2018-11-22 23:08:58,202 INFO L448 ceAbstractionStarter]: For program point usb_get_intfdataEXIT(lines 3415 3424) no Hoare annotation was computed. [2018-11-22 23:08:58,203 INFO L451 ceAbstractionStarter]: At program point usb_get_intfdataENTRY(lines 3415 3424) the Hoare annotation is: true [2018-11-22 23:08:58,203 INFO L448 ceAbstractionStarter]: For program point usb_get_intfdataFINAL(lines 3415 3424) no Hoare annotation was computed. [2018-11-22 23:08:58,203 INFO L448 ceAbstractionStarter]: For program point kbtab_exitFINAL(lines 3949 3958) no Hoare annotation was computed. [2018-11-22 23:08:58,203 INFO L451 ceAbstractionStarter]: At program point kbtab_exitENTRY(lines 3949 3958) the Hoare annotation is: true [2018-11-22 23:08:58,203 INFO L448 ceAbstractionStarter]: For program point kbtab_exitEXIT(lines 3949 3958) no Hoare annotation was computed. [2018-11-22 23:08:58,203 INFO L451 ceAbstractionStarter]: At program point usb_to_input_idENTRY(lines 3575 3585) the Hoare annotation is: true [2018-11-22 23:08:58,203 INFO L448 ceAbstractionStarter]: For program point usb_to_input_idFINAL(lines 3575 3585) no Hoare annotation was computed. [2018-11-22 23:08:58,203 INFO L448 ceAbstractionStarter]: For program point usb_to_input_idEXIT(lines 3575 3585) no Hoare annotation was computed. [2018-11-22 23:08:58,203 INFO L451 ceAbstractionStarter]: At program point L3402(line 3402) the Hoare annotation is: true [2018-11-22 23:08:58,203 INFO L448 ceAbstractionStarter]: For program point kzallocEXIT(lines 3397 3406) no Hoare annotation was computed. [2018-11-22 23:08:58,203 INFO L448 ceAbstractionStarter]: For program point L3402-1(line 3402) no Hoare annotation was computed. [2018-11-22 23:08:58,203 INFO L451 ceAbstractionStarter]: At program point kzallocENTRY(lines 3397 3406) the Hoare annotation is: true [2018-11-22 23:08:58,203 INFO L448 ceAbstractionStarter]: For program point kzallocFINAL(lines 3397 3406) no Hoare annotation was computed. [2018-11-22 23:08:58,204 INFO L448 ceAbstractionStarter]: For program point ldv_assume_stopFINAL(lines 4087 4094) no Hoare annotation was computed. [2018-11-22 23:08:58,204 INFO L451 ceAbstractionStarter]: At program point ldv_assume_stopENTRY(lines 4087 4094) the Hoare annotation is: true [2018-11-22 23:08:58,204 INFO L448 ceAbstractionStarter]: For program point ldv_assume_stopEXIT(lines 4087 4094) no Hoare annotation was computed. [2018-11-22 23:08:58,204 INFO L451 ceAbstractionStarter]: At program point kmallocENTRY(lines 3386 3396) the Hoare annotation is: true [2018-11-22 23:08:58,204 INFO L448 ceAbstractionStarter]: For program point kmallocFINAL(lines 3386 3396) no Hoare annotation was computed. [2018-11-22 23:08:58,204 INFO L448 ceAbstractionStarter]: For program point kmallocEXIT(lines 3386 3396) no Hoare annotation was computed. [2018-11-22 23:08:58,204 INFO L444 ceAbstractionStarter]: At program point L4156(lines 4128 4161) 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-22 23:08:58,204 INFO L444 ceAbstractionStarter]: At program point usb_free_coherentENTRY(lines 4128 4161) the Hoare annotation is: (let ((.cse1 (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) (.cse0 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 (not (= ~res_kbtab_probe_3~0 0)) .cse1) (or .cse1 .cse0 (not (= 0 ~ldv_urb_state~0))))) [2018-11-22 23:08:58,204 INFO L448 ceAbstractionStarter]: For program point L4134(lines 4133 4155) no Hoare annotation was computed. [2018-11-22 23:08:58,204 INFO L448 ceAbstractionStarter]: For program point usb_free_coherentEXIT(lines 4128 4161) no Hoare annotation was computed. [2018-11-22 23:08:58,205 INFO L448 ceAbstractionStarter]: For program point L4147-1(lines 4143 4149) no Hoare annotation was computed. [2018-11-22 23:08:58,205 INFO L444 ceAbstractionStarter]: At program point L4147(line 4147) 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-22 23:08:58,205 INFO L448 ceAbstractionStarter]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2018-11-22 23:08:58,205 INFO L451 ceAbstractionStarter]: At program point L4137(line 4137) the Hoare annotation is: true [2018-11-22 23:08:58,205 INFO L448 ceAbstractionStarter]: For program point L4135(lines 4133 4155) no Hoare annotation was computed. [2018-11-22 23:08:58,205 INFO L444 ceAbstractionStarter]: At program point L4133loopEntry(lines 4133 4155) the Hoare annotation is: (let ((.cse1 (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) (.cse0 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 (not (= ~res_kbtab_probe_3~0 0)) .cse1) (or .cse1 .cse0 (not (= 0 ~ldv_urb_state~0))))) [2018-11-22 23:08:58,205 INFO L448 ceAbstractionStarter]: For program point usb_alloc_coherentFINAL(lines 4099 4126) no Hoare annotation was computed. [2018-11-22 23:08:58,205 INFO L444 ceAbstractionStarter]: At program point usb_alloc_coherentENTRY(lines 4099 4126) the Hoare annotation is: (or (= 0 ~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-22 23:08:58,205 INFO L448 ceAbstractionStarter]: For program point L4121(lines 4105 4122) no Hoare annotation was computed. [2018-11-22 23:08:58,205 INFO L448 ceAbstractionStarter]: For program point usb_alloc_coherentEXIT(lines 4099 4126) no Hoare annotation was computed. [2018-11-22 23:08:58,206 INFO L448 ceAbstractionStarter]: For program point L4112(lines 4112 4116) no Hoare annotation was computed. [2018-11-22 23:08:58,206 INFO L444 ceAbstractionStarter]: At program point L4106loopEntry(lines 4106 4120) the Hoare annotation is: (or (= 0 ~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-22 23:08:58,206 INFO L448 ceAbstractionStarter]: For program point L4107(line 4107) no Hoare annotation was computed. [2018-11-22 23:08:58,206 INFO L451 ceAbstractionStarter]: At program point usb_set_intfdataENTRY(lines 3427 3436) the Hoare annotation is: true [2018-11-22 23:08:58,206 INFO L448 ceAbstractionStarter]: For program point usb_set_intfdataFINAL(lines 3427 3436) no Hoare annotation was computed. [2018-11-22 23:08:58,206 INFO L448 ceAbstractionStarter]: For program point usb_set_intfdataEXIT(lines 3427 3436) no Hoare annotation was computed. [2018-11-22 23:08:58,206 INFO L448 ceAbstractionStarter]: For program point L3809-1(line 3809) no Hoare annotation was computed. [2018-11-22 23:08:58,206 INFO L444 ceAbstractionStarter]: At program point L3809(line 3809) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~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-22 23:08:58,206 INFO L444 ceAbstractionStarter]: At program point L3834(line 3834) 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-22 23:08:58,206 INFO L448 ceAbstractionStarter]: For program point L3834-1(line 3834) no Hoare annotation was computed. [2018-11-22 23:08:58,207 INFO L444 ceAbstractionStarter]: At program point L3814(line 3814) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-22 23:08:58,207 INFO L448 ceAbstractionStarter]: For program point L3814-1(line 3814) no Hoare annotation was computed. [2018-11-22 23:08:58,207 INFO L448 ceAbstractionStarter]: For program point L3868(lines 3868 3872) no Hoare annotation was computed. [2018-11-22 23:08:58,207 INFO L444 ceAbstractionStarter]: At program point L3860(line 3860) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (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)))) [2018-11-22 23:08:58,207 INFO L448 ceAbstractionStarter]: For program point L3860-1(line 3860) no Hoare annotation was computed. [2018-11-22 23:08:58,207 INFO L444 ceAbstractionStarter]: At program point L3885(lines 3807 3891) the Hoare annotation is: (or (and (or (<= (+ kbtab_probe_~error~0 1) 0) (< 0 kbtab_probe_~error~0)) (and (< 0 (+ ~ldv_coherent_state~0 1)) (<= ~ldv_coherent_state~0 0)) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_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-22 23:08:58,207 INFO L448 ceAbstractionStarter]: For program point L3819(lines 3819 3823) no Hoare annotation was computed. [2018-11-22 23:08:58,207 INFO L444 ceAbstractionStarter]: At program point L3848(line 3848) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (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)))) [2018-11-22 23:08:58,207 INFO L444 ceAbstractionStarter]: At program point L3881(lines 3807 3891) the Hoare annotation is: (or (and (and (or (<= (+ kbtab_probe_~error~0 1) 0) (< 0 kbtab_probe_~error~0)) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (<= 1 ~ldv_coherent_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-22 23:08:58,208 INFO L448 ceAbstractionStarter]: For program point L3848-1(line 3848) no Hoare annotation was computed. [2018-11-22 23:08:58,208 INFO L444 ceAbstractionStarter]: At program point L3844(line 3844) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (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)))) [2018-11-22 23:08:58,208 INFO L448 ceAbstractionStarter]: For program point L3844-1(line 3844) no Hoare annotation was computed. [2018-11-22 23:08:58,208 INFO L448 ceAbstractionStarter]: For program point L3836(lines 3836 3840) no Hoare annotation was computed. [2018-11-22 23:08:58,208 INFO L444 ceAbstractionStarter]: At program point L3869(lines 3807 3891) the Hoare annotation is: (or (and (or (<= (+ kbtab_probe_~error~0 1) 0) (< 0 kbtab_probe_~error~0)) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 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-22 23:08:58,208 INFO L444 ceAbstractionStarter]: At program point kbtab_probeENTRY(lines 3795 3892) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~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-22 23:08:58,208 INFO L448 ceAbstractionStarter]: For program point L3828(lines 3828 3832) no Hoare annotation was computed. [2018-11-22 23:08:58,208 INFO L448 ceAbstractionStarter]: For program point L3861-1(lines 3861 3862) no Hoare annotation was computed. [2018-11-22 23:08:58,208 INFO L444 ceAbstractionStarter]: At program point L3861(lines 3861 3862) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (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)))) [2018-11-22 23:08:58,208 INFO L448 ceAbstractionStarter]: For program point kbtab_probeFINAL(lines 3795 3892) no Hoare annotation was computed. [2018-11-22 23:08:58,209 INFO L448 ceAbstractionStarter]: For program point L3816(lines 3816 3823) no Hoare annotation was computed. [2018-11-22 23:08:58,209 INFO L444 ceAbstractionStarter]: At program point L3812(line 3812) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-22 23:08:58,209 INFO L444 ceAbstractionStarter]: At program point L3874(line 3874) 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-22 23:08:58,209 INFO L448 ceAbstractionStarter]: For program point L3812-1(line 3812) no Hoare annotation was computed. [2018-11-22 23:08:58,209 INFO L448 ceAbstractionStarter]: For program point L3874-1(line 3874) no Hoare annotation was computed. [2018-11-22 23:08:58,209 INFO L448 ceAbstractionStarter]: For program point kbtab_probeEXIT(lines 3795 3892) no Hoare annotation was computed. [2018-11-22 23:08:58,209 INFO L448 ceAbstractionStarter]: For program point L3825-1(line 3825) no Hoare annotation was computed. [2018-11-22 23:08:58,209 INFO L444 ceAbstractionStarter]: At program point L3825(line 3825) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-22 23:08:58,209 INFO L444 ceAbstractionStarter]: At program point L3850(line 3850) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (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)))) [2018-11-22 23:08:58,209 INFO L448 ceAbstractionStarter]: For program point L3883-1(line 3883) no Hoare annotation was computed. [2018-11-22 23:08:58,209 INFO L444 ceAbstractionStarter]: At program point L3883(line 3883) the Hoare annotation is: (or (and (and (or (<= (+ kbtab_probe_~error~0 1) 0) (< 0 kbtab_probe_~error~0)) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (<= 1 ~ldv_coherent_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-22 23:08:58,210 INFO L448 ceAbstractionStarter]: For program point L3850-1(line 3850) no Hoare annotation was computed. [2018-11-22 23:08:58,210 INFO L448 ceAbstractionStarter]: For program point L3879-1(line 3879) no Hoare annotation was computed. [2018-11-22 23:08:58,210 INFO L444 ceAbstractionStarter]: At program point L3879(line 3879) the Hoare annotation is: (or (and (or (<= (+ kbtab_probe_~error~0 1) 0) (< 0 kbtab_probe_~error~0)) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (<= 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-22 23:08:58,210 INFO L451 ceAbstractionStarter]: At program point input_set_drvdataENTRY(lines 3527 3536) the Hoare annotation is: true [2018-11-22 23:08:58,210 INFO L448 ceAbstractionStarter]: For program point input_set_drvdataFINAL(lines 3527 3536) no Hoare annotation was computed. [2018-11-22 23:08:58,210 INFO L448 ceAbstractionStarter]: For program point input_set_drvdataEXIT(lines 3527 3536) no Hoare annotation was computed. [2018-11-22 23:08:58,210 INFO L444 ceAbstractionStarter]: At program point L4210(line 4210) 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-22 23:08:58,210 INFO L448 ceAbstractionStarter]: For program point L4206(lines 4206 4212) no Hoare annotation was computed. [2018-11-22 23:08:58,210 INFO L448 ceAbstractionStarter]: For program point L4210-1(lines 4206 4212) no Hoare annotation was computed. [2018-11-22 23:08:58,210 INFO L448 ceAbstractionStarter]: For program point L4198(lines 4196 4218) no Hoare annotation was computed. [2018-11-22 23:08:58,210 INFO L448 ceAbstractionStarter]: For program point usb_free_urbEXIT(lines 4191 4224) no Hoare annotation was computed. [2018-11-22 23:08:58,210 INFO L451 ceAbstractionStarter]: At program point L4200(line 4200) the Hoare annotation is: true [2018-11-22 23:08:58,211 INFO L444 ceAbstractionStarter]: At program point L4196loopEntry(lines 4196 4218) 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-22 23:08:58,211 INFO L444 ceAbstractionStarter]: At program point usb_free_urbENTRY(lines 4191 4224) 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-22 23:08:58,211 INFO L444 ceAbstractionStarter]: At program point L4219(lines 4191 4224) 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-22 23:08:58,211 INFO L448 ceAbstractionStarter]: For program point L4197(lines 4196 4218) no Hoare annotation was computed. [2018-11-22 23:08:58,211 INFO L448 ceAbstractionStarter]: For program point usb_make_pathEXIT(lines 3445 3460) no Hoare annotation was computed. [2018-11-22 23:08:58,211 INFO L448 ceAbstractionStarter]: For program point L3453(lines 3453 3457) no Hoare annotation was computed. [2018-11-22 23:08:58,211 INFO L448 ceAbstractionStarter]: For program point L3453-2(lines 3453 3457) no Hoare annotation was computed. [2018-11-22 23:08:58,211 INFO L451 ceAbstractionStarter]: At program point usb_make_pathENTRY(lines 3445 3460) the Hoare annotation is: true [2018-11-22 23:08:58,211 INFO L448 ceAbstractionStarter]: For program point usb_make_pathFINAL(lines 3445 3460) no Hoare annotation was computed. [2018-11-22 23:08:58,211 INFO L451 ceAbstractionStarter]: At program point __create_pipeENTRY(lines 3505 3511) the Hoare annotation is: true [2018-11-22 23:08:58,211 INFO L448 ceAbstractionStarter]: For program point __create_pipeFINAL(lines 3505 3511) no Hoare annotation was computed. [2018-11-22 23:08:58,212 INFO L448 ceAbstractionStarter]: For program point __create_pipeEXIT(lines 3505 3511) no Hoare annotation was computed. [2018-11-22 23:08:58,212 INFO L448 ceAbstractionStarter]: For program point input_allocate_deviceFINAL(lines 3512 3514) no Hoare annotation was computed. [2018-11-22 23:08:58,212 INFO L451 ceAbstractionStarter]: At program point input_allocate_deviceENTRY(lines 3512 3514) the Hoare annotation is: true [2018-11-22 23:08:58,212 INFO L448 ceAbstractionStarter]: For program point input_allocate_deviceEXIT(lines 3512 3514) no Hoare annotation was computed. [2018-11-22 23:08:58,212 INFO L448 ceAbstractionStarter]: For program point L3513(line 3513) no Hoare annotation was computed. [2018-11-22 23:08:58,212 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-22 23:08:58,212 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0)) [2018-11-22 23:08:58,212 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 23:08:58,212 INFO L448 ceAbstractionStarter]: For program point interface_to_usbdevFINAL(lines 3437 3444) no Hoare annotation was computed. [2018-11-22 23:08:58,212 INFO L451 ceAbstractionStarter]: At program point interface_to_usbdevENTRY(lines 3437 3444) the Hoare annotation is: true [2018-11-22 23:08:58,212 INFO L448 ceAbstractionStarter]: For program point interface_to_usbdevEXIT(lines 3437 3444) no Hoare annotation was computed. [2018-11-22 23:08:58,212 INFO L451 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 4226 4246) the Hoare annotation is: true [2018-11-22 23:08:58,212 INFO L444 ceAbstractionStarter]: At program point L4241(line 4241) the Hoare annotation is: (or (not (= 0 ~ldv_urb_state~0)) (not (= 0 ~ldv_coherent_state~0))) [2018-11-22 23:08:58,212 INFO L448 ceAbstractionStarter]: For program point L4241-1(lines 4226 4246) no Hoare annotation was computed. [2018-11-22 23:08:58,213 INFO L444 ceAbstractionStarter]: At program point L4234(line 4234) the Hoare annotation is: (or (not (= 0 ~ldv_urb_state~0)) (not (= 0 ~ldv_coherent_state~0))) [2018-11-22 23:08:58,213 INFO L448 ceAbstractionStarter]: For program point L4234-1(lines 4229 4245) no Hoare annotation was computed. [2018-11-22 23:08:58,213 INFO L448 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 4226 4246) no Hoare annotation was computed. [2018-11-22 23:08:58,213 INFO L444 ceAbstractionStarter]: At program point usb_alloc_urbENTRY(lines 4163 4189) the Hoare annotation is: (or (= 0 ~ldv_urb_state~0) (< 1 ~ldv_coherent_state~0) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|))) [2018-11-22 23:08:58,213 INFO L448 ceAbstractionStarter]: For program point L4184(lines 4168 4185) no Hoare annotation was computed. [2018-11-22 23:08:58,213 INFO L448 ceAbstractionStarter]: For program point usb_alloc_urbFINAL(lines 4163 4189) no Hoare annotation was computed. [2018-11-22 23:08:58,213 INFO L448 ceAbstractionStarter]: For program point L4175(lines 4175 4179) no Hoare annotation was computed. [2018-11-22 23:08:58,213 INFO L448 ceAbstractionStarter]: For program point L4170(line 4170) no Hoare annotation was computed. [2018-11-22 23:08:58,213 INFO L444 ceAbstractionStarter]: At program point L4169loopEntry(lines 4169 4183) the Hoare annotation is: (or (= 0 ~ldv_urb_state~0) (< 1 ~ldv_coherent_state~0) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|))) [2018-11-22 23:08:58,213 INFO L448 ceAbstractionStarter]: For program point usb_alloc_urbEXIT(lines 4163 4189) no Hoare annotation was computed. [2018-11-22 23:08:58,213 INFO L451 ceAbstractionStarter]: At program point usb_registerENTRY(lines 3462 3471) the Hoare annotation is: true [2018-11-22 23:08:58,213 INFO L448 ceAbstractionStarter]: For program point usb_registerEXIT(lines 3462 3471) no Hoare annotation was computed. [2018-11-22 23:08:58,214 INFO L448 ceAbstractionStarter]: For program point usb_registerFINAL(lines 3462 3471) no Hoare annotation was computed. [2018-11-22 23:08:58,214 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 23:08:58,214 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-22 23:08:58,214 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 23:08:58,214 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 23:08:58,214 INFO L451 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4077 4083) the Hoare annotation is: true [2018-11-22 23:08:58,214 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4081) no Hoare annotation was computed. [2018-11-22 23:08:58,214 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4077 4083) no Hoare annotation was computed. [2018-11-22 23:08:58,214 INFO L448 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4077 4083) no Hoare annotation was computed. [2018-11-22 23:08:58,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:08:58 BoogieIcfgContainer [2018-11-22 23:08:58,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:08:58,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:08:58,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:08:58,236 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:08:58,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:08:45" (3/4) ... [2018-11-22 23:08:58,240 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 23:08:58,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2018-11-22 23:08:58,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2018-11-22 23:08:58,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_disconnect [2018-11-22 23:08:58,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 23:08:58,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2018-11-22 23:08:58,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2018-11-22 23:08:58,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_to_input_id [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_coherent [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_probe [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_drvdata [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_make_path [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_allocate_device [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 23:08:58,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure interface_to_usbdev [2018-11-22 23:08:58,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-22 23:08:58,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2018-11-22 23:08:58,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_register [2018-11-22 23:08:58,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-11-22 23:08:58,266 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 188 nodes and edges [2018-11-22 23:08:58,267 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 87 nodes and edges [2018-11-22 23:08:58,268 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2018-11-22 23:08:58,268 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-22 23:08:58,269 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-22 23:08:58,269 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-22 23:08:58,294 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-22 23:08:58,295 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-22 23:08:58,295 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-22 23:08:58,295 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-22 23:08:58,295 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-22 23:08:58,295 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((error + 1 <= 0 || 0 < error) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && 1 <= ldv_coherent_state) && 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-22 23:08:58,296 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((error + 1 <= 0 || 0 < error) && 0 < ldv_coherent_state + 1 && ldv_coherent_state <= 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-11-22 23:08:58,296 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-22 23:08:58,296 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-22 23:08:58,296 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(ldv_coherent_state) < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_coherent_state) == ldv_coherent_state) && ((\old(ldv_coherent_state) == ldv_coherent_state || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) [2018-11-22 23:08:58,297 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-22 23:08:58,297 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == ldv_coherent_state || !(res_kbtab_probe_3 == 0)) || !(0 == ldv_urb_state)) || !(0 == \old(ldv_coherent_state)) [2018-11-22 23:08:58,297 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_urb_state || 1 < ldv_coherent_state) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state)) [2018-11-22 23:08:58,298 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((error + 1 <= 0 || 0 < error) && 1 <= ldv_coherent_state) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_urb_state) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-11-22 23:08:58,338 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7ead911b-f48a-47e2-95de-678252f53b67/bin-2019/uautomizer/witness.graphml [2018-11-22 23:08:58,338 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:08:58,339 INFO L168 Benchmark]: Toolchain (without parser) took 14858.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.6 MB). Free memory was 953.9 MB in the beginning and 888.8 MB in the end (delta: 65.1 MB). Peak memory consumption was 456.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:08:58,340 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:08:58,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 953.9 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. [2018-11-22 23:08:58,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.46 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-22 23:08:58,340 INFO L168 Benchmark]: Boogie Preprocessor took 65.05 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:08:58,341 INFO L168 Benchmark]: RCFGBuilder took 931.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.8 MB in the end (delta: 148.2 MB). Peak memory consumption was 148.2 MB. Max. memory is 11.5 GB. [2018-11-22 23:08:58,341 INFO L168 Benchmark]: TraceAbstraction took 12925.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.8 MB). Free memory was 941.8 MB in the beginning and 899.0 MB in the end (delta: 42.8 MB). Peak memory consumption was 348.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:08:58,341 INFO L168 Benchmark]: Witness Printer took 102.70 ms. Allocated memory is still 1.4 GB. Free memory was 899.0 MB in the beginning and 888.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2018-11-22 23:08:58,342 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 794.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 953.9 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.46 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 65.05 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 931.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.8 MB in the end (delta: 148.2 MB). Peak memory consumption was 148.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12925.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.8 MB). Free memory was 941.8 MB in the beginning and 899.0 MB in the end (delta: 42.8 MB). Peak memory consumption was 348.0 MB. Max. memory is 11.5 GB. * Witness Printer took 102.70 ms. Allocated memory is still 1.4 GB. Free memory was 899.0 MB in the beginning and 888.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4081]: 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: 4106]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state || !(res_kbtab_probe_3 == 0)) || !(0 == ldv_urb_state)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4191]: 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: 4169]: Loop Invariant Derived loop invariant: (((0 == ldv_urb_state || 1 < ldv_coherent_state) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state)) - InvariantResult [Line: 4005]: 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: 4128]: 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: 4006]: 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: 3807]: Loop Invariant Derived loop invariant: (((((error + 1 <= 0 || 0 < error) && 0 < ldv_coherent_state + 1 && ldv_coherent_state <= 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4196]: 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: 4133]: Loop Invariant Derived loop invariant: ((\old(ldv_coherent_state) < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_coherent_state) == ldv_coherent_state) && ((\old(ldv_coherent_state) == ldv_coherent_state || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) - InvariantResult [Line: 3993]: 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: 4025]: 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: 4087]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: ((((((error + 1 <= 0 || 0 < error) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && 1 <= ldv_coherent_state) && 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: 3931]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: (((((((error + 1 <= 0 || 0 < error) && 1 <= ldv_coherent_state) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && 1 <= ldv_urb_state) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4022]: 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)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 26 procedures, 181 locations, 1 error locations. SAFE Result, 12.8s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 3983 SDtfs, 3496 SDslu, 7757 SDs, 0 SdLazy, 2488 SolverSat, 1143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 515 SyntacticMatches, 12 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=801occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 377 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 3013 PreInvPairs, 3081 NumberOfFragments, 1395 HoareAnnotationTreeSize, 3013 FomulaSimplifications, 6696 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 70 FomulaSimplificationsInter, 3409 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2557 NumberOfCodeBlocks, 2557 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2534 ConstructedInterpolants, 0 QuantifiedInterpolants, 751236 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3753 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 208/237 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...