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-f4eb214f-m [2019-10-13 22:55:20,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:55:20,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:55:20,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:55:20,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:55:20,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:55:20,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:55:20,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:55:20,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:55:20,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:55:20,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:55:20,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:55:20,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:55:20,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:55:20,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:55:20,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:55:20,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:55:20,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:55:20,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:55:20,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:55:20,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:55:20,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:55:20,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:55:20,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:55:20,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:55:20,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:55:20,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:55:20,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:55:20,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:55:20,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:55:20,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:55:20,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:55:20,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:55:20,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:55:20,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:55:20,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:55:20,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:55:20,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:55:20,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:55:20,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:55:20,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:55:20,744 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-13 22:55:20,780 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:55:20,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:55:20,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:55:20,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:55:20,782 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:55:20,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:55:20,783 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:55:20,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:55:20,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:55:20,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:55:20,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:55:20,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:55:20,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:55:20,784 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:55:20,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:55:20,784 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:55:20,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:55:20,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:55:20,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:55:20,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:55:20,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:55:20,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:55:20,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:55:20,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:55:20,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:55:20,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:55:20,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:55:20,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:55:20,787 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-13 22:55:21,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:55:21,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:55:21,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:55:21,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:55:21,101 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:55:21,102 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-13 22:55:21,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4703f92d/76e70a80c8314420bee804d00b9a34b4/FLAG013173ec4 [2019-10-13 22:55:21,945 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:55:21,945 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-13 22:55:21,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4703f92d/76e70a80c8314420bee804d00b9a34b4/FLAG013173ec4 [2019-10-13 22:55:22,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4703f92d/76e70a80c8314420bee804d00b9a34b4 [2019-10-13 22:55:22,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:55:22,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:55:22,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:55:22,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:55:22,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:55:22,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:22" (1/1) ... [2019-10-13 22:55:22,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30593915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:22, skipping insertion in model container [2019-10-13 22:55:22,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:22" (1/1) ... [2019-10-13 22:55:22,076 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:55:22,180 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:55:23,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:55:23,405 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:55:23,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:55:23,680 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:55:23,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:23 WrapperNode [2019-10-13 22:55:23,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:55:23,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:55:23,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:55:23,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:55:23,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:23" (1/1) ... [2019-10-13 22:55:23,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:23" (1/1) ... [2019-10-13 22:55:23,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:23" (1/1) ... [2019-10-13 22:55:23,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:23" (1/1) ... [2019-10-13 22:55:23,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:23" (1/1) ... [2019-10-13 22:55:23,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:23" (1/1) ... [2019-10-13 22:55:23,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:23" (1/1) ... [2019-10-13 22:55:23,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:55:23,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:55:23,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:55:23,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:55:23,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:23" (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-13 22:55:23,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:55:23,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:55:23,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-10-13 22:55:23,976 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-10-13 22:55:23,976 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2019-10-13 22:55:23,977 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2019-10-13 22:55:23,977 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-13 22:55:23,977 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-10-13 22:55:23,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-13 22:55:23,977 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2019-10-13 22:55:23,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-13 22:55:23,978 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-13 22:55:23,978 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-13 22:55:23,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-13 22:55:23,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-13 22:55:23,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-13 22:55:23,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-13 22:55:23,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-13 22:55:23,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-13 22:55:23,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-13 22:55:23,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-13 22:55:23,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-13 22:55:23,981 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-13 22:55:23,981 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-10-13 22:55:23,981 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-10-13 22:55:23,981 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-13 22:55:23,981 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-10-13 22:55:23,982 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-13 22:55:23,982 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-10-13 22:55:23,982 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_irq [2019-10-13 22:55:23,982 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_open [2019-10-13 22:55:23,982 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_close [2019-10-13 22:55:23,982 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_probe [2019-10-13 22:55:23,983 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-10-13 22:55:23,983 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_init [2019-10-13 22:55:23,983 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_exit [2019-10-13 22:55:23,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-10-13 22:55:23,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:55:23,984 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-13 22:55:23,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_2 [2019-10-13 22:55:23,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-10-13 22:55:23,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-10-13 22:55:23,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_5 [2019-10-13 22:55:23,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_6 [2019-10-13 22:55:23,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-10-13 22:55:23,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_8 [2019-10-13 22:55:23,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_10 [2019-10-13 22:55:23,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_11 [2019-10-13 22:55:23,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-13 22:55:23,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-10-13 22:55:23,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-10-13 22:55:23,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-10-13 22:55:23,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-10-13 22:55:23,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-10-13 22:55:23,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-10-13 22:55:23,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-10-13 22:55:23,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-10-13 22:55:23,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-10-13 22:55:23,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-10-13 22:55:23,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-10-13 22:55:23,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-10-13 22:55:23,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-10-13 22:55:23,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-10-13 22:55:23,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-10-13 22:55:23,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-13 22:55:23,991 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-13 22:55:23,992 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-13 22:55:23,992 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-13 22:55:23,992 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-13 22:55:23,992 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-13 22:55:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-10-13 22:55:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-13 22:55:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-13 22:55:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-13 22:55:23,994 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-13 22:55:23,994 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2019-10-13 22:55:23,994 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-13 22:55:23,994 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-13 22:55:23,995 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-13 22:55:23,995 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-13 22:55:23,995 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-13 22:55:23,995 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-10-13 22:55:23,995 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-13 22:55:23,996 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-13 22:55:23,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-13 22:55:23,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-13 22:55:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:55:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-13 22:55:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-10-13 22:55:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:55:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2019-10-13 22:55:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2019-10-13 22:55:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-10-13 22:55:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-13 22:55:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-13 22:55:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-13 22:55:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-10-13 22:55:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2019-10-13 22:55:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-13 22:55:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-13 22:55:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-13 22:55:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_8 [2019-10-13 22:55:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-10-13 22:55:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-13 22:55:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-13 22:55:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 22:55:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 22:55:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-13 22:55:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_2 [2019-10-13 22:55:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-10-13 22:55:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-13 22:55:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_11 [2019-10-13 22:55:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_6 [2019-10-13 22:55:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_5 [2019-10-13 22:55:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_10 [2019-10-13 22:55:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-10-13 22:55:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-10-13 22:55:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-13 22:55:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-13 22:55:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-13 22:55:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-13 22:55:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2019-10-13 22:55:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-10-13 22:55:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-10-13 22:55:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-10-13 22:55:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-10-13 22:55:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-10-13 22:55:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-10-13 22:55:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-10-13 22:55:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-13 22:55:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-13 22:55:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-13 22:55:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-13 22:55:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-13 22:55:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 22:55:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 22:55:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:55:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-13 22:55:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 22:55:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:55:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 22:55:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-13 22:55:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-13 22:55:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-13 22:55:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-13 22:55:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-13 22:55:24,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-13 22:55:24,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-13 22:55:24,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-13 22:55:24,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-13 22:55:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-10-13 22:55:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-13 22:55:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-13 22:55:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-10-13 22:55:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-10-13 22:55:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-13 22:55:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-13 22:55:24,015 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-13 22:55:24,015 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-13 22:55:24,015 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-10-13 22:55:24,015 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-13 22:55:24,015 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-10-13 22:55:24,016 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-10-13 22:55:24,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:55:24,016 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_irq [2019-10-13 22:55:24,016 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_open [2019-10-13 22:55:24,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 22:55:24,017 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_close [2019-10-13 22:55:24,017 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_probe [2019-10-13 22:55:24,017 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-10-13 22:55:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_init [2019-10-13 22:55:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_exit [2019-10-13 22:55:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-13 22:55:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-13 22:55:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:55:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-13 22:55:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-10-13 22:55:24,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-10-13 22:55:24,020 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-10-13 22:55:24,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-10-13 22:55:24,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-10-13 22:55:24,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-10-13 22:55:24,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-10-13 22:55:24,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-10-13 22:55:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-10-13 22:55:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-13 22:55:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 22:55:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:55:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:55:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 22:55:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 22:55:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:55:25,050 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-13 22:55:27,156 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:55:27,156 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 22:55:27,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:27 BoogieIcfgContainer [2019-10-13 22:55:27,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:55:27,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:55:27,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:55:27,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:55:27,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:55:22" (1/3) ... [2019-10-13 22:55:27,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4270284e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:27, skipping insertion in model container [2019-10-13 22:55:27,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:23" (2/3) ... [2019-10-13 22:55:27,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4270284e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:27, skipping insertion in model container [2019-10-13 22:55:27,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:27" (3/3) ... [2019-10-13 22:55:27,169 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-13 22:55:27,180 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:55:27,196 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:55:27,208 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:55:27,251 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:55:27,252 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:55:27,252 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:55:27,252 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:55:27,252 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:55:27,252 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:55:27,252 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:55:27,252 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:55:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states. [2019-10-13 22:55:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 22:55:27,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:27,305 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-13 22:55:27,308 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:27,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:27,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1188300801, now seen corresponding path program 1 times [2019-10-13 22:55:27,324 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:27,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138379126] [2019-10-13 22:55:27,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:27,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:27,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:27,815 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-13 22:55:27,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138379126] [2019-10-13 22:55:27,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:27,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:55:27,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229222119] [2019-10-13 22:55:27,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:55:27,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:27,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:55:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:55:27,841 INFO L87 Difference]: Start difference. First operand 414 states. Second operand 3 states. [2019-10-13 22:55:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:28,040 INFO L93 Difference]: Finished difference Result 856 states and 1017 transitions. [2019-10-13 22:55:28,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:55:28,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-13 22:55:28,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:28,062 INFO L225 Difference]: With dead ends: 856 [2019-10-13 22:55:28,062 INFO L226 Difference]: Without dead ends: 540 [2019-10-13 22:55:28,070 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-13 22:55:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-13 22:55:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-13 22:55:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-13 22:55:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 627 transitions. [2019-10-13 22:55:28,201 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 627 transitions. Word has length 38 [2019-10-13 22:55:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:28,202 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 627 transitions. [2019-10-13 22:55:28,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:55:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 627 transitions. [2019-10-13 22:55:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 22:55:28,212 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:28,212 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-13 22:55:28,213 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:28,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash 578807213, now seen corresponding path program 1 times [2019-10-13 22:55:28,218 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:28,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243408223] [2019-10-13 22:55:28,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:28,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:28,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:28,446 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-13 22:55:28,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243408223] [2019-10-13 22:55:28,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:28,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:55:28,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216609605] [2019-10-13 22:55:28,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:55:28,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:28,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:55:28,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:55:28,458 INFO L87 Difference]: Start difference. First operand 540 states and 627 transitions. Second operand 3 states. [2019-10-13 22:55:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:28,567 INFO L93 Difference]: Finished difference Result 927 states and 1074 transitions. [2019-10-13 22:55:28,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:55:28,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 22:55:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:28,580 INFO L225 Difference]: With dead ends: 927 [2019-10-13 22:55:28,580 INFO L226 Difference]: Without dead ends: 924 [2019-10-13 22:55:28,582 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-13 22:55:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-10-13 22:55:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 904. [2019-10-13 22:55:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-13 22:55:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1049 transitions. [2019-10-13 22:55:28,658 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1049 transitions. Word has length 57 [2019-10-13 22:55:28,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:28,658 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1049 transitions. [2019-10-13 22:55:28,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:55:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1049 transitions. [2019-10-13 22:55:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 22:55:28,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:28,662 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-13 22:55:28,662 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:28,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:28,662 INFO L82 PathProgramCache]: Analyzing trace with hash 763009325, now seen corresponding path program 1 times [2019-10-13 22:55:28,662 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:28,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335521839] [2019-10-13 22:55:28,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:28,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:28,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:28,860 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-13 22:55:28,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335521839] [2019-10-13 22:55:28,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:28,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:55:28,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939521086] [2019-10-13 22:55:28,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:55:28,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:28,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:55:28,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:55:28,863 INFO L87 Difference]: Start difference. First operand 904 states and 1049 transitions. Second operand 3 states. [2019-10-13 22:55:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:28,913 INFO L93 Difference]: Finished difference Result 906 states and 1050 transitions. [2019-10-13 22:55:28,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:55:28,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 22:55:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:28,920 INFO L225 Difference]: With dead ends: 906 [2019-10-13 22:55:28,920 INFO L226 Difference]: Without dead ends: 903 [2019-10-13 22:55:28,922 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-13 22:55:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-10-13 22:55:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2019-10-13 22:55:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-10-13 22:55:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1047 transitions. [2019-10-13 22:55:28,995 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1047 transitions. Word has length 58 [2019-10-13 22:55:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:28,998 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1047 transitions. [2019-10-13 22:55:28,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:55:28,998 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1047 transitions. [2019-10-13 22:55:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 22:55:29,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:29,006 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-13 22:55:29,007 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:29,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2116654928, now seen corresponding path program 1 times [2019-10-13 22:55:29,007 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:29,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568577864] [2019-10-13 22:55:29,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:29,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:29,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:29,168 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-13 22:55:29,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568577864] [2019-10-13 22:55:29,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:29,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:55:29,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138434042] [2019-10-13 22:55:29,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:55:29,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:55:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:55:29,171 INFO L87 Difference]: Start difference. First operand 903 states and 1047 transitions. Second operand 3 states. [2019-10-13 22:55:29,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:29,211 INFO L93 Difference]: Finished difference Result 905 states and 1048 transitions. [2019-10-13 22:55:29,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:55:29,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-13 22:55:29,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:29,217 INFO L225 Difference]: With dead ends: 905 [2019-10-13 22:55:29,218 INFO L226 Difference]: Without dead ends: 902 [2019-10-13 22:55:29,219 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-13 22:55:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-10-13 22:55:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2019-10-13 22:55:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-10-13 22:55:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1045 transitions. [2019-10-13 22:55:29,274 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1045 transitions. Word has length 59 [2019-10-13 22:55:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:29,274 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1045 transitions. [2019-10-13 22:55:29,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:55:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1045 transitions. [2019-10-13 22:55:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 22:55:29,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:29,276 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-13 22:55:29,276 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1191928688, now seen corresponding path program 1 times [2019-10-13 22:55:29,277 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:29,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624712125] [2019-10-13 22:55:29,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:29,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:29,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:29,387 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-13 22:55:29,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624712125] [2019-10-13 22:55:29,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:29,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:55:29,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961131847] [2019-10-13 22:55:29,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:55:29,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:29,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:55:29,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:55:29,389 INFO L87 Difference]: Start difference. First operand 902 states and 1045 transitions. Second operand 3 states. [2019-10-13 22:55:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:29,437 INFO L93 Difference]: Finished difference Result 904 states and 1046 transitions. [2019-10-13 22:55:29,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:55:29,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 22:55:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:29,446 INFO L225 Difference]: With dead ends: 904 [2019-10-13 22:55:29,447 INFO L226 Difference]: Without dead ends: 901 [2019-10-13 22:55:29,448 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-13 22:55:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-10-13 22:55:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2019-10-13 22:55:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-10-13 22:55:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1043 transitions. [2019-10-13 22:55:29,512 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1043 transitions. Word has length 60 [2019-10-13 22:55:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:29,514 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1043 transitions. [2019-10-13 22:55:29,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:55:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1043 transitions. [2019-10-13 22:55:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 22:55:29,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:29,516 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-13 22:55:29,516 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:29,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1704785843, now seen corresponding path program 1 times [2019-10-13 22:55:29,517 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:29,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188634546] [2019-10-13 22:55:29,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:29,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:29,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:29,662 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-13 22:55:29,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188634546] [2019-10-13 22:55:29,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:29,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:55:29,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525611527] [2019-10-13 22:55:29,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:55:29,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:29,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:55:29,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:55:29,667 INFO L87 Difference]: Start difference. First operand 901 states and 1043 transitions. Second operand 3 states. [2019-10-13 22:55:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:29,706 INFO L93 Difference]: Finished difference Result 903 states and 1044 transitions. [2019-10-13 22:55:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:55:29,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-13 22:55:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:29,712 INFO L225 Difference]: With dead ends: 903 [2019-10-13 22:55:29,712 INFO L226 Difference]: Without dead ends: 883 [2019-10-13 22:55:29,713 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-13 22:55:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-10-13 22:55:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2019-10-13 22:55:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-10-13 22:55:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1022 transitions. [2019-10-13 22:55:29,826 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1022 transitions. Word has length 61 [2019-10-13 22:55:29,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:29,828 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1022 transitions. [2019-10-13 22:55:29,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:55:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1022 transitions. [2019-10-13 22:55:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-13 22:55:29,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:29,836 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-13 22:55:29,839 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:29,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:29,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2075513611, now seen corresponding path program 1 times [2019-10-13 22:55:29,840 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:29,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10630281] [2019-10-13 22:55:29,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:29,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:29,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:30,007 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-13 22:55:30,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10630281] [2019-10-13 22:55:30,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:30,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:55:30,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165586107] [2019-10-13 22:55:30,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:55:30,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:30,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:55:30,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:55:30,010 INFO L87 Difference]: Start difference. First operand 883 states and 1022 transitions. Second operand 3 states. [2019-10-13 22:55:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:30,089 INFO L93 Difference]: Finished difference Result 1424 states and 1662 transitions. [2019-10-13 22:55:30,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:55:30,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-13 22:55:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:30,093 INFO L225 Difference]: With dead ends: 1424 [2019-10-13 22:55:30,094 INFO L226 Difference]: Without dead ends: 558 [2019-10-13 22:55:30,097 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-13 22:55:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-10-13 22:55:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 526. [2019-10-13 22:55:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-10-13 22:55:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 615 transitions. [2019-10-13 22:55:30,130 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 615 transitions. Word has length 186 [2019-10-13 22:55:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:30,130 INFO L462 AbstractCegarLoop]: Abstraction has 526 states and 615 transitions. [2019-10-13 22:55:30,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:55:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 615 transitions. [2019-10-13 22:55:30,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-13 22:55:30,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:30,134 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-13 22:55:30,135 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:30,135 INFO L82 PathProgramCache]: Analyzing trace with hash -854921549, now seen corresponding path program 1 times [2019-10-13 22:55:30,136 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:30,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340423049] [2019-10-13 22:55:30,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:30,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:30,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:30,342 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-13 22:55:30,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340423049] [2019-10-13 22:55:30,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:30,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:55:30,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370321351] [2019-10-13 22:55:30,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:55:30,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:30,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:55:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:55:30,344 INFO L87 Difference]: Start difference. First operand 526 states and 615 transitions. Second operand 6 states. [2019-10-13 22:55:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:30,439 INFO L93 Difference]: Finished difference Result 1034 states and 1213 transitions. [2019-10-13 22:55:30,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:55:30,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-10-13 22:55:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:30,444 INFO L225 Difference]: With dead ends: 1034 [2019-10-13 22:55:30,445 INFO L226 Difference]: Without dead ends: 538 [2019-10-13 22:55:30,447 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-13 22:55:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-13 22:55:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2019-10-13 22:55:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-10-13 22:55:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 625 transitions. [2019-10-13 22:55:30,486 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 625 transitions. Word has length 203 [2019-10-13 22:55:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:30,487 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 625 transitions. [2019-10-13 22:55:30,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:55:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 625 transitions. [2019-10-13 22:55:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-13 22:55:30,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:30,492 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-13 22:55:30,493 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1660401743, now seen corresponding path program 1 times [2019-10-13 22:55:30,493 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:30,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212955223] [2019-10-13 22:55:30,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:30,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:30,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:30,937 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-13 22:55:30,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212955223] [2019-10-13 22:55:30,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:30,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 22:55:30,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890272361] [2019-10-13 22:55:30,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 22:55:30,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:30,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 22:55:30,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 22:55:30,939 INFO L87 Difference]: Start difference. First operand 536 states and 625 transitions. Second operand 8 states. [2019-10-13 22:55:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:31,956 INFO L93 Difference]: Finished difference Result 769 states and 898 transitions. [2019-10-13 22:55:31,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 22:55:31,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 207 [2019-10-13 22:55:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:31,961 INFO L225 Difference]: With dead ends: 769 [2019-10-13 22:55:31,961 INFO L226 Difference]: Without dead ends: 753 [2019-10-13 22:55:31,962 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-13 22:55:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-10-13 22:55:32,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 748. [2019-10-13 22:55:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-13 22:55:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 875 transitions. [2019-10-13 22:55:32,006 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 875 transitions. Word has length 207 [2019-10-13 22:55:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:32,006 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 875 transitions. [2019-10-13 22:55:32,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 22:55:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 875 transitions. [2019-10-13 22:55:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-13 22:55:32,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:32,011 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-13 22:55:32,011 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash 94456589, now seen corresponding path program 1 times [2019-10-13 22:55:32,012 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:32,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116286620] [2019-10-13 22:55:32,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:32,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:32,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:32,253 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-13 22:55:32,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116286620] [2019-10-13 22:55:32,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40301804] [2019-10-13 22:55:32,254 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-13 22:55:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:32,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 2105 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 22:55:33,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:55:33,175 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-13 22:55:33,175 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:55:33,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:55:33,781 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-13 22:55:33,782 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 22:55:33,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 12 [2019-10-13 22:55:33,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953368365] [2019-10-13 22:55:33,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 22:55:33,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:33,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 22:55:33,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-13 22:55:33,784 INFO L87 Difference]: Start difference. First operand 748 states and 875 transitions. Second operand 8 states. [2019-10-13 22:55:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:35,216 INFO L93 Difference]: Finished difference Result 1979 states and 2320 transitions. [2019-10-13 22:55:35,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 22:55:35,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-10-13 22:55:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:35,228 INFO L225 Difference]: With dead ends: 1979 [2019-10-13 22:55:35,228 INFO L226 Difference]: Without dead ends: 1963 [2019-10-13 22:55:35,229 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-13 22:55:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-10-13 22:55:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1944. [2019-10-13 22:55:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1944 states. [2019-10-13 22:55:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 2283 transitions. [2019-10-13 22:55:35,415 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 2283 transitions. Word has length 242 [2019-10-13 22:55:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:35,416 INFO L462 AbstractCegarLoop]: Abstraction has 1944 states and 2283 transitions. [2019-10-13 22:55:35,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 22:55:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2283 transitions. [2019-10-13 22:55:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-13 22:55:35,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:35,422 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-13 22:55:35,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:55:35,631 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:35,632 INFO L82 PathProgramCache]: Analyzing trace with hash 96989818, now seen corresponding path program 1 times [2019-10-13 22:55:35,632 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:35,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816954495] [2019-10-13 22:55:35,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:35,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:35,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:36,456 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-13 22:55:36,463 INFO L168 Benchmark]: Toolchain (without parser) took 14403.25 ms. Allocated memory was 138.9 MB in the beginning and 503.3 MB in the end (delta: 364.4 MB). Free memory was 96.7 MB in the beginning and 246.4 MB in the end (delta: -149.8 MB). Peak memory consumption was 214.6 MB. Max. memory is 7.1 GB. [2019-10-13 22:55:36,464 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-13 22:55:36,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1620.60 ms. Allocated memory was 138.9 MB in the beginning and 207.6 MB in the end (delta: 68.7 MB). Free memory was 96.5 MB in the beginning and 119.7 MB in the end (delta: -23.2 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-10-13 22:55:36,465 INFO L168 Benchmark]: Boogie Preprocessor took 198.22 ms. Allocated memory is still 207.6 MB. Free memory was 119.7 MB in the beginning and 111.2 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. [2019-10-13 22:55:36,466 INFO L168 Benchmark]: RCFGBuilder took 3279.29 ms. Allocated memory was 207.6 MB in the beginning and 257.9 MB in the end (delta: 50.3 MB). Free memory was 111.2 MB in the beginning and 122.7 MB in the end (delta: -11.6 MB). Peak memory consumption was 72.5 MB. Max. memory is 7.1 GB. [2019-10-13 22:55:36,467 INFO L168 Benchmark]: TraceAbstraction took 9300.24 ms. Allocated memory was 257.9 MB in the beginning and 503.3 MB in the end (delta: 245.4 MB). Free memory was 122.7 MB in the beginning and 246.4 MB in the end (delta: -123.7 MB). Peak memory consumption was 121.7 MB. Max. memory is 7.1 GB. [2019-10-13 22:55:36,470 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.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1620.60 ms. Allocated memory was 138.9 MB in the beginning and 207.6 MB in the end (delta: 68.7 MB). Free memory was 96.5 MB in the beginning and 119.7 MB in the end (delta: -23.2 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 198.22 ms. Allocated memory is still 207.6 MB. Free memory was 119.7 MB in the beginning and 111.2 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3279.29 ms. Allocated memory was 207.6 MB in the beginning and 257.9 MB in the end (delta: 50.3 MB). Free memory was 111.2 MB in the beginning and 122.7 MB in the end (delta: -11.6 MB). Peak memory consumption was 72.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9300.24 ms. Allocated memory was 257.9 MB in the beginning and 503.3 MB in the end (delta: 245.4 MB). Free memory was 122.7 MB in the beginning and 246.4 MB in the end (delta: -123.7 MB). Peak memory consumption was 121.7 MB. 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...