java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 02:58:05,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 02:58:05,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 02:58:05,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 02:58:05,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 02:58:05,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 02:58:05,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 02:58:05,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 02:58:05,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 02:58:05,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 02:58:05,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 02:58:05,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 02:58:05,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 02:58:05,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 02:58:05,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 02:58:05,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 02:58:05,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 02:58:05,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 02:58:05,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 02:58:05,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 02:58:05,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 02:58:05,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 02:58:05,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 02:58:05,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 02:58:05,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 02:58:05,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 02:58:05,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 02:58:05,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 02:58:05,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 02:58:05,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 02:58:05,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 02:58:05,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 02:58:05,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 02:58:05,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 02:58:05,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 02:58:05,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 02:58:05,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 02:58:05,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 02:58:05,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 02:58:05,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 02:58:05,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 02:58:05,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 02:58:05,483 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 02:58:05,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 02:58:05,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 02:58:05,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 02:58:05,487 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 02:58:05,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 02:58:05,488 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 02:58:05,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 02:58:05,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 02:58:05,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 02:58:05,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 02:58:05,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 02:58:05,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 02:58:05,491 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 02:58:05,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 02:58:05,492 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 02:58:05,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 02:58:05,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 02:58:05,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 02:58:05,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 02:58:05,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 02:58:05,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 02:58:05,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 02:58:05,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 02:58:05,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 02:58:05,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 02:58:05,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 02:58:05,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 02:58:05,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 02:58:05,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 02:58:05,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 02:58:05,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 02:58:05,829 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 02:58:05,829 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 02:58:05,830 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-10-15 02:58:05,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842ae3f0c/2bc3c463a1f4475ba9a8fdd86b81e5ee/FLAGa9b375e3c [2019-10-15 02:58:06,609 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 02:58:06,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-10-15 02:58:06,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842ae3f0c/2bc3c463a1f4475ba9a8fdd86b81e5ee/FLAGa9b375e3c [2019-10-15 02:58:06,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842ae3f0c/2bc3c463a1f4475ba9a8fdd86b81e5ee [2019-10-15 02:58:06,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 02:58:06,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 02:58:06,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 02:58:06,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 02:58:06,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 02:58:06,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:58:06" (1/1) ... [2019-10-15 02:58:06,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc2b61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:58:06, skipping insertion in model container [2019-10-15 02:58:06,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:58:06" (1/1) ... [2019-10-15 02:58:06,731 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 02:58:06,840 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 02:58:08,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:58:08,190 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 02:58:08,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:58:08,537 INFO L192 MainTranslator]: Completed translation [2019-10-15 02:58:08,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:58:08 WrapperNode [2019-10-15 02:58:08,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 02:58:08,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 02:58:08,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 02:58:08,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 02:58:08,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:58:08" (1/1) ... [2019-10-15 02:58:08,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:58:08" (1/1) ... [2019-10-15 02:58:08,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:58:08" (1/1) ... [2019-10-15 02:58:08,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:58:08" (1/1) ... [2019-10-15 02:58:08,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:58:08" (1/1) ... [2019-10-15 02:58:08,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:58:08" (1/1) ... [2019-10-15 02:58:08,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:58:08" (1/1) ... [2019-10-15 02:58:08,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 02:58:08,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 02:58:08,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 02:58:08,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 02:58:08,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:58:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 02:58:08,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 02:58:08,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 02:58:08,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-10-15 02:58:08,879 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-10-15 02:58:08,879 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2019-10-15 02:58:08,881 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2019-10-15 02:58:08,882 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-15 02:58:08,882 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-10-15 02:58:08,882 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-15 02:58:08,883 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2019-10-15 02:58:08,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-15 02:58:08,884 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-15 02:58:08,885 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-15 02:58:08,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-15 02:58:08,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-15 02:58:08,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-15 02:58:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-15 02:58:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-15 02:58:08,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-15 02:58:08,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-15 02:58:08,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-15 02:58:08,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-15 02:58:08,891 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-15 02:58:08,891 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-10-15 02:58:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-10-15 02:58:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-15 02:58:08,893 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-10-15 02:58:08,893 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-15 02:58:08,893 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-10-15 02:58:08,893 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_irq [2019-10-15 02:58:08,894 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_open [2019-10-15 02:58:08,894 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_close [2019-10-15 02:58:08,894 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_probe [2019-10-15 02:58:08,896 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-10-15 02:58:08,896 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_init [2019-10-15 02:58:08,897 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_exit [2019-10-15 02:58:08,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-10-15 02:58:08,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 02:58:08,897 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-15 02:58:08,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_2 [2019-10-15 02:58:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-10-15 02:58:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-10-15 02:58:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_5 [2019-10-15 02:58:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_6 [2019-10-15 02:58:08,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-10-15 02:58:08,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_8 [2019-10-15 02:58:08,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_10 [2019-10-15 02:58:08,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_11 [2019-10-15 02:58:08,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-15 02:58:08,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-10-15 02:58:08,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-10-15 02:58:08,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-10-15 02:58:08,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-10-15 02:58:08,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-10-15 02:58:08,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-10-15 02:58:08,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-10-15 02:58:08,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-10-15 02:58:08,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-10-15 02:58:08,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-10-15 02:58:08,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-10-15 02:58:08,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-10-15 02:58:08,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-10-15 02:58:08,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-10-15 02:58:08,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-10-15 02:58:08,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-15 02:58:08,905 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-15 02:58:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-15 02:58:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-15 02:58:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-15 02:58:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-15 02:58:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-10-15 02:58:08,907 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-15 02:58:08,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-15 02:58:08,908 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-15 02:58:08,909 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-15 02:58:08,909 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2019-10-15 02:58:08,910 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-15 02:58:08,910 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-15 02:58:08,910 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-15 02:58:08,911 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-15 02:58:08,911 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-15 02:58:08,912 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-10-15 02:58:08,913 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-15 02:58:08,913 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-15 02:58:08,913 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-15 02:58:08,914 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-15 02:58:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 02:58:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-15 02:58:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-10-15 02:58:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 02:58:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2019-10-15 02:58:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2019-10-15 02:58:08,916 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-10-15 02:58:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-15 02:58:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-15 02:58:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-15 02:58:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-10-15 02:58:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2019-10-15 02:58:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-15 02:58:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-15 02:58:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-15 02:58:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_8 [2019-10-15 02:58:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-10-15 02:58:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-15 02:58:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-15 02:58:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 02:58:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 02:58:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-15 02:58:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_2 [2019-10-15 02:58:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-10-15 02:58:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-15 02:58:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_11 [2019-10-15 02:58:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_6 [2019-10-15 02:58:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_5 [2019-10-15 02:58:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_10 [2019-10-15 02:58:08,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-10-15 02:58:08,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-10-15 02:58:08,923 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-15 02:58:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-15 02:58:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-15 02:58:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-15 02:58:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2019-10-15 02:58:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-10-15 02:58:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-10-15 02:58:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-10-15 02:58:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-10-15 02:58:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-10-15 02:58:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-10-15 02:58:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-10-15 02:58:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-15 02:58:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-15 02:58:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-15 02:58:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-15 02:58:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-15 02:58:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 02:58:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 02:58:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 02:58:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-15 02:58:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 02:58:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 02:58:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 02:58:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-15 02:58:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-15 02:58:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-15 02:58:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-15 02:58:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-15 02:58:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-15 02:58:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-15 02:58:08,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-15 02:58:08,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-15 02:58:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-10-15 02:58:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-15 02:58:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-15 02:58:08,949 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-10-15 02:58:08,950 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-10-15 02:58:08,950 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-15 02:58:08,951 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-15 02:58:08,951 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-15 02:58:08,951 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-15 02:58:08,951 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-10-15 02:58:08,951 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-15 02:58:08,951 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-10-15 02:58:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-10-15 02:58:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 02:58:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_irq [2019-10-15 02:58:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_open [2019-10-15 02:58:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 02:58:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_close [2019-10-15 02:58:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_probe [2019-10-15 02:58:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-10-15 02:58:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_init [2019-10-15 02:58:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_exit [2019-10-15 02:58:08,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-15 02:58:08,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-15 02:58:08,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 02:58:08,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-15 02:58:08,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-10-15 02:58:08,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-10-15 02:58:08,955 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-10-15 02:58:08,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-10-15 02:58:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-10-15 02:58:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-10-15 02:58:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-10-15 02:58:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-10-15 02:58:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-10-15 02:58:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-15 02:58:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 02:58:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 02:58:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 02:58:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 02:58:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 02:58:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 02:58:09,835 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-15 02:58:11,619 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 02:58:11,619 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 02:58:11,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:58:11 BoogieIcfgContainer [2019-10-15 02:58:11,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 02:58:11,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 02:58:11,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 02:58:11,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 02:58:11,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:58:06" (1/3) ... [2019-10-15 02:58:11,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321f91e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:58:11, skipping insertion in model container [2019-10-15 02:58:11,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:58:08" (2/3) ... [2019-10-15 02:58:11,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321f91e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:58:11, skipping insertion in model container [2019-10-15 02:58:11,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:58:11" (3/3) ... [2019-10-15 02:58:11,631 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-10-15 02:58:11,647 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 02:58:11,659 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 02:58:11,671 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 02:58:11,708 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 02:58:11,708 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 02:58:11,708 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 02:58:11,708 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 02:58:11,709 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 02:58:11,709 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 02:58:11,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 02:58:11,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 02:58:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states. [2019-10-15 02:58:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 02:58:11,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:58:11,763 INFO L380 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] [2019-10-15 02:58:11,766 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:58:11,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:58:11,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1188300801, now seen corresponding path program 1 times [2019-10-15 02:58:11,783 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:58:11,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898448277] [2019-10-15 02:58:11,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:11,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:11,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:58:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:58:12,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898448277] [2019-10-15 02:58:12,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:58:12,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:58:12,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106018851] [2019-10-15 02:58:12,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:58:12,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:58:12,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:58:12,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:58:12,363 INFO L87 Difference]: Start difference. First operand 414 states. Second operand 3 states. [2019-10-15 02:58:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:58:12,541 INFO L93 Difference]: Finished difference Result 856 states and 1017 transitions. [2019-10-15 02:58:12,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:58:12,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-15 02:58:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:58:12,564 INFO L225 Difference]: With dead ends: 856 [2019-10-15 02:58:12,565 INFO L226 Difference]: Without dead ends: 540 [2019-10-15 02:58:12,572 INFO L600 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 [2019-10-15 02:58:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-15 02:58:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-15 02:58:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-15 02:58:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 627 transitions. [2019-10-15 02:58:12,744 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 627 transitions. Word has length 38 [2019-10-15 02:58:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:58:12,745 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 627 transitions. [2019-10-15 02:58:12,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:58:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 627 transitions. [2019-10-15 02:58:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 02:58:12,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:58:12,750 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 02:58:12,750 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:58:12,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:58:12,751 INFO L82 PathProgramCache]: Analyzing trace with hash 578807213, now seen corresponding path program 1 times [2019-10-15 02:58:12,751 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:58:12,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244331574] [2019-10-15 02:58:12,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:12,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:12,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:58:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 02:58:13,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244331574] [2019-10-15 02:58:13,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:58:13,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:58:13,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277629678] [2019-10-15 02:58:13,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:58:13,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:58:13,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:58:13,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:58:13,021 INFO L87 Difference]: Start difference. First operand 540 states and 627 transitions. Second operand 3 states. [2019-10-15 02:58:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:58:13,120 INFO L93 Difference]: Finished difference Result 927 states and 1074 transitions. [2019-10-15 02:58:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:58:13,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 02:58:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:58:13,135 INFO L225 Difference]: With dead ends: 927 [2019-10-15 02:58:13,135 INFO L226 Difference]: Without dead ends: 924 [2019-10-15 02:58:13,138 INFO L600 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 [2019-10-15 02:58:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-10-15 02:58:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 904. [2019-10-15 02:58:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-15 02:58:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1049 transitions. [2019-10-15 02:58:13,241 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1049 transitions. Word has length 57 [2019-10-15 02:58:13,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:58:13,242 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1049 transitions. [2019-10-15 02:58:13,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:58:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1049 transitions. [2019-10-15 02:58:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 02:58:13,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:58:13,245 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 02:58:13,245 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:58:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:58:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash 763009325, now seen corresponding path program 1 times [2019-10-15 02:58:13,246 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:58:13,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923278014] [2019-10-15 02:58:13,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:13,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:13,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:58:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 02:58:13,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923278014] [2019-10-15 02:58:13,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:58:13,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:58:13,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606258476] [2019-10-15 02:58:13,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:58:13,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:58:13,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:58:13,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:58:13,394 INFO L87 Difference]: Start difference. First operand 904 states and 1049 transitions. Second operand 3 states. [2019-10-15 02:58:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:58:13,435 INFO L93 Difference]: Finished difference Result 906 states and 1050 transitions. [2019-10-15 02:58:13,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:58:13,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 02:58:13,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:58:13,442 INFO L225 Difference]: With dead ends: 906 [2019-10-15 02:58:13,442 INFO L226 Difference]: Without dead ends: 903 [2019-10-15 02:58:13,443 INFO L600 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 [2019-10-15 02:58:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-10-15 02:58:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2019-10-15 02:58:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-10-15 02:58:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1047 transitions. [2019-10-15 02:58:13,497 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1047 transitions. Word has length 58 [2019-10-15 02:58:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:58:13,498 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1047 transitions. [2019-10-15 02:58:13,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:58:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1047 transitions. [2019-10-15 02:58:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 02:58:13,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:58:13,501 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 02:58:13,501 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:58:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:58:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash -2116654928, now seen corresponding path program 1 times [2019-10-15 02:58:13,502 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:58:13,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647693463] [2019-10-15 02:58:13,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:13,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:13,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:58:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 02:58:13,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647693463] [2019-10-15 02:58:13,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:58:13,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:58:13,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822411307] [2019-10-15 02:58:13,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:58:13,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:58:13,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:58:13,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:58:13,609 INFO L87 Difference]: Start difference. First operand 903 states and 1047 transitions. Second operand 3 states. [2019-10-15 02:58:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:58:13,687 INFO L93 Difference]: Finished difference Result 905 states and 1048 transitions. [2019-10-15 02:58:13,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:58:13,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 02:58:13,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:58:13,694 INFO L225 Difference]: With dead ends: 905 [2019-10-15 02:58:13,694 INFO L226 Difference]: Without dead ends: 902 [2019-10-15 02:58:13,695 INFO L600 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 [2019-10-15 02:58:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-10-15 02:58:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2019-10-15 02:58:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-10-15 02:58:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1045 transitions. [2019-10-15 02:58:13,750 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1045 transitions. Word has length 59 [2019-10-15 02:58:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:58:13,750 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1045 transitions. [2019-10-15 02:58:13,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:58:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1045 transitions. [2019-10-15 02:58:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 02:58:13,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:58:13,752 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 02:58:13,753 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:58:13,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:58:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1191928688, now seen corresponding path program 1 times [2019-10-15 02:58:13,753 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:58:13,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728355789] [2019-10-15 02:58:13,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:13,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:13,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:58:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 02:58:13,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728355789] [2019-10-15 02:58:13,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:58:13,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:58:13,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896102703] [2019-10-15 02:58:13,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:58:13,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:58:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:58:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:58:13,855 INFO L87 Difference]: Start difference. First operand 902 states and 1045 transitions. Second operand 3 states. [2019-10-15 02:58:13,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:58:13,902 INFO L93 Difference]: Finished difference Result 904 states and 1046 transitions. [2019-10-15 02:58:13,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:58:13,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 02:58:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:58:13,908 INFO L225 Difference]: With dead ends: 904 [2019-10-15 02:58:13,909 INFO L226 Difference]: Without dead ends: 901 [2019-10-15 02:58:13,910 INFO L600 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 [2019-10-15 02:58:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-10-15 02:58:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2019-10-15 02:58:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-10-15 02:58:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1043 transitions. [2019-10-15 02:58:13,973 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1043 transitions. Word has length 60 [2019-10-15 02:58:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:58:13,974 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1043 transitions. [2019-10-15 02:58:13,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:58:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1043 transitions. [2019-10-15 02:58:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 02:58:13,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:58:13,976 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 02:58:13,976 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:58:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:58:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1704785843, now seen corresponding path program 1 times [2019-10-15 02:58:13,977 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:58:13,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11888091] [2019-10-15 02:58:13,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:13,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:13,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:58:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 02:58:14,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11888091] [2019-10-15 02:58:14,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:58:14,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:58:14,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315006169] [2019-10-15 02:58:14,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:58:14,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:58:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:58:14,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:58:14,093 INFO L87 Difference]: Start difference. First operand 901 states and 1043 transitions. Second operand 3 states. [2019-10-15 02:58:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:58:14,140 INFO L93 Difference]: Finished difference Result 903 states and 1044 transitions. [2019-10-15 02:58:14,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:58:14,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-15 02:58:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:58:14,149 INFO L225 Difference]: With dead ends: 903 [2019-10-15 02:58:14,149 INFO L226 Difference]: Without dead ends: 883 [2019-10-15 02:58:14,150 INFO L600 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 [2019-10-15 02:58:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-10-15 02:58:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2019-10-15 02:58:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-10-15 02:58:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1022 transitions. [2019-10-15 02:58:14,206 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1022 transitions. Word has length 61 [2019-10-15 02:58:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:58:14,206 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1022 transitions. [2019-10-15 02:58:14,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:58:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1022 transitions. [2019-10-15 02:58:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-15 02:58:14,219 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:58:14,219 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:58:14,219 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:58:14,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:58:14,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2075513611, now seen corresponding path program 1 times [2019-10-15 02:58:14,220 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:58:14,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601678761] [2019-10-15 02:58:14,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:14,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:14,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:58:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 02:58:14,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601678761] [2019-10-15 02:58:14,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:58:14,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:58:14,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473635659] [2019-10-15 02:58:14,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:58:14,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:58:14,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:58:14,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:58:14,453 INFO L87 Difference]: Start difference. First operand 883 states and 1022 transitions. Second operand 3 states. [2019-10-15 02:58:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:58:14,542 INFO L93 Difference]: Finished difference Result 1424 states and 1662 transitions. [2019-10-15 02:58:14,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:58:14,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-15 02:58:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:58:14,546 INFO L225 Difference]: With dead ends: 1424 [2019-10-15 02:58:14,547 INFO L226 Difference]: Without dead ends: 558 [2019-10-15 02:58:14,555 INFO L600 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 [2019-10-15 02:58:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-10-15 02:58:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 526. [2019-10-15 02:58:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-10-15 02:58:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 615 transitions. [2019-10-15 02:58:14,603 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 615 transitions. Word has length 186 [2019-10-15 02:58:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:58:14,603 INFO L462 AbstractCegarLoop]: Abstraction has 526 states and 615 transitions. [2019-10-15 02:58:14,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:58:14,604 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 615 transitions. [2019-10-15 02:58:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-15 02:58:14,609 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:58:14,610 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:58:14,610 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:58:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:58:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash -854921549, now seen corresponding path program 1 times [2019-10-15 02:58:14,611 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:58:14,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389927817] [2019-10-15 02:58:14,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:14,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:14,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:58:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 02:58:14,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389927817] [2019-10-15 02:58:14,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:58:14,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 02:58:14,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4084820] [2019-10-15 02:58:14,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 02:58:14,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:58:14,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 02:58:14,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:58:14,808 INFO L87 Difference]: Start difference. First operand 526 states and 615 transitions. Second operand 6 states. [2019-10-15 02:58:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:58:14,902 INFO L93 Difference]: Finished difference Result 1034 states and 1213 transitions. [2019-10-15 02:58:14,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 02:58:14,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-10-15 02:58:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:58:14,907 INFO L225 Difference]: With dead ends: 1034 [2019-10-15 02:58:14,907 INFO L226 Difference]: Without dead ends: 538 [2019-10-15 02:58:14,909 INFO L600 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 [2019-10-15 02:58:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-15 02:58:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2019-10-15 02:58:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-10-15 02:58:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 625 transitions. [2019-10-15 02:58:14,945 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 625 transitions. Word has length 203 [2019-10-15 02:58:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:58:14,946 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 625 transitions. [2019-10-15 02:58:14,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 02:58:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 625 transitions. [2019-10-15 02:58:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-15 02:58:14,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:58:14,951 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:58:14,951 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:58:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:58:14,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1660401743, now seen corresponding path program 1 times [2019-10-15 02:58:14,952 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:58:14,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452921750] [2019-10-15 02:58:14,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:14,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:14,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:58:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 02:58:15,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452921750] [2019-10-15 02:58:15,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:58:15,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 02:58:15,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088453321] [2019-10-15 02:58:15,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 02:58:15,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:58:15,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 02:58:15,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:58:15,567 INFO L87 Difference]: Start difference. First operand 536 states and 625 transitions. Second operand 8 states. [2019-10-15 02:58:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:58:16,520 INFO L93 Difference]: Finished difference Result 769 states and 898 transitions. [2019-10-15 02:58:16,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 02:58:16,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 207 [2019-10-15 02:58:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:58:16,526 INFO L225 Difference]: With dead ends: 769 [2019-10-15 02:58:16,526 INFO L226 Difference]: Without dead ends: 753 [2019-10-15 02:58:16,527 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:58:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-10-15 02:58:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 748. [2019-10-15 02:58:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-15 02:58:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 875 transitions. [2019-10-15 02:58:16,592 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 875 transitions. Word has length 207 [2019-10-15 02:58:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:58:16,594 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 875 transitions. [2019-10-15 02:58:16,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 02:58:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 875 transitions. [2019-10-15 02:58:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-15 02:58:16,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:58:16,599 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:58:16,599 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:58:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:58:16,600 INFO L82 PathProgramCache]: Analyzing trace with hash 94456589, now seen corresponding path program 1 times [2019-10-15 02:58:16,600 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:58:16,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007882357] [2019-10-15 02:58:16,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:16,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:16,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:58:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 02:58:17,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007882357] [2019-10-15 02:58:17,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001862500] [2019-10-15 02:58:17,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:58:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:17,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 2105 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-15 02:58:17,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:58:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 02:58:17,872 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:58:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:58:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 02:58:18,356 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 02:58:18,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 12 [2019-10-15 02:58:18,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902859535] [2019-10-15 02:58:18,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 02:58:18,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:58:18,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 02:58:18,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-15 02:58:18,360 INFO L87 Difference]: Start difference. First operand 748 states and 875 transitions. Second operand 8 states. [2019-10-15 02:58:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:58:19,817 INFO L93 Difference]: Finished difference Result 1979 states and 2320 transitions. [2019-10-15 02:58:19,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 02:58:19,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-10-15 02:58:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:58:19,836 INFO L225 Difference]: With dead ends: 1979 [2019-10-15 02:58:19,836 INFO L226 Difference]: Without dead ends: 1963 [2019-10-15 02:58:19,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-15 02:58:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-10-15 02:58:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1944. [2019-10-15 02:58:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1944 states. [2019-10-15 02:58:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 2283 transitions. [2019-10-15 02:58:20,018 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 2283 transitions. Word has length 242 [2019-10-15 02:58:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:58:20,021 INFO L462 AbstractCegarLoop]: Abstraction has 1944 states and 2283 transitions. [2019-10-15 02:58:20,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 02:58:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2283 transitions. [2019-10-15 02:58:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-15 02:58:20,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:58:20,029 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:58:20,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:58:20,238 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:58:20,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:58:20,238 INFO L82 PathProgramCache]: Analyzing trace with hash 96989818, now seen corresponding path program 1 times [2019-10-15 02:58:20,239 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:58:20,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460979025] [2019-10-15 02:58:20,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:20,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:58:20,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:58:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:58:21,165 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1186) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:574) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:274) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:210) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-15 02:58:21,174 INFO L168 Benchmark]: Toolchain (without parser) took 14463.93 ms. Allocated memory was 137.9 MB in the beginning and 536.9 MB in the end (delta: 399.0 MB). Free memory was 96.7 MB in the beginning and 449.8 MB in the end (delta: -353.1 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-10-15 02:58:21,176 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 02:58:21,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1825.45 ms. Allocated memory was 137.9 MB in the beginning and 206.6 MB in the end (delta: 68.7 MB). Free memory was 96.5 MB in the beginning and 119.8 MB in the end (delta: -23.3 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-10-15 02:58:21,179 INFO L168 Benchmark]: Boogie Preprocessor took 229.71 ms. Allocated memory is still 206.6 MB. Free memory was 119.8 MB in the beginning and 111.5 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. [2019-10-15 02:58:21,183 INFO L168 Benchmark]: RCFGBuilder took 2852.17 ms. Allocated memory was 206.6 MB in the beginning and 263.7 MB in the end (delta: 57.1 MB). Free memory was 111.5 MB in the beginning and 135.3 MB in the end (delta: -23.8 MB). Peak memory consumption was 73.9 MB. Max. memory is 7.1 GB. [2019-10-15 02:58:21,185 INFO L168 Benchmark]: TraceAbstraction took 9547.79 ms. Allocated memory was 263.7 MB in the beginning and 536.9 MB in the end (delta: 273.2 MB). Free memory was 135.3 MB in the beginning and 449.8 MB in the end (delta: -314.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 02:58:21,193 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1825.45 ms. Allocated memory was 137.9 MB in the beginning and 206.6 MB in the end (delta: 68.7 MB). Free memory was 96.5 MB in the beginning and 119.8 MB in the end (delta: -23.3 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 229.71 ms. Allocated memory is still 206.6 MB. Free memory was 119.8 MB in the beginning and 111.5 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2852.17 ms. Allocated memory was 206.6 MB in the beginning and 263.7 MB in the end (delta: 57.1 MB). Free memory was 111.5 MB in the beginning and 135.3 MB in the end (delta: -23.8 MB). Peak memory consumption was 73.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9547.79 ms. Allocated memory was 263.7 MB in the beginning and 536.9 MB in the end (delta: 273.2 MB). Free memory was 135.3 MB in the beginning and 449.8 MB in the end (delta: -314.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...