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 -i ../../../trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--hisax--hisax_st5481.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 15:56:05,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 15:56:05,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 15:56:05,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 15:56:05,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 15:56:05,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 15:56:05,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 15:56:05,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 15:56:05,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 15:56:05,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 15:56:05,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 15:56:05,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 15:56:05,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 15:56:05,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 15:56:05,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 15:56:05,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 15:56:05,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 15:56:05,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 15:56:05,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 15:56:05,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 15:56:05,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 15:56:05,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 15:56:05,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 15:56:05,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 15:56:05,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 15:56:05,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 15:56:05,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 15:56:05,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 15:56:05,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 15:56:05,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 15:56:05,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 15:56:05,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 15:56:05,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 15:56:05,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 15:56:05,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 15:56:05,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 15:56:05,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 15:56:05,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 15:56:05,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 15:56:05,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 15:56:05,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 15:56:05,147 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-09-08 15:56:05,162 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 15:56:05,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 15:56:05,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 15:56:05,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 15:56:05,163 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 15:56:05,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 15:56:05,164 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 15:56:05,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 15:56:05,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 15:56:05,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 15:56:05,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 15:56:05,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 15:56:05,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 15:56:05,165 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 15:56:05,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 15:56:05,166 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 15:56:05,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 15:56:05,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 15:56:05,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 15:56:05,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 15:56:05,167 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 15:56:05,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 15:56:05,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 15:56:05,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 15:56:05,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 15:56:05,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 15:56:05,168 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 15:56:05,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 15:56:05,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 15:56:05,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 15:56:05,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 15:56:05,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 15:56:05,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 15:56:05,213 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 15:56:05,214 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--hisax--hisax_st5481.ko-entry_point.cil.out.i [2019-09-08 15:56:05,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731cbc5f3/79c5bba24a164788bc454950d6302238/FLAGf7abac0b2 [2019-09-08 15:56:06,249 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 15:56:06,251 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--hisax--hisax_st5481.ko-entry_point.cil.out.i [2019-09-08 15:56:06,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731cbc5f3/79c5bba24a164788bc454950d6302238/FLAGf7abac0b2 [2019-09-08 15:56:06,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731cbc5f3/79c5bba24a164788bc454950d6302238 [2019-09-08 15:56:06,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 15:56:06,704 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 15:56:06,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 15:56:06,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 15:56:06,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 15:56:06,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:56:06" (1/1) ... [2019-09-08 15:56:06,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322c079e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:56:06, skipping insertion in model container [2019-09-08 15:56:06,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:56:06" (1/1) ... [2019-09-08 15:56:06,722 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 15:56:06,871 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 15:56:09,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 15:56:09,353 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 15:56:09,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 15:56:09,993 INFO L192 MainTranslator]: Completed translation [2019-09-08 15:56:09,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:56:09 WrapperNode [2019-09-08 15:56:09,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 15:56:09,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 15:56:09,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 15:56:09,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 15:56:10,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:56:09" (1/1) ... [2019-09-08 15:56:10,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:56:09" (1/1) ... [2019-09-08 15:56:10,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:56:09" (1/1) ... [2019-09-08 15:56:10,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:56:09" (1/1) ... [2019-09-08 15:56:10,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:56:09" (1/1) ... [2019-09-08 15:56:10,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:56:09" (1/1) ... [2019-09-08 15:56:10,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:56:09" (1/1) ... [2019-09-08 15:56:10,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 15:56:10,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 15:56:10,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 15:56:10,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 15:56:10,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:56:09" (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-09-08 15:56:10,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 15:56:10,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 15:56:10,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 15:56:10,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~TO~VOID [2019-09-08 15:56:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-08 15:56:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-08 15:56:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-08 15:56:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-08 15:56:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-08 15:56:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-08 15:56:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-08 15:56:10,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-08 15:56:10,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-08 15:56:10,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-08 15:56:10,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-08 15:56:10,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-08 15:56:10,523 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_st5481 [2019-09-08 15:56:10,524 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_st5481 [2019-09-08 15:56:10,524 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_usb_init [2019-09-08 15:56:10,524 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_usb_exit [2019-09-08 15:56:10,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-09-08 15:56:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 15:56:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-08 15:56:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_2 [2019-09-08 15:56:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_3 [2019-09-08 15:56:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_5 [2019-09-08 15:56:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_6 [2019-09-08 15:56:10,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __cpu_to_le16p [2019-09-08 15:56:10,526 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-09-08 15:56:10,526 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-09-08 15:56:10,526 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2019-09-08 15:56:10,526 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-09-08 15:56:10,526 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-09-08 15:56:10,527 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2019-09-08 15:56:10,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-08 15:56:10,527 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2019-09-08 15:56:10,527 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2019-09-08 15:56:10,528 INFO L138 BoogieDeclarations]: Found implementation of procedure fifo_init [2019-09-08 15:56:10,528 INFO L138 BoogieDeclarations]: Found implementation of procedure fifo_add [2019-09-08 15:56:10,528 INFO L138 BoogieDeclarations]: Found implementation of procedure fifo_remove [2019-09-08 15:56:10,528 INFO L138 BoogieDeclarations]: Found implementation of procedure dump_packet [2019-09-08 15:56:10,528 INFO L138 BoogieDeclarations]: Found implementation of procedure dump_iso_packet [2019-09-08 15:56:10,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ST5481_CMD_string [2019-09-08 15:56:10,529 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_next_ctrl_msg [2019-09-08 15:56:10,529 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ctrl_msg [2019-09-08 15:56:10,529 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_usb_device_ctrl_msg [2019-09-08 15:56:10,529 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_usb_pipe_reset [2019-09-08 15:56:10,530 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_ph_command [2019-09-08 15:56:10,530 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ctrl_complete [2019-09-08 15:56:10,530 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_int_complete [2019-09-08 15:56:10,530 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_setup_usb [2019-09-08 15:56:10,530 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_release_usb [2019-09-08 15:56:10,531 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_start [2019-09-08 15:56:10,531 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_stop [2019-09-08 15:56:10,531 INFO L138 BoogieDeclarations]: Found implementation of procedure fill_isoc_urb [2019-09-08 15:56:10,531 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_setup_isocpipes [2019-09-08 15:56:10,532 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_release_isocpipes [2019-09-08 15:56:10,532 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_in_complete [2019-09-08 15:56:10,532 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_setup_in [2019-09-08 15:56:10,532 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_release_in [2019-09-08 15:56:10,532 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_isoc_flatten [2019-09-08 15:56:10,532 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_start_rcv [2019-09-08 15:56:10,533 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_in_mode [2019-09-08 15:56:10,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_10 [2019-09-08 15:56:10,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_11 [2019-09-08 15:56:10,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_12 [2019-09-08 15:56:10,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_13 [2019-09-08 15:56:10,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_14 [2019-09-08 15:56:10,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_15 [2019-09-08 15:56:10,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_16 [2019-09-08 15:56:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_17 [2019-09-08 15:56:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_18 [2019-09-08 15:56:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_19 [2019-09-08 15:56:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_20 [2019-09-08 15:56:10,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_21 [2019-09-08 15:56:10,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_22 [2019-09-08 15:56:10,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_23 [2019-09-08 15:56:10,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_24 [2019-09-08 15:56:10,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_25 [2019-09-08 15:56:10,537 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2019-09-08 15:56:10,537 INFO L138 BoogieDeclarations]: Found implementation of procedure get_buf_nr [2019-09-08 15:56:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure dump_packet___0 [2019-09-08 15:56:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure dump_iso_packet___0 [2019-09-08 15:56:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure D_L1L2 [2019-09-08 15:56:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure l1_go_f3 [2019-09-08 15:56:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure l1_go_f6 [2019-09-08 15:56:10,539 INFO L138 BoogieDeclarations]: Found implementation of procedure l1_go_f7 [2019-09-08 15:56:10,540 INFO L138 BoogieDeclarations]: Found implementation of procedure l1_go_f8 [2019-09-08 15:56:10,540 INFO L138 BoogieDeclarations]: Found implementation of procedure l1_timer3 [2019-09-08 15:56:10,541 INFO L138 BoogieDeclarations]: Found implementation of procedure l1_ignore [2019-09-08 15:56:10,542 INFO L138 BoogieDeclarations]: Found implementation of procedure l1_activate [2019-09-08 15:56:10,542 INFO L138 BoogieDeclarations]: Found implementation of procedure l1m_debug [2019-09-08 15:56:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_debug [2019-09-08 15:56:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_stop_event [2019-09-08 15:56:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_d_out [2019-09-08 15:56:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure fifo_reseted [2019-09-08 15:56:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_d_out_complete [2019-09-08 15:56:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_start_xmit [2019-09-08 15:56:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_short_fifo [2019-09-08 15:56:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_end_short_frame [2019-09-08 15:56:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_long_enable_fifo [2019-09-08 15:56:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_long_den [2019-09-08 15:56:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_reset [2019-09-08 15:56:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_stop [2019-09-08 15:56:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_underrun [2019-09-08 15:56:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_check_busy [2019-09-08 15:56:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_reseted [2019-09-08 15:56:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_complete [2019-09-08 15:56:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure dout_ignore [2019-09-08 15:56:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_d_l2l1 [2019-09-08 15:56:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ph_connect [2019-09-08 15:56:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ph_disconnect [2019-09-08 15:56:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_setup_d_out [2019-09-08 15:56:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_release_d_out [2019-09-08 15:56:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_setup_d [2019-09-08 15:56:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_release_d [2019-09-08 15:56:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_d_init [2019-09-08 15:56:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_d_exit [2019-09-08 15:56:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_27 [2019-09-08 15:56:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_28 [2019-09-08 15:56:10,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_29 [2019-09-08 15:56:10,548 INFO L138 BoogieDeclarations]: Found implementation of procedure bitrev8 [2019-09-08 15:56:10,548 INFO L138 BoogieDeclarations]: Found implementation of procedure dump_packet___1 [2019-09-08 15:56:10,548 INFO L138 BoogieDeclarations]: Found implementation of procedure dump_iso_packet___1 [2019-09-08 15:56:10,549 INFO L138 BoogieDeclarations]: Found implementation of procedure B_L1L2 [2019-09-08 15:56:10,549 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_b_out [2019-09-08 15:56:10,549 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481B_start_xfer [2019-09-08 15:56:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure led_blink [2019-09-08 15:56:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_b_out_complete [2019-09-08 15:56:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481B_mode [2019-09-08 15:56:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_setup_b_out [2019-09-08 15:56:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_release_b_out [2019-09-08 15:56:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_setup_b [2019-09-08 15:56:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_release_b [2019-09-08 15:56:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure st5481_b_l2l1 [2019-09-08 15:56:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_31 [2019-09-08 15:56:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2019-09-08 15:56:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-09-08 15:56:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-09-08 15:56:10,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-09-08 15:56:10,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-09-08 15:56:10,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-09-08 15:56:10,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-09-08 15:56:10,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-09-08 15:56:10,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-09-08 15:56:10,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-09-08 15:56:10,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-09-08 15:56:10,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-09-08 15:56:10,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-09-08 15:56:10,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-09-08 15:56:10,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-09-08 15:56:10,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-09-08 15:56:10,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 15:56:10,566 INFO L138 BoogieDeclarations]: Found implementation of procedure FsmChangeState [2019-09-08 15:56:10,567 INFO L138 BoogieDeclarations]: Found implementation of procedure FsmDelTimer [2019-09-08 15:56:10,567 INFO L138 BoogieDeclarations]: Found implementation of procedure FsmEvent [2019-09-08 15:56:10,567 INFO L138 BoogieDeclarations]: Found implementation of procedure FsmFree [2019-09-08 15:56:10,568 INFO L138 BoogieDeclarations]: Found implementation of procedure FsmInitTimer [2019-09-08 15:56:10,568 INFO L138 BoogieDeclarations]: Found implementation of procedure FsmNew [2019-09-08 15:56:10,568 INFO L138 BoogieDeclarations]: Found implementation of procedure FsmRestartTimer [2019-09-08 15:56:10,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-09-08 15:56:10,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __netdev_alloc_skb [2019-09-08 15:56:10,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-09-08 15:56:10,569 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-09-08 15:56:10,569 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-09-08 15:56:10,569 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2019-09-08 15:56:10,569 INFO L138 BoogieDeclarations]: Found implementation of procedure hisax_register [2019-09-08 15:56:10,569 INFO L138 BoogieDeclarations]: Found implementation of procedure hisax_unregister [2019-09-08 15:56:10,569 INFO L138 BoogieDeclarations]: Found implementation of procedure isdnhdlc_decode [2019-09-08 15:56:10,570 INFO L138 BoogieDeclarations]: Found implementation of procedure isdnhdlc_encode [2019-09-08 15:56:10,570 INFO L138 BoogieDeclarations]: Found implementation of procedure isdnhdlc_out_init [2019-09-08 15:56:10,570 INFO L138 BoogieDeclarations]: Found implementation of procedure isdnhdlc_rcv_init [2019-09-08 15:56:10,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_va_end [2019-09-08 15:56:10,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_va_start [2019-09-08 15:56:10,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 15:56:10,570 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-08 15:56:10,570 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2019-09-08 15:56:10,571 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-09-08 15:56:10,571 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_altnum_to_altsetting [2019-09-08 15:56:10,571 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-08 15:56:10,571 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_current_frame_number [2019-09-08 15:56:10,571 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ifnum_to_if [2019-09-08 15:56:10,571 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-08 15:56:10,571 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-08 15:56:10,571 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_reset_configuration [2019-09-08 15:56:10,572 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_reset_endpoint [2019-09-08 15:56:10,572 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2019-09-08 15:56:10,572 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2019-09-08 15:56:10,572 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-08 15:56:10,572 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-08 15:56:10,572 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-08 15:56:10,572 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-08 15:56:10,573 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-08 15:56:10,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 15:56:10,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 15:56:10,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-08 15:56:10,574 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-08 15:56:10,574 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-09-08 15:56:10,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_3 [2019-09-08 15:56:10,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_2 [2019-09-08 15:56:10,574 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-08 15:56:10,574 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-08 15:56:10,574 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_5 [2019-09-08 15:56:10,575 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-08 15:56:10,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_6 [2019-09-08 15:56:10,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-09-08 15:56:10,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-09-08 15:56:10,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-09-08 15:56:10,575 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-08 15:56:10,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-08 15:56:10,575 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-08 15:56:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-08 15:56:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-08 15:56:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 15:56:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 15:56:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 15:56:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-08 15:56:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 15:56:10,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 15:56:10,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 15:56:10,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-08 15:56:10,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-08 15:56:10,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-08 15:56:10,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-08 15:56:10,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-08 15:56:10,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-08 15:56:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-08 15:56:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-08 15:56:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-09-08 15:56:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure hisax_register [2019-09-08 15:56:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure hisax_unregister [2019-09-08 15:56:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_setup_b [2019-09-08 15:56:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_release_b [2019-09-08 15:56:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_d_l2l1 [2019-09-08 15:56:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_setup_d [2019-09-08 15:56:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_release_d [2019-09-08 15:56:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_b_l2l1 [2019-09-08 15:56:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_d_init [2019-09-08 15:56:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_d_exit [2019-09-08 15:56:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_setup_usb [2019-09-08 15:56:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_release_usb [2019-09-08 15:56:10,579 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_start [2019-09-08 15:56:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_stop [2019-09-08 15:56:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure probe_st5481 [2019-09-08 15:56:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 15:56:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 15:56:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 15:56:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 15:56:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_st5481 [2019-09-08 15:56:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_usb_init [2019-09-08 15:56:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_usb_exit [2019-09-08 15:56:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 15:56:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 15:56:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 15:56:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure __cpu_to_le16p [2019-09-08 15:56:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-09-08 15:56:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-09-08 15:56:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2019-09-08 15:56:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-09-08 15:56:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-09-08 15:56:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-09-08 15:56:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-09-08 15:56:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-09-08 15:56:10,582 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-09-08 15:56:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ifnum_to_if [2019-09-08 15:56:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure usb_altnum_to_altsetting [2019-09-08 15:56:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2019-09-08 15:56:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_14 [2019-09-08 15:56:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_12 [2019-09-08 15:56:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_13 [2019-09-08 15:56:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_20 [2019-09-08 15:56:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_15 [2019-09-08 15:56:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_16 [2019-09-08 15:56:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_17 [2019-09-08 15:56:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_18 [2019-09-08 15:56:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_21 [2019-09-08 15:56:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_22 [2019-09-08 15:56:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_10 [2019-09-08 15:56:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_11 [2019-09-08 15:56:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_19 [2019-09-08 15:56:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_23 [2019-09-08 15:56:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_24 [2019-09-08 15:56:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_25 [2019-09-08 15:56:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2019-09-08 15:56:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-08 15:56:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure usb_reset_configuration [2019-09-08 15:56:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2019-09-08 15:56:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure usb_reset_endpoint [2019-09-08 15:56:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-08 15:56:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-09-08 15:56:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-09-08 15:56:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-09-08 15:56:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-09-08 15:56:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure isdnhdlc_rcv_init [2019-09-08 15:56:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure isdnhdlc_decode [2019-09-08 15:56:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure FsmEvent [2019-09-08 15:56:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-09-08 15:56:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure __netdev_alloc_skb [2019-09-08 15:56:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2019-09-08 15:56:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2019-09-08 15:56:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure fifo_init [2019-09-08 15:56:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure fifo_add [2019-09-08 15:56:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure fifo_remove [2019-09-08 15:56:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_setup_in [2019-09-08 15:56:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_release_in [2019-09-08 15:56:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_in_mode [2019-09-08 15:56:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_ph_command [2019-09-08 15:56:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_setup_isocpipes [2019-09-08 15:56:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_release_isocpipes [2019-09-08 15:56:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_usb_pipe_reset [2019-09-08 15:56:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_usb_device_ctrl_msg [2019-09-08 15:56:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure dump_packet [2019-09-08 15:56:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure dump_iso_packet [2019-09-08 15:56:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 15:56:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure ST5481_CMD_string [2019-09-08 15:56:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_isoc_flatten [2019-09-08 15:56:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure usb_next_ctrl_msg [2019-09-08 15:56:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ctrl_msg [2019-09-08 15:56:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ctrl_complete [2019-09-08 15:56:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 15:56:10,599 INFO L130 BoogieDeclarations]: Found specification of procedure usb_int_complete [2019-09-08 15:56:10,599 INFO L130 BoogieDeclarations]: Found specification of procedure fill_isoc_urb [2019-09-08 15:56:10,599 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-08 15:56:10,599 INFO L130 BoogieDeclarations]: Found specification of procedure usb_in_complete [2019-09-08 15:56:10,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-08 15:56:10,599 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~TO~VOID [2019-09-08 15:56:10,599 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_start_rcv [2019-09-08 15:56:10,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_va_end [2019-09-08 15:56:10,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_va_start [2019-09-08 15:56:10,600 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2019-09-08 15:56:10,600 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2019-09-08 15:56:10,600 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_current_frame_number [2019-09-08 15:56:10,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_27 [2019-09-08 15:56:10,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_28 [2019-09-08 15:56:10,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_29 [2019-09-08 15:56:10,600 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2019-09-08 15:56:10,600 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2019-09-08 15:56:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure isdnhdlc_out_init [2019-09-08 15:56:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure isdnhdlc_encode [2019-09-08 15:56:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure FsmNew [2019-09-08 15:56:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure FsmFree [2019-09-08 15:56:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure FsmChangeState [2019-09-08 15:56:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure FsmInitTimer [2019-09-08 15:56:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure FsmRestartTimer [2019-09-08 15:56:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure FsmDelTimer [2019-09-08 15:56:10,601 INFO L130 BoogieDeclarations]: Found specification of procedure get_buf_nr [2019-09-08 15:56:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure dump_packet___0 [2019-09-08 15:56:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure dump_iso_packet___0 [2019-09-08 15:56:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure ph_connect [2019-09-08 15:56:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure ph_disconnect [2019-09-08 15:56:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure D_L1L2 [2019-09-08 15:56:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure l1_go_f3 [2019-09-08 15:56:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure l1_go_f6 [2019-09-08 15:56:10,602 INFO L130 BoogieDeclarations]: Found specification of procedure l1_go_f7 [2019-09-08 15:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure l1_go_f8 [2019-09-08 15:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure l1_timer3 [2019-09-08 15:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure l1_ignore [2019-09-08 15:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure l1_activate [2019-09-08 15:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure l1m_debug [2019-09-08 15:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure dout_debug [2019-09-08 15:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure dout_stop_event [2019-09-08 15:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure usb_d_out [2019-09-08 15:56:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure fifo_reseted [2019-09-08 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure usb_d_out_complete [2019-09-08 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure dout_start_xmit [2019-09-08 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure dout_short_fifo [2019-09-08 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure dout_end_short_frame [2019-09-08 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure dout_long_enable_fifo [2019-09-08 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure dout_long_den [2019-09-08 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure dout_reset [2019-09-08 15:56:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure dout_stop [2019-09-08 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure dout_underrun [2019-09-08 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure dout_check_busy [2019-09-08 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure dout_reseted [2019-09-08 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure dout_complete [2019-09-08 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure dout_ignore [2019-09-08 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_setup_d_out [2019-09-08 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_release_d_out [2019-09-08 15:56:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-08 15:56:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_31 [2019-09-08 15:56:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure bitrev8 [2019-09-08 15:56:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure dump_packet___1 [2019-09-08 15:56:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure dump_iso_packet___1 [2019-09-08 15:56:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure B_L1L2 [2019-09-08 15:56:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure usb_b_out [2019-09-08 15:56:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-08 15:56:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure st5481B_start_xfer [2019-09-08 15:56:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure led_blink [2019-09-08 15:56:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure usb_b_out_complete [2019-09-08 15:56:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure st5481B_mode [2019-09-08 15:56:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_setup_b_out [2019-09-08 15:56:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure st5481_release_b_out [2019-09-08 15:56:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2019-09-08 15:56:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-09-08 15:56:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-09-08 15:56:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-09-08 15:56:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-09-08 15:56:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-09-08 15:56:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-09-08 15:56:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-09-08 15:56:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-09-08 15:56:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-08 15:56:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 15:56:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 15:56:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 15:56:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 15:56:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 15:56:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-08 15:56:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-08 15:56:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-08 15:56:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-08 15:56:12,241 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-08 15:56:23,348 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2019-09-08 15:56:30,036 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 15:56:30,036 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 15:56:30,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:56:30 BoogieIcfgContainer [2019-09-08 15:56:30,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 15:56:30,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 15:56:30,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 15:56:30,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 15:56:30,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:56:06" (1/3) ... [2019-09-08 15:56:30,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15764675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:56:30, skipping insertion in model container [2019-09-08 15:56:30,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:56:09" (2/3) ... [2019-09-08 15:56:30,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15764675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:56:30, skipping insertion in model container [2019-09-08 15:56:30,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:56:30" (3/3) ... [2019-09-08 15:56:30,046 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--hisax--hisax_st5481.ko-entry_point.cil.out.i [2019-09-08 15:56:30,056 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 15:56:30,067 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 15:56:30,080 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 15:56:30,121 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 15:56:30,122 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 15:56:30,122 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 15:56:30,122 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 15:56:30,122 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 15:56:30,122 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 15:56:30,122 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 15:56:30,122 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 15:56:30,122 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 15:56:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states. [2019-09-08 15:56:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 15:56:30,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:30,182 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 15:56:30,184 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:30,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:30,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2131827545, now seen corresponding path program 1 times [2019-09-08 15:56:30,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:30,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:30,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 15:56:31,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:56:31,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:56:31,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:56:31,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:56:31,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:56:31,340 INFO L87 Difference]: Start difference. First operand 1556 states. Second operand 3 states. [2019-09-08 15:56:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:35,423 INFO L93 Difference]: Finished difference Result 4476 states and 6155 transitions. [2019-09-08 15:56:35,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:56:35,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-08 15:56:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:35,480 INFO L225 Difference]: With dead ends: 4476 [2019-09-08 15:56:35,480 INFO L226 Difference]: Without dead ends: 2934 [2019-09-08 15:56:35,498 INFO L628 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-09-08 15:56:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2019-09-08 15:56:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2934. [2019-09-08 15:56:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2019-09-08 15:56:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 3873 transitions. [2019-09-08 15:56:35,800 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 3873 transitions. Word has length 50 [2019-09-08 15:56:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:56:35,801 INFO L475 AbstractCegarLoop]: Abstraction has 2934 states and 3873 transitions. [2019-09-08 15:56:35,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:56:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 3873 transitions. [2019-09-08 15:56:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 15:56:35,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:35,811 INFO L399 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] [2019-09-08 15:56:35,812 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:35,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1643470365, now seen corresponding path program 1 times [2019-09-08 15:56:35,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:35,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:35,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:35,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:36,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-09-08 15:56:36,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:56:36,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:56:36,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:56:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:56:36,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:56:36,365 INFO L87 Difference]: Start difference. First operand 2934 states and 3873 transitions. Second operand 3 states. [2019-09-08 15:56:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:37,823 INFO L93 Difference]: Finished difference Result 2960 states and 3905 transitions. [2019-09-08 15:56:37,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:56:37,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-08 15:56:37,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:37,844 INFO L225 Difference]: With dead ends: 2960 [2019-09-08 15:56:37,845 INFO L226 Difference]: Without dead ends: 2947 [2019-09-08 15:56:37,848 INFO L628 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-09-08 15:56:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2019-09-08 15:56:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2934. [2019-09-08 15:56:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2019-09-08 15:56:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 3872 transitions. [2019-09-08 15:56:37,975 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 3872 transitions. Word has length 48 [2019-09-08 15:56:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:56:37,975 INFO L475 AbstractCegarLoop]: Abstraction has 2934 states and 3872 transitions. [2019-09-08 15:56:37,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:56:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 3872 transitions. [2019-09-08 15:56:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 15:56:37,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:37,977 INFO L399 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] [2019-09-08 15:56:37,978 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:37,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1700728667, now seen corresponding path program 1 times [2019-09-08 15:56:37,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:37,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:37,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:37,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 15:56:38,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:56:38,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:56:38,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:56:38,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:56:38,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:56:38,477 INFO L87 Difference]: Start difference. First operand 2934 states and 3872 transitions. Second operand 3 states. [2019-09-08 15:56:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:38,827 INFO L93 Difference]: Finished difference Result 8759 states and 12489 transitions. [2019-09-08 15:56:38,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:56:38,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-08 15:56:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:38,881 INFO L225 Difference]: With dead ends: 8759 [2019-09-08 15:56:38,881 INFO L226 Difference]: Without dead ends: 5846 [2019-09-08 15:56:38,905 INFO L628 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-09-08 15:56:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5846 states. [2019-09-08 15:56:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5846 to 5836. [2019-09-08 15:56:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5836 states. [2019-09-08 15:56:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5836 states to 5836 states and 8044 transitions. [2019-09-08 15:56:39,220 INFO L78 Accepts]: Start accepts. Automaton has 5836 states and 8044 transitions. Word has length 48 [2019-09-08 15:56:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:56:39,224 INFO L475 AbstractCegarLoop]: Abstraction has 5836 states and 8044 transitions. [2019-09-08 15:56:39,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:56:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5836 states and 8044 transitions. [2019-09-08 15:56:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 15:56:39,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:39,226 INFO L399 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] [2019-09-08 15:56:39,226 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:39,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:39,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1182229619, now seen corresponding path program 1 times [2019-09-08 15:56:39,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:39,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:39,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:39,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:39,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 15:56:39,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:56:39,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:56:39,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:56:39,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:56:39,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:56:39,774 INFO L87 Difference]: Start difference. First operand 5836 states and 8044 transitions. Second operand 3 states. [2019-09-08 15:56:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:39,969 INFO L93 Difference]: Finished difference Result 5838 states and 8045 transitions. [2019-09-08 15:56:39,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:56:39,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-08 15:56:39,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:40,018 INFO L225 Difference]: With dead ends: 5838 [2019-09-08 15:56:40,019 INFO L226 Difference]: Without dead ends: 5835 [2019-09-08 15:56:40,025 INFO L628 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-09-08 15:56:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2019-09-08 15:56:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5835. [2019-09-08 15:56:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5835 states. [2019-09-08 15:56:40,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5835 states to 5835 states and 8042 transitions. [2019-09-08 15:56:40,447 INFO L78 Accepts]: Start accepts. Automaton has 5835 states and 8042 transitions. Word has length 49 [2019-09-08 15:56:40,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:56:40,447 INFO L475 AbstractCegarLoop]: Abstraction has 5835 states and 8042 transitions. [2019-09-08 15:56:40,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:56:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 5835 states and 8042 transitions. [2019-09-08 15:56:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 15:56:40,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:40,450 INFO L399 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] [2019-09-08 15:56:40,450 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:40,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2006334114, now seen corresponding path program 1 times [2019-09-08 15:56:40,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:40,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:40,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:40,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 15:56:40,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:56:40,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:56:40,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:56:40,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:56:40,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:56:40,852 INFO L87 Difference]: Start difference. First operand 5835 states and 8042 transitions. Second operand 3 states. [2019-09-08 15:56:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:41,036 INFO L93 Difference]: Finished difference Result 5837 states and 8043 transitions. [2019-09-08 15:56:41,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:56:41,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-08 15:56:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:41,079 INFO L225 Difference]: With dead ends: 5837 [2019-09-08 15:56:41,079 INFO L226 Difference]: Without dead ends: 5834 [2019-09-08 15:56:41,085 INFO L628 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-09-08 15:56:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5834 states. [2019-09-08 15:56:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5834 to 5834. [2019-09-08 15:56:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2019-09-08 15:56:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 8040 transitions. [2019-09-08 15:56:41,383 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 8040 transitions. Word has length 50 [2019-09-08 15:56:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:56:41,384 INFO L475 AbstractCegarLoop]: Abstraction has 5834 states and 8040 transitions. [2019-09-08 15:56:41,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:56:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 8040 transitions. [2019-09-08 15:56:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 15:56:41,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:41,386 INFO L399 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] [2019-09-08 15:56:41,386 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:41,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2067557162, now seen corresponding path program 1 times [2019-09-08 15:56:41,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:41,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:41,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:41,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:41,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 15:56:41,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:56:41,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:56:41,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:56:41,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:56:41,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:56:41,731 INFO L87 Difference]: Start difference. First operand 5834 states and 8040 transitions. Second operand 3 states. [2019-09-08 15:56:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:41,903 INFO L93 Difference]: Finished difference Result 5836 states and 8041 transitions. [2019-09-08 15:56:41,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:56:41,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-08 15:56:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:41,953 INFO L225 Difference]: With dead ends: 5836 [2019-09-08 15:56:41,954 INFO L226 Difference]: Without dead ends: 5833 [2019-09-08 15:56:41,960 INFO L628 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-09-08 15:56:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5833 states. [2019-09-08 15:56:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5833 to 5833. [2019-09-08 15:56:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5833 states. [2019-09-08 15:56:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 8038 transitions. [2019-09-08 15:56:42,260 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 8038 transitions. Word has length 51 [2019-09-08 15:56:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:56:42,261 INFO L475 AbstractCegarLoop]: Abstraction has 5833 states and 8038 transitions. [2019-09-08 15:56:42,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:56:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 8038 transitions. [2019-09-08 15:56:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 15:56:42,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:42,262 INFO L399 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] [2019-09-08 15:56:42,263 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:42,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:42,263 INFO L82 PathProgramCache]: Analyzing trace with hash 329500513, now seen corresponding path program 1 times [2019-09-08 15:56:42,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:42,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:42,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:42,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:42,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 15:56:43,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:56:43,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:56:43,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:56:43,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:56:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:56:43,431 INFO L87 Difference]: Start difference. First operand 5833 states and 8038 transitions. Second operand 3 states. [2019-09-08 15:56:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:43,591 INFO L93 Difference]: Finished difference Result 5835 states and 8039 transitions. [2019-09-08 15:56:43,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:56:43,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-08 15:56:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:43,626 INFO L225 Difference]: With dead ends: 5835 [2019-09-08 15:56:43,626 INFO L226 Difference]: Without dead ends: 5805 [2019-09-08 15:56:43,632 INFO L628 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-09-08 15:56:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5805 states. [2019-09-08 15:56:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5805 to 5805. [2019-09-08 15:56:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5805 states. [2019-09-08 15:56:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5805 states to 5805 states and 8006 transitions. [2019-09-08 15:56:43,897 INFO L78 Accepts]: Start accepts. Automaton has 5805 states and 8006 transitions. Word has length 52 [2019-09-08 15:56:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:56:43,898 INFO L475 AbstractCegarLoop]: Abstraction has 5805 states and 8006 transitions. [2019-09-08 15:56:43,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:56:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5805 states and 8006 transitions. [2019-09-08 15:56:43,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 15:56:43,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:43,911 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:56:43,911 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:43,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash -805193030, now seen corresponding path program 1 times [2019-09-08 15:56:43,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:43,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:43,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:43,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:43,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 15:56:44,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:56:44,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:56:44,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:56:44,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:56:44,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:56:44,232 INFO L87 Difference]: Start difference. First operand 5805 states and 8006 transitions. Second operand 3 states. [2019-09-08 15:56:46,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:46,272 INFO L93 Difference]: Finished difference Result 11726 states and 16168 transitions. [2019-09-08 15:56:46,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:56:46,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 15:56:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:46,320 INFO L225 Difference]: With dead ends: 11726 [2019-09-08 15:56:46,320 INFO L226 Difference]: Without dead ends: 5942 [2019-09-08 15:56:46,349 INFO L628 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-09-08 15:56:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2019-09-08 15:56:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 5915. [2019-09-08 15:56:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5915 states. [2019-09-08 15:56:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 8150 transitions. [2019-09-08 15:56:46,666 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 8150 transitions. Word has length 160 [2019-09-08 15:56:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:56:46,667 INFO L475 AbstractCegarLoop]: Abstraction has 5915 states and 8150 transitions. [2019-09-08 15:56:46,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:56:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 8150 transitions. [2019-09-08 15:56:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 15:56:46,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:46,687 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:56:46,687 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:46,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:46,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2081650103, now seen corresponding path program 1 times [2019-09-08 15:56:46,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:46,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:46,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:46,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:46,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 15:56:47,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:56:47,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:56:47,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:56:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:56:47,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:56:47,253 INFO L87 Difference]: Start difference. First operand 5915 states and 8150 transitions. Second operand 3 states. [2019-09-08 15:56:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:47,597 INFO L93 Difference]: Finished difference Result 11825 states and 16310 transitions. [2019-09-08 15:56:47,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:56:47,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-08 15:56:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:47,633 INFO L225 Difference]: With dead ends: 11825 [2019-09-08 15:56:47,634 INFO L226 Difference]: Without dead ends: 5931 [2019-09-08 15:56:47,662 INFO L628 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-09-08 15:56:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2019-09-08 15:56:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 5923. [2019-09-08 15:56:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5923 states. [2019-09-08 15:56:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 8158 transitions. [2019-09-08 15:56:47,958 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 8158 transitions. Word has length 211 [2019-09-08 15:56:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:56:47,960 INFO L475 AbstractCegarLoop]: Abstraction has 5923 states and 8158 transitions. [2019-09-08 15:56:47,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:56:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 8158 transitions. [2019-09-08 15:56:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 15:56:47,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:47,985 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:56:47,986 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:47,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1214914309, now seen corresponding path program 1 times [2019-09-08 15:56:47,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:47,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:47,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:47,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:47,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 15:56:48,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:56:48,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 15:56:48,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 15:56:48,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 15:56:48,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 15:56:48,698 INFO L87 Difference]: Start difference. First operand 5923 states and 8158 transitions. Second operand 11 states. [2019-09-08 15:56:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:49,136 INFO L93 Difference]: Finished difference Result 11885 states and 16378 transitions. [2019-09-08 15:56:49,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 15:56:49,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 213 [2019-09-08 15:56:49,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:49,174 INFO L225 Difference]: With dead ends: 11885 [2019-09-08 15:56:49,175 INFO L226 Difference]: Without dead ends: 5983 [2019-09-08 15:56:49,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 15:56:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2019-09-08 15:56:49,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 5983. [2019-09-08 15:56:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5983 states. [2019-09-08 15:56:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 8230 transitions. [2019-09-08 15:56:49,714 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 8230 transitions. Word has length 213 [2019-09-08 15:56:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:56:49,715 INFO L475 AbstractCegarLoop]: Abstraction has 5983 states and 8230 transitions. [2019-09-08 15:56:49,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 15:56:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 8230 transitions. [2019-09-08 15:56:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 15:56:49,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:49,732 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:56:49,732 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:49,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:49,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1098890908, now seen corresponding path program 1 times [2019-09-08 15:56:49,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:49,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:49,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:49,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 15:56:50,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:56:50,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:56:50,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:56:50,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:56:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:56:50,490 INFO L87 Difference]: Start difference. First operand 5983 states and 8230 transitions. Second operand 5 states. [2019-09-08 15:56:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:54,750 INFO L93 Difference]: Finished difference Result 17931 states and 24678 transitions. [2019-09-08 15:56:54,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 15:56:54,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-09-08 15:56:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:54,818 INFO L225 Difference]: With dead ends: 17931 [2019-09-08 15:56:54,818 INFO L226 Difference]: Without dead ends: 11969 [2019-09-08 15:56:54,846 INFO L628 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-09-08 15:56:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11969 states. [2019-09-08 15:56:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11969 to 5999. [2019-09-08 15:56:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5999 states. [2019-09-08 15:56:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5999 states to 5999 states and 8250 transitions. [2019-09-08 15:56:55,280 INFO L78 Accepts]: Start accepts. Automaton has 5999 states and 8250 transitions. Word has length 213 [2019-09-08 15:56:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:56:55,281 INFO L475 AbstractCegarLoop]: Abstraction has 5999 states and 8250 transitions. [2019-09-08 15:56:55,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:56:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5999 states and 8250 transitions. [2019-09-08 15:56:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 15:56:55,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:56:55,300 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:56:55,300 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:56:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:56:55,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1942896410, now seen corresponding path program 1 times [2019-09-08 15:56:55,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:56:55,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:56:55,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:55,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:55,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:56:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 15:56:56,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 15:56:56,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 15:56:56,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:56:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:56:58,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 6657 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 15:56:58,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 15:56:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 15:56:59,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 15:56:59,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 15:56:59,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:56:59,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:56:59,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:56:59,067 INFO L87 Difference]: Start difference. First operand 5999 states and 8250 transitions. Second operand 5 states. [2019-09-08 15:56:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:56:59,449 INFO L93 Difference]: Finished difference Result 11993 states and 16518 transitions. [2019-09-08 15:56:59,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 15:56:59,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-09-08 15:56:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:56:59,496 INFO L225 Difference]: With dead ends: 11993 [2019-09-08 15:56:59,497 INFO L226 Difference]: Without dead ends: 6015 [2019-09-08 15:56:59,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:56:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2019-09-08 15:56:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 6015. [2019-09-08 15:56:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6015 states. [2019-09-08 15:57:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6015 states to 6015 states and 8266 transitions. [2019-09-08 15:57:00,029 INFO L78 Accepts]: Start accepts. Automaton has 6015 states and 8266 transitions. Word has length 213 [2019-09-08 15:57:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:57:00,030 INFO L475 AbstractCegarLoop]: Abstraction has 6015 states and 8266 transitions. [2019-09-08 15:57:00,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:57:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 6015 states and 8266 transitions. [2019-09-08 15:57:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 15:57:00,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:57:00,053 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 15:57:00,054 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:57:00,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:57:00,054 INFO L82 PathProgramCache]: Analyzing trace with hash -90309918, now seen corresponding path program 2 times [2019-09-08 15:57:00,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:57:00,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:57:00,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:57:00,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:57:00,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:57:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:57:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 15:57:01,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:57:01,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:57:01,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:57:01,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:57:01,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:57:01,007 INFO L87 Difference]: Start difference. First operand 6015 states and 8266 transitions. Second operand 3 states. [2019-09-08 15:57:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:57:01,455 INFO L93 Difference]: Finished difference Result 12021 states and 16550 transitions. [2019-09-08 15:57:01,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:57:01,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-09-08 15:57:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:57:01,487 INFO L225 Difference]: With dead ends: 12021 [2019-09-08 15:57:01,488 INFO L226 Difference]: Without dead ends: 6027 [2019-09-08 15:57:01,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:57:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2019-09-08 15:57:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 6027. [2019-09-08 15:57:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6027 states. [2019-09-08 15:57:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6027 states to 6027 states and 8278 transitions. [2019-09-08 15:57:02,026 INFO L78 Accepts]: Start accepts. Automaton has 6027 states and 8278 transitions. Word has length 215 [2019-09-08 15:57:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:57:02,027 INFO L475 AbstractCegarLoop]: Abstraction has 6027 states and 8278 transitions. [2019-09-08 15:57:02,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:57:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 6027 states and 8278 transitions. [2019-09-08 15:57:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 15:57:02,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:57:02,055 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:57:02,055 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:57:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:57:02,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1123401021, now seen corresponding path program 1 times [2019-09-08 15:57:02,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:57:02,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:57:02,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:57:02,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 15:57:02,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:57:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:57:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 15:57:03,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:57:03,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 15:57:03,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 15:57:03,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 15:57:03,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 15:57:03,210 INFO L87 Difference]: Start difference. First operand 6027 states and 8278 transitions. Second operand 8 states. [2019-09-08 15:57:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:57:08,481 INFO L93 Difference]: Finished difference Result 12053 states and 16584 transitions. [2019-09-08 15:57:08,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 15:57:08,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 225 [2019-09-08 15:57:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:57:08,513 INFO L225 Difference]: With dead ends: 12053 [2019-09-08 15:57:08,514 INFO L226 Difference]: Without dead ends: 6047 [2019-09-08 15:57:08,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 15:57:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2019-09-08 15:57:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 6027. [2019-09-08 15:57:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6027 states. [2019-09-08 15:57:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6027 states to 6027 states and 8276 transitions. [2019-09-08 15:57:08,910 INFO L78 Accepts]: Start accepts. Automaton has 6027 states and 8276 transitions. Word has length 225 [2019-09-08 15:57:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:57:08,911 INFO L475 AbstractCegarLoop]: Abstraction has 6027 states and 8276 transitions. [2019-09-08 15:57:08,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 15:57:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 6027 states and 8276 transitions. [2019-09-08 15:57:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 15:57:08,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:57:08,940 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 15:57:08,940 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:57:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:57:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1358301758, now seen corresponding path program 1 times [2019-09-08 15:57:08,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:57:08,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:57:08,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:57:08,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:57:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:57:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:57:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 15:57:09,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 15:57:09,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 15:57:09,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 15:57:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 15:57:24,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 15:57:24,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-08 15:57:24,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 15:57:24,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 15:57:24,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 15:57:24,481 INFO L87 Difference]: Start difference. First operand 6027 states and 8276 transitions. Second operand 11 states. [2019-09-08 15:58:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:58:11,684 INFO L93 Difference]: Finished difference Result 16203 states and 22535 transitions. [2019-09-08 15:58:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 15:58:11,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 282 [2019-09-08 15:58:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:58:11,739 INFO L225 Difference]: With dead ends: 16203 [2019-09-08 15:58:11,740 INFO L226 Difference]: Without dead ends: 10197 [2019-09-08 15:58:11,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2019-09-08 15:58:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10197 states. [2019-09-08 15:58:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10197 to 10009. [2019-09-08 15:58:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10009 states. [2019-09-08 15:58:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10009 states to 10009 states and 13982 transitions. [2019-09-08 15:58:12,650 INFO L78 Accepts]: Start accepts. Automaton has 10009 states and 13982 transitions. Word has length 282 [2019-09-08 15:58:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:58:12,651 INFO L475 AbstractCegarLoop]: Abstraction has 10009 states and 13982 transitions. [2019-09-08 15:58:12,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 15:58:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 10009 states and 13982 transitions. [2019-09-08 15:58:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 15:58:12,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:58:12,685 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 15:58:12,685 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:58:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:58:12,686 INFO L82 PathProgramCache]: Analyzing trace with hash -185003542, now seen corresponding path program 2 times [2019-09-08 15:58:12,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:58:12,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:58:12,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:58:12,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:58:12,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:58:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:58:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 15:58:14,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 15:58:14,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 15:58:14,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 15:58:40,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 15:58:40,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-08 15:58:41,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 15:58:41,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-08 15:58:41,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 15:58:41,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 15:58:41,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 15:58:41,067 INFO L87 Difference]: Start difference. First operand 10009 states and 13982 transitions. Second operand 9 states. [2019-09-08 15:59:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:59:11,905 INFO L93 Difference]: Finished difference Result 20313 states and 28521 transitions. [2019-09-08 15:59:11,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 15:59:11,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 282 [2019-09-08 15:59:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:59:11,962 INFO L225 Difference]: With dead ends: 20313 [2019-09-08 15:59:11,962 INFO L226 Difference]: Without dead ends: 10325 [2019-09-08 15:59:11,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-09-08 15:59:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10325 states. [2019-09-08 15:59:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10325 to 10019. [2019-09-08 15:59:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-09-08 15:59:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 13990 transitions. [2019-09-08 15:59:12,555 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 13990 transitions. Word has length 282 [2019-09-08 15:59:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:59:12,557 INFO L475 AbstractCegarLoop]: Abstraction has 10019 states and 13990 transitions. [2019-09-08 15:59:12,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 15:59:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 13990 transitions. [2019-09-08 15:59:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-08 15:59:12,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:59:12,608 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 15:59:12,609 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:59:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:59:12,609 INFO L82 PathProgramCache]: Analyzing trace with hash 98104890, now seen corresponding path program 1 times [2019-09-08 15:59:12,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:59:12,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:59:12,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:59:12,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 15:59:12,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:59:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:59:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 15:59:12,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:59:12,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:59:12,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:59:12,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:59:12,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:59:12,991 INFO L87 Difference]: Start difference. First operand 10019 states and 13990 transitions. Second operand 3 states. [2019-09-08 15:59:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:59:13,778 INFO L93 Difference]: Finished difference Result 20203 states and 28564 transitions. [2019-09-08 15:59:13,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:59:13,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2019-09-08 15:59:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:59:13,834 INFO L225 Difference]: With dead ends: 20203 [2019-09-08 15:59:13,834 INFO L226 Difference]: Without dead ends: 10205 [2019-09-08 15:59:13,861 INFO L628 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-09-08 15:59:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10205 states. [2019-09-08 15:59:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10205 to 10035. [2019-09-08 15:59:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10035 states. [2019-09-08 15:59:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10035 states to 10035 states and 14006 transitions. [2019-09-08 15:59:14,468 INFO L78 Accepts]: Start accepts. Automaton has 10035 states and 14006 transitions. Word has length 285 [2019-09-08 15:59:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:59:14,469 INFO L475 AbstractCegarLoop]: Abstraction has 10035 states and 14006 transitions. [2019-09-08 15:59:14,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:59:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 10035 states and 14006 transitions. [2019-09-08 15:59:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-08 15:59:14,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:59:14,505 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 15:59:14,506 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:59:14,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:59:14,506 INFO L82 PathProgramCache]: Analyzing trace with hash 697260167, now seen corresponding path program 1 times [2019-09-08 15:59:14,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:59:14,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:59:14,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:59:14,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:59:14,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:59:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:59:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 15:59:15,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:59:15,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 15:59:15,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 15:59:15,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 15:59:15,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 15:59:15,808 INFO L87 Difference]: Start difference. First operand 10035 states and 14006 transitions. Second operand 10 states. [2019-09-08 15:59:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:59:59,574 INFO L93 Difference]: Finished difference Result 23474 states and 33158 transitions. [2019-09-08 15:59:59,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 15:59:59,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 283 [2019-09-08 15:59:59,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:59:59,641 INFO L225 Difference]: With dead ends: 23474 [2019-09-08 15:59:59,641 INFO L226 Difference]: Without dead ends: 13421 [2019-09-08 15:59:59,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-09-08 15:59:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13421 states. [2019-09-08 16:00:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13421 to 13193. [2019-09-08 16:00:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13193 states. [2019-09-08 16:00:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13193 states to 13193 states and 18313 transitions. [2019-09-08 16:00:00,502 INFO L78 Accepts]: Start accepts. Automaton has 13193 states and 18313 transitions. Word has length 283 [2019-09-08 16:00:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:00:00,503 INFO L475 AbstractCegarLoop]: Abstraction has 13193 states and 18313 transitions. [2019-09-08 16:00:00,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 16:00:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 13193 states and 18313 transitions. [2019-09-08 16:00:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 16:00:00,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:00:00,526 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:00:00,527 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:00:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:00:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash -666493587, now seen corresponding path program 1 times [2019-09-08 16:00:00,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:00:00,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:00:00,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:00:00,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:00:00,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:00:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:00:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 16:00:01,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:00:01,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:00:01,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:00:01,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:00:01,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:00:01,163 INFO L87 Difference]: Start difference. First operand 13193 states and 18313 transitions. Second operand 5 states. [2019-09-08 16:00:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:00:01,977 INFO L93 Difference]: Finished difference Result 25855 states and 35838 transitions. [2019-09-08 16:00:01,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:00:01,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 289 [2019-09-08 16:00:01,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:00:02,049 INFO L225 Difference]: With dead ends: 25855 [2019-09-08 16:00:02,050 INFO L226 Difference]: Without dead ends: 12683 [2019-09-08 16:00:02,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:00:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12683 states. [2019-09-08 16:00:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12683 to 12595. [2019-09-08 16:00:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12595 states. [2019-09-08 16:00:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12595 states to 12595 states and 17293 transitions. [2019-09-08 16:00:03,181 INFO L78 Accepts]: Start accepts. Automaton has 12595 states and 17293 transitions. Word has length 289 [2019-09-08 16:00:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:00:03,182 INFO L475 AbstractCegarLoop]: Abstraction has 12595 states and 17293 transitions. [2019-09-08 16:00:03,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:00:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 12595 states and 17293 transitions. [2019-09-08 16:00:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 16:00:03,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:00:03,197 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:00:03,197 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:00:03,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:00:03,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1718031607, now seen corresponding path program 1 times [2019-09-08 16:00:03,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:00:03,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:00:03,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:00:03,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:00:03,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:00:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:00:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 16:00:03,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:00:03,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:00:03,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:00:03,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:00:03,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:00:03,716 INFO L87 Difference]: Start difference. First operand 12595 states and 17293 transitions. Second operand 5 states. [2019-09-08 16:00:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:00:04,318 INFO L93 Difference]: Finished difference Result 25169 states and 34576 transitions. [2019-09-08 16:00:04,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:00:04,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 303 [2019-09-08 16:00:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:00:04,382 INFO L225 Difference]: With dead ends: 25169 [2019-09-08 16:00:04,382 INFO L226 Difference]: Without dead ends: 12595 [2019-09-08 16:00:04,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:00:04,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12595 states. [2019-09-08 16:00:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12595 to 12595. [2019-09-08 16:00:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12595 states. [2019-09-08 16:00:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12595 states to 12595 states and 17287 transitions. [2019-09-08 16:00:05,102 INFO L78 Accepts]: Start accepts. Automaton has 12595 states and 17287 transitions. Word has length 303 [2019-09-08 16:00:05,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:00:05,103 INFO L475 AbstractCegarLoop]: Abstraction has 12595 states and 17287 transitions. [2019-09-08 16:00:05,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:00:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 12595 states and 17287 transitions. [2019-09-08 16:00:05,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 16:00:05,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:00:05,117 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:00:05,117 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:00:05,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:00:05,118 INFO L82 PathProgramCache]: Analyzing trace with hash -767965666, now seen corresponding path program 1 times [2019-09-08 16:00:05,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:00:05,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:00:05,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:00:05,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:00:05,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:00:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:00:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 16:00:09,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:00:09,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:00:09,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:00:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 16:00:24,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:00:24,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-09-08 16:00:24,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 16:00:24,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 16:00:24,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 16:00:24,125 INFO L87 Difference]: Start difference. First operand 12595 states and 17287 transitions. Second operand 15 states. [2019-09-08 16:01:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:01:17,629 INFO L93 Difference]: Finished difference Result 25321 states and 34843 transitions. [2019-09-08 16:01:17,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 16:01:17,630 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 310 [2019-09-08 16:01:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:01:17,684 INFO L225 Difference]: With dead ends: 25321 [2019-09-08 16:01:17,684 INFO L226 Difference]: Without dead ends: 12743 [2019-09-08 16:01:17,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2019-09-08 16:01:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12743 states. [2019-09-08 16:01:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12743 to 12577. [2019-09-08 16:01:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12577 states. [2019-09-08 16:01:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12577 states to 12577 states and 17269 transitions. [2019-09-08 16:01:18,512 INFO L78 Accepts]: Start accepts. Automaton has 12577 states and 17269 transitions. Word has length 310 [2019-09-08 16:01:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:01:18,513 INFO L475 AbstractCegarLoop]: Abstraction has 12577 states and 17269 transitions. [2019-09-08 16:01:18,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 16:01:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 12577 states and 17269 transitions. [2019-09-08 16:01:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 16:01:18,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:01:18,525 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:01:18,525 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:01:18,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:01:18,526 INFO L82 PathProgramCache]: Analyzing trace with hash 407514939, now seen corresponding path program 1 times [2019-09-08 16:01:18,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:01:18,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:01:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:01:18,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:01:18,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:01:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:01:21,309 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-09-08 16:01:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 16:01:21,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:01:21,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:01:21,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:01:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 16:01:36,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:01:36,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-08 16:01:36,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 16:01:36,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 16:01:36,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 16:01:36,064 INFO L87 Difference]: Start difference. First operand 12577 states and 17269 transitions. Second operand 14 states. [2019-09-08 16:02:13,501 WARN L188 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-08 16:02:14,167 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-08 16:02:35,572 WARN L188 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 48 [2019-09-08 16:02:36,100 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-09-08 16:02:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:02:40,846 INFO L93 Difference]: Finished difference Result 25249 states and 34753 transitions. [2019-09-08 16:02:40,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 16:02:40,850 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 311 [2019-09-08 16:02:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:02:40,902 INFO L225 Difference]: With dead ends: 25249 [2019-09-08 16:02:40,903 INFO L226 Difference]: Without dead ends: 12689 [2019-09-08 16:02:40,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-09-08 16:02:40,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12689 states. [2019-09-08 16:02:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12689 to 12519. [2019-09-08 16:02:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12519 states. [2019-09-08 16:02:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12519 states to 12519 states and 17185 transitions. [2019-09-08 16:02:41,743 INFO L78 Accepts]: Start accepts. Automaton has 12519 states and 17185 transitions. Word has length 311 [2019-09-08 16:02:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:02:41,744 INFO L475 AbstractCegarLoop]: Abstraction has 12519 states and 17185 transitions. [2019-09-08 16:02:41,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 16:02:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 12519 states and 17185 transitions. [2019-09-08 16:02:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 16:02:41,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:02:41,763 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:02:41,763 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:02:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:02:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1549129051, now seen corresponding path program 1 times [2019-09-08 16:02:41,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:02:41,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:02:41,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:02:41,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:02:41,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:02:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:02:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-08 16:02:42,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:02:42,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 16:02:42,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 16:02:42,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 16:02:42,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:02:42,374 INFO L87 Difference]: Start difference. First operand 12519 states and 17185 transitions. Second operand 9 states. [2019-09-08 16:02:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:02:43,025 INFO L93 Difference]: Finished difference Result 25081 states and 34494 transitions. [2019-09-08 16:02:43,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:02:43,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 376 [2019-09-08 16:02:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:02:43,081 INFO L225 Difference]: With dead ends: 25081 [2019-09-08 16:02:43,081 INFO L226 Difference]: Without dead ends: 12583 [2019-09-08 16:02:43,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:02:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12583 states. [2019-09-08 16:02:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12583 to 12547. [2019-09-08 16:02:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12547 states. [2019-09-08 16:02:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12547 states to 12547 states and 17217 transitions. [2019-09-08 16:02:43,816 INFO L78 Accepts]: Start accepts. Automaton has 12547 states and 17217 transitions. Word has length 376 [2019-09-08 16:02:43,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:02:43,817 INFO L475 AbstractCegarLoop]: Abstraction has 12547 states and 17217 transitions. [2019-09-08 16:02:43,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 16:02:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 12547 states and 17217 transitions. [2019-09-08 16:02:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 16:02:43,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:02:43,835 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:02:43,835 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:02:43,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:02:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash 887539578, now seen corresponding path program 1 times [2019-09-08 16:02:43,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:02:43,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:02:43,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:02:43,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:02:43,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:02:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:02:52,539 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-08 16:02:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 16:02:52,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:02:52,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:02:52,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 16:03:07,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:03:07,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-09-08 16:03:07,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 16:03:07,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 16:03:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=915, Unknown=0, NotChecked=0, Total=992 [2019-09-08 16:03:07,528 INFO L87 Difference]: Start difference. First operand 12547 states and 17217 transitions. Second operand 32 states. [2019-09-08 16:04:28,918 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2019-09-08 16:04:29,381 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-08 16:04:50,259 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-09-08 16:04:56,037 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-08 16:05:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:18,075 INFO L93 Difference]: Finished difference Result 33914 states and 47449 transitions. [2019-09-08 16:05:18,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 16:05:18,075 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 376 [2019-09-08 16:05:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:18,162 INFO L225 Difference]: With dead ends: 33914 [2019-09-08 16:05:18,162 INFO L226 Difference]: Without dead ends: 21353 [2019-09-08 16:05:18,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1921 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=607, Invalid=7225, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 16:05:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21353 states. [2019-09-08 16:05:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21353 to 18873. [2019-09-08 16:05:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18873 states. [2019-09-08 16:05:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18873 states to 18873 states and 25901 transitions. [2019-09-08 16:05:19,161 INFO L78 Accepts]: Start accepts. Automaton has 18873 states and 25901 transitions. Word has length 376 [2019-09-08 16:05:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:19,162 INFO L475 AbstractCegarLoop]: Abstraction has 18873 states and 25901 transitions. [2019-09-08 16:05:19,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 16:05:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 18873 states and 25901 transitions. [2019-09-08 16:05:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-08 16:05:19,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:19,177 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:05:19,178 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:19,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash -140249769, now seen corresponding path program 1 times [2019-09-08 16:05:19,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:19,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:19,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:19,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:27,058 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-08 16:05:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 16:05:27,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:05:27,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:05:27,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 16:05:42,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:05:42,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-09-08 16:05:42,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 16:05:42,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 16:05:42,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2019-09-08 16:05:42,165 INFO L87 Difference]: Start difference. First operand 18873 states and 25901 transitions. Second operand 32 states. [2019-09-08 16:07:22,885 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-08 16:07:50,736 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-08 16:08:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:11,535 INFO L93 Difference]: Finished difference Result 46892 states and 65307 transitions. [2019-09-08 16:08:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 16:08:11,536 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 377 [2019-09-08 16:08:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:11,620 INFO L225 Difference]: With dead ends: 46892 [2019-09-08 16:08:11,620 INFO L226 Difference]: Without dead ends: 28005 [2019-09-08 16:08:11,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=636, Invalid=7196, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 16:08:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28005 states. [2019-09-08 16:08:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28005 to 24723. [2019-09-08 16:08:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24723 states. [2019-09-08 16:08:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24723 states to 24723 states and 33791 transitions. [2019-09-08 16:08:12,753 INFO L78 Accepts]: Start accepts. Automaton has 24723 states and 33791 transitions. Word has length 377 [2019-09-08 16:08:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:12,754 INFO L475 AbstractCegarLoop]: Abstraction has 24723 states and 33791 transitions. [2019-09-08 16:08:12,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 16:08:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 24723 states and 33791 transitions. [2019-09-08 16:08:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-09-08 16:08:12,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:12,769 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:08:12,769 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:12,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:12,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1636508985, now seen corresponding path program 1 times [2019-09-08 16:08:12,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:12,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:12,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:12,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:12,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 16:08:13,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:08:13,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:08:13,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:08:13,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:08:13,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:13,236 INFO L87 Difference]: Start difference. First operand 24723 states and 33791 transitions. Second operand 5 states. [2019-09-08 16:08:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:14,448 INFO L93 Difference]: Finished difference Result 49515 states and 67812 transitions. [2019-09-08 16:08:14,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:08:14,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 406 [2019-09-08 16:08:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:14,522 INFO L225 Difference]: With dead ends: 49515 [2019-09-08 16:08:14,522 INFO L226 Difference]: Without dead ends: 24813 [2019-09-08 16:08:14,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:14,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24813 states. [2019-09-08 16:08:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24813 to 24779. [2019-09-08 16:08:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24779 states. [2019-09-08 16:08:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24779 states to 24779 states and 33875 transitions. [2019-09-08 16:08:15,521 INFO L78 Accepts]: Start accepts. Automaton has 24779 states and 33875 transitions. Word has length 406 [2019-09-08 16:08:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:15,522 INFO L475 AbstractCegarLoop]: Abstraction has 24779 states and 33875 transitions. [2019-09-08 16:08:15,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:08:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 24779 states and 33875 transitions. [2019-09-08 16:08:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-08 16:08:15,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:15,544 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:08:15,545 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:15,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash 56770875, now seen corresponding path program 1 times [2019-09-08 16:08:15,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:15,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:15,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:15,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:15,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 16:08:16,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:08:16,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:08:16,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:08:16,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:08:16,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:08:16,016 INFO L87 Difference]: Start difference. First operand 24779 states and 33875 transitions. Second operand 3 states. [2019-09-08 16:08:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:16,988 INFO L93 Difference]: Finished difference Result 49609 states and 70876 transitions. [2019-09-08 16:08:16,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:08:16,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 413 [2019-09-08 16:08:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:17,126 INFO L225 Difference]: With dead ends: 49609 [2019-09-08 16:08:17,126 INFO L226 Difference]: Without dead ends: 24851 [2019-09-08 16:08:17,215 INFO L628 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-09-08 16:08:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24851 states. [2019-09-08 16:08:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24851 to 24595. [2019-09-08 16:08:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24595 states. [2019-09-08 16:08:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24595 states to 24595 states and 33383 transitions. [2019-09-08 16:08:18,541 INFO L78 Accepts]: Start accepts. Automaton has 24595 states and 33383 transitions. Word has length 413 [2019-09-08 16:08:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:18,542 INFO L475 AbstractCegarLoop]: Abstraction has 24595 states and 33383 transitions. [2019-09-08 16:08:18,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:08:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 24595 states and 33383 transitions. [2019-09-08 16:08:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-09-08 16:08:18,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:18,563 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:08:18,563 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:18,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:18,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1824778413, now seen corresponding path program 1 times [2019-09-08 16:08:18,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:18,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:18,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:18,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:18,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 16:08:19,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:19,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:08:19,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:22,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 7757 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:08:22,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:08:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 16:08:22,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:08:22,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 16:08:22,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:08:22,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:08:22,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:22,239 INFO L87 Difference]: Start difference. First operand 24595 states and 33383 transitions. Second operand 5 states. [2019-09-08 16:08:23,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:23,500 INFO L93 Difference]: Finished difference Result 49477 states and 67924 transitions. [2019-09-08 16:08:23,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 16:08:23,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 419 [2019-09-08 16:08:23,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:23,581 INFO L225 Difference]: With dead ends: 49477 [2019-09-08 16:08:23,581 INFO L226 Difference]: Without dead ends: 24903 [2019-09-08 16:08:23,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:23,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24903 states. [2019-09-08 16:08:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24903 to 24887. [2019-09-08 16:08:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24887 states. [2019-09-08 16:08:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24887 states to 24887 states and 33835 transitions. [2019-09-08 16:08:24,645 INFO L78 Accepts]: Start accepts. Automaton has 24887 states and 33835 transitions. Word has length 419 [2019-09-08 16:08:24,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:24,646 INFO L475 AbstractCegarLoop]: Abstraction has 24887 states and 33835 transitions. [2019-09-08 16:08:24,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:08:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 24887 states and 33835 transitions. [2019-09-08 16:08:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-09-08 16:08:24,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:24,677 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:08:24,677 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash 348229347, now seen corresponding path program 2 times [2019-09-08 16:08:24,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:24,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:24,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 16:08:25,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:08:25,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:08:25,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:08:25,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:08:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:08:25,547 INFO L87 Difference]: Start difference. First operand 24887 states and 33835 transitions. Second operand 3 states. [2019-09-08 16:08:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:26,690 INFO L93 Difference]: Finished difference Result 49777 states and 67938 transitions. [2019-09-08 16:08:26,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:08:26,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 424 [2019-09-08 16:08:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:26,765 INFO L225 Difference]: With dead ends: 49777 [2019-09-08 16:08:26,765 INFO L226 Difference]: Without dead ends: 24911 [2019-09-08 16:08:26,810 INFO L628 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-09-08 16:08:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24911 states. [2019-09-08 16:08:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24911 to 24895. [2019-09-08 16:08:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24895 states. [2019-09-08 16:08:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24895 states to 24895 states and 33843 transitions. [2019-09-08 16:08:27,796 INFO L78 Accepts]: Start accepts. Automaton has 24895 states and 33843 transitions. Word has length 424 [2019-09-08 16:08:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:27,797 INFO L475 AbstractCegarLoop]: Abstraction has 24895 states and 33843 transitions. [2019-09-08 16:08:27,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:08:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 24895 states and 33843 transitions. [2019-09-08 16:08:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-09-08 16:08:27,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:27,819 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:08:27,819 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1427531582, now seen corresponding path program 1 times [2019-09-08 16:08:27,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:27,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:27,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:27,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:08:27,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-09-08 16:08:28,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:08:28,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:08:28,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:08:28,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:08:28,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:28,472 INFO L87 Difference]: Start difference. First operand 24895 states and 33843 transitions. Second operand 5 states. [2019-09-08 16:08:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:29,727 INFO L93 Difference]: Finished difference Result 49783 states and 67900 transitions. [2019-09-08 16:08:29,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:08:29,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 435 [2019-09-08 16:08:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:29,803 INFO L225 Difference]: With dead ends: 49783 [2019-09-08 16:08:29,803 INFO L226 Difference]: Without dead ends: 24909 [2019-09-08 16:08:29,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24909 states. [2019-09-08 16:08:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24909 to 24903. [2019-09-08 16:08:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24903 states. [2019-09-08 16:08:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24903 states to 24903 states and 33845 transitions. [2019-09-08 16:08:30,834 INFO L78 Accepts]: Start accepts. Automaton has 24903 states and 33845 transitions. Word has length 435 [2019-09-08 16:08:30,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:30,834 INFO L475 AbstractCegarLoop]: Abstraction has 24903 states and 33845 transitions. [2019-09-08 16:08:30,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:08:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 24903 states and 33845 transitions. [2019-09-08 16:08:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-09-08 16:08:30,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:30,857 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:08:30,857 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:30,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:30,858 INFO L82 PathProgramCache]: Analyzing trace with hash 660313332, now seen corresponding path program 1 times [2019-09-08 16:08:30,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:30,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:30,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:30,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:30,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 16:08:32,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:32,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:08:32,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:08:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 16:08:47,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:08:47,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-09-08 16:08:47,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 16:08:47,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 16:08:47,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-09-08 16:08:47,345 INFO L87 Difference]: Start difference. First operand 24903 states and 33845 transitions. Second operand 16 states.