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-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 06:17:43,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 06:17:43,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 06:17:43,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 06:17:43,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 06:17:43,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 06:17:43,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 06:17:43,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 06:17:43,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 06:17:43,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 06:17:43,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 06:17:43,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 06:17:43,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 06:17:43,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 06:17:43,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 06:17:43,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 06:17:43,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 06:17:43,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 06:17:43,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 06:17:43,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 06:17:43,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 06:17:43,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 06:17:43,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 06:17:43,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 06:17:43,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 06:17:43,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 06:17:43,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 06:17:43,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 06:17:43,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 06:17:43,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 06:17:43,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 06:17:43,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 06:17:43,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 06:17:43,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 06:17:43,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 06:17:43,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 06:17:43,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 06:17:43,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 06:17:43,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 06:17:43,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 06:17:43,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 06:17:43,927 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-07 06:17:43,950 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 06:17:43,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 06:17:43,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 06:17:43,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 06:17:43,953 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 06:17:43,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 06:17:43,953 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 06:17:43,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 06:17:43,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 06:17:43,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 06:17:43,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 06:17:43,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 06:17:43,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 06:17:43,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 06:17:43,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 06:17:43,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 06:17:43,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 06:17:43,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 06:17:43,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 06:17:43,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 06:17:43,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 06:17:43,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 06:17:43,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 06:17:43,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 06:17:43,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 06:17:43,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 06:17:43,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 06:17:43,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 06:17:43,959 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-07 06:17:44,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 06:17:44,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 06:17:44,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 06:17:44,271 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 06:17:44,272 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 06:17:44,272 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-07 06:17:44,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1589956c/2fc8f01e74f6478ca5515b5a2ab20dec/FLAG3648ccb6a [2019-10-07 06:17:45,108 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 06:17:45,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-07 06:17:45,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1589956c/2fc8f01e74f6478ca5515b5a2ab20dec/FLAG3648ccb6a [2019-10-07 06:17:45,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1589956c/2fc8f01e74f6478ca5515b5a2ab20dec [2019-10-07 06:17:45,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 06:17:45,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 06:17:45,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 06:17:45,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 06:17:45,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 06:17:45,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 06:17:45" (1/1) ... [2019-10-07 06:17:45,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f918a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 06:17:45, skipping insertion in model container [2019-10-07 06:17:45,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 06:17:45" (1/1) ... [2019-10-07 06:17:45,228 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 06:17:45,329 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 06:17:46,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 06:17:46,596 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 06:17:46,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 06:17:46,960 INFO L192 MainTranslator]: Completed translation [2019-10-07 06:17:46,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 06:17:46 WrapperNode [2019-10-07 06:17:46,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 06:17:46,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 06:17:46,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 06:17:46,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 06:17:46,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 06:17:46" (1/1) ... [2019-10-07 06:17:46,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 06:17:46" (1/1) ... [2019-10-07 06:17:47,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 06:17:46" (1/1) ... [2019-10-07 06:17:47,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 06:17:46" (1/1) ... [2019-10-07 06:17:47,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 06:17:46" (1/1) ... [2019-10-07 06:17:47,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 06:17:46" (1/1) ... [2019-10-07 06:17:47,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 06:17:46" (1/1) ... [2019-10-07 06:17:47,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 06:17:47,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 06:17:47,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 06:17:47,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 06:17:47,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 06:17:46" (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-07 06:17:47,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 06:17:47,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 06:17:47,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __le16_to_cpup [2019-10-07 06:17:47,317 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-07 06:17:47,318 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-07 06:17:47,319 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2019-10-07 06:17:47,320 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-10-07 06:17:47,320 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-07 06:17:47,321 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-07 06:17:47,321 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-10-07 06:17:47,321 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2019-10-07 06:17:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-07 06:17:47,322 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-07 06:17:47,323 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-10-07 06:17:47,323 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-10-07 06:17:47,323 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-07 06:17:47,326 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-10-07 06:17:47,327 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-07 06:17:47,327 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-10-07 06:17:47,328 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2019-10-07 06:17:47,328 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_irq [2019-10-07 06:17:47,328 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_open [2019-10-07 06:17:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_close [2019-10-07 06:17:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2019-10-07 06:17:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2019-10-07 06:17:47,329 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2019-10-07 06:17:47,330 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2019-10-07 06:17:47,330 INFO L138 BoogieDeclarations]: Found implementation of procedure init_module [2019-10-07 06:17:47,330 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup_module [2019-10-07 06:17:47,330 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 06:17:47,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-10-07 06:17:47,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-10-07 06:17:47,331 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-07 06:17:47,331 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-07 06:17:47,332 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-10-07 06:17:47,333 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-10-07 06:17:47,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-07 06:17:47,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-07 06:17:47,333 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-07 06:17:47,334 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-07 06:17:47,334 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-07 06:17:47,334 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-07 06:17:47,335 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-07 06:17:47,335 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-10-07 06:17:47,335 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-07 06:17:47,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-10-07 06:17:47,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-07 06:17:47,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-10-07 06:17:47,336 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-07 06:17:47,336 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-07 06:17:47,337 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-07 06:17:47,337 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-07 06:17:47,337 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-07 06:17:47,338 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-10-07 06:17:47,338 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-07 06:17:47,338 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-07 06:17:47,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 06:17:47,339 INFO L130 BoogieDeclarations]: Found specification of procedure __le16_to_cpup [2019-10-07 06:17:47,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 06:17:47,340 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-07 06:17:47,340 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-07 06:17:47,341 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-07 06:17:47,341 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-07 06:17:47,342 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-07 06:17:47,342 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-07 06:17:47,342 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-07 06:17:47,342 INFO L130 BoogieDeclarations]: Found specification of procedure init_module [2019-10-07 06:17:47,343 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup_module [2019-10-07 06:17:47,343 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-07 06:17:47,343 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-07 06:17:47,343 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2019-10-07 06:17:47,344 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-10-07 06:17:47,344 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-07 06:17:47,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 06:17:47,346 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-07 06:17:47,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 06:17:47,347 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-07 06:17:47,347 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-10-07 06:17:47,347 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-07 06:17:47,347 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2019-10-07 06:17:47,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 06:17:47,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 06:17:47,349 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-10-07 06:17:47,349 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-10-07 06:17:47,349 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-10-07 06:17:47,349 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-07 06:17:47,349 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-07 06:17:47,350 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-07 06:17:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-07 06:17:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-07 06:17:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-07 06:17:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-10-07 06:17:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-10-07 06:17:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-07 06:17:47,352 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-07 06:17:47,352 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-07 06:17:47,352 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-07 06:17:47,352 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-10-07 06:17:47,352 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-07 06:17:47,352 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-10-07 06:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-10-07 06:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2019-10-07 06:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_irq [2019-10-07 06:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_open [2019-10-07 06:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_close [2019-10-07 06:17:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2019-10-07 06:17:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2019-10-07 06:17:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2019-10-07 06:17:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2019-10-07 06:17:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-07 06:17:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-10-07 06:17:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-07 06:17:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 06:17:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 06:17:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-10-07 06:17:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-10-07 06:17:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-10-07 06:17:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-07 06:17:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-07 06:17:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 06:17:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 06:17:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 06:17:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 06:17:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 06:17:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-07 06:17:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 06:17:47,990 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 06:17:48,035 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-07 06:17:48,035 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-07 06:17:48,396 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 06:17:48,471 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-07 06:17:48,472 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-07 06:17:48,779 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-10-07 06:17:49,825 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 06:17:49,826 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-07 06:17:49,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 06:17:49 BoogieIcfgContainer [2019-10-07 06:17:49,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 06:17:49,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 06:17:49,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 06:17:49,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 06:17:49,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 06:17:45" (1/3) ... [2019-10-07 06:17:49,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f07d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 06:17:49, skipping insertion in model container [2019-10-07 06:17:49,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 06:17:46" (2/3) ... [2019-10-07 06:17:49,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f07d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 06:17:49, skipping insertion in model container [2019-10-07 06:17:49,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 06:17:49" (3/3) ... [2019-10-07 06:17:49,836 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-07 06:17:49,846 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 06:17:49,857 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 06:17:49,869 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 06:17:49,902 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 06:17:49,902 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 06:17:49,903 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 06:17:49,903 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 06:17:49,903 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 06:17:49,903 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 06:17:49,904 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 06:17:49,904 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 06:17:49,937 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2019-10-07 06:17:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 06:17:49,947 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:17:49,948 INFO L385 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] [2019-10-07 06:17:49,950 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:17:49,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:17:49,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1838643444, now seen corresponding path program 1 times [2019-10-07 06:17:49,965 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:17:49,965 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:49,966 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:49,966 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:49,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:17:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:17:50,488 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-07 06:17:50,488 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:50,489 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:17:50,489 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 06:17:50,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 06:17:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 06:17:50,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 06:17:50,511 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 3 states. [2019-10-07 06:17:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:17:50,666 INFO L93 Difference]: Finished difference Result 528 states and 654 transitions. [2019-10-07 06:17:50,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 06:17:50,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-07 06:17:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:17:50,707 INFO L225 Difference]: With dead ends: 528 [2019-10-07 06:17:50,707 INFO L226 Difference]: Without dead ends: 327 [2019-10-07 06:17:50,721 INFO L606 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-07 06:17:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-07 06:17:50,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2019-10-07 06:17:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-10-07 06:17:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 370 transitions. [2019-10-07 06:17:50,891 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 370 transitions. Word has length 25 [2019-10-07 06:17:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:17:50,893 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 370 transitions. [2019-10-07 06:17:50,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 06:17:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 370 transitions. [2019-10-07 06:17:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 06:17:50,894 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:17:50,894 INFO L385 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] [2019-10-07 06:17:50,895 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:17:50,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:17:50,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1163173868, now seen corresponding path program 1 times [2019-10-07 06:17:50,896 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:17:50,896 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:50,896 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:50,896 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:17:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:17:51,103 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-07 06:17:51,104 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:51,104 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:17:51,104 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 06:17:51,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 06:17:51,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 06:17:51,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 06:17:51,109 INFO L87 Difference]: Start difference. First operand 322 states and 370 transitions. Second operand 3 states. [2019-10-07 06:17:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:17:51,176 INFO L93 Difference]: Finished difference Result 741 states and 856 transitions. [2019-10-07 06:17:51,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 06:17:51,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-07 06:17:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:17:51,182 INFO L225 Difference]: With dead ends: 741 [2019-10-07 06:17:51,182 INFO L226 Difference]: Without dead ends: 431 [2019-10-07 06:17:51,184 INFO L606 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-07 06:17:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-07 06:17:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 425. [2019-10-07 06:17:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-07 06:17:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 488 transitions. [2019-10-07 06:17:51,224 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 488 transitions. Word has length 26 [2019-10-07 06:17:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:17:51,224 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 488 transitions. [2019-10-07 06:17:51,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 06:17:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 488 transitions. [2019-10-07 06:17:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-07 06:17:51,227 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:17:51,227 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 06:17:51,228 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:17:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:17:51,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1952461806, now seen corresponding path program 1 times [2019-10-07 06:17:51,228 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:17:51,229 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:51,229 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:51,229 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:17:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:17:51,362 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-07 06:17:51,363 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:51,363 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:17:51,363 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 06:17:51,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 06:17:51,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 06:17:51,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 06:17:51,365 INFO L87 Difference]: Start difference. First operand 425 states and 488 transitions. Second operand 3 states. [2019-10-07 06:17:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:17:51,422 INFO L93 Difference]: Finished difference Result 853 states and 996 transitions. [2019-10-07 06:17:51,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 06:17:51,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-07 06:17:51,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:17:51,427 INFO L225 Difference]: With dead ends: 853 [2019-10-07 06:17:51,428 INFO L226 Difference]: Without dead ends: 448 [2019-10-07 06:17:51,429 INFO L606 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-07 06:17:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-10-07 06:17:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-10-07 06:17:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-07 06:17:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 519 transitions. [2019-10-07 06:17:51,459 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 519 transitions. Word has length 61 [2019-10-07 06:17:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:17:51,459 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 519 transitions. [2019-10-07 06:17:51,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 06:17:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 519 transitions. [2019-10-07 06:17:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-07 06:17:51,463 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:17:51,463 INFO L385 BasicCegarLoop]: trace histogram [3, 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] [2019-10-07 06:17:51,464 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:17:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:17:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash -119762277, now seen corresponding path program 1 times [2019-10-07 06:17:51,464 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:17:51,465 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:51,465 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:51,465 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:51,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:17:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:17:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 06:17:51,716 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:51,717 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:17:51,717 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 06:17:51,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 06:17:51,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 06:17:51,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 06:17:51,720 INFO L87 Difference]: Start difference. First operand 448 states and 519 transitions. Second operand 7 states. [2019-10-07 06:17:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:17:53,013 INFO L93 Difference]: Finished difference Result 794 states and 922 transitions. [2019-10-07 06:17:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 06:17:53,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2019-10-07 06:17:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:17:53,018 INFO L225 Difference]: With dead ends: 794 [2019-10-07 06:17:53,019 INFO L226 Difference]: Without dead ends: 467 [2019-10-07 06:17:53,020 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-07 06:17:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-10-07 06:17:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 344. [2019-10-07 06:17:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-10-07 06:17:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 394 transitions. [2019-10-07 06:17:53,043 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 394 transitions. Word has length 108 [2019-10-07 06:17:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:17:53,044 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 394 transitions. [2019-10-07 06:17:53,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 06:17:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 394 transitions. [2019-10-07 06:17:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-07 06:17:53,046 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:17:53,047 INFO L385 BasicCegarLoop]: trace histogram [4, 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] [2019-10-07 06:17:53,047 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:17:53,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:17:53,048 INFO L82 PathProgramCache]: Analyzing trace with hash -864977968, now seen corresponding path program 1 times [2019-10-07 06:17:53,048 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:17:53,048 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:53,048 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:53,048 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:17:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:17:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-07 06:17:53,337 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:53,338 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:17:53,338 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 06:17:53,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 06:17:53,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 06:17:53,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 06:17:53,340 INFO L87 Difference]: Start difference. First operand 344 states and 394 transitions. Second operand 8 states. [2019-10-07 06:17:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:17:55,851 INFO L93 Difference]: Finished difference Result 687 states and 798 transitions. [2019-10-07 06:17:55,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 06:17:55,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 106 [2019-10-07 06:17:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:17:55,855 INFO L225 Difference]: With dead ends: 687 [2019-10-07 06:17:55,855 INFO L226 Difference]: Without dead ends: 684 [2019-10-07 06:17:55,856 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-07 06:17:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-10-07 06:17:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 648. [2019-10-07 06:17:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-07 06:17:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 755 transitions. [2019-10-07 06:17:55,940 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 755 transitions. Word has length 106 [2019-10-07 06:17:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:17:55,941 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 755 transitions. [2019-10-07 06:17:55,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 06:17:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 755 transitions. [2019-10-07 06:17:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-07 06:17:55,944 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:17:55,944 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 06:17:55,945 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:17:55,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:17:55,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1389176690, now seen corresponding path program 1 times [2019-10-07 06:17:55,945 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:17:55,945 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:55,946 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:55,946 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:55,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:17:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:17:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 06:17:56,101 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:56,101 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:17:56,102 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 06:17:56,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 06:17:56,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 06:17:56,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 06:17:56,103 INFO L87 Difference]: Start difference. First operand 648 states and 755 transitions. Second operand 6 states. [2019-10-07 06:17:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:17:56,195 INFO L93 Difference]: Finished difference Result 1145 states and 1343 transitions. [2019-10-07 06:17:56,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 06:17:56,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-10-07 06:17:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:17:56,200 INFO L225 Difference]: With dead ends: 1145 [2019-10-07 06:17:56,200 INFO L226 Difference]: Without dead ends: 490 [2019-10-07 06:17:56,203 INFO L606 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-07 06:17:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-10-07 06:17:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 472. [2019-10-07 06:17:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-07 06:17:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 558 transitions. [2019-10-07 06:17:56,230 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 558 transitions. Word has length 122 [2019-10-07 06:17:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:17:56,231 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 558 transitions. [2019-10-07 06:17:56,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 06:17:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 558 transitions. [2019-10-07 06:17:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-07 06:17:56,233 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:17:56,234 INFO L385 BasicCegarLoop]: trace histogram [4, 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] [2019-10-07 06:17:56,234 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:17:56,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:17:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash -582616881, now seen corresponding path program 1 times [2019-10-07 06:17:56,235 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:17:56,235 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:56,235 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:56,235 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:56,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:17:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:17:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-07 06:17:56,404 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:56,404 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:17:56,404 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 06:17:56,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 06:17:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 06:17:56,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 06:17:56,408 INFO L87 Difference]: Start difference. First operand 472 states and 558 transitions. Second operand 3 states. [2019-10-07 06:17:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:17:56,447 INFO L93 Difference]: Finished difference Result 840 states and 1004 transitions. [2019-10-07 06:17:56,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 06:17:56,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-07 06:17:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:17:56,453 INFO L225 Difference]: With dead ends: 840 [2019-10-07 06:17:56,454 INFO L226 Difference]: Without dead ends: 446 [2019-10-07 06:17:56,455 INFO L606 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-07 06:17:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-07 06:17:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2019-10-07 06:17:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-07 06:17:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 517 transitions. [2019-10-07 06:17:56,482 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 517 transitions. Word has length 130 [2019-10-07 06:17:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:17:56,483 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 517 transitions. [2019-10-07 06:17:56,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 06:17:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 517 transitions. [2019-10-07 06:17:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-07 06:17:56,488 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:17:56,488 INFO L385 BasicCegarLoop]: trace histogram [4, 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] [2019-10-07 06:17:56,488 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:17:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:17:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash 703227700, now seen corresponding path program 1 times [2019-10-07 06:17:56,489 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:17:56,489 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:56,489 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:56,489 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:56,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:17:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:17:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-07 06:17:56,705 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:56,706 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:17:56,706 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 06:17:56,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 06:17:56,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 06:17:56,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 06:17:56,708 INFO L87 Difference]: Start difference. First operand 446 states and 517 transitions. Second operand 7 states. [2019-10-07 06:17:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:17:57,685 INFO L93 Difference]: Finished difference Result 481 states and 557 transitions. [2019-10-07 06:17:57,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 06:17:57,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-10-07 06:17:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:17:57,690 INFO L225 Difference]: With dead ends: 481 [2019-10-07 06:17:57,690 INFO L226 Difference]: Without dead ends: 478 [2019-10-07 06:17:57,691 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-07 06:17:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-07 06:17:57,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 459. [2019-10-07 06:17:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-10-07 06:17:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 530 transitions. [2019-10-07 06:17:57,741 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 530 transitions. Word has length 132 [2019-10-07 06:17:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:17:57,743 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 530 transitions. [2019-10-07 06:17:57,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 06:17:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 530 transitions. [2019-10-07 06:17:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-07 06:17:57,747 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:17:57,747 INFO L385 BasicCegarLoop]: trace histogram [4, 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] [2019-10-07 06:17:57,747 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:17:57,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:17:57,748 INFO L82 PathProgramCache]: Analyzing trace with hash 325024172, now seen corresponding path program 1 times [2019-10-07 06:17:57,748 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:17:57,748 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:57,748 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:57,749 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:17:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:17:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:17:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-07 06:17:58,130 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:17:58,131 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:17:58,131 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 06:17:58,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 06:17:58,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 06:17:58,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-07 06:17:58,133 INFO L87 Difference]: Start difference. First operand 459 states and 530 transitions. Second operand 8 states. [2019-10-07 06:18:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:18:00,247 INFO L93 Difference]: Finished difference Result 954 states and 1139 transitions. [2019-10-07 06:18:00,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 06:18:00,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-10-07 06:18:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:18:00,253 INFO L225 Difference]: With dead ends: 954 [2019-10-07 06:18:00,253 INFO L226 Difference]: Without dead ends: 735 [2019-10-07 06:18:00,254 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-10-07 06:18:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-10-07 06:18:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 687. [2019-10-07 06:18:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-10-07 06:18:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 819 transitions. [2019-10-07 06:18:00,293 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 819 transitions. Word has length 133 [2019-10-07 06:18:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:18:00,294 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 819 transitions. [2019-10-07 06:18:00,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 06:18:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 819 transitions. [2019-10-07 06:18:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-07 06:18:00,296 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:18:00,296 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 06:18:00,297 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:18:00,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:18:00,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2093508702, now seen corresponding path program 1 times [2019-10-07 06:18:00,297 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:18:00,298 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:00,298 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:00,298 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:18:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:18:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 06:18:00,562 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:00,563 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:18:00,563 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 06:18:00,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 06:18:00,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 06:18:00,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 06:18:00,564 INFO L87 Difference]: Start difference. First operand 687 states and 819 transitions. Second operand 8 states. [2019-10-07 06:18:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:18:02,858 INFO L93 Difference]: Finished difference Result 1167 states and 1408 transitions. [2019-10-07 06:18:02,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 06:18:02,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2019-10-07 06:18:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:18:02,870 INFO L225 Difference]: With dead ends: 1167 [2019-10-07 06:18:02,871 INFO L226 Difference]: Without dead ends: 1160 [2019-10-07 06:18:02,874 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-07 06:18:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-10-07 06:18:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1111. [2019-10-07 06:18:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-10-07 06:18:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1344 transitions. [2019-10-07 06:18:02,960 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1344 transitions. Word has length 148 [2019-10-07 06:18:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:18:02,961 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 1344 transitions. [2019-10-07 06:18:02,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 06:18:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1344 transitions. [2019-10-07 06:18:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-07 06:18:02,964 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:18:02,965 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-10-07 06:18:02,965 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:18:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:18:02,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2062722488, now seen corresponding path program 1 times [2019-10-07 06:18:02,965 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:18:02,966 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:02,966 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:02,966 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:18:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:18:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-07 06:18:03,125 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:03,125 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:18:03,125 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 06:18:03,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 06:18:03,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 06:18:03,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 06:18:03,172 INFO L87 Difference]: Start difference. First operand 1111 states and 1344 transitions. Second operand 5 states. [2019-10-07 06:18:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:18:03,282 INFO L93 Difference]: Finished difference Result 1163 states and 1398 transitions. [2019-10-07 06:18:03,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 06:18:03,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-10-07 06:18:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:18:03,292 INFO L225 Difference]: With dead ends: 1163 [2019-10-07 06:18:03,292 INFO L226 Difference]: Without dead ends: 1142 [2019-10-07 06:18:03,294 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 06:18:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-10-07 06:18:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1121. [2019-10-07 06:18:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-10-07 06:18:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1350 transitions. [2019-10-07 06:18:03,409 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1350 transitions. Word has length 165 [2019-10-07 06:18:03,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:18:03,409 INFO L462 AbstractCegarLoop]: Abstraction has 1121 states and 1350 transitions. [2019-10-07 06:18:03,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 06:18:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1350 transitions. [2019-10-07 06:18:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-07 06:18:03,413 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:18:03,413 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-10-07 06:18:03,413 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:18:03,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:18:03,414 INFO L82 PathProgramCache]: Analyzing trace with hash 888062377, now seen corresponding path program 1 times [2019-10-07 06:18:03,414 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:18:03,414 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:03,415 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:03,415 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:03,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:18:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:18:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-07 06:18:03,610 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:03,610 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 06:18:03,610 INFO L95 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-07 06:18:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:18:04,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 06:18:04,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 06:18:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-07 06:18:04,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 06:18:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-07 06:18:04,553 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 06:18:04,554 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 5 [2019-10-07 06:18:04,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 06:18:04,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 06:18:04,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 06:18:04,555 INFO L87 Difference]: Start difference. First operand 1121 states and 1350 transitions. Second operand 4 states. [2019-10-07 06:18:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:18:04,643 INFO L93 Difference]: Finished difference Result 1868 states and 2217 transitions. [2019-10-07 06:18:04,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 06:18:04,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-07 06:18:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:18:04,648 INFO L225 Difference]: With dead ends: 1868 [2019-10-07 06:18:04,649 INFO L226 Difference]: Without dead ends: 842 [2019-10-07 06:18:04,652 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 334 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 06:18:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-10-07 06:18:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 826. [2019-10-07 06:18:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-10-07 06:18:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 944 transitions. [2019-10-07 06:18:04,706 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 944 transitions. Word has length 168 [2019-10-07 06:18:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:18:04,706 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 944 transitions. [2019-10-07 06:18:04,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 06:18:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 944 transitions. [2019-10-07 06:18:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-07 06:18:04,709 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:18:04,709 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:18:04,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 06:18:04,923 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:18:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:18:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1788904068, now seen corresponding path program 1 times [2019-10-07 06:18:04,924 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:18:04,924 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:04,925 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:04,925 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:04,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:18:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:18:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 06:18:05,193 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:05,193 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:18:05,193 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 06:18:05,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 06:18:05,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 06:18:05,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 06:18:05,195 INFO L87 Difference]: Start difference. First operand 826 states and 944 transitions. Second operand 3 states. [2019-10-07 06:18:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:18:05,225 INFO L93 Difference]: Finished difference Result 1103 states and 1263 transitions. [2019-10-07 06:18:05,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 06:18:05,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-07 06:18:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:18:05,230 INFO L225 Difference]: With dead ends: 1103 [2019-10-07 06:18:05,230 INFO L226 Difference]: Without dead ends: 509 [2019-10-07 06:18:05,232 INFO L606 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-07 06:18:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-10-07 06:18:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2019-10-07 06:18:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-07 06:18:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 568 transitions. [2019-10-07 06:18:05,262 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 568 transitions. Word has length 183 [2019-10-07 06:18:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:18:05,263 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 568 transitions. [2019-10-07 06:18:05,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 06:18:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 568 transitions. [2019-10-07 06:18:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-07 06:18:05,265 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:18:05,266 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:18:05,266 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:18:05,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:18:05,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1236126625, now seen corresponding path program 1 times [2019-10-07 06:18:05,267 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:18:05,267 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:05,267 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:05,267 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:18:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:18:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 06:18:05,930 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:05,931 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:18:05,931 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 06:18:05,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 06:18:05,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 06:18:05,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-07 06:18:05,934 INFO L87 Difference]: Start difference. First operand 509 states and 568 transitions. Second operand 8 states. [2019-10-07 06:18:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:18:07,134 INFO L93 Difference]: Finished difference Result 554 states and 609 transitions. [2019-10-07 06:18:07,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 06:18:07,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2019-10-07 06:18:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:18:07,138 INFO L225 Difference]: With dead ends: 554 [2019-10-07 06:18:07,139 INFO L226 Difference]: Without dead ends: 532 [2019-10-07 06:18:07,140 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-10-07 06:18:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-07 06:18:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 501. [2019-10-07 06:18:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-07 06:18:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 557 transitions. [2019-10-07 06:18:07,178 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 557 transitions. Word has length 185 [2019-10-07 06:18:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:18:07,178 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 557 transitions. [2019-10-07 06:18:07,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 06:18:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 557 transitions. [2019-10-07 06:18:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-07 06:18:07,182 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:18:07,183 INFO L385 BasicCegarLoop]: trace histogram [5, 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] [2019-10-07 06:18:07,183 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:18:07,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:18:07,184 INFO L82 PathProgramCache]: Analyzing trace with hash 302984622, now seen corresponding path program 1 times [2019-10-07 06:18:07,184 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:18:07,184 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:07,184 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:07,184 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:18:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:18:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-07 06:18:07,368 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:07,368 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 06:18:07,368 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 06:18:07,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 06:18:07,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 06:18:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 06:18:07,372 INFO L87 Difference]: Start difference. First operand 501 states and 557 transitions. Second operand 6 states. [2019-10-07 06:18:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 06:18:07,446 INFO L93 Difference]: Finished difference Result 742 states and 825 transitions. [2019-10-07 06:18:07,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 06:18:07,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2019-10-07 06:18:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 06:18:07,451 INFO L225 Difference]: With dead ends: 742 [2019-10-07 06:18:07,451 INFO L226 Difference]: Without dead ends: 424 [2019-10-07 06:18:07,456 INFO L606 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-07 06:18:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-10-07 06:18:07,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 401. [2019-10-07 06:18:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-10-07 06:18:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 439 transitions. [2019-10-07 06:18:07,500 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 439 transitions. Word has length 215 [2019-10-07 06:18:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 06:18:07,501 INFO L462 AbstractCegarLoop]: Abstraction has 401 states and 439 transitions. [2019-10-07 06:18:07,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 06:18:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 439 transitions. [2019-10-07 06:18:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-07 06:18:07,506 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 06:18:07,507 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 06:18:07,507 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 06:18:07,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 06:18:07,507 INFO L82 PathProgramCache]: Analyzing trace with hash 808510366, now seen corresponding path program 1 times [2019-10-07 06:18:07,508 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 06:18:07,508 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:07,508 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:07,508 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 06:18:07,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 06:18:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:18:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-07 06:18:08,196 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 06:18:08,196 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 06:18:08,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 06:18:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 06:18:08,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-07 06:18:08,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 06:18:08,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-07 06:18:08,870 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 06:18:08,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:08,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,317 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2019-10-07 06:18:09,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 06:18:09,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,879 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2019-10-07 06:18:09,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 06:18:09,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:09,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:10,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:10,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:10,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:10,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:10,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:10,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:10,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 06:18:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-07 06:18:10,222 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 06:18:10,255 INFO L162 IcfgInterpreter]: Started Sifa with 186 locations of interest [2019-10-07 06:18:10,255 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 06:18:10,261 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 06:18:10,267 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 06:18:10,268 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 06:18:11,204 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 828 [2019-10-07 06:18:11,582 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 857 [2019-10-07 06:18:14,188 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 867 [2019-10-07 06:18:14,548 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 877 [2019-10-07 06:18:14,955 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 915 [2019-10-07 06:18:15,552 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 966 [2019-10-07 06:18:16,473 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 957 [2019-10-07 06:18:16,754 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 957 [2019-10-07 06:18:16,968 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 957 [2019-10-07 06:18:17,289 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-07 06:18:17,653 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-07 06:18:17,922 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-07 06:18:18,187 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-07 06:18:18,569 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-07 06:18:18,834 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-07 06:18:19,117 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-07 06:18:19,403 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-07 06:18:19,651 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-07 06:18:19,905 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-07 06:18:19,918 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 148 for LOIs [2019-10-07 06:18:20,233 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 832 [2019-10-07 06:18:20,236 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1011 for LOIs [2019-10-07 06:18:20,542 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:20,799 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:21,074 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:21,403 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:21,670 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:21,952 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:22,222 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:22,513 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:22,785 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:23,293 WARN L191 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 1027 DAG size of output: 1011 [2019-10-07 06:18:23,585 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:24,183 WARN L191 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:24,482 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:24,723 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:25,001 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:25,285 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:25,526 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:25,786 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:26,029 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:26,300 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:26,562 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:26,818 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:27,060 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:27,324 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:27,607 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:27,852 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:28,114 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:28,357 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:28,598 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:28,881 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:29,128 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:29,370 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:29,634 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:29,877 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:30,150 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:30,413 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:30,655 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:30,895 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:31,157 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:31,410 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:31,654 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:31,919 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:32,163 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:32,405 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:32,666 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:32,935 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:33,177 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:33,438 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:33,679 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:33,923 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:34,183 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:34,429 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:34,668 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:34,933 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:35,175 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:35,415 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:35,677 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:35,939 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:36,180 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:36,442 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:36,684 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:36,925 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:37,185 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:37,432 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:37,676 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:37,937 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:38,185 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:38,428 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:38,689 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:38,932 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:39,187 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:39,448 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:39,691 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:39,931 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:40,191 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:40,432 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:40,679 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:40,944 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:41,186 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:41,427 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:41,692 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:41,933 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:42,180 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:42,444 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:42,685 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:42,925 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:43,191 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:43,433 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:43,675 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:43,939 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:44,181 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:44,422 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:44,681 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:44,923 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:45,163 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:45,434 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:45,675 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:45,917 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:46,178 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:46,422 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:46,661 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:46,923 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:47,168 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:47,409 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:47,670 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:47,912 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:48,157 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:48,430 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:48,671 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:48,920 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:49,283 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:49,525 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:49,764 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:50,026 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:50,269 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:50,513 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:50,776 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:51,019 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:51,261 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:51,525 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:51,768 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:52,007 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:52,276 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:52,519 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:52,759 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:53,020 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:53,263 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:53,506 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:53,767 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:54,014 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:54,257 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:54,521 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:54,764 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:55,004 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:55,267 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:55,509 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:55,755 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:56,017 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:56,261 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:56,504 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1011 [2019-10-07 06:18:56,766 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1025 [2019-10-07 06:18:57,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 06:18:57,024 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) 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) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 06:18:57,036 INFO L168 Benchmark]: Toolchain (without parser) took 71822.81 ms. Allocated memory was 144.7 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 97.4 MB in the beginning and 468.4 MB in the end (delta: -371.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-10-07 06:18:57,036 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 06:18:57,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1748.47 ms. Allocated memory was 144.7 MB in the beginning and 205.0 MB in the end (delta: 60.3 MB). Free memory was 97.2 MB in the beginning and 120.9 MB in the end (delta: -23.7 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-10-07 06:18:57,037 INFO L168 Benchmark]: Boogie Preprocessor took 234.68 ms. Allocated memory is still 205.0 MB. Free memory was 120.9 MB in the beginning and 113.5 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. [2019-10-07 06:18:57,045 INFO L168 Benchmark]: RCFGBuilder took 2626.21 ms. Allocated memory was 205.0 MB in the beginning and 255.9 MB in the end (delta: 50.9 MB). Free memory was 113.5 MB in the beginning and 143.9 MB in the end (delta: -30.4 MB). Peak memory consumption was 74.6 MB. Max. memory is 7.1 GB. [2019-10-07 06:18:57,046 INFO L168 Benchmark]: TraceAbstraction took 67205.37 ms. Allocated memory was 255.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 143.9 MB in the beginning and 468.4 MB in the end (delta: -324.5 MB). Peak memory consumption was 963.7 MB. Max. memory is 7.1 GB. [2019-10-07 06:18:57,050 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.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1748.47 ms. Allocated memory was 144.7 MB in the beginning and 205.0 MB in the end (delta: 60.3 MB). Free memory was 97.2 MB in the beginning and 120.9 MB in the end (delta: -23.7 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 234.68 ms. Allocated memory is still 205.0 MB. Free memory was 120.9 MB in the beginning and 113.5 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2626.21 ms. Allocated memory was 205.0 MB in the beginning and 255.9 MB in the end (delta: 50.9 MB). Free memory was 113.5 MB in the beginning and 143.9 MB in the end (delta: -30.4 MB). Peak memory consumption was 74.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67205.37 ms. Allocated memory was 255.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 143.9 MB in the beginning and 468.4 MB in the end (delta: -324.5 MB). Peak memory consumption was 963.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...