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--net--can--usb--usb_8dev.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 16:02:54,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 16:02:54,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 16:02:54,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 16:02:54,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 16:02:54,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 16:02:54,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 16:02:54,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 16:02:54,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 16:02:54,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 16:02:54,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 16:02:54,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 16:02:54,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 16:02:54,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 16:02:54,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 16:02:54,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 16:02:54,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 16:02:54,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 16:02:54,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 16:02:54,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 16:02:54,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 16:02:54,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 16:02:54,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 16:02:54,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 16:02:54,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 16:02:54,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 16:02:54,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 16:02:54,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 16:02:54,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 16:02:54,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 16:02:54,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 16:02:54,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 16:02:54,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 16:02:54,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 16:02:54,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 16:02:54,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 16:02:54,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 16:02:54,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 16:02:54,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 16:02:54,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 16:02:54,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 16:02:54,913 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 16:02:54,941 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 16:02:54,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 16:02:54,944 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 16:02:54,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 16:02:54,944 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 16:02:54,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 16:02:54,945 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 16:02:54,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 16:02:54,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 16:02:54,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 16:02:54,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 16:02:54,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 16:02:54,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 16:02:54,948 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 16:02:54,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 16:02:54,948 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 16:02:54,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 16:02:54,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 16:02:54,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 16:02:54,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 16:02:54,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 16:02:54,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 16:02:54,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 16:02:54,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 16:02:54,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 16:02:54,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 16:02:54,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 16:02:54,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 16:02:54,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 16:02:54,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 16:02:55,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 16:02:55,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 16:02:55,009 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 16:02:55,009 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 16:02:55,010 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--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2019-09-08 16:02:55,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b225fd5/d04c61c9f8d4470d838162dd702d788a/FLAG1d3f87f60 [2019-09-08 16:02:55,952 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 16:02:55,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2019-09-08 16:02:55,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b225fd5/d04c61c9f8d4470d838162dd702d788a/FLAG1d3f87f60 [2019-09-08 16:02:56,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b225fd5/d04c61c9f8d4470d838162dd702d788a [2019-09-08 16:02:56,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 16:02:56,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 16:02:56,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 16:02:56,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 16:02:56,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 16:02:56,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:02:56" (1/1) ... [2019-09-08 16:02:56,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b81684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:56, skipping insertion in model container [2019-09-08 16:02:56,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:02:56" (1/1) ... [2019-09-08 16:02:56,417 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 16:02:56,548 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 16:02:58,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 16:02:58,229 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 16:02:58,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 16:02:58,910 INFO L192 MainTranslator]: Completed translation [2019-09-08 16:02:58,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:58 WrapperNode [2019-09-08 16:02:58,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 16:02:58,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 16:02:58,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 16:02:58,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 16:02:58,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:58" (1/1) ... [2019-09-08 16:02:58,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:58" (1/1) ... [2019-09-08 16:02:58,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:58" (1/1) ... [2019-09-08 16:02:58,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:58" (1/1) ... [2019-09-08 16:02:59,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:58" (1/1) ... [2019-09-08 16:02:59,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:58" (1/1) ... [2019-09-08 16:02:59,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:58" (1/1) ... [2019-09-08 16:02:59,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 16:02:59,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 16:02:59,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 16:02:59,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 16:02:59,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:58" (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 16:02:59,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 16:02:59,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 16:02:59,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 16:02:59,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_swab32 [2019-09-08 16:02:59,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2019-09-08 16:02:59,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2019-09-08 16:02:59,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __swab32p [2019-09-08 16:02:59,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __be32_to_cpup [2019-09-08 16:02:59,244 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-09-08 16:02:59,245 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-09-08 16:02:59,245 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2019-09-08 16:02:59,245 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2019-09-08 16:02:59,245 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2019-09-08 16:02:59,245 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2019-09-08 16:02:59,246 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2019-09-08 16:02:59,246 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2019-09-08 16:02:59,246 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2019-09-08 16:02:59,246 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-09-08 16:02:59,246 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2019-09-08 16:02:59,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-08 16:02:59,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-08 16:02:59,247 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-08 16:02:59,247 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-08 16:02:59,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-08 16:02:59,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-08 16:02:59,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-08 16:02:59,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-08 16:02:59,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-08 16:02:59,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-08 16:02:59,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-08 16:02:59,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-08 16:02:59,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-08 16:02:59,251 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2019-09-08 16:02:59,251 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-09-08 16:02:59,251 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2019-09-08 16:02:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2019-09-08 16:02:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_wake_queue [2019-09-08 16:02:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2019-09-08 16:02:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_stop_queue [2019-09-08 16:02:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2019-09-08 16:02:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2019-09-08 16:02:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure can_dropped_invalid_skb [2019-09-08 16:02:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_send_cmd_msg [2019-09-08 16:02:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_wait_cmd_msg [2019-09-08 16:02:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_send_cmd [2019-09-08 16:02:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_cmd_open [2019-09-08 16:02:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_cmd_close [2019-09-08 16:02:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_cmd_version [2019-09-08 16:02:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_set_mode [2019-09-08 16:02:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_rx_err_msg [2019-09-08 16:02:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_rx_can_msg [2019-09-08 16:02:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_read_bulk_callback [2019-09-08 16:02:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_write_bulk_callback [2019-09-08 16:02:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_start_xmit [2019-09-08 16:02:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_get_berr_counter [2019-09-08 16:02:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_start [2019-09-08 16:02:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_open [2019-09-08 16:02:59,257 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2019-09-08 16:02:59,258 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_close [2019-09-08 16:02:59,258 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_probe [2019-09-08 16:02:59,259 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_disconnect [2019-09-08 16:02:59,259 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_driver_init [2019-09-08 16:02:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_driver_exit [2019-09-08 16:02:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-09-08 16:02:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_net_device_ops_2 [2019-09-08 16:02:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 16:02:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-08 16:02:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2019-09-08 16:02:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-09-08 16:02:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_4 [2019-09-08 16:02:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_6 [2019-09-08 16:02:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_7 [2019-09-08 16:02:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_8 [2019-09-08 16:02:59,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_9 [2019-09-08 16:02:59,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_10 [2019-09-08 16:02:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_12 [2019-09-08 16:02:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_13 [2019-09-08 16:02:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_14 [2019-09-08 16:02:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_15 [2019-09-08 16:02:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_16 [2019-09-08 16:02:59,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_18 [2019-09-08 16:02:59,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_19 [2019-09-08 16:02:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2019-09-08 16:02:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-09-08 16:02:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-09-08 16:02:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-09-08 16:02:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-09-08 16:02:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-09-08 16:02:59,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-09-08 16:02:59,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-09-08 16:02:59,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-09-08 16:02:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-09-08 16:02:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-09-08 16:02:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-09-08 16:02:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-09-08 16:02:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-09-08 16:02:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-09-08 16:02:59,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-09-08 16:02:59,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 16:02:59,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2019-09-08 16:02:59,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-09-08 16:02:59,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __netif_schedule [2019-09-08 16:02:59,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-09-08 16:02:59,268 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2019-09-08 16:02:59,269 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_can_err_skb [2019-09-08 16:02:59,269 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_can_skb [2019-09-08 16:02:59,269 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_candev [2019-09-08 16:02:59,269 INFO L138 BoogieDeclarations]: Found implementation of procedure can_bus_off [2019-09-08 16:02:59,269 INFO L138 BoogieDeclarations]: Found implementation of procedure can_free_echo_skb [2019-09-08 16:02:59,269 INFO L138 BoogieDeclarations]: Found implementation of procedure can_get_echo_skb [2019-09-08 16:02:59,269 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2019-09-08 16:02:59,270 INFO L138 BoogieDeclarations]: Found implementation of procedure can_put_echo_skb [2019-09-08 16:02:59,270 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2019-09-08 16:02:59,270 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2019-09-08 16:02:59,270 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2019-09-08 16:02:59,270 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_can_led_init [2019-09-08 16:02:59,271 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2019-09-08 16:02:59,271 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2019-09-08 16:02:59,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 16:02:59,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_init_2 [2019-09-08 16:02:59,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ndo_uninit_2 [2019-09-08 16:02:59,272 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2019-09-08 16:02:59,272 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-09-08 16:02:59,272 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2019-09-08 16:02:59,273 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2019-09-08 16:02:59,273 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2019-09-08 16:02:59,273 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2019-09-08 16:02:59,273 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2019-09-08 16:02:59,274 INFO L138 BoogieDeclarations]: Found implementation of procedure netpoll_trap [2019-09-08 16:02:59,274 INFO L138 BoogieDeclarations]: Found implementation of procedure open_candev [2019-09-08 16:02:59,274 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-08 16:02:59,274 INFO L138 BoogieDeclarations]: Found implementation of procedure register_candev [2019-09-08 16:02:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2019-09-08 16:02:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-09-08 16:02:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2019-09-08 16:02:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2019-09-08 16:02:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-08 16:02:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-09-08 16:02:59,276 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2019-09-08 16:02:59,276 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-08 16:02:59,280 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_string [2019-09-08 16:02:59,280 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2019-09-08 16:02:59,280 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-09-08 16:02:59,280 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-08 16:02:59,287 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-08 16:02:59,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-08 16:02:59,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-08 16:02:59,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-08 16:02:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 16:02:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-08 16:02:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-08 16:02:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-08 16:02:59,290 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-09-08 16:02:59,290 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_swab32 [2019-09-08 16:02:59,290 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2019-09-08 16:02:59,290 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2019-09-08 16:02:59,290 INFO L130 BoogieDeclarations]: Found specification of procedure __swab32p [2019-09-08 16:02:59,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 16:02:59,290 INFO L130 BoogieDeclarations]: Found specification of procedure __be32_to_cpup [2019-09-08 16:02:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-09-08 16:02:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-09-08 16:02:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2019-09-08 16:02:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2019-09-08 16:02:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-08 16:02:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-09-08 16:02:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2019-09-08 16:02:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2019-09-08 16:02:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 16:02:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2019-09-08 16:02:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2019-09-08 16:02:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2019-09-08 16:02:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 16:02:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-09-08 16:02:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-09-08 16:02:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2019-09-08 16:02:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-09-08 16:02:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2019-09-08 16:02:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-09-08 16:02:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2019-09-08 16:02:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2019-09-08 16:02:59,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_16 [2019-09-08 16:02:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_15 [2019-09-08 16:02:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-08 16:02:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-08 16:02:59,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_18 [2019-09-08 16:02:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-08 16:02:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_19 [2019-09-08 16:02:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2019-09-08 16:02:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 16:02:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 16:02:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2019-09-08 16:02:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_4 [2019-09-08 16:02:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_9 [2019-09-08 16:02:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_7 [2019-09-08 16:02:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_8 [2019-09-08 16:02:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_10 [2019-09-08 16:02:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_13 [2019-09-08 16:02:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_14 [2019-09-08 16:02:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-09-08 16:02:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_6 [2019-09-08 16:02:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_12 [2019-09-08 16:02:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2019-09-08 16:02:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2019-09-08 16:02:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2019-09-08 16:02:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-09-08 16:02:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-09-08 16:02:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2019-09-08 16:02:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure usb_string [2019-09-08 16:02:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-08 16:02:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-09-08 16:02:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-09-08 16:02:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-09-08 16:02:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-09-08 16:02:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-09-08 16:02:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-09-08 16:02:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-09-08 16:02:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-08 16:02:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-08 16:02:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-08 16:02:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-08 16:02:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-08 16:02:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 16:02:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 16:02:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 16:02:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-08 16:02:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 16:02:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 16:02:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 16:02:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-08 16:02:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-08 16:02:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-08 16:02:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-08 16:02:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-08 16:02:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-08 16:02:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-08 16:02:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-08 16:02:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-09-08 16:02:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_net_device_ops_2 [2019-09-08 16:02:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2019-09-08 16:02:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2019-09-08 16:02:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2019-09-08 16:02:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 16:02:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-09-08 16:02:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure netpoll_trap [2019-09-08 16:02:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure __netif_schedule [2019-09-08 16:02:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2019-09-08 16:02:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2019-09-08 16:02:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_wake_queue [2019-09-08 16:02:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2019-09-08 16:02:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_stop_queue [2019-09-08 16:02:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2019-09-08 16:02:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2019-09-08 16:02:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2019-09-08 16:02:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2019-09-08 16:02:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2019-09-08 16:02:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2019-09-08 16:02:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2019-09-08 16:02:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2019-09-08 16:02:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2019-09-08 16:02:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure devm_can_led_init [2019-09-08 16:02:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure can_dropped_invalid_skb [2019-09-08 16:02:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_candev [2019-09-08 16:02:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2019-09-08 16:02:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure open_candev [2019-09-08 16:02:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2019-09-08 16:02:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure register_candev [2019-09-08 16:02:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure can_bus_off [2019-09-08 16:02:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure can_put_echo_skb [2019-09-08 16:02:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure can_get_echo_skb [2019-09-08 16:02:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure can_free_echo_skb [2019-09-08 16:02:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_can_skb [2019-09-08 16:02:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_can_err_skb [2019-09-08 16:02:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_send_cmd_msg [2019-09-08 16:02:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_wait_cmd_msg [2019-09-08 16:02:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_send_cmd [2019-09-08 16:02:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-08 16:02:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_cmd_open [2019-09-08 16:02:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-08 16:02:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_cmd_close [2019-09-08 16:02:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_cmd_version [2019-09-08 16:02:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_set_mode [2019-09-08 16:02:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_rx_err_msg [2019-09-08 16:02:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_rx_can_msg [2019-09-08 16:02:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_read_bulk_callback [2019-09-08 16:02:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_write_bulk_callback [2019-09-08 16:02:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_start_xmit [2019-09-08 16:02:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_get_berr_counter [2019-09-08 16:02:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_start [2019-09-08 16:02:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_open [2019-09-08 16:02:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2019-09-08 16:02:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_close [2019-09-08 16:02:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_probe [2019-09-08 16:02:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_disconnect [2019-09-08 16:02:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_driver_init [2019-09-08 16:02:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_driver_exit [2019-09-08 16:02:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_init_2 [2019-09-08 16:02:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ndo_uninit_2 [2019-09-08 16:02:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 16:02:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 16:02:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 16:02:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2019-09-08 16:02:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-09-08 16:02:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-09-08 16:02:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 16:02:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-09-08 16:02:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-09-08 16:02:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-09-08 16:02:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-09-08 16:02:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-09-08 16:02:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-09-08 16:02:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-08 16:02:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-08 16:02:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 16:02:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 16:02:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-08 16:02:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 16:02:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 16:02:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 16:02:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-08 16:02:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-08 16:02:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-08 16:03:00,983 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-08 16:03:03,992 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2019-09-08 16:03:04,812 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 16:03:04,812 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 16:03:04,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:03:04 BoogieIcfgContainer [2019-09-08 16:03:04,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 16:03:04,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 16:03:04,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 16:03:04,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 16:03:04,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:02:56" (1/3) ... [2019-09-08 16:03:04,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62061a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:03:04, skipping insertion in model container [2019-09-08 16:03:04,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:58" (2/3) ... [2019-09-08 16:03:04,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62061a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:03:04, skipping insertion in model container [2019-09-08 16:03:04,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:03:04" (3/3) ... [2019-09-08 16:03:04,823 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2019-09-08 16:03:04,834 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 16:03:04,844 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 16:03:04,863 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 16:03:04,908 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 16:03:04,909 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 16:03:04,909 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 16:03:04,909 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 16:03:04,910 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 16:03:04,910 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 16:03:04,910 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 16:03:04,910 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 16:03:04,910 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 16:03:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states. [2019-09-08 16:03:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 16:03:04,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:04,975 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] [2019-09-08 16:03:04,978 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1061388494, now seen corresponding path program 1 times [2019-09-08 16:03:04,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:04,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:05,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:05,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:05,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 16:03:05,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:05,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:03:05,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:03:05,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:03:05,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:03:05,672 INFO L87 Difference]: Start difference. First operand 994 states. Second operand 3 states. [2019-09-08 16:03:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:06,452 INFO L93 Difference]: Finished difference Result 2768 states and 3460 transitions. [2019-09-08 16:03:06,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:03:06,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-08 16:03:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:06,501 INFO L225 Difference]: With dead ends: 2768 [2019-09-08 16:03:06,502 INFO L226 Difference]: Without dead ends: 1803 [2019-09-08 16:03:06,514 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:03:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-09-08 16:03:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2019-09-08 16:03:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-09-08 16:03:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2238 transitions. [2019-09-08 16:03:06,705 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2238 transitions. Word has length 45 [2019-09-08 16:03:06,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:06,706 INFO L475 AbstractCegarLoop]: Abstraction has 1803 states and 2238 transitions. [2019-09-08 16:03:06,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:03:06,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2238 transitions. [2019-09-08 16:03:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 16:03:06,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:06,712 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:06,713 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:06,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:06,713 INFO L82 PathProgramCache]: Analyzing trace with hash 742484847, now seen corresponding path program 1 times [2019-09-08 16:03:06,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:06,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:06,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:06,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 16:03:06,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:06,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:03:06,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:03:06,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:03:06,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:03:06,944 INFO L87 Difference]: Start difference. First operand 1803 states and 2238 transitions. Second operand 3 states. [2019-09-08 16:03:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:07,166 INFO L93 Difference]: Finished difference Result 5380 states and 6751 transitions. [2019-09-08 16:03:07,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:03:07,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 16:03:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:07,210 INFO L225 Difference]: With dead ends: 5380 [2019-09-08 16:03:07,210 INFO L226 Difference]: Without dead ends: 3591 [2019-09-08 16:03:07,220 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 16:03:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2019-09-08 16:03:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3581. [2019-09-08 16:03:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3581 states. [2019-09-08 16:03:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 4484 transitions. [2019-09-08 16:03:07,431 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 4484 transitions. Word has length 61 [2019-09-08 16:03:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:07,432 INFO L475 AbstractCegarLoop]: Abstraction has 3581 states and 4484 transitions. [2019-09-08 16:03:07,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:03:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 4484 transitions. [2019-09-08 16:03:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 16:03:07,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:07,444 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:07,444 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:07,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1541616014, now seen corresponding path program 1 times [2019-09-08 16:03:07,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:07,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:07,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:07,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:07,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 16:03:07,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:07,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:03:07,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:03:07,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:03:07,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:03:07,723 INFO L87 Difference]: Start difference. First operand 3581 states and 4484 transitions. Second operand 3 states. [2019-09-08 16:03:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:07,864 INFO L93 Difference]: Finished difference Result 3583 states and 4485 transitions. [2019-09-08 16:03:07,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:03:07,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 16:03:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:07,891 INFO L225 Difference]: With dead ends: 3583 [2019-09-08 16:03:07,891 INFO L226 Difference]: Without dead ends: 3580 [2019-09-08 16:03:07,894 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:03:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2019-09-08 16:03:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3580. [2019-09-08 16:03:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3580 states. [2019-09-08 16:03:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 4482 transitions. [2019-09-08 16:03:08,153 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 4482 transitions. Word has length 62 [2019-09-08 16:03:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:08,154 INFO L475 AbstractCegarLoop]: Abstraction has 3580 states and 4482 transitions. [2019-09-08 16:03:08,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:03:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 4482 transitions. [2019-09-08 16:03:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 16:03:08,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:08,156 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:08,156 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash 544883282, now seen corresponding path program 1 times [2019-09-08 16:03:08,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:08,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:08,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:08,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:08,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 16:03:08,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:08,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:03:08,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:03:08,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:03:08,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:03:08,304 INFO L87 Difference]: Start difference. First operand 3580 states and 4482 transitions. Second operand 3 states. [2019-09-08 16:03:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:08,428 INFO L93 Difference]: Finished difference Result 3582 states and 4483 transitions. [2019-09-08 16:03:08,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:03:08,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 16:03:08,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:08,452 INFO L225 Difference]: With dead ends: 3582 [2019-09-08 16:03:08,452 INFO L226 Difference]: Without dead ends: 3579 [2019-09-08 16:03:08,455 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:03:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579 states. [2019-09-08 16:03:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 3579. [2019-09-08 16:03:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3579 states. [2019-09-08 16:03:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 4480 transitions. [2019-09-08 16:03:08,659 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 4480 transitions. Word has length 63 [2019-09-08 16:03:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:08,660 INFO L475 AbstractCegarLoop]: Abstraction has 3579 states and 4480 transitions. [2019-09-08 16:03:08,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:03:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 4480 transitions. [2019-09-08 16:03:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 16:03:08,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:08,665 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:08,665 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash -289055471, now seen corresponding path program 1 times [2019-09-08 16:03:08,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:08,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:08,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 16:03:08,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:08,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:03:08,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:03:08,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:03:08,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:03:08,837 INFO L87 Difference]: Start difference. First operand 3579 states and 4480 transitions. Second operand 3 states. [2019-09-08 16:03:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:08,956 INFO L93 Difference]: Finished difference Result 3581 states and 4481 transitions. [2019-09-08 16:03:08,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:03:08,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 16:03:08,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:08,979 INFO L225 Difference]: With dead ends: 3581 [2019-09-08 16:03:08,979 INFO L226 Difference]: Without dead ends: 3578 [2019-09-08 16:03:08,982 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:03:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2019-09-08 16:03:09,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3578. [2019-09-08 16:03:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3578 states. [2019-09-08 16:03:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 3578 states and 4478 transitions. [2019-09-08 16:03:09,159 INFO L78 Accepts]: Start accepts. Automaton has 3578 states and 4478 transitions. Word has length 64 [2019-09-08 16:03:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:09,160 INFO L475 AbstractCegarLoop]: Abstraction has 3578 states and 4478 transitions. [2019-09-08 16:03:09,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:03:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3578 states and 4478 transitions. [2019-09-08 16:03:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 16:03:09,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:09,162 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:09,162 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:09,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash -371348171, now seen corresponding path program 1 times [2019-09-08 16:03:09,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:09,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:09,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:09,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:09,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 16:03:09,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:09,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:03:09,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:03:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:03:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:03:09,361 INFO L87 Difference]: Start difference. First operand 3578 states and 4478 transitions. Second operand 3 states. [2019-09-08 16:03:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:09,478 INFO L93 Difference]: Finished difference Result 3580 states and 4479 transitions. [2019-09-08 16:03:09,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:03:09,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 16:03:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:09,504 INFO L225 Difference]: With dead ends: 3580 [2019-09-08 16:03:09,504 INFO L226 Difference]: Without dead ends: 3558 [2019-09-08 16:03:09,508 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:03:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-09-08 16:03:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2019-09-08 16:03:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3558 states. [2019-09-08 16:03:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4454 transitions. [2019-09-08 16:03:09,681 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4454 transitions. Word has length 65 [2019-09-08 16:03:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:09,682 INFO L475 AbstractCegarLoop]: Abstraction has 3558 states and 4454 transitions. [2019-09-08 16:03:09,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:03:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4454 transitions. [2019-09-08 16:03:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 16:03:09,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:09,688 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-08 16:03:09,688 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1745410132, now seen corresponding path program 1 times [2019-09-08 16:03:09,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:09,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:09,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:09,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:09,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 16:03:09,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:09,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:03:09,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:03:09,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:03:09,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:03:09,809 INFO L87 Difference]: Start difference. First operand 3558 states and 4454 transitions. Second operand 3 states. [2019-09-08 16:03:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:10,124 INFO L93 Difference]: Finished difference Result 8335 states and 10310 transitions. [2019-09-08 16:03:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:03:10,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 16:03:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:10,157 INFO L225 Difference]: With dead ends: 8335 [2019-09-08 16:03:10,158 INFO L226 Difference]: Without dead ends: 4791 [2019-09-08 16:03:10,182 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:03:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states. [2019-09-08 16:03:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 4773. [2019-09-08 16:03:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4773 states. [2019-09-08 16:03:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 5851 transitions. [2019-09-08 16:03:10,492 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 5851 transitions. Word has length 122 [2019-09-08 16:03:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:10,493 INFO L475 AbstractCegarLoop]: Abstraction has 4773 states and 5851 transitions. [2019-09-08 16:03:10,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:03:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 5851 transitions. [2019-09-08 16:03:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 16:03:10,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:10,501 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2019-09-08 16:03:10,502 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1938798497, now seen corresponding path program 1 times [2019-09-08 16:03:10,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:10,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:10,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 16:03:10,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:10,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:03:10,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:03:10,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:03:10,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:03:10,770 INFO L87 Difference]: Start difference. First operand 4773 states and 5851 transitions. Second operand 3 states. [2019-09-08 16:03:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:11,907 INFO L93 Difference]: Finished difference Result 10795 states and 13174 transitions. [2019-09-08 16:03:11,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:03:11,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-08 16:03:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:11,941 INFO L225 Difference]: With dead ends: 10795 [2019-09-08 16:03:11,942 INFO L226 Difference]: Without dead ends: 6045 [2019-09-08 16:03:11,959 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:03:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2019-09-08 16:03:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 6027. [2019-09-08 16:03:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6027 states. [2019-09-08 16:03:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6027 states to 6027 states and 7307 transitions. [2019-09-08 16:03:12,240 INFO L78 Accepts]: Start accepts. Automaton has 6027 states and 7307 transitions. Word has length 151 [2019-09-08 16:03:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:12,241 INFO L475 AbstractCegarLoop]: Abstraction has 6027 states and 7307 transitions. [2019-09-08 16:03:12,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:03:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6027 states and 7307 transitions. [2019-09-08 16:03:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 16:03:12,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:12,248 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-09-08 16:03:12,248 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash -30340138, now seen corresponding path program 1 times [2019-09-08 16:03:12,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:12,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:12,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:12,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:12,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 16:03:12,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:12,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:03:12,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:03:12,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:03:12,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:03:12,397 INFO L87 Difference]: Start difference. First operand 6027 states and 7307 transitions. Second operand 3 states. [2019-09-08 16:03:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:13,547 INFO L93 Difference]: Finished difference Result 14359 states and 17388 transitions. [2019-09-08 16:03:13,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:03:13,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 16:03:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:13,582 INFO L225 Difference]: With dead ends: 14359 [2019-09-08 16:03:13,582 INFO L226 Difference]: Without dead ends: 8355 [2019-09-08 16:03:13,600 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:03:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states. [2019-09-08 16:03:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 8337. [2019-09-08 16:03:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8337 states. [2019-09-08 16:03:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8337 states to 8337 states and 10065 transitions. [2019-09-08 16:03:13,947 INFO L78 Accepts]: Start accepts. Automaton has 8337 states and 10065 transitions. Word has length 167 [2019-09-08 16:03:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:13,947 INFO L475 AbstractCegarLoop]: Abstraction has 8337 states and 10065 transitions. [2019-09-08 16:03:13,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:03:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 8337 states and 10065 transitions. [2019-09-08 16:03:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 16:03:13,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:13,957 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-09-08 16:03:13,957 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:13,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1320147301, now seen corresponding path program 1 times [2019-09-08 16:03:13,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:13,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:13,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:13,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:13,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 16:03:14,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:14,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 16:03:14,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 16:03:14,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 16:03:14,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:03:14,188 INFO L87 Difference]: Start difference. First operand 8337 states and 10065 transitions. Second operand 9 states. [2019-09-08 16:03:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:16,230 INFO L93 Difference]: Finished difference Result 20909 states and 25291 transitions. [2019-09-08 16:03:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 16:03:16,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 175 [2019-09-08 16:03:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:16,304 INFO L225 Difference]: With dead ends: 20909 [2019-09-08 16:03:16,304 INFO L226 Difference]: Without dead ends: 12595 [2019-09-08 16:03:16,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-08 16:03:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12595 states. [2019-09-08 16:03:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12595 to 8393. [2019-09-08 16:03:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8393 states. [2019-09-08 16:03:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8393 states to 8393 states and 10141 transitions. [2019-09-08 16:03:16,871 INFO L78 Accepts]: Start accepts. Automaton has 8393 states and 10141 transitions. Word has length 175 [2019-09-08 16:03:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:16,872 INFO L475 AbstractCegarLoop]: Abstraction has 8393 states and 10141 transitions. [2019-09-08 16:03:16,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 16:03:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 8393 states and 10141 transitions. [2019-09-08 16:03:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 16:03:16,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:16,885 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-09-08 16:03:16,885 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1454160807, now seen corresponding path program 1 times [2019-09-08 16:03:16,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:16,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:16,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:16,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:16,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 16:03:17,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:03:17,097 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) [2019-09-08 16:03:17,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:03:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:17,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 2136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:03:17,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:03:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 16:03:17,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:03:17,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-09-08 16:03:17,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:03:17,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:03:17,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:03:17,643 INFO L87 Difference]: Start difference. First operand 8393 states and 10141 transitions. Second operand 5 states. [2019-09-08 16:03:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:21,890 INFO L93 Difference]: Finished difference Result 26103 states and 31489 transitions. [2019-09-08 16:03:21,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:03:21,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 16:03:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:22,034 INFO L225 Difference]: With dead ends: 26103 [2019-09-08 16:03:22,034 INFO L226 Difference]: Without dead ends: 26085 [2019-09-08 16:03:22,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:03:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26085 states. [2019-09-08 16:03:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26085 to 25057. [2019-09-08 16:03:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25057 states. [2019-09-08 16:03:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25057 states to 25057 states and 30295 transitions. [2019-09-08 16:03:23,526 INFO L78 Accepts]: Start accepts. Automaton has 25057 states and 30295 transitions. Word has length 175 [2019-09-08 16:03:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:23,527 INFO L475 AbstractCegarLoop]: Abstraction has 25057 states and 30295 transitions. [2019-09-08 16:03:23,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:03:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 25057 states and 30295 transitions. [2019-09-08 16:03:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 16:03:23,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:23,551 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2019-09-08 16:03:23,552 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:23,552 INFO L82 PathProgramCache]: Analyzing trace with hash -928597766, now seen corresponding path program 1 times [2019-09-08 16:03:23,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:23,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:23,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:23,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:23,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-08 16:03:23,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:03:23,781 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:03:23,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:24,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 2284 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 16:03:24,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:03:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-08 16:03:24,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:03:24,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-08 16:03:24,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 16:03:24,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 16:03:24,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:03:24,250 INFO L87 Difference]: Start difference. First operand 25057 states and 30295 transitions. Second operand 8 states. [2019-09-08 16:03:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:28,060 INFO L93 Difference]: Finished difference Result 38835 states and 47242 transitions. [2019-09-08 16:03:28,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 16:03:28,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2019-09-08 16:03:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:28,110 INFO L225 Difference]: With dead ends: 38835 [2019-09-08 16:03:28,110 INFO L226 Difference]: Without dead ends: 12870 [2019-09-08 16:03:28,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:03:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12870 states. [2019-09-08 16:03:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12870 to 12252. [2019-09-08 16:03:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12252 states. [2019-09-08 16:03:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12252 states to 12252 states and 14823 transitions. [2019-09-08 16:03:28,737 INFO L78 Accepts]: Start accepts. Automaton has 12252 states and 14823 transitions. Word has length 191 [2019-09-08 16:03:28,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:28,738 INFO L475 AbstractCegarLoop]: Abstraction has 12252 states and 14823 transitions. [2019-09-08 16:03:28,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 16:03:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 12252 states and 14823 transitions. [2019-09-08 16:03:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 16:03:28,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:28,757 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 16:03:28,758 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:28,758 INFO L82 PathProgramCache]: Analyzing trace with hash 883465955, now seen corresponding path program 1 times [2019-09-08 16:03:28,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:28,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:28,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:28,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:28,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 16:03:29,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:29,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 16:03:29,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 16:03:29,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 16:03:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:03:29,270 INFO L87 Difference]: Start difference. First operand 12252 states and 14823 transitions. Second operand 8 states. [2019-09-08 16:03:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:32,554 INFO L93 Difference]: Finished difference Result 29527 states and 35905 transitions. [2019-09-08 16:03:32,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 16:03:32,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2019-09-08 16:03:32,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:32,629 INFO L225 Difference]: With dead ends: 29527 [2019-09-08 16:03:32,630 INFO L226 Difference]: Without dead ends: 17430 [2019-09-08 16:03:32,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:03:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17430 states. [2019-09-08 16:03:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17430 to 17430. [2019-09-08 16:03:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17430 states. [2019-09-08 16:03:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17430 states to 17430 states and 21174 transitions. [2019-09-08 16:03:34,238 INFO L78 Accepts]: Start accepts. Automaton has 17430 states and 21174 transitions. Word has length 191 [2019-09-08 16:03:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:34,238 INFO L475 AbstractCegarLoop]: Abstraction has 17430 states and 21174 transitions. [2019-09-08 16:03:34,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 16:03:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 17430 states and 21174 transitions. [2019-09-08 16:03:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 16:03:34,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:34,261 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-09-08 16:03:34,261 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:34,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1364859823, now seen corresponding path program 1 times [2019-09-08 16:03:34,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:34,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:34,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:34,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:34,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 41 proven. 9 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 16:03:34,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:03:34,507 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) [2019-09-08 16:03:34,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:03:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:34,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 2282 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 16:03:34,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:03:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 16:03:34,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:03:34,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 16:03:34,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 16:03:34,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 16:03:34,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:03:34,976 INFO L87 Difference]: Start difference. First operand 17430 states and 21174 transitions. Second operand 7 states. [2019-09-08 16:03:37,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:03:37,089 INFO L93 Difference]: Finished difference Result 33054 states and 40300 transitions. [2019-09-08 16:03:37,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 16:03:37,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 208 [2019-09-08 16:03:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:03:37,146 INFO L225 Difference]: With dead ends: 33054 [2019-09-08 16:03:37,146 INFO L226 Difference]: Without dead ends: 16648 [2019-09-08 16:03:37,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:03:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16648 states. [2019-09-08 16:03:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16648 to 16624. [2019-09-08 16:03:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16624 states. [2019-09-08 16:03:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16624 states to 16624 states and 20207 transitions. [2019-09-08 16:03:38,280 INFO L78 Accepts]: Start accepts. Automaton has 16624 states and 20207 transitions. Word has length 208 [2019-09-08 16:03:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:03:38,280 INFO L475 AbstractCegarLoop]: Abstraction has 16624 states and 20207 transitions. [2019-09-08 16:03:38,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 16:03:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 16624 states and 20207 transitions. [2019-09-08 16:03:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 16:03:38,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:03:38,302 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:03:38,302 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:03:38,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:03:38,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1568975542, now seen corresponding path program 1 times [2019-09-08 16:03:38,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:03:38,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:03:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:38,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:03:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:03:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:03:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 16:03:38,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:03:38,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 16:03:38,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 16:03:38,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 16:03:38,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:03:38,850 INFO L87 Difference]: Start difference. First operand 16624 states and 20207 transitions. Second operand 13 states. [2019-09-08 16:04:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:04:23,054 INFO L93 Difference]: Finished difference Result 36406 states and 44790 transitions. [2019-09-08 16:04:23,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 16:04:23,054 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 212 [2019-09-08 16:04:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:04:23,114 INFO L225 Difference]: With dead ends: 36406 [2019-09-08 16:04:23,114 INFO L226 Difference]: Without dead ends: 20791 [2019-09-08 16:04:23,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-09-08 16:04:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20791 states. [2019-09-08 16:04:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20791 to 20260. [2019-09-08 16:04:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20260 states. [2019-09-08 16:04:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20260 states to 20260 states and 24707 transitions. [2019-09-08 16:04:24,300 INFO L78 Accepts]: Start accepts. Automaton has 20260 states and 24707 transitions. Word has length 212 [2019-09-08 16:04:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:04:24,300 INFO L475 AbstractCegarLoop]: Abstraction has 20260 states and 24707 transitions. [2019-09-08 16:04:24,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 16:04:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 20260 states and 24707 transitions. [2019-09-08 16:04:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 16:04:24,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:04:24,332 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 16:04:24,332 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:04:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:04:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1287549155, now seen corresponding path program 1 times [2019-09-08 16:04:24,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:04:24,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:04:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:04:24,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:04:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:04:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:04:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 16:04:24,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:04:24,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:04:24,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:04:24,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:04:24,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:04:24,486 INFO L87 Difference]: Start difference. First operand 20260 states and 24707 transitions. Second operand 3 states. [2019-09-08 16:04:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:04:25,505 INFO L93 Difference]: Finished difference Result 52676 states and 64849 transitions. [2019-09-08 16:04:25,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:04:25,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 16:04:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:04:25,626 INFO L225 Difference]: With dead ends: 52676 [2019-09-08 16:04:25,626 INFO L226 Difference]: Without dead ends: 32439 [2019-09-08 16:04:25,675 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:04:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32439 states. [2019-09-08 16:04:27,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32439 to 28371. [2019-09-08 16:04:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28371 states. [2019-09-08 16:04:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28371 states to 28371 states and 34982 transitions. [2019-09-08 16:04:27,575 INFO L78 Accepts]: Start accepts. Automaton has 28371 states and 34982 transitions. Word has length 229 [2019-09-08 16:04:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:04:27,576 INFO L475 AbstractCegarLoop]: Abstraction has 28371 states and 34982 transitions. [2019-09-08 16:04:27,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:04:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 28371 states and 34982 transitions. [2019-09-08 16:04:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 16:04:27,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:04:27,637 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 16:04:27,637 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:04:27,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:04:27,638 INFO L82 PathProgramCache]: Analyzing trace with hash 260520261, now seen corresponding path program 2 times [2019-09-08 16:04:27,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:04:27,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:04:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:04:27,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:04:27,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:04:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:04:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 16:04:27,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:04:27,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:04:27,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:04:27,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:04:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:04:27,960 INFO L87 Difference]: Start difference. First operand 28371 states and 34982 transitions. Second operand 3 states. [2019-09-08 16:04:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:04:30,234 INFO L93 Difference]: Finished difference Result 64968 states and 80374 transitions. [2019-09-08 16:04:30,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:04:30,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 16:04:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:04:30,341 INFO L225 Difference]: With dead ends: 64968 [2019-09-08 16:04:30,341 INFO L226 Difference]: Without dead ends: 36620 [2019-09-08 16:04:30,412 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:04:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36620 states. [2019-09-08 16:04:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36620 to 35229. [2019-09-08 16:04:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35229 states. [2019-09-08 16:04:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35229 states to 35229 states and 43728 transitions. [2019-09-08 16:04:32,164 INFO L78 Accepts]: Start accepts. Automaton has 35229 states and 43728 transitions. Word has length 229 [2019-09-08 16:04:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:04:32,164 INFO L475 AbstractCegarLoop]: Abstraction has 35229 states and 43728 transitions. [2019-09-08 16:04:32,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:04:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 35229 states and 43728 transitions. [2019-09-08 16:04:32,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 16:04:32,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:04:32,181 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 16:04:32,181 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:04:32,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:04:32,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1096381891, now seen corresponding path program 1 times [2019-09-08 16:04:32,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:04:32,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:04:32,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:04:32,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:04:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:04:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:04:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 16:04:32,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:04:32,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 16:04:32,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 16:04:32,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 16:04:32,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:04:32,421 INFO L87 Difference]: Start difference. First operand 35229 states and 43728 transitions. Second operand 8 states. [2019-09-08 16:04:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:04:33,510 INFO L93 Difference]: Finished difference Result 70450 states and 88155 transitions. [2019-09-08 16:04:33,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 16:04:33,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 251 [2019-09-08 16:04:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:04:33,593 INFO L225 Difference]: With dead ends: 70450 [2019-09-08 16:04:33,594 INFO L226 Difference]: Without dead ends: 35628 [2019-09-08 16:04:33,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:04:33,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35628 states. [2019-09-08 16:04:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35628 to 35299. [2019-09-08 16:04:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35299 states. [2019-09-08 16:04:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35299 states to 35299 states and 43812 transitions. [2019-09-08 16:04:36,574 INFO L78 Accepts]: Start accepts. Automaton has 35299 states and 43812 transitions. Word has length 251 [2019-09-08 16:04:36,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:04:36,575 INFO L475 AbstractCegarLoop]: Abstraction has 35299 states and 43812 transitions. [2019-09-08 16:04:36,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 16:04:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 35299 states and 43812 transitions. [2019-09-08 16:04:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 16:04:36,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:04:36,599 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 16:04:36,600 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:04:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:04:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1289759600, now seen corresponding path program 1 times [2019-09-08 16:04:36,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:04:36,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:04:36,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:04:36,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:04:36,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:04:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:04:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 16:04:36,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:04:36,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:04:36,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:04:36,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:04:36,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:04:36,782 INFO L87 Difference]: Start difference. First operand 35299 states and 43812 transitions. Second operand 3 states. [2019-09-08 16:04:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:04:37,718 INFO L93 Difference]: Finished difference Result 70912 states and 88687 transitions. [2019-09-08 16:04:37,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:04:37,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-09-08 16:04:37,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:04:37,802 INFO L225 Difference]: With dead ends: 70912 [2019-09-08 16:04:37,802 INFO L226 Difference]: Without dead ends: 36020 [2019-09-08 16:04:37,852 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:04:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36020 states. [2019-09-08 16:04:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36020 to 35348. [2019-09-08 16:04:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35348 states. [2019-09-08 16:04:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35348 states to 35348 states and 43826 transitions. [2019-09-08 16:04:39,387 INFO L78 Accepts]: Start accepts. Automaton has 35348 states and 43826 transitions. Word has length 252 [2019-09-08 16:04:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:04:39,388 INFO L475 AbstractCegarLoop]: Abstraction has 35348 states and 43826 transitions. [2019-09-08 16:04:39,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:04:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 35348 states and 43826 transitions. [2019-09-08 16:04:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 16:04:39,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:04:39,405 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 16:04:39,405 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:04:39,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:04:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1801366362, now seen corresponding path program 1 times [2019-09-08 16:04:39,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:04:39,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:04:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:04:39,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:04:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:04:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:04:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 16:04:40,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:04:40,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 16:04:40,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 16:04:40,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 16:04:40,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:04:40,020 INFO L87 Difference]: Start difference. First operand 35348 states and 43826 transitions. Second operand 13 states. [2019-09-08 16:05:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:23,732 INFO L93 Difference]: Finished difference Result 79737 states and 99559 transitions. [2019-09-08 16:05:23,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 16:05:23,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 259 [2019-09-08 16:05:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:23,837 INFO L225 Difference]: With dead ends: 79737 [2019-09-08 16:05:23,837 INFO L226 Difference]: Without dead ends: 44781 [2019-09-08 16:05:23,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-09-08 16:05:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44781 states. [2019-09-08 16:05:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44781 to 35334. [2019-09-08 16:05:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35334 states. [2019-09-08 16:05:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35334 states to 35334 states and 43798 transitions. [2019-09-08 16:05:26,513 INFO L78 Accepts]: Start accepts. Automaton has 35334 states and 43798 transitions. Word has length 259 [2019-09-08 16:05:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:26,514 INFO L475 AbstractCegarLoop]: Abstraction has 35334 states and 43798 transitions. [2019-09-08 16:05:26,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 16:05:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 35334 states and 43798 transitions. [2019-09-08 16:05:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 16:05:26,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:26,537 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,537 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash -108613760, now seen corresponding path program 1 times [2019-09-08 16:05:26,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:26,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:26,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 16:05:26,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:26,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:05:26,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:05:26,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:05:26,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:05:26,742 INFO L87 Difference]: Start difference. First operand 35334 states and 43798 transitions. Second operand 5 states. [2019-09-08 16:05:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:29,474 INFO L93 Difference]: Finished difference Result 88891 states and 109758 transitions. [2019-09-08 16:05:29,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 16:05:29,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2019-09-08 16:05:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:29,576 INFO L225 Difference]: With dead ends: 88891 [2019-09-08 16:05:29,576 INFO L226 Difference]: Without dead ends: 53580 [2019-09-08 16:05:29,619 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 16:05:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53580 states. [2019-09-08 16:05:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53580 to 35470. [2019-09-08 16:05:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35470 states. [2019-09-08 16:05:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35470 states to 35470 states and 43934 transitions. [2019-09-08 16:05:30,859 INFO L78 Accepts]: Start accepts. Automaton has 35470 states and 43934 transitions. Word has length 264 [2019-09-08 16:05:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:30,859 INFO L475 AbstractCegarLoop]: Abstraction has 35470 states and 43934 transitions. [2019-09-08 16:05:30,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:05:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 35470 states and 43934 transitions. [2019-09-08 16:05:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-08 16:05:30,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:30,885 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,885 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:30,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1983258690, now seen corresponding path program 1 times [2019-09-08 16:05:30,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:30,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:30,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:30,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:30,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 16:05:31,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:31,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:05:31,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:05:31,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:05:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:05:31,092 INFO L87 Difference]: Start difference. First operand 35470 states and 43934 transitions. Second operand 5 states. [2019-09-08 16:05:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:33,509 INFO L93 Difference]: Finished difference Result 89265 states and 110132 transitions. [2019-09-08 16:05:33,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 16:05:33,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 274 [2019-09-08 16:05:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:33,672 INFO L225 Difference]: With dead ends: 89265 [2019-09-08 16:05:33,672 INFO L226 Difference]: Without dead ends: 53818 [2019-09-08 16:05:33,716 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 16:05:33,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53818 states. [2019-09-08 16:05:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53818 to 35470. [2019-09-08 16:05:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35470 states. [2019-09-08 16:05:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35470 states to 35470 states and 43934 transitions. [2019-09-08 16:05:35,016 INFO L78 Accepts]: Start accepts. Automaton has 35470 states and 43934 transitions. Word has length 274 [2019-09-08 16:05:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:35,017 INFO L475 AbstractCegarLoop]: Abstraction has 35470 states and 43934 transitions. [2019-09-08 16:05:35,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:05:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 35470 states and 43934 transitions. [2019-09-08 16:05:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 16:05:35,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:35,034 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-08 16:05:35,035 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1795244572, now seen corresponding path program 1 times [2019-09-08 16:05:35,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:35,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:35,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:35,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:35,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 16:05:35,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:35,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 16:05:35,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 16:05:35,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 16:05:35,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:05:35,382 INFO L87 Difference]: Start difference. First operand 35470 states and 43934 transitions. Second operand 8 states. [2019-09-08 16:05:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:37,392 INFO L93 Difference]: Finished difference Result 70753 states and 87912 transitions. [2019-09-08 16:05:37,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:05:37,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 331 [2019-09-08 16:05:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:37,476 INFO L225 Difference]: With dead ends: 70753 [2019-09-08 16:05:37,477 INFO L226 Difference]: Without dead ends: 35694 [2019-09-08 16:05:37,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 16:05:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35694 states. [2019-09-08 16:05:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35694 to 35554. [2019-09-08 16:05:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35554 states. [2019-09-08 16:05:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35554 states to 35554 states and 44046 transitions. [2019-09-08 16:05:38,767 INFO L78 Accepts]: Start accepts. Automaton has 35554 states and 44046 transitions. Word has length 331 [2019-09-08 16:05:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:38,768 INFO L475 AbstractCegarLoop]: Abstraction has 35554 states and 44046 transitions. [2019-09-08 16:05:38,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 16:05:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 35554 states and 44046 transitions. [2019-09-08 16:05:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 16:05:38,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:38,788 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:05:38,788 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:38,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:38,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1113559969, now seen corresponding path program 1 times [2019-09-08 16:05:38,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:38,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:38,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 16:05:39,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:39,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:05:39,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:05:39,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:05:39,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:05:39,025 INFO L87 Difference]: Start difference. First operand 35554 states and 44046 transitions. Second operand 3 states. [2019-09-08 16:05:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:40,377 INFO L93 Difference]: Finished difference Result 71185 states and 89258 transitions. [2019-09-08 16:05:40,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:05:40,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-08 16:05:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:40,474 INFO L225 Difference]: With dead ends: 71185 [2019-09-08 16:05:40,474 INFO L226 Difference]: Without dead ends: 35654 [2019-09-08 16:05:40,531 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:05:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35654 states. [2019-09-08 16:05:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35654 to 35604. [2019-09-08 16:05:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35604 states. [2019-09-08 16:05:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35604 states to 35604 states and 44096 transitions. [2019-09-08 16:05:41,788 INFO L78 Accepts]: Start accepts. Automaton has 35604 states and 44096 transitions. Word has length 335 [2019-09-08 16:05:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:41,789 INFO L475 AbstractCegarLoop]: Abstraction has 35604 states and 44096 transitions. [2019-09-08 16:05:41,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:05:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 35604 states and 44096 transitions. [2019-09-08 16:05:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 16:05:41,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:41,817 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:05:41,818 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:41,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:41,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1320642085, now seen corresponding path program 1 times [2019-09-08 16:05:41,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:41,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:41,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:41,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 16:05:43,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:05:43,467 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:05:43,502 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:05:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:43,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 2925 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:05:43,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:05:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 16:05:44,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:05:44,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 16:05:44,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:05:44,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:05:44,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:05:44,050 INFO L87 Difference]: Start difference. First operand 35604 states and 44096 transitions. Second operand 5 states. [2019-09-08 16:05:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:45,100 INFO L93 Difference]: Finished difference Result 71335 states and 89408 transitions. [2019-09-08 16:05:45,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 16:05:45,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 337 [2019-09-08 16:05:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:45,185 INFO L225 Difference]: With dead ends: 71335 [2019-09-08 16:05:45,186 INFO L226 Difference]: Without dead ends: 35754 [2019-09-08 16:05:45,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 337 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:05:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35754 states. [2019-09-08 16:05:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35754 to 35704. [2019-09-08 16:05:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35704 states. [2019-09-08 16:05:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35704 states to 35704 states and 44196 transitions. [2019-09-08 16:05:46,717 INFO L78 Accepts]: Start accepts. Automaton has 35704 states and 44196 transitions. Word has length 337 [2019-09-08 16:05:46,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:46,717 INFO L475 AbstractCegarLoop]: Abstraction has 35704 states and 44196 transitions. [2019-09-08 16:05:46,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:05:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 35704 states and 44196 transitions. [2019-09-08 16:05:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-08 16:05:46,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:46,735 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-08 16:05:46,735 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:46,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 169795021, now seen corresponding path program 1 times [2019-09-08 16:05:46,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:46,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:46,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:46,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:46,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-08 16:05:47,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:05:47,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:05:47,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:05:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:05:47,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:05:47,019 INFO L87 Difference]: Start difference. First operand 35704 states and 44196 transitions. Second operand 5 states. [2019-09-08 16:05:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:48,182 INFO L93 Difference]: Finished difference Result 71358 states and 88867 transitions. [2019-09-08 16:05:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:05:48,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 429 [2019-09-08 16:05:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:48,316 INFO L225 Difference]: With dead ends: 71358 [2019-09-08 16:05:48,317 INFO L226 Difference]: Without dead ends: 36068 [2019-09-08 16:05:48,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:05:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36068 states. [2019-09-08 16:05:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36068 to 35956. [2019-09-08 16:05:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35956 states. [2019-09-08 16:05:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35956 states to 35956 states and 44546 transitions. [2019-09-08 16:05:50,099 INFO L78 Accepts]: Start accepts. Automaton has 35956 states and 44546 transitions. Word has length 429 [2019-09-08 16:05:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:50,100 INFO L475 AbstractCegarLoop]: Abstraction has 35956 states and 44546 transitions. [2019-09-08 16:05:50,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:05:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 35956 states and 44546 transitions. [2019-09-08 16:05:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 16:05:50,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:50,121 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:05:50,121 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:50,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:50,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1536907351, now seen corresponding path program 2 times [2019-09-08 16:05:50,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:50,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:50,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:50,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 16:05:50,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:05:50,372 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:05:50,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:05:51,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:05:51,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:05:51,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 2931 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 16:05:51,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:05:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 16:05:51,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:05:51,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 16:05:51,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:05:51,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:05:51,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:05:51,533 INFO L87 Difference]: Start difference. First operand 35956 states and 44546 transitions. Second operand 6 states. [2019-09-08 16:05:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:52,623 INFO L93 Difference]: Finished difference Result 72039 states and 90441 transitions. [2019-09-08 16:05:52,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:05:52,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 339 [2019-09-08 16:05:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:52,764 INFO L225 Difference]: With dead ends: 72039 [2019-09-08 16:05:52,764 INFO L226 Difference]: Without dead ends: 36106 [2019-09-08 16:05:52,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:05:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36106 states. [2019-09-08 16:05:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36106 to 36056. [2019-09-08 16:05:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36056 states. [2019-09-08 16:05:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36056 states to 36056 states and 44646 transitions. [2019-09-08 16:05:54,497 INFO L78 Accepts]: Start accepts. Automaton has 36056 states and 44646 transitions. Word has length 339 [2019-09-08 16:05:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:54,498 INFO L475 AbstractCegarLoop]: Abstraction has 36056 states and 44646 transitions. [2019-09-08 16:05:54,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:05:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 36056 states and 44646 transitions. [2019-09-08 16:05:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-09-08 16:05:54,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:54,528 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-08 16:05:54,528 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash -174558963, now seen corresponding path program 1 times [2019-09-08 16:05:54,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:54,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:54,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:54,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:05:54,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 62 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-08 16:05:54,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:05:54,945 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:05:54,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:55,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 3463 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:05:55,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:05:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-08 16:05:55,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:05:55,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 16:05:55,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:05:55,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:05:55,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:05:55,617 INFO L87 Difference]: Start difference. First operand 36056 states and 44646 transitions. Second operand 5 states. [2019-09-08 16:05:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:05:57,105 INFO L93 Difference]: Finished difference Result 72844 states and 91774 transitions. [2019-09-08 16:05:57,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 16:05:57,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 431 [2019-09-08 16:05:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:05:57,195 INFO L225 Difference]: With dead ends: 72844 [2019-09-08 16:05:57,195 INFO L226 Difference]: Without dead ends: 37204 [2019-09-08 16:05:57,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 431 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:05:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37204 states. [2019-09-08 16:05:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37204 to 35121. [2019-09-08 16:05:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35121 states. [2019-09-08 16:05:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35121 states to 35121 states and 43666 transitions. [2019-09-08 16:05:58,562 INFO L78 Accepts]: Start accepts. Automaton has 35121 states and 43666 transitions. Word has length 431 [2019-09-08 16:05:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:05:58,562 INFO L475 AbstractCegarLoop]: Abstraction has 35121 states and 43666 transitions. [2019-09-08 16:05:58,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:05:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 35121 states and 43666 transitions. [2019-09-08 16:05:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-08 16:05:58,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:05:58,580 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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:05:58,580 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:05:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:05:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1137154093, now seen corresponding path program 3 times [2019-09-08 16:05:58,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:05:58,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:05:58,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:58,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:05:58,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:05:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:05:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 16:05:58,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:05:58,831 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) [2019-09-08 16:05:58,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:06:00,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 16:06:00,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:06:00,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 2326 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 16:06:00,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:06:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 16:06:00,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:06:00,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 16:06:00,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 16:06:00,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 16:06:00,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:06:00,189 INFO L87 Difference]: Start difference. First operand 35121 states and 43666 transitions. Second operand 9 states. [2019-09-08 16:06:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:01,851 INFO L93 Difference]: Finished difference Result 70491 states and 89323 transitions. [2019-09-08 16:06:01,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:06:01,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 341 [2019-09-08 16:06:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:01,966 INFO L225 Difference]: With dead ends: 70491 [2019-09-08 16:06:01,967 INFO L226 Difference]: Without dead ends: 35393 [2019-09-08 16:06:02,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:06:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35393 states. [2019-09-08 16:06:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35393 to 35345. [2019-09-08 16:06:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35345 states. [2019-09-08 16:06:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35345 states to 35345 states and 44132 transitions. [2019-09-08 16:06:03,483 INFO L78 Accepts]: Start accepts. Automaton has 35345 states and 44132 transitions. Word has length 341 [2019-09-08 16:06:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:03,484 INFO L475 AbstractCegarLoop]: Abstraction has 35345 states and 44132 transitions. [2019-09-08 16:06:03,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 16:06:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 35345 states and 44132 transitions. [2019-09-08 16:06:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-08 16:06:03,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:03,509 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:03,509 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:03,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1254729237, now seen corresponding path program 1 times [2019-09-08 16:06:03,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:03,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:03,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:06:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 16:06:05,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:06:05,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:06:05,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:06:05,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:06:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:06:05,244 INFO L87 Difference]: Start difference. First operand 35345 states and 44132 transitions. Second operand 3 states. [2019-09-08 16:06:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:06,328 INFO L93 Difference]: Finished difference Result 70735 states and 88375 transitions. [2019-09-08 16:06:06,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:06:06,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 356 [2019-09-08 16:06:06,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:06,417 INFO L225 Difference]: With dead ends: 70735 [2019-09-08 16:06:06,418 INFO L226 Difference]: Without dead ends: 35413 [2019-09-08 16:06:06,472 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:06:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35413 states. [2019-09-08 16:06:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35413 to 35379. [2019-09-08 16:06:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35379 states. [2019-09-08 16:06:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35379 states to 35379 states and 44166 transitions. [2019-09-08 16:06:08,052 INFO L78 Accepts]: Start accepts. Automaton has 35379 states and 44166 transitions. Word has length 356 [2019-09-08 16:06:08,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:08,053 INFO L475 AbstractCegarLoop]: Abstraction has 35379 states and 44166 transitions. [2019-09-08 16:06:08,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:06:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 35379 states and 44166 transitions. [2019-09-08 16:06:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-08 16:06:08,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:08,072 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:08,072 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash 333353553, now seen corresponding path program 1 times [2019-09-08 16:06:08,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:08,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:08,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:06:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-08 16:06:08,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:06:08,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 16:06:08,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:06:08,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:06:08,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:06:08,359 INFO L87 Difference]: Start difference. First operand 35379 states and 44166 transitions. Second operand 6 states. [2019-09-08 16:06:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:10,612 INFO L93 Difference]: Finished difference Result 89795 states and 111701 transitions. [2019-09-08 16:06:10,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:06:10,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 358 [2019-09-08 16:06:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:10,764 INFO L225 Difference]: With dead ends: 89795 [2019-09-08 16:06:10,764 INFO L226 Difference]: Without dead ends: 54439 [2019-09-08 16:06:10,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:06:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54439 states. [2019-09-08 16:06:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54439 to 35447. [2019-09-08 16:06:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35447 states. [2019-09-08 16:06:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35447 states to 35447 states and 44268 transitions. [2019-09-08 16:06:12,576 INFO L78 Accepts]: Start accepts. Automaton has 35447 states and 44268 transitions. Word has length 358 [2019-09-08 16:06:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:12,576 INFO L475 AbstractCegarLoop]: Abstraction has 35447 states and 44268 transitions. [2019-09-08 16:06:12,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:06:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 35447 states and 44268 transitions. [2019-09-08 16:06:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-08 16:06:12,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:12,591 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-08 16:06:12,591 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1348137744, now seen corresponding path program 1 times [2019-09-08 16:06:12,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:12,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:12,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:12,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:06:12,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 50 proven. 16 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 16:06:12,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:06:12,864 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) [2019-09-08 16:06:12,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:06:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:13,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 2979 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 16:06:13,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:06:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 62 proven. 1 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 16:06:13,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:06:13,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 16:06:13,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 16:06:13,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 16:06:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:06:13,425 INFO L87 Difference]: Start difference. First operand 35447 states and 44268 transitions. Second operand 10 states. [2019-09-08 16:06:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:15,245 INFO L93 Difference]: Finished difference Result 71079 states and 90560 transitions. [2019-09-08 16:06:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 16:06:15,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 344 [2019-09-08 16:06:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:15,321 INFO L225 Difference]: With dead ends: 71079 [2019-09-08 16:06:15,321 INFO L226 Difference]: Without dead ends: 35655 [2019-09-08 16:06:15,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-08 16:06:15,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35655 states. [2019-09-08 16:06:16,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35655 to 35607. [2019-09-08 16:06:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35607 states. [2019-09-08 16:06:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35607 states to 35607 states and 44428 transitions. [2019-09-08 16:06:16,719 INFO L78 Accepts]: Start accepts. Automaton has 35607 states and 44428 transitions. Word has length 344 [2019-09-08 16:06:16,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:16,719 INFO L475 AbstractCegarLoop]: Abstraction has 35607 states and 44428 transitions. [2019-09-08 16:06:16,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 16:06:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 35607 states and 44428 transitions. [2019-09-08 16:06:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-08 16:06:16,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:16,735 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:06:16,735 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:16,735 INFO L82 PathProgramCache]: Analyzing trace with hash 637520557, now seen corresponding path program 1 times [2019-09-08 16:06:16,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:16,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:16,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:16,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:06:16,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 50 proven. 25 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 16:06:17,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:06:17,042 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:06:17,074 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:06:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:17,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 2995 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 16:06:17,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:06:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 50 proven. 25 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:06:17,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:06:17,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-08 16:06:17,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 16:06:17,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 16:06:17,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:06:17,632 INFO L87 Difference]: Start difference. First operand 35607 states and 44428 transitions. Second operand 9 states. [2019-09-08 16:06:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:19,102 INFO L93 Difference]: Finished difference Result 71335 states and 90118 transitions. [2019-09-08 16:06:19,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 16:06:19,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 347 [2019-09-08 16:06:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:19,191 INFO L225 Difference]: With dead ends: 71335 [2019-09-08 16:06:19,191 INFO L226 Difference]: Without dead ends: 35751 [2019-09-08 16:06:19,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:06:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35751 states. [2019-09-08 16:06:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35751 to 35703. [2019-09-08 16:06:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35703 states. [2019-09-08 16:06:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35703 states to 35703 states and 44524 transitions. [2019-09-08 16:06:20,643 INFO L78 Accepts]: Start accepts. Automaton has 35703 states and 44524 transitions. Word has length 347 [2019-09-08 16:06:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:20,644 INFO L475 AbstractCegarLoop]: Abstraction has 35703 states and 44524 transitions. [2019-09-08 16:06:20,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 16:06:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 35703 states and 44524 transitions. [2019-09-08 16:06:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-08 16:06:20,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:20,661 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:06:20,661 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:20,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:20,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2135530665, now seen corresponding path program 2 times [2019-09-08 16:06:20,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:20,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:20,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:20,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:06:20,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:22,541 WARN L188 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 3 [2019-09-08 16:06:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 50 proven. 36 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 16:06:22,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:06:22,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:06:22,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:06:23,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:06:23,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:06:23,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 3001 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 16:06:23,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:06:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 50 proven. 36 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:06:23,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:06:23,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 16:06:23,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 16:06:23,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 16:06:23,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:06:23,671 INFO L87 Difference]: Start difference. First operand 35703 states and 44524 transitions. Second operand 10 states. [2019-09-08 16:06:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:25,114 INFO L93 Difference]: Finished difference Result 71527 states and 90310 transitions. [2019-09-08 16:06:25,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:06:25,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 349 [2019-09-08 16:06:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:25,210 INFO L225 Difference]: With dead ends: 71527 [2019-09-08 16:06:25,210 INFO L226 Difference]: Without dead ends: 35847 [2019-09-08 16:06:25,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:06:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35847 states. [2019-09-08 16:06:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35847 to 35799. [2019-09-08 16:06:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35799 states. [2019-09-08 16:06:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35799 states to 35799 states and 44620 transitions. [2019-09-08 16:06:26,854 INFO L78 Accepts]: Start accepts. Automaton has 35799 states and 44620 transitions. Word has length 349 [2019-09-08 16:06:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:26,854 INFO L475 AbstractCegarLoop]: Abstraction has 35799 states and 44620 transitions. [2019-09-08 16:06:26,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 16:06:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 35799 states and 44620 transitions. [2019-09-08 16:06:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-08 16:06:26,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:26,870 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:06:26,870 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:26,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:26,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1385767003, now seen corresponding path program 3 times [2019-09-08 16:06:26,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:26,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:26,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:26,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:06:26,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 50 proven. 49 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 16:06:27,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:06:27,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:06:27,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 16:06:40,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 16:06:40,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:06:40,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 2768 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 16:06:40,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:06:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-08 16:06:40,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:06:40,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2019-09-08 16:06:40,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 16:06:40,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 16:06:40,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-09-08 16:06:40,609 INFO L87 Difference]: Start difference. First operand 35799 states and 44620 transitions. Second operand 16 states. [2019-09-08 16:06:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:43,735 INFO L93 Difference]: Finished difference Result 71785 states and 90575 transitions. [2019-09-08 16:06:43,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 16:06:43,736 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 351 [2019-09-08 16:06:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:43,812 INFO L225 Difference]: With dead ends: 71785 [2019-09-08 16:06:43,813 INFO L226 Difference]: Without dead ends: 36009 [2019-09-08 16:06:43,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2019-09-08 16:06:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36009 states. [2019-09-08 16:06:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36009 to 35895. [2019-09-08 16:06:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35895 states. [2019-09-08 16:06:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35895 states to 35895 states and 44690 transitions. [2019-09-08 16:06:45,303 INFO L78 Accepts]: Start accepts. Automaton has 35895 states and 44690 transitions. Word has length 351 [2019-09-08 16:06:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:45,303 INFO L475 AbstractCegarLoop]: Abstraction has 35895 states and 44690 transitions. [2019-09-08 16:06:45,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 16:06:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 35895 states and 44690 transitions. [2019-09-08 16:06:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 16:06:45,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:45,322 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-08 16:06:45,323 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:45,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1574966494, now seen corresponding path program 1 times [2019-09-08 16:06:45,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:45,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:45,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:45,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:06:45,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 50 proven. 64 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 16:06:45,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:06:45,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:06:45,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:06:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:46,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 16:06:46,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:06:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 50 proven. 64 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 16:06:46,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:06:46,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 16:06:46,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 16:06:46,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 16:06:46,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 16:06:46,235 INFO L87 Difference]: Start difference. First operand 35895 states and 44690 transitions. Second operand 12 states. [2019-09-08 16:06:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:47,885 INFO L93 Difference]: Finished difference Result 71911 states and 90642 transitions. [2019-09-08 16:06:47,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 16:06:47,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 373 [2019-09-08 16:06:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:47,982 INFO L225 Difference]: With dead ends: 71911 [2019-09-08 16:06:47,983 INFO L226 Difference]: Without dead ends: 36039 [2019-09-08 16:06:48,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 16:06:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36039 states. [2019-09-08 16:06:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36039 to 35991. [2019-09-08 16:06:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35991 states. [2019-09-08 16:06:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35991 states to 35991 states and 44786 transitions. [2019-09-08 16:06:49,501 INFO L78 Accepts]: Start accepts. Automaton has 35991 states and 44786 transitions. Word has length 373 [2019-09-08 16:06:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:49,502 INFO L475 AbstractCegarLoop]: Abstraction has 35991 states and 44786 transitions. [2019-09-08 16:06:49,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 16:06:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 35991 states and 44786 transitions. [2019-09-08 16:06:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-08 16:06:49,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:49,521 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-08 16:06:49,521 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:49,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:49,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1944286174, now seen corresponding path program 2 times [2019-09-08 16:06:49,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:49,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:49,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:49,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:06:49,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 50 proven. 81 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 16:06:50,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:06:50,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:06:50,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:06:51,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:06:51,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:06:51,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 3116 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 16:06:51,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:06:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 50 proven. 81 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:06:51,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:06:51,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-08 16:06:51,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 16:06:51,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 16:06:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:06:51,384 INFO L87 Difference]: Start difference. First operand 35991 states and 44786 transitions. Second operand 13 states. [2019-09-08 16:06:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:06:53,081 INFO L93 Difference]: Finished difference Result 72103 states and 90834 transitions. [2019-09-08 16:06:53,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 16:06:53,082 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 375 [2019-09-08 16:06:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:06:53,172 INFO L225 Difference]: With dead ends: 72103 [2019-09-08 16:06:53,173 INFO L226 Difference]: Without dead ends: 36135 [2019-09-08 16:06:53,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:06:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36135 states. [2019-09-08 16:06:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36135 to 36087. [2019-09-08 16:06:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36087 states. [2019-09-08 16:06:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36087 states to 36087 states and 44882 transitions. [2019-09-08 16:06:56,645 INFO L78 Accepts]: Start accepts. Automaton has 36087 states and 44882 transitions. Word has length 375 [2019-09-08 16:06:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:06:56,646 INFO L475 AbstractCegarLoop]: Abstraction has 36087 states and 44882 transitions. [2019-09-08 16:06:56,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 16:06:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 36087 states and 44882 transitions. [2019-09-08 16:06:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-08 16:06:56,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:06:56,667 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-08 16:06:56,668 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:06:56,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:06:56,668 INFO L82 PathProgramCache]: Analyzing trace with hash -488129126, now seen corresponding path program 3 times [2019-09-08 16:06:56,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:06:56,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:06:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:56,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:06:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:06:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:06:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 50 proven. 100 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 16:06:57,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:06:57,068 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:06:57,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:07:09,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 16:07:09,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:07:09,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 2865 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 16:07:09,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:07:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 62 proven. 1 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-08 16:07:09,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:07:09,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-09-08 16:07:09,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 16:07:09,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 16:07:09,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-09-08 16:07:09,618 INFO L87 Difference]: Start difference. First operand 36087 states and 44882 transitions. Second operand 17 states. [2019-09-08 16:07:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:07:11,640 INFO L93 Difference]: Finished difference Result 72615 states and 92011 transitions. [2019-09-08 16:07:11,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 16:07:11,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 377 [2019-09-08 16:07:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:07:11,721 INFO L225 Difference]: With dead ends: 72615 [2019-09-08 16:07:11,721 INFO L226 Difference]: Without dead ends: 36551 [2019-09-08 16:07:11,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-09-08 16:07:11,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36551 states. [2019-09-08 16:07:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36551 to 36311. [2019-09-08 16:07:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36311 states. [2019-09-08 16:07:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36311 states to 36311 states and 45170 transitions. [2019-09-08 16:07:13,239 INFO L78 Accepts]: Start accepts. Automaton has 36311 states and 45170 transitions. Word has length 377 [2019-09-08 16:07:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:07:13,240 INFO L475 AbstractCegarLoop]: Abstraction has 36311 states and 45170 transitions. [2019-09-08 16:07:13,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 16:07:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 36311 states and 45170 transitions. [2019-09-08 16:07:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-08 16:07:13,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:07:13,260 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:07:13,260 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:07:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:07:13,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1582996885, now seen corresponding path program 4 times [2019-09-08 16:07:13,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:07:13,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:07:13,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:13,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:07:13,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 50 proven. 121 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 16:07:13,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:07:13,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:07:13,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 16:07:14,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 16:07:14,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:07:14,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 3164 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 16:07:14,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:07:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 50 proven. 121 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:07:14,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:07:14,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-08 16:07:14,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 16:07:14,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 16:07:14,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 16:07:14,811 INFO L87 Difference]: Start difference. First operand 36311 states and 45170 transitions. Second operand 15 states. [2019-09-08 16:07:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:07:16,249 INFO L93 Difference]: Finished difference Result 72743 states and 91602 transitions. [2019-09-08 16:07:16,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 16:07:16,250 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 380 [2019-09-08 16:07:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:07:16,352 INFO L225 Difference]: With dead ends: 72743 [2019-09-08 16:07:16,353 INFO L226 Difference]: Without dead ends: 36455 [2019-09-08 16:07:16,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 16:07:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36455 states. [2019-09-08 16:07:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36455 to 36407. [2019-09-08 16:07:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36407 states. [2019-09-08 16:07:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36407 states to 36407 states and 45266 transitions. [2019-09-08 16:07:18,284 INFO L78 Accepts]: Start accepts. Automaton has 36407 states and 45266 transitions. Word has length 380 [2019-09-08 16:07:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:07:18,284 INFO L475 AbstractCegarLoop]: Abstraction has 36407 states and 45266 transitions. [2019-09-08 16:07:18,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 16:07:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 36407 states and 45266 transitions. [2019-09-08 16:07:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 16:07:18,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:07:18,306 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:07:18,306 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:07:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:07:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash 205215121, now seen corresponding path program 5 times [2019-09-08 16:07:18,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:07:18,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:07:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:18,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:07:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 50 proven. 144 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 16:07:18,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:07:18,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:07:18,720 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 16:07:20,222 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-08 16:07:20,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:07:20,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 16:07:20,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:07:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-08 16:07:20,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:07:20,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2019-09-08 16:07:20,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 16:07:20,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 16:07:20,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-09-08 16:07:20,341 INFO L87 Difference]: Start difference. First operand 36407 states and 45266 transitions. Second operand 18 states. [2019-09-08 16:07:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:07:23,588 INFO L93 Difference]: Finished difference Result 90580 states and 114607 transitions. [2019-09-08 16:07:23,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 16:07:23,589 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 382 [2019-09-08 16:07:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:07:23,707 INFO L225 Difference]: With dead ends: 90580 [2019-09-08 16:07:23,708 INFO L226 Difference]: Without dead ends: 54196 [2019-09-08 16:07:23,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=729, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 16:07:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54196 states. [2019-09-08 16:07:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54196 to 36513. [2019-09-08 16:07:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36513 states. [2019-09-08 16:07:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36513 states to 36513 states and 45360 transitions. [2019-09-08 16:07:25,444 INFO L78 Accepts]: Start accepts. Automaton has 36513 states and 45360 transitions. Word has length 382 [2019-09-08 16:07:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:07:25,445 INFO L475 AbstractCegarLoop]: Abstraction has 36513 states and 45360 transitions. [2019-09-08 16:07:25,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 16:07:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 36513 states and 45360 transitions. [2019-09-08 16:07:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2019-09-08 16:07:25,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:07:25,462 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 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, 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, 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, 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] [2019-09-08 16:07:25,462 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:07:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:07:25,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1679584583, now seen corresponding path program 1 times [2019-09-08 16:07:25,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:07:25,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:07:25,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:25,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:07:25,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 64 proven. 20 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-09-08 16:07:25,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:07:25,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:07:27,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:07:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:28,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 3925 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 16:07:28,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:07:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 73 proven. 20 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2019-09-08 16:07:28,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:07:28,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 16:07:28,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:07:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:07:28,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:07:28,257 INFO L87 Difference]: Start difference. First operand 36513 states and 45360 transitions. Second operand 6 states. [2019-09-08 16:07:29,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:07:29,853 INFO L93 Difference]: Finished difference Result 74197 states and 93494 transitions. [2019-09-08 16:07:29,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:07:29,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 498 [2019-09-08 16:07:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:07:29,960 INFO L225 Difference]: With dead ends: 74197 [2019-09-08 16:07:29,960 INFO L226 Difference]: Without dead ends: 38128 [2019-09-08 16:07:30,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:07:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38128 states. [2019-09-08 16:07:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38128 to 36793. [2019-09-08 16:07:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36793 states. [2019-09-08 16:07:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36793 states to 36793 states and 45836 transitions. [2019-09-08 16:07:31,837 INFO L78 Accepts]: Start accepts. Automaton has 36793 states and 45836 transitions. Word has length 498 [2019-09-08 16:07:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:07:31,838 INFO L475 AbstractCegarLoop]: Abstraction has 36793 states and 45836 transitions. [2019-09-08 16:07:31,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:07:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 36793 states and 45836 transitions. [2019-09-08 16:07:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2019-09-08 16:07:31,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:07:31,863 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-08 16:07:31,863 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:07:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:07:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash 286407947, now seen corresponding path program 1 times [2019-09-08 16:07:31,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:07:31,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:07:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:31,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:07:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 69 proven. 57 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2019-09-08 16:07:32,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:07:32,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:07:32,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:07:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:33,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 4422 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 16:07:33,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:07:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 81 proven. 57 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2019-09-08 16:07:33,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:07:33,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 16:07:33,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 16:07:33,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 16:07:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:07:33,267 INFO L87 Difference]: Start difference. First operand 36793 states and 45836 transitions. Second operand 7 states. [2019-09-08 16:07:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:07:35,166 INFO L93 Difference]: Finished difference Result 75477 states and 95595 transitions. [2019-09-08 16:07:35,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 16:07:35,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 585 [2019-09-08 16:07:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:07:35,276 INFO L225 Difference]: With dead ends: 75477 [2019-09-08 16:07:35,276 INFO L226 Difference]: Without dead ends: 39128 [2019-09-08 16:07:35,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:07:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39128 states. [2019-09-08 16:07:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39128 to 37073. [2019-09-08 16:07:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37073 states. [2019-09-08 16:07:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37073 states to 37073 states and 46312 transitions. [2019-09-08 16:07:37,370 INFO L78 Accepts]: Start accepts. Automaton has 37073 states and 46312 transitions. Word has length 585 [2019-09-08 16:07:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:07:37,370 INFO L475 AbstractCegarLoop]: Abstraction has 37073 states and 46312 transitions. [2019-09-08 16:07:37,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 16:07:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 37073 states and 46312 transitions. [2019-09-08 16:07:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-09-08 16:07:37,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:07:37,403 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:37,403 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:07:37,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:07:37,403 INFO L82 PathProgramCache]: Analyzing trace with hash -22089352, now seen corresponding path program 1 times [2019-09-08 16:07:37,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:07:37,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:07:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:37,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:07:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 86 proven. 112 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2019-09-08 16:07:38,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:07:38,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:07:38,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:07:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:38,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 4996 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 16:07:38,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:07:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 101 proven. 112 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2019-09-08 16:07:39,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:07:39,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 16:07:39,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 16:07:39,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 16:07:39,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:07:39,062 INFO L87 Difference]: Start difference. First operand 37073 states and 46312 transitions. Second operand 8 states. [2019-09-08 16:07:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:07:42,444 INFO L93 Difference]: Finished difference Result 76757 states and 97696 transitions. [2019-09-08 16:07:42,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 16:07:42,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 691 [2019-09-08 16:07:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:07:42,561 INFO L225 Difference]: With dead ends: 76757 [2019-09-08 16:07:42,561 INFO L226 Difference]: Without dead ends: 40128 [2019-09-08 16:07:42,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:07:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40128 states. [2019-09-08 16:07:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40128 to 37353. [2019-09-08 16:07:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37353 states. [2019-09-08 16:07:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37353 states to 37353 states and 46788 transitions. [2019-09-08 16:07:44,607 INFO L78 Accepts]: Start accepts. Automaton has 37353 states and 46788 transitions. Word has length 691 [2019-09-08 16:07:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:07:44,608 INFO L475 AbstractCegarLoop]: Abstraction has 37353 states and 46788 transitions. [2019-09-08 16:07:44,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 16:07:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 37353 states and 46788 transitions. [2019-09-08 16:07:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-08 16:07:44,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:07:44,639 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:44,639 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:07:44,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:07:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1996180649, now seen corresponding path program 1 times [2019-09-08 16:07:44,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:07:44,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:07:44,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:44,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:07:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-08 16:07:44,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:07:44,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 16:07:44,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 16:07:44,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 16:07:44,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:07:44,925 INFO L87 Difference]: Start difference. First operand 37353 states and 46788 transitions. Second operand 9 states. [2019-09-08 16:07:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:07:48,139 INFO L93 Difference]: Finished difference Result 92868 states and 117104 transitions. [2019-09-08 16:07:48,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 16:07:48,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 496 [2019-09-08 16:07:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:07:48,270 INFO L225 Difference]: With dead ends: 92868 [2019-09-08 16:07:48,270 INFO L226 Difference]: Without dead ends: 55959 [2019-09-08 16:07:48,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-08 16:07:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55959 states. [2019-09-08 16:07:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55959 to 36924. [2019-09-08 16:07:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36924 states. [2019-09-08 16:07:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36924 states to 36924 states and 46116 transitions. [2019-09-08 16:07:50,147 INFO L78 Accepts]: Start accepts. Automaton has 36924 states and 46116 transitions. Word has length 496 [2019-09-08 16:07:50,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:07:50,148 INFO L475 AbstractCegarLoop]: Abstraction has 36924 states and 46116 transitions. [2019-09-08 16:07:50,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 16:07:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 36924 states and 46116 transitions. [2019-09-08 16:07:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2019-09-08 16:07:50,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:07:50,178 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:50,178 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:07:50,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:07:50,179 INFO L82 PathProgramCache]: Analyzing trace with hash 623682844, now seen corresponding path program 1 times [2019-09-08 16:07:50,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:07:50,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:07:50,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:50,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:07:50,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 79 proven. 185 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2019-09-08 16:07:51,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:07:51,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:07:51,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:07:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:51,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 5366 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 16:07:51,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:07:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 97 proven. 185 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-09-08 16:07:52,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:07:52,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-08 16:07:52,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 16:07:52,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 16:07:52,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:07:52,389 INFO L87 Difference]: Start difference. First operand 36924 states and 46116 transitions. Second operand 9 states. [2019-09-08 16:07:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:07:56,123 INFO L93 Difference]: Finished difference Result 76633 states and 97429 transitions. [2019-09-08 16:07:56,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 16:07:56,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 754 [2019-09-08 16:07:56,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:07:56,219 INFO L225 Difference]: With dead ends: 76633 [2019-09-08 16:07:56,220 INFO L226 Difference]: Without dead ends: 40153 [2019-09-08 16:07:56,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:07:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40153 states. [2019-09-08 16:07:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40153 to 37204. [2019-09-08 16:07:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37204 states. [2019-09-08 16:07:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 46592 transitions. [2019-09-08 16:07:58,013 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 46592 transitions. Word has length 754 [2019-09-08 16:07:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:07:58,014 INFO L475 AbstractCegarLoop]: Abstraction has 37204 states and 46592 transitions. [2019-09-08 16:07:58,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 16:07:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 46592 transitions. [2019-09-08 16:07:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-09-08 16:07:58,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:07:58,051 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 8, 8, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:58,052 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:07:58,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:07:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1498858127, now seen corresponding path program 1 times [2019-09-08 16:07:58,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:07:58,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:07:58,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:58,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:07:58,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:07:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 94 proven. 4 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2019-09-08 16:07:58,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:07:58,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:07:58,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:07:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:07:59,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 4814 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:07:59,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:08:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-09-08 16:08:00,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:08:00,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-09-08 16:08:00,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 16:08:00,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 16:08:00,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:08:00,136 INFO L87 Difference]: Start difference. First operand 37204 states and 46592 transitions. Second operand 10 states. [2019-09-08 16:08:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:02,186 INFO L93 Difference]: Finished difference Result 74928 states and 94630 transitions. [2019-09-08 16:08:02,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 16:08:02,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 683 [2019-09-08 16:08:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:02,268 INFO L225 Difference]: With dead ends: 74928 [2019-09-08 16:08:02,268 INFO L226 Difference]: Without dead ends: 38112 [2019-09-08 16:08:02,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:08:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38112 states. [2019-09-08 16:08:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38112 to 37526. [2019-09-08 16:08:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37526 states. [2019-09-08 16:08:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37526 states to 37526 states and 46975 transitions. [2019-09-08 16:08:04,005 INFO L78 Accepts]: Start accepts. Automaton has 37526 states and 46975 transitions. Word has length 683 [2019-09-08 16:08:04,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:04,006 INFO L475 AbstractCegarLoop]: Abstraction has 37526 states and 46975 transitions. [2019-09-08 16:08:04,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 16:08:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 37526 states and 46975 transitions. [2019-09-08 16:08:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2019-09-08 16:08:04,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:04,044 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-08 16:08:04,044 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:04,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:04,045 INFO L82 PathProgramCache]: Analyzing trace with hash -941125690, now seen corresponding path program 1 times [2019-09-08 16:08:04,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:04,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:04,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:04,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:04,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1736 backedges. 84 proven. 276 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2019-09-08 16:08:04,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:04,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:08:04,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:05,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 5839 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 16:08:05,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:08:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1736 backedges. 105 proven. 276 refuted. 0 times theorem prover too weak. 1355 trivial. 0 not checked. [2019-09-08 16:08:06,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:08:06,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 16:08:06,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 16:08:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 16:08:06,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:08:06,187 INFO L87 Difference]: Start difference. First operand 37526 states and 46975 transitions. Second operand 10 states. [2019-09-08 16:08:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:09,108 INFO L93 Difference]: Finished difference Result 78872 states and 100749 transitions. [2019-09-08 16:08:09,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:08:09,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 839 [2019-09-08 16:08:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:09,287 INFO L225 Difference]: With dead ends: 78872 [2019-09-08 16:08:09,287 INFO L226 Difference]: Without dead ends: 41790 [2019-09-08 16:08:09,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 839 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:08:09,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41790 states. [2019-09-08 16:08:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41790 to 37806. [2019-09-08 16:08:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37806 states. [2019-09-08 16:08:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37806 states to 37806 states and 47451 transitions. [2019-09-08 16:08:13,042 INFO L78 Accepts]: Start accepts. Automaton has 37806 states and 47451 transitions. Word has length 839 [2019-09-08 16:08:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:13,043 INFO L475 AbstractCegarLoop]: Abstraction has 37806 states and 47451 transitions. [2019-09-08 16:08:13,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 16:08:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 37806 states and 47451 transitions. [2019-09-08 16:08:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2019-09-08 16:08:13,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:13,082 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,082 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:13,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:13,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1890790207, now seen corresponding path program 1 times [2019-09-08 16:08:13,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:13,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:13,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:13,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:13,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 94 proven. 4 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-09-08 16:08:13,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:13,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:08:13,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:14,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 4991 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:08:14,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:08:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2019-09-08 16:08:14,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:08:14,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2019-09-08 16:08:14,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 16:08:14,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 16:08:14,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 16:08:14,526 INFO L87 Difference]: Start difference. First operand 37806 states and 47451 transitions. Second operand 4 states. [2019-09-08 16:08:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:17,947 INFO L93 Difference]: Finished difference Result 75845 states and 96145 transitions. [2019-09-08 16:08:17,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:08:17,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 715 [2019-09-08 16:08:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:18,052 INFO L225 Difference]: With dead ends: 75845 [2019-09-08 16:08:18,052 INFO L226 Difference]: Without dead ends: 38062 [2019-09-08 16:08:18,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38062 states. [2019-09-08 16:08:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38062 to 37998. [2019-09-08 16:08:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37998 states. [2019-09-08 16:08:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37998 states to 37998 states and 47643 transitions. [2019-09-08 16:08:19,838 INFO L78 Accepts]: Start accepts. Automaton has 37998 states and 47643 transitions. Word has length 715 [2019-09-08 16:08:19,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:19,839 INFO L475 AbstractCegarLoop]: Abstraction has 37998 states and 47643 transitions. [2019-09-08 16:08:19,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 16:08:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 37998 states and 47643 transitions. [2019-09-08 16:08:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2019-09-08 16:08:19,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:19,873 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,873 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:19,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:19,874 INFO L82 PathProgramCache]: Analyzing trace with hash 231492221, now seen corresponding path program 1 times [2019-09-08 16:08:19,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:19,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:19,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:19,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:19,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 94 proven. 4 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-09-08 16:08:20,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:20,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:08:20,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:21,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 4994 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:08:21,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:08:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2019-09-08 16:08:21,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:08:21,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2019-09-08 16:08:21,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 16:08:21,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 16:08:21,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 16:08:21,717 INFO L87 Difference]: Start difference. First operand 37998 states and 47643 transitions. Second operand 4 states. [2019-09-08 16:08:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:23,541 INFO L93 Difference]: Finished difference Result 76357 states and 96529 transitions. [2019-09-08 16:08:23,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:08:23,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 715 [2019-09-08 16:08:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:23,632 INFO L225 Difference]: With dead ends: 76357 [2019-09-08 16:08:23,633 INFO L226 Difference]: Without dead ends: 38382 [2019-09-08 16:08:23,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:08:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38382 states. [2019-09-08 16:08:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38382 to 38126. [2019-09-08 16:08:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38126 states. [2019-09-08 16:08:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38126 states to 38126 states and 47771 transitions. [2019-09-08 16:08:25,404 INFO L78 Accepts]: Start accepts. Automaton has 38126 states and 47771 transitions. Word has length 715 [2019-09-08 16:08:25,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:25,405 INFO L475 AbstractCegarLoop]: Abstraction has 38126 states and 47771 transitions. [2019-09-08 16:08:25,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 16:08:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 38126 states and 47771 transitions. [2019-09-08 16:08:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2019-09-08 16:08:25,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:25,440 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,440 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:25,440 INFO L82 PathProgramCache]: Analyzing trace with hash 934159906, now seen corresponding path program 1 times [2019-09-08 16:08:25,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:25,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:25,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:25,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 60 proven. 169 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2019-09-08 16:08:26,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:26,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:08:26,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:27,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 5094 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 16:08:27,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:08:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 198 proven. 1 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:08:27,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:08:27,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-09-08 16:08:27,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 16:08:27,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 16:08:27,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-09-08 16:08:27,554 INFO L87 Difference]: Start difference. First operand 38126 states and 47771 transitions. Second operand 19 states. [2019-09-08 16:08:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:29,650 INFO L93 Difference]: Finished difference Result 76613 states and 97201 transitions. [2019-09-08 16:08:29,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 16:08:29,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 736 [2019-09-08 16:08:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:29,742 INFO L225 Difference]: With dead ends: 76613 [2019-09-08 16:08:29,742 INFO L226 Difference]: Without dead ends: 38454 [2019-09-08 16:08:29,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2019-09-08 16:08:29,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38454 states. [2019-09-08 16:08:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38454 to 38250. [2019-09-08 16:08:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38250 states. [2019-09-08 16:08:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38250 states to 38250 states and 47895 transitions. [2019-09-08 16:08:31,545 INFO L78 Accepts]: Start accepts. Automaton has 38250 states and 47895 transitions. Word has length 736 [2019-09-08 16:08:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:31,545 INFO L475 AbstractCegarLoop]: Abstraction has 38250 states and 47895 transitions. [2019-09-08 16:08:31,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 16:08:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 38250 states and 47895 transitions. [2019-09-08 16:08:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-09-08 16:08:31,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:31,579 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,579 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:31,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:31,580 INFO L82 PathProgramCache]: Analyzing trace with hash -134023039, now seen corresponding path program 1 times [2019-09-08 16:08:31,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:31,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:31,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:31,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:31,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 50 proven. 196 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2019-09-08 16:08:32,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:32,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:08:32,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:33,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 4755 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 16:08:33,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:08:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 127 proven. 3 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2019-09-08 16:08:33,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:08:33,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 21 [2019-09-08 16:08:33,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 16:08:33,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 16:08:33,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-09-08 16:08:33,299 INFO L87 Difference]: Start difference. First operand 38250 states and 47895 transitions. Second operand 21 states. [2019-09-08 16:08:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:36,971 INFO L93 Difference]: Finished difference Result 76939 states and 97560 transitions. [2019-09-08 16:08:36,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 16:08:36,971 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 652 [2019-09-08 16:08:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:37,072 INFO L225 Difference]: With dead ends: 76939 [2019-09-08 16:08:37,072 INFO L226 Difference]: Without dead ends: 38656 [2019-09-08 16:08:37,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2019-09-08 16:08:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38656 states. [2019-09-08 16:08:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38656 to 38374. [2019-09-08 16:08:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38374 states. [2019-09-08 16:08:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38374 states to 38374 states and 48019 transitions. [2019-09-08 16:08:38,927 INFO L78 Accepts]: Start accepts. Automaton has 38374 states and 48019 transitions. Word has length 652 [2019-09-08 16:08:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:38,928 INFO L475 AbstractCegarLoop]: Abstraction has 38374 states and 48019 transitions. [2019-09-08 16:08:38,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 16:08:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 38374 states and 48019 transitions. [2019-09-08 16:08:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2019-09-08 16:08:38,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:38,967 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,968 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:38,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:38,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1027322643, now seen corresponding path program 1 times [2019-09-08 16:08:38,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:38,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:38,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:38,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:38,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 60 proven. 225 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-08 16:08:39,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:39,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:08:39,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:40,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 5021 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 16:08:40,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:08:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 186 proven. 6 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2019-09-08 16:08:40,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:08:40,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2019-09-08 16:08:40,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 16:08:40,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 16:08:40,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-08 16:08:40,936 INFO L87 Difference]: Start difference. First operand 38374 states and 48019 transitions. Second operand 23 states. [2019-09-08 16:08:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:43,035 INFO L93 Difference]: Finished difference Result 77265 states and 97919 transitions. [2019-09-08 16:08:43,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 16:08:43,035 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 721 [2019-09-08 16:08:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:43,138 INFO L225 Difference]: With dead ends: 77265 [2019-09-08 16:08:43,139 INFO L226 Difference]: Without dead ends: 38858 [2019-09-08 16:08:43,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2019-09-08 16:08:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38858 states. [2019-09-08 16:08:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38858 to 38498. [2019-09-08 16:08:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38498 states. [2019-09-08 16:08:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38498 states to 38498 states and 48143 transitions. [2019-09-08 16:08:44,975 INFO L78 Accepts]: Start accepts. Automaton has 38498 states and 48143 transitions. Word has length 721 [2019-09-08 16:08:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:44,975 INFO L475 AbstractCegarLoop]: Abstraction has 38498 states and 48143 transitions. [2019-09-08 16:08:44,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 16:08:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 38498 states and 48143 transitions. [2019-09-08 16:08:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-09-08 16:08:45,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:45,011 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,011 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:45,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1442079060, now seen corresponding path program 1 times [2019-09-08 16:08:45,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:45,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:45,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:45,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:45,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-09-08 16:08:45,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:45,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:08:45,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:46,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 4808 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:08:46,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:08:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-09-08 16:08:46,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:08:46,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 16:08:46,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:08:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:08:46,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:08:46,898 INFO L87 Difference]: Start difference. First operand 38498 states and 48143 transitions. Second operand 6 states. [2019-09-08 16:08:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:50,272 INFO L93 Difference]: Finished difference Result 70865 states and 88788 transitions. [2019-09-08 16:08:50,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 16:08:50,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 668 [2019-09-08 16:08:50,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:50,358 INFO L225 Difference]: With dead ends: 70865 [2019-09-08 16:08:50,358 INFO L226 Difference]: Without dead ends: 32390 [2019-09-08 16:08:50,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:08:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32390 states. [2019-09-08 16:08:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32390 to 32346. [2019-09-08 16:08:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32346 states. [2019-09-08 16:08:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32346 states to 32346 states and 40533 transitions. [2019-09-08 16:08:51,922 INFO L78 Accepts]: Start accepts. Automaton has 32346 states and 40533 transitions. Word has length 668 [2019-09-08 16:08:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:51,923 INFO L475 AbstractCegarLoop]: Abstraction has 32346 states and 40533 transitions. [2019-09-08 16:08:51,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:08:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 32346 states and 40533 transitions. [2019-09-08 16:08:51,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2019-09-08 16:08:51,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:51,954 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,955 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:51,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:51,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1419422311, now seen corresponding path program 2 times [2019-09-08 16:08:51,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:51,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:51,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:51,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:08:51,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 60 proven. 256 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2019-09-08 16:08:52,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:52,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:08:52,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:08:54,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:08:54,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:08:54,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 5115 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 16:08:54,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:08:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 186 proven. 10 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-08 16:08:54,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:08:54,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8] total 25 [2019-09-08 16:08:54,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 16:08:54,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 16:08:54,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2019-09-08 16:08:54,648 INFO L87 Difference]: Start difference. First operand 32346 states and 40533 transitions. Second operand 25 states. [2019-09-08 16:08:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:08:56,860 INFO L93 Difference]: Finished difference Result 65182 states and 82717 transitions. [2019-09-08 16:08:56,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 16:08:56,861 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 727 [2019-09-08 16:08:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:08:56,942 INFO L225 Difference]: With dead ends: 65182 [2019-09-08 16:08:56,943 INFO L226 Difference]: Without dead ends: 32811 [2019-09-08 16:08:56,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2019-09-08 16:08:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32811 states. [2019-09-08 16:08:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32811 to 32444. [2019-09-08 16:08:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32444 states. [2019-09-08 16:08:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32444 states to 32444 states and 40631 transitions. [2019-09-08 16:08:58,484 INFO L78 Accepts]: Start accepts. Automaton has 32444 states and 40631 transitions. Word has length 727 [2019-09-08 16:08:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:08:58,485 INFO L475 AbstractCegarLoop]: Abstraction has 32444 states and 40631 transitions. [2019-09-08 16:08:58,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 16:08:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 32444 states and 40631 transitions. [2019-09-08 16:08:58,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2019-09-08 16:08:58,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:08:58,515 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,515 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:08:58,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:08:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash -264568853, now seen corresponding path program 3 times [2019-09-08 16:08:58,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:08:58,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:08:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:58,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:08:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:08:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:08:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 60 proven. 289 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2019-09-08 16:08:59,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:08:59,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:08:59,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 16:09:12,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 16:09:12,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:09:12,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 2901 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 16:09:12,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:09:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 156 proven. 3 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2019-09-08 16:09:13,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:09:13,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 25 [2019-09-08 16:09:13,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 16:09:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 16:09:13,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-09-08 16:09:13,137 INFO L87 Difference]: Start difference. First operand 32444 states and 40631 transitions. Second operand 25 states. [2019-09-08 16:09:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:09:15,418 INFO L93 Difference]: Finished difference Result 65424 states and 83613 transitions. [2019-09-08 16:09:15,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 16:09:15,418 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 727 [2019-09-08 16:09:15,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:09:15,805 INFO L225 Difference]: With dead ends: 65424 [2019-09-08 16:09:15,806 INFO L226 Difference]: Without dead ends: 33003 [2019-09-08 16:09:15,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 722 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2019-09-08 16:09:15,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33003 states. [2019-09-08 16:09:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33003 to 32574. [2019-09-08 16:09:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32574 states. [2019-09-08 16:09:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32574 states to 32574 states and 40817 transitions. [2019-09-08 16:09:17,318 INFO L78 Accepts]: Start accepts. Automaton has 32574 states and 40817 transitions. Word has length 727 [2019-09-08 16:09:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:09:17,319 INFO L475 AbstractCegarLoop]: Abstraction has 32574 states and 40817 transitions. [2019-09-08 16:09:17,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 16:09:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 32574 states and 40817 transitions. [2019-09-08 16:09:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2019-09-08 16:09:17,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:09:17,347 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:17,347 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:09:17,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:09:17,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1782089113, now seen corresponding path program 4 times [2019-09-08 16:09:17,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:09:17,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:09:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:09:17,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:09:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:09:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:09:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 60 proven. 324 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2019-09-08 16:09:17,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:09:17,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:09:18,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 16:09:31,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 16:09:31,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:09:31,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 5123 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 16:09:31,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:09:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 69 proven. 324 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-09-08 16:09:31,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:09:31,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-08 16:09:31,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 16:09:31,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 16:09:31,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 16:09:31,344 INFO L87 Difference]: Start difference. First operand 32574 states and 40817 transitions. Second operand 22 states. [2019-09-08 16:09:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:09:32,797 INFO L93 Difference]: Finished difference Result 65236 states and 82635 transitions. [2019-09-08 16:09:32,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 16:09:32,797 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 731 [2019-09-08 16:09:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:09:32,881 INFO L225 Difference]: With dead ends: 65236 [2019-09-08 16:09:32,881 INFO L226 Difference]: Without dead ends: 32685 [2019-09-08 16:09:32,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 16:09:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32685 states. [2019-09-08 16:09:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32685 to 32648. [2019-09-08 16:09:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32648 states. [2019-09-08 16:09:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32648 states to 32648 states and 40891 transitions. [2019-09-08 16:09:34,728 INFO L78 Accepts]: Start accepts. Automaton has 32648 states and 40891 transitions. Word has length 731 [2019-09-08 16:09:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:09:34,729 INFO L475 AbstractCegarLoop]: Abstraction has 32648 states and 40891 transitions. [2019-09-08 16:09:34,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 16:09:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 32648 states and 40891 transitions. [2019-09-08 16:09:34,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2019-09-08 16:09:34,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:09:34,759 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:34,759 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:09:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:09:34,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1431858823, now seen corresponding path program 2 times [2019-09-08 16:09:34,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:09:34,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:09:34,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:09:34,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:09:34,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:09:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:09:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 50 proven. 361 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-09-08 16:09:35,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:09:35,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:09:35,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:09:36,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:09:36,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:09:36,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 4793 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 16:09:36,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:09:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 127 proven. 15 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:09:37,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:09:37,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 29 [2019-09-08 16:09:37,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 16:09:37,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 16:09:37,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=552, Unknown=0, NotChecked=0, Total=812 [2019-09-08 16:09:37,315 INFO L87 Difference]: Start difference. First operand 32648 states and 40891 transitions. Second operand 29 states. [2019-09-08 16:09:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:09:39,067 INFO L93 Difference]: Finished difference Result 65815 states and 83490 transitions. [2019-09-08 16:09:39,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 16:09:39,068 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 664 [2019-09-08 16:09:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:09:39,155 INFO L225 Difference]: With dead ends: 65815 [2019-09-08 16:09:39,155 INFO L226 Difference]: Without dead ends: 33142 [2019-09-08 16:09:39,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=876, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 16:09:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33142 states. [2019-09-08 16:09:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33142 to 32746. [2019-09-08 16:09:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32746 states. [2019-09-08 16:09:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32746 states to 32746 states and 40989 transitions. [2019-09-08 16:09:41,004 INFO L78 Accepts]: Start accepts. Automaton has 32746 states and 40989 transitions. Word has length 664 [2019-09-08 16:09:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:09:41,004 INFO L475 AbstractCegarLoop]: Abstraction has 32746 states and 40989 transitions. [2019-09-08 16:09:41,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 16:09:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 32746 states and 40989 transitions. [2019-09-08 16:09:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2019-09-08 16:09:41,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:09:41,034 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 9, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:41,034 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:09:41,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:09:41,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2136833672, now seen corresponding path program 3 times [2019-09-08 16:09:41,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:09:41,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:09:41,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:09:41,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:09:41,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:09:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:09:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 101 proven. 32 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2019-09-08 16:09:42,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:09:42,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:09:42,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 16:09:55,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 16:09:55,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:09:55,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 2901 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 16:09:55,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:09:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 124 proven. 1 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-09-08 16:09:55,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:09:55,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-09-08 16:09:55,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 16:09:55,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 16:09:55,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-08 16:09:55,972 INFO L87 Difference]: Start difference. First operand 32746 states and 40989 transitions. Second operand 12 states. [2019-09-08 16:09:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:09:59,277 INFO L93 Difference]: Finished difference Result 68141 states and 88233 transitions. [2019-09-08 16:09:59,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 16:09:59,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 671 [2019-09-08 16:09:59,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:09:59,376 INFO L225 Difference]: With dead ends: 68141 [2019-09-08 16:09:59,376 INFO L226 Difference]: Without dead ends: 35418 [2019-09-08 16:09:59,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 668 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2019-09-08 16:09:59,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35418 states. [2019-09-08 16:10:01,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35418 to 33082. [2019-09-08 16:10:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33082 states. [2019-09-08 16:10:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33082 states to 33082 states and 41645 transitions. [2019-09-08 16:10:01,342 INFO L78 Accepts]: Start accepts. Automaton has 33082 states and 41645 transitions. Word has length 671 [2019-09-08 16:10:01,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:01,343 INFO L475 AbstractCegarLoop]: Abstraction has 33082 states and 41645 transitions. [2019-09-08 16:10:01,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 16:10:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 33082 states and 41645 transitions. [2019-09-08 16:10:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2019-09-08 16:10:01,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:01,413 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 8, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:01,414 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:01,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1334402280, now seen corresponding path program 5 times [2019-09-08 16:10:01,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:01,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:01,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:10:01,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2019-09-08 16:10:02,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:10:02,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:10:02,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:10:02,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:10:02,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:02,978 INFO L87 Difference]: Start difference. First operand 33082 states and 41645 transitions. Second operand 3 states. [2019-09-08 16:10:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:04,517 INFO L93 Difference]: Finished difference Result 65644 states and 83115 transitions. [2019-09-08 16:10:04,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:10:04,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 740 [2019-09-08 16:10:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:04,608 INFO L225 Difference]: With dead ends: 65644 [2019-09-08 16:10:04,608 INFO L226 Difference]: Without dead ends: 33034 [2019-09-08 16:10:04,659 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 16:10:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33034 states. [2019-09-08 16:10:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33034 to 33034. [2019-09-08 16:10:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33034 states. [2019-09-08 16:10:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33034 states to 33034 states and 41501 transitions. [2019-09-08 16:10:06,700 INFO L78 Accepts]: Start accepts. Automaton has 33034 states and 41501 transitions. Word has length 740 [2019-09-08 16:10:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:06,701 INFO L475 AbstractCegarLoop]: Abstraction has 33034 states and 41501 transitions. [2019-09-08 16:10:06,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:10:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 33034 states and 41501 transitions. [2019-09-08 16:10:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2019-09-08 16:10:06,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:06,736 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 8, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:06,737 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:06,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:06,737 INFO L82 PathProgramCache]: Analyzing trace with hash -787347672, now seen corresponding path program 1 times [2019-09-08 16:10:06,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:06,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:06,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:06,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:10:06,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 116 proven. 66 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2019-09-08 16:10:07,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:07,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:07,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:08,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 5233 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 16:10:08,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 186 proven. 21 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-09-08 16:10:09,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:09,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2019-09-08 16:10:09,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 16:10:09,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 16:10:09,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-08 16:10:09,278 INFO L87 Difference]: Start difference. First operand 33034 states and 41501 transitions. Second operand 17 states. [2019-09-08 16:10:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:11,536 INFO L93 Difference]: Finished difference Result 67363 states and 87267 transitions. [2019-09-08 16:10:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 16:10:11,536 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 740 [2019-09-08 16:10:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:11,631 INFO L225 Difference]: With dead ends: 67363 [2019-09-08 16:10:11,631 INFO L226 Difference]: Without dead ends: 34304 [2019-09-08 16:10:11,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 16:10:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34304 states. [2019-09-08 16:10:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34304 to 33114. [2019-09-08 16:10:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33114 states. [2019-09-08 16:10:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33114 states to 33114 states and 41525 transitions. [2019-09-08 16:10:13,545 INFO L78 Accepts]: Start accepts. Automaton has 33114 states and 41525 transitions. Word has length 740 [2019-09-08 16:10:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:13,546 INFO L475 AbstractCegarLoop]: Abstraction has 33114 states and 41525 transitions. [2019-09-08 16:10:13,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 16:10:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 33114 states and 41525 transitions. [2019-09-08 16:10:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2019-09-08 16:10:13,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:13,578 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 10, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:13,578 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:13,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:13,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1289899038, now seen corresponding path program 1 times [2019-09-08 16:10:13,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:13,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:13,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:13,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 94 proven. 4 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2019-09-08 16:10:14,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:14,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:14,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:15,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 5408 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 16:10:15,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 198 proven. 28 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2019-09-08 16:10:15,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:15,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 11] total 12 [2019-09-08 16:10:15,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 16:10:15,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 16:10:15,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-09-08 16:10:15,859 INFO L87 Difference]: Start difference. First operand 33114 states and 41525 transitions. Second operand 12 states. [2019-09-08 16:10:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:17,721 INFO L93 Difference]: Finished difference Result 66917 states and 84625 transitions. [2019-09-08 16:10:17,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 16:10:17,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 764 [2019-09-08 16:10:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:17,810 INFO L225 Difference]: With dead ends: 66917 [2019-09-08 16:10:17,810 INFO L226 Difference]: Without dead ends: 33778 [2019-09-08 16:10:17,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 756 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-09-08 16:10:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33778 states. [2019-09-08 16:10:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33778 to 32802. [2019-09-08 16:10:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32802 states. [2019-09-08 16:10:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32802 states to 32802 states and 40917 transitions. [2019-09-08 16:10:19,444 INFO L78 Accepts]: Start accepts. Automaton has 32802 states and 40917 transitions. Word has length 764 [2019-09-08 16:10:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:19,444 INFO L475 AbstractCegarLoop]: Abstraction has 32802 states and 40917 transitions. [2019-09-08 16:10:19,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 16:10:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 32802 states and 40917 transitions. [2019-09-08 16:10:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2019-09-08 16:10:19,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:19,475 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 10, 8, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:19,475 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:19,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:19,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2082985675, now seen corresponding path program 1 times [2019-09-08 16:10:19,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:19,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:19,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 94 proven. 36 refuted. 0 times theorem prover too weak. 951 trivial. 0 not checked. [2019-09-08 16:10:24,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:24,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:24,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:24,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 5414 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 16:10:24,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 198 proven. 36 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2019-09-08 16:10:25,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:25,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-08 16:10:25,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 16:10:25,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 16:10:25,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2019-09-08 16:10:25,488 INFO L87 Difference]: Start difference. First operand 32802 states and 40917 transitions. Second operand 22 states. [2019-09-08 16:10:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:27,178 INFO L93 Difference]: Finished difference Result 65803 states and 82730 transitions. [2019-09-08 16:10:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 16:10:27,178 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 765 [2019-09-08 16:10:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:27,266 INFO L225 Difference]: With dead ends: 65803 [2019-09-08 16:10:27,266 INFO L226 Difference]: Without dead ends: 33420 [2019-09-08 16:10:27,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=373, Invalid=557, Unknown=0, NotChecked=0, Total=930 [2019-09-08 16:10:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33420 states. [2019-09-08 16:10:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33420 to 32826. [2019-09-08 16:10:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32826 states. [2019-09-08 16:10:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32826 states to 32826 states and 40941 transitions. [2019-09-08 16:10:29,061 INFO L78 Accepts]: Start accepts. Automaton has 32826 states and 40941 transitions. Word has length 765 [2019-09-08 16:10:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:29,061 INFO L475 AbstractCegarLoop]: Abstraction has 32826 states and 40941 transitions. [2019-09-08 16:10:29,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 16:10:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 32826 states and 40941 transitions. [2019-09-08 16:10:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2019-09-08 16:10:29,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:29,093 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 10, 9, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:29,093 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:29,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:29,094 INFO L82 PathProgramCache]: Analyzing trace with hash -773226213, now seen corresponding path program 1 times [2019-09-08 16:10:29,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:29,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:29,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:29,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:29,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 94 proven. 45 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-08 16:10:30,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:30,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:30,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:31,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 5323 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 16:10:31,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 186 proven. 45 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-09-08 16:10:31,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:31,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-09-08 16:10:31,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 16:10:31,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 16:10:31,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2019-09-08 16:10:31,427 INFO L87 Difference]: Start difference. First operand 32826 states and 40941 transitions. Second operand 24 states. [2019-09-08 16:10:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:33,252 INFO L93 Difference]: Finished difference Result 65917 states and 82872 transitions. [2019-09-08 16:10:33,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 16:10:33,253 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 745 [2019-09-08 16:10:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:33,327 INFO L225 Difference]: With dead ends: 65917 [2019-09-08 16:10:33,327 INFO L226 Difference]: Without dead ends: 33510 [2019-09-08 16:10:33,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=449, Invalid=673, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 16:10:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33510 states. [2019-09-08 16:10:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33510 to 32850. [2019-09-08 16:10:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32850 states. [2019-09-08 16:10:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32850 states to 32850 states and 40965 transitions. [2019-09-08 16:10:34,937 INFO L78 Accepts]: Start accepts. Automaton has 32850 states and 40965 transitions. Word has length 745 [2019-09-08 16:10:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:34,937 INFO L475 AbstractCegarLoop]: Abstraction has 32850 states and 40965 transitions. [2019-09-08 16:10:34,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 16:10:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 32850 states and 40965 transitions. [2019-09-08 16:10:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2019-09-08 16:10:34,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:34,970 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 10, 10, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:34,970 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1464195470, now seen corresponding path program 2 times [2019-09-08 16:10:34,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:34,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:34,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:34,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:34,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 94 proven. 55 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-08 16:10:37,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:37,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:37,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:10:38,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:10:38,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:10:38,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 5329 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 16:10:38,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 186 proven. 55 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-09-08 16:10:38,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:38,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-09-08 16:10:38,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 16:10:38,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 16:10:38,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=394, Unknown=0, NotChecked=0, Total=650 [2019-09-08 16:10:38,715 INFO L87 Difference]: Start difference. First operand 32850 states and 40965 transitions. Second operand 26 states. [2019-09-08 16:10:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:40,558 INFO L93 Difference]: Finished difference Result 66031 states and 83014 transitions. [2019-09-08 16:10:40,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 16:10:40,559 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 746 [2019-09-08 16:10:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:40,649 INFO L225 Difference]: With dead ends: 66031 [2019-09-08 16:10:40,649 INFO L226 Difference]: Without dead ends: 33600 [2019-09-08 16:10:40,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=532, Invalid=800, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 16:10:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33600 states. [2019-09-08 16:10:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33600 to 32874. [2019-09-08 16:10:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32874 states. [2019-09-08 16:10:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32874 states to 32874 states and 40989 transitions. [2019-09-08 16:10:42,459 INFO L78 Accepts]: Start accepts. Automaton has 32874 states and 40989 transitions. Word has length 746 [2019-09-08 16:10:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:42,460 INFO L475 AbstractCegarLoop]: Abstraction has 32874 states and 40989 transitions. [2019-09-08 16:10:42,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 16:10:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 32874 states and 40989 transitions. [2019-09-08 16:10:42,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2019-09-08 16:10:42,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:42,489 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 11, 10, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:42,489 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:42,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:42,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1131675245, now seen corresponding path program 1 times [2019-09-08 16:10:42,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:42,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:42,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:42,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:10:42,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-08 16:10:44,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:10:44,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:10:44,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:10:44,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:10:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:44,410 INFO L87 Difference]: Start difference. First operand 32874 states and 40989 transitions. Second operand 3 states. [2019-09-08 16:10:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:45,856 INFO L93 Difference]: Finished difference Result 65233 states and 81836 transitions. [2019-09-08 16:10:45,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:10:45,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 678 [2019-09-08 16:10:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:45,948 INFO L225 Difference]: With dead ends: 65233 [2019-09-08 16:10:45,949 INFO L226 Difference]: Without dead ends: 32826 [2019-09-08 16:10:45,998 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 16:10:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32826 states. [2019-09-08 16:10:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32826 to 32826. [2019-09-08 16:10:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32826 states. [2019-09-08 16:10:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32826 states to 32826 states and 40869 transitions. [2019-09-08 16:10:47,843 INFO L78 Accepts]: Start accepts. Automaton has 32826 states and 40869 transitions. Word has length 678 [2019-09-08 16:10:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:47,843 INFO L475 AbstractCegarLoop]: Abstraction has 32826 states and 40869 transitions. [2019-09-08 16:10:47,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:10:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 32826 states and 40869 transitions. [2019-09-08 16:10:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 769 [2019-09-08 16:10:47,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:47,874 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 11, 10, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:47,874 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:47,874 INFO L82 PathProgramCache]: Analyzing trace with hash -873713246, now seen corresponding path program 1 times [2019-09-08 16:10:47,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:47,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:47,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 94 proven. 66 refuted. 0 times theorem prover too weak. 951 trivial. 0 not checked. [2019-09-08 16:10:49,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:49,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:49,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:50,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 5432 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 16:10:50,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 198 proven. 66 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2019-09-08 16:10:50,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:50,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-09-08 16:10:50,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 16:10:50,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 16:10:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=459, Unknown=0, NotChecked=0, Total=756 [2019-09-08 16:10:50,969 INFO L87 Difference]: Start difference. First operand 32826 states and 40869 transitions. Second operand 28 states. [2019-09-08 16:10:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:54,953 INFO L93 Difference]: Finished difference Result 66049 states and 82916 transitions. [2019-09-08 16:10:54,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 16:10:54,953 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 768 [2019-09-08 16:10:54,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:55,032 INFO L225 Difference]: With dead ends: 66049 [2019-09-08 16:10:55,032 INFO L226 Difference]: Without dead ends: 33642 [2019-09-08 16:10:55,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=622, Invalid=938, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 16:10:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33642 states. [2019-09-08 16:10:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33642 to 32850. [2019-09-08 16:10:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32850 states. [2019-09-08 16:10:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32850 states to 32850 states and 40893 transitions. [2019-09-08 16:10:56,652 INFO L78 Accepts]: Start accepts. Automaton has 32850 states and 40893 transitions. Word has length 768 [2019-09-08 16:10:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:56,652 INFO L475 AbstractCegarLoop]: Abstraction has 32850 states and 40893 transitions. [2019-09-08 16:10:56,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 16:10:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 32850 states and 40893 transitions. [2019-09-08 16:10:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2019-09-08 16:10:56,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:56,683 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 15, 12, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:56,683 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:56,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:56,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1778267541, now seen corresponding path program 1 times [2019-09-08 16:10:56,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:56,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:56,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 94 proven. 78 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-09-08 16:11:00,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:00,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:00,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:11:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:01,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 5541 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 16:11:01,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 186 proven. 78 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:11:01,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:01,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-09-08 16:11:01,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 16:11:01,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 16:11:01,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=529, Unknown=0, NotChecked=0, Total=870 [2019-09-08 16:11:01,626 INFO L87 Difference]: Start difference. First operand 32850 states and 40893 transitions. Second operand 30 states. [2019-09-08 16:11:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:03,626 INFO L93 Difference]: Finished difference Result 66163 states and 83058 transitions. [2019-09-08 16:11:03,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 16:11:03,627 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 755 [2019-09-08 16:11:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:03,700 INFO L225 Difference]: With dead ends: 66163 [2019-09-08 16:11:03,700 INFO L226 Difference]: Without dead ends: 33732 [2019-09-08 16:11:03,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 16:11:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33732 states. [2019-09-08 16:11:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33732 to 32874. [2019-09-08 16:11:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32874 states. [2019-09-08 16:11:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32874 states to 32874 states and 40917 transitions. [2019-09-08 16:11:05,311 INFO L78 Accepts]: Start accepts. Automaton has 32874 states and 40917 transitions. Word has length 755 [2019-09-08 16:11:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:05,312 INFO L475 AbstractCegarLoop]: Abstraction has 32874 states and 40917 transitions. [2019-09-08 16:11:05,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 16:11:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 32874 states and 40917 transitions. [2019-09-08 16:11:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2019-09-08 16:11:05,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:05,343 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 13, 10, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:05,343 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:05,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:05,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1571853157, now seen corresponding path program 2 times [2019-09-08 16:11:05,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:05,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:05,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:05,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:11:05,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 94 proven. 91 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-08 16:11:07,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:07,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:07,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:11:08,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:11:08,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:11:08,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 5347 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 16:11:08,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 186 proven. 91 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-09-08 16:11:08,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:08,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-09-08 16:11:08,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 16:11:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 16:11:08,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-08 16:11:08,887 INFO L87 Difference]: Start difference. First operand 32874 states and 40917 transitions. Second operand 32 states. [2019-09-08 16:11:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:10,965 INFO L93 Difference]: Finished difference Result 66277 states and 83200 transitions. [2019-09-08 16:11:10,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 16:11:10,965 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 749 [2019-09-08 16:11:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:11,055 INFO L225 Difference]: With dead ends: 66277 [2019-09-08 16:11:11,055 INFO L226 Difference]: Without dead ends: 33822 [2019-09-08 16:11:11,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=823, Invalid=1247, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 16:11:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33822 states. [2019-09-08 16:11:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33822 to 32898. [2019-09-08 16:11:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32898 states. [2019-09-08 16:11:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32898 states to 32898 states and 40941 transitions. [2019-09-08 16:11:13,024 INFO L78 Accepts]: Start accepts. Automaton has 32898 states and 40941 transitions. Word has length 749 [2019-09-08 16:11:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:13,025 INFO L475 AbstractCegarLoop]: Abstraction has 32898 states and 40941 transitions. [2019-09-08 16:11:13,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 16:11:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 32898 states and 40941 transitions. [2019-09-08 16:11:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2019-09-08 16:11:13,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:13,054 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 14, 10, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:13,055 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:13,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1425043854, now seen corresponding path program 3 times [2019-09-08 16:11:13,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:13,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:13,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:13,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:11:13,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 94 proven. 105 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-08 16:11:14,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:14,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:14,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 16:11:28,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 16:11:28,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:11:28,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 2911 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 16:11:28,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 146 proven. 3 refuted. 0 times theorem prover too weak. 974 trivial. 0 not checked. [2019-09-08 16:11:28,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:28,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2019-09-08 16:11:28,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 16:11:28,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 16:11:28,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2019-09-08 16:11:28,462 INFO L87 Difference]: Start difference. First operand 32898 states and 40941 transitions. Second operand 23 states. [2019-09-08 16:11:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:30,382 INFO L93 Difference]: Finished difference Result 66599 states and 84049 transitions. [2019-09-08 16:11:30,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 16:11:30,383 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 750 [2019-09-08 16:11:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:30,476 INFO L225 Difference]: With dead ends: 66599 [2019-09-08 16:11:30,476 INFO L226 Difference]: Without dead ends: 33676 [2019-09-08 16:11:30,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 745 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=501, Unknown=0, NotChecked=0, Total=702 [2019-09-08 16:11:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33676 states. [2019-09-08 16:11:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33676 to 32978. [2019-09-08 16:11:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32978 states. [2019-09-08 16:11:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32978 states to 32978 states and 41077 transitions. [2019-09-08 16:11:32,362 INFO L78 Accepts]: Start accepts. Automaton has 32978 states and 41077 transitions. Word has length 750 [2019-09-08 16:11:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:32,363 INFO L475 AbstractCegarLoop]: Abstraction has 32978 states and 41077 transitions. [2019-09-08 16:11:32,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 16:11:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 32978 states and 41077 transitions. [2019-09-08 16:11:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-09-08 16:11:32,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:32,394 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 15, 10, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:32,394 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:32,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:32,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1543866589, now seen corresponding path program 1 times [2019-09-08 16:11:32,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:32,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:32,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:32,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:11:32,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 63 proven. 120 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2019-09-08 16:11:34,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:34,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:34,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:11:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:34,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 5043 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 16:11:34,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 127 proven. 120 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-09-08 16:11:35,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:35,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-09-08 16:11:35,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 16:11:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 16:11:35,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=769, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 16:11:35,253 INFO L87 Difference]: Start difference. First operand 32978 states and 41077 transitions. Second operand 36 states. [2019-09-08 16:11:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:37,621 INFO L93 Difference]: Finished difference Result 66616 states and 83706 transitions. [2019-09-08 16:11:37,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 16:11:37,622 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 684 [2019-09-08 16:11:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:37,699 INFO L225 Difference]: With dead ends: 66616 [2019-09-08 16:11:37,699 INFO L226 Difference]: Without dead ends: 34058 [2019-09-08 16:11:37,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1052, Invalid=1600, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 16:11:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34058 states. [2019-09-08 16:11:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34058 to 33002. [2019-09-08 16:11:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33002 states. [2019-09-08 16:11:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33002 states to 33002 states and 41101 transitions. [2019-09-08 16:11:39,342 INFO L78 Accepts]: Start accepts. Automaton has 33002 states and 41101 transitions. Word has length 684 [2019-09-08 16:11:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:39,342 INFO L475 AbstractCegarLoop]: Abstraction has 33002 states and 41101 transitions. [2019-09-08 16:11:39,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 16:11:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 33002 states and 41101 transitions. [2019-09-08 16:11:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2019-09-08 16:11:39,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:39,374 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 16, 10, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:39,374 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:39,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1388388488, now seen corresponding path program 4 times [2019-09-08 16:11:39,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:39,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:39,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:39,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:11:39,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 163 proven. 17 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-09-08 16:11:44,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:44,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:44,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 16:11:45,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 16:11:45,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:11:45,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 3020 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 16:11:45,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 319 proven. 15 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2019-09-08 16:11:45,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:45,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2019-09-08 16:11:45,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 16:11:45,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 16:11:45,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-09-08 16:11:45,649 INFO L87 Difference]: Start difference. First operand 33002 states and 41101 transitions. Second operand 15 states. [2019-09-08 16:11:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:47,997 INFO L93 Difference]: Finished difference Result 67381 states and 85761 transitions. [2019-09-08 16:11:47,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 16:11:47,997 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 754 [2019-09-08 16:11:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:48,093 INFO L225 Difference]: With dead ends: 67381 [2019-09-08 16:11:48,093 INFO L226 Difference]: Without dead ends: 34402 [2019-09-08 16:11:48,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 776 GetRequests, 751 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2019-09-08 16:11:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34402 states. [2019-09-08 16:11:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34402 to 33170. [2019-09-08 16:11:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33170 states. [2019-09-08 16:11:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33170 states to 33170 states and 41381 transitions. [2019-09-08 16:11:49,990 INFO L78 Accepts]: Start accepts. Automaton has 33170 states and 41381 transitions. Word has length 754 [2019-09-08 16:11:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:49,991 INFO L475 AbstractCegarLoop]: Abstraction has 33170 states and 41381 transitions. [2019-09-08 16:11:49,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 16:11:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 33170 states and 41381 transitions. [2019-09-08 16:11:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2019-09-08 16:11:50,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:50,021 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 18, 16, 9, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:50,021 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 33647909, now seen corresponding path program 2 times [2019-09-08 16:11:50,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:50,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:50,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:11:50,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 93 proven. 166 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2019-09-08 16:11:53,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:53,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:53,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:11:54,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:11:54,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:11:54,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 5367 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 16:11:54,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 347 proven. 21 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2019-09-08 16:11:54,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:54,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2019-09-08 16:11:54,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 16:11:54,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 16:11:54,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-09-08 16:11:54,895 INFO L87 Difference]: Start difference. First operand 33170 states and 41381 transitions. Second operand 16 states. [2019-09-08 16:11:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:57,653 INFO L93 Difference]: Finished difference Result 67997 states and 86809 transitions. [2019-09-08 16:11:57,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 16:11:57,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 696 [2019-09-08 16:11:57,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:57,754 INFO L225 Difference]: With dead ends: 67997 [2019-09-08 16:11:57,754 INFO L226 Difference]: Without dead ends: 34850 [2019-09-08 16:11:57,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2019-09-08 16:11:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34850 states. [2019-09-08 16:11:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34850 to 33226. [2019-09-08 16:11:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33226 states. [2019-09-08 16:11:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33226 states to 33226 states and 41493 transitions. [2019-09-08 16:11:59,786 INFO L78 Accepts]: Start accepts. Automaton has 33226 states and 41493 transitions. Word has length 696 [2019-09-08 16:11:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:59,787 INFO L475 AbstractCegarLoop]: Abstraction has 33226 states and 41493 transitions. [2019-09-08 16:11:59,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 16:11:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 33226 states and 41493 transitions. [2019-09-08 16:11:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-09-08 16:11:59,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:59,819 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 16, 14, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:59,819 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:59,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:59,819 INFO L82 PathProgramCache]: Analyzing trace with hash 780263894, now seen corresponding path program 3 times [2019-09-08 16:11:59,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:59,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:59,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:59,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:11:59,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 187 proven. 30 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2019-09-08 16:12:00,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:12:00,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:12:00,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 16:12:23,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 16:12:23,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:12:23,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 3607 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 16:12:23,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:12:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 140 proven. 6 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2019-09-08 16:12:24,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:12:24,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-09-08 16:12:24,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 16:12:24,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 16:12:24,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 16:12:24,243 INFO L87 Difference]: Start difference. First operand 33226 states and 41493 transitions. Second operand 19 states. [2019-09-08 16:12:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:27,262 INFO L93 Difference]: Finished difference Result 68781 states and 88289 transitions. [2019-09-08 16:12:27,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 16:12:27,262 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 689 [2019-09-08 16:12:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:27,382 INFO L225 Difference]: With dead ends: 68781 [2019-09-08 16:12:27,382 INFO L226 Difference]: Without dead ends: 35578 [2019-09-08 16:12:27,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 683 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1137, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 16:12:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35578 states. [2019-09-08 16:12:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35578 to 33338. [2019-09-08 16:12:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33338 states. [2019-09-08 16:12:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33338 states to 33338 states and 41717 transitions. [2019-09-08 16:12:29,525 INFO L78 Accepts]: Start accepts. Automaton has 33338 states and 41717 transitions. Word has length 689 [2019-09-08 16:12:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:29,526 INFO L475 AbstractCegarLoop]: Abstraction has 33338 states and 41717 transitions. [2019-09-08 16:12:29,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 16:12:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 33338 states and 41717 transitions. [2019-09-08 16:12:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2019-09-08 16:12:29,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:29,560 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 16, 16, 8, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:29,560 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:29,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:29,561 INFO L82 PathProgramCache]: Analyzing trace with hash 923878294, now seen corresponding path program 4 times [2019-09-08 16:12:29,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:29,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:29,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:29,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:12:29,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 222 proven. 39 refuted. 0 times theorem prover too weak. 889 trivial. 0 not checked. [2019-09-08 16:12:30,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:12:30,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:12:30,284 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 16:12:30,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 16:12:30,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:12:30,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 3001 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 16:12:30,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:12:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 330 proven. 36 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-08 16:12:31,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:12:31,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2019-09-08 16:12:31,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 16:12:31,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 16:12:31,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-08 16:12:31,361 INFO L87 Difference]: Start difference. First operand 33338 states and 41717 transitions. Second operand 19 states. [2019-09-08 16:12:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:34,512 INFO L93 Difference]: Finished difference Result 69117 states and 88953 transitions. [2019-09-08 16:12:34,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 16:12:34,513 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 693 [2019-09-08 16:12:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:34,634 INFO L225 Difference]: With dead ends: 69117 [2019-09-08 16:12:34,634 INFO L226 Difference]: Without dead ends: 35802 [2019-09-08 16:12:34,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=452, Invalid=1440, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 16:12:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35802 states. [2019-09-08 16:12:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35802 to 33394. [2019-09-08 16:12:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33394 states. [2019-09-08 16:12:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33394 states to 33394 states and 41829 transitions. [2019-09-08 16:12:36,801 INFO L78 Accepts]: Start accepts. Automaton has 33394 states and 41829 transitions. Word has length 693 [2019-09-08 16:12:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:36,802 INFO L475 AbstractCegarLoop]: Abstraction has 33394 states and 41829 transitions. [2019-09-08 16:12:36,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 16:12:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 33394 states and 41829 transitions. [2019-09-08 16:12:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2019-09-08 16:12:36,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:36,837 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 18, 16, 8, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:36,837 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:36,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1757174802, now seen corresponding path program 5 times [2019-09-08 16:12:36,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:36,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:36,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:36,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:12:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 254 proven. 48 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2019-09-08 16:12:39,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:12:39,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:12:39,853 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 16:13:41,107 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-08 16:13:41,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:13:41,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 16:13:41,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:13:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2019-09-08 16:13:41,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:13:41,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 19 [2019-09-08 16:13:41,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 16:13:41,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 16:13:41,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 16:13:41,394 INFO L87 Difference]: Start difference. First operand 33394 states and 41829 transitions. Second operand 19 states. [2019-09-08 16:13:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:13:46,869 INFO L93 Difference]: Finished difference Result 69341 states and 89137 transitions. [2019-09-08 16:13:46,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 16:13:46,870 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 764 [2019-09-08 16:13:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:13:46,984 INFO L225 Difference]: With dead ends: 69341 [2019-09-08 16:13:46,984 INFO L226 Difference]: Without dead ends: 35970 [2019-09-08 16:13:47,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 761 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=479, Invalid=1413, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 16:13:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35970 states. [2019-09-08 16:13:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35970 to 33634. [2019-09-08 16:13:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33634 states. [2019-09-08 16:13:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33634 states to 33634 states and 42211 transitions. [2019-09-08 16:13:49,050 INFO L78 Accepts]: Start accepts. Automaton has 33634 states and 42211 transitions. Word has length 764 [2019-09-08 16:13:49,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:13:49,051 INFO L475 AbstractCegarLoop]: Abstraction has 33634 states and 42211 transitions. [2019-09-08 16:13:49,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 16:13:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33634 states and 42211 transitions. [2019-09-08 16:13:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2019-09-08 16:13:49,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:13:49,084 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 16, 9, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:49,085 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:13:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:13:49,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1718613960, now seen corresponding path program 5 times [2019-09-08 16:13:49,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:13:49,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:13:49,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:13:49,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:13:49,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:13:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:13:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 122 proven. 233 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2019-09-08 16:13:51,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:13:51,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:13:51,390 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 16:14:52,790 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-08 16:14:52,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:14:52,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 16:14:52,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:14:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 253 proven. 1 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-08 16:14:53,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:14:53,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 20 [2019-09-08 16:14:53,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 16:14:53,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 16:14:53,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-08 16:14:53,304 INFO L87 Difference]: Start difference. First operand 33634 states and 42211 transitions. Second operand 20 states. [2019-09-08 16:14:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:14:56,801 INFO L93 Difference]: Finished difference Result 70197 states and 90591 transitions. [2019-09-08 16:14:56,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 16:14:56,802 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 699 [2019-09-08 16:14:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:14:56,915 INFO L225 Difference]: With dead ends: 70197 [2019-09-08 16:14:56,915 INFO L226 Difference]: Without dead ends: 36586 [2019-09-08 16:14:56,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 696 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 16:14:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36586 states. [2019-09-08 16:14:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36586 to 33714. [2019-09-08 16:14:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33714 states. [2019-09-08 16:14:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33714 states to 33714 states and 42347 transitions. [2019-09-08 16:14:59,127 INFO L78 Accepts]: Start accepts. Automaton has 33714 states and 42347 transitions. Word has length 699 [2019-09-08 16:14:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:14:59,127 INFO L475 AbstractCegarLoop]: Abstraction has 33714 states and 42347 transitions. [2019-09-08 16:14:59,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 16:14:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 33714 states and 42347 transitions. [2019-09-08 16:14:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2019-09-08 16:14:59,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:14:59,164 INFO L399 BasicCegarLoop]: trace histogram [24, 20, 20, 16, 9, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:59,164 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:14:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:14:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1237647334, now seen corresponding path program 2 times [2019-09-08 16:14:59,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:14:59,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:14:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:14:59,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:14:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:15:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1537 backedges. 333 proven. 69 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2019-09-08 16:15:06,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:15:06,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:15:06,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:15:08,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:15:08,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:15:08,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 6016 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 16:15:08,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:15:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1537 backedges. 547 proven. 66 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-08 16:15:08,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:15:08,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2019-09-08 16:15:08,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 16:15:08,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 16:15:08,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-09-08 16:15:08,374 INFO L87 Difference]: Start difference. First operand 33714 states and 42347 transitions. Second operand 23 states. [2019-09-08 16:15:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:15:12,191 INFO L93 Difference]: Finished difference Result 71341 states and 92663 transitions. [2019-09-08 16:15:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 16:15:12,191 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 792 [2019-09-08 16:15:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:15:12,282 INFO L225 Difference]: With dead ends: 71341 [2019-09-08 16:15:12,283 INFO L226 Difference]: Without dead ends: 37650 [2019-09-08 16:15:12,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=811, Invalid=2729, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 16:15:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37650 states. [2019-09-08 16:15:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37650 to 33770. [2019-09-08 16:15:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33770 states. [2019-09-08 16:15:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33770 states to 33770 states and 42459 transitions. [2019-09-08 16:15:14,152 INFO L78 Accepts]: Start accepts. Automaton has 33770 states and 42459 transitions. Word has length 792 [2019-09-08 16:15:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:15:14,152 INFO L475 AbstractCegarLoop]: Abstraction has 33770 states and 42459 transitions. [2019-09-08 16:15:14,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 16:15:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 33770 states and 42459 transitions. [2019-09-08 16:15:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2019-09-08 16:15:14,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:15:14,182 INFO L399 BasicCegarLoop]: trace histogram [26, 20, 20, 16, 9, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:14,183 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:15:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:15:14,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1515717899, now seen corresponding path program 6 times [2019-09-08 16:15:14,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:15:14,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:15:14,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:14,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:15:14,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY