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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 16:27:13,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 16:27:13,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 16:27:13,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 16:27:13,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 16:27:13,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 16:27:13,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 16:27:13,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 16:27:13,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 16:27:13,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 16:27:13,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 16:27:13,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 16:27:13,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 16:27:13,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 16:27:13,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 16:27:13,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 16:27:13,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 16:27:13,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 16:27:13,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 16:27:13,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 16:27:13,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 16:27:13,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 16:27:13,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 16:27:13,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 16:27:13,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 16:27:13,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 16:27:13,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 16:27:13,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 16:27:13,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 16:27:13,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 16:27:13,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 16:27:13,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 16:27:13,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 16:27:13,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 16:27:13,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 16:27:13,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 16:27:13,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 16:27:13,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 16:27:13,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 16:27:13,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 16:27:13,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 16:27:13,275 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:27:13,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 16:27:13,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 16:27:13,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 16:27:13,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 16:27:13,293 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 16:27:13,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 16:27:13,294 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 16:27:13,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 16:27:13,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 16:27:13,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 16:27:13,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 16:27:13,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 16:27:13,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 16:27:13,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 16:27:13,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 16:27:13,296 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 16:27:13,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 16:27:13,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 16:27:13,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 16:27:13,297 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 16:27:13,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 16:27:13,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 16:27:13,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 16:27:13,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 16:27:13,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 16:27:13,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 16:27:13,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 16:27:13,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 16:27:13,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 16:27:13,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 16:27:13,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 16:27:13,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 16:27:13,357 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 16:27:13,358 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 16:27:13,358 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2019-09-08 16:27:13,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be839da1/b7f5ab9dd48f458fa6397301dcbf64a1/FLAGb2f787d71 [2019-09-08 16:27:14,230 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 16:27:14,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2019-09-08 16:27:14,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be839da1/b7f5ab9dd48f458fa6397301dcbf64a1/FLAGb2f787d71 [2019-09-08 16:27:14,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be839da1/b7f5ab9dd48f458fa6397301dcbf64a1 [2019-09-08 16:27:14,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 16:27:14,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 16:27:14,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 16:27:14,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 16:27:14,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 16:27:14,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:27:14" (1/1) ... [2019-09-08 16:27:14,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f1ad7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:27:14, skipping insertion in model container [2019-09-08 16:27:14,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:27:14" (1/1) ... [2019-09-08 16:27:14,789 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 16:27:14,924 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 16:27:16,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 16:27:16,939 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 16:27:17,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 16:27:17,589 INFO L192 MainTranslator]: Completed translation [2019-09-08 16:27:17,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:27:17 WrapperNode [2019-09-08 16:27:17,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 16:27:17,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 16:27:17,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 16:27:17,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 16:27:17,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:27:17" (1/1) ... [2019-09-08 16:27:17,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:27:17" (1/1) ... [2019-09-08 16:27:17,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:27:17" (1/1) ... [2019-09-08 16:27:17,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:27:17" (1/1) ... [2019-09-08 16:27:17,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:27:17" (1/1) ... [2019-09-08 16:27:17,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:27:17" (1/1) ... [2019-09-08 16:27:17,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:27:17" (1/1) ... [2019-09-08 16:27:17,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 16:27:17,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 16:27:17,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 16:27:17,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 16:27:17,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:27:17" (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:27:17,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 16:27:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 16:27:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2019-09-08 16:27:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-09-08 16:27:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-09-08 16:27:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-09-08 16:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2019-09-08 16:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2019-09-08 16:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_swab32 [2019-09-08 16:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2019-09-08 16:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2019-09-08 16:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __swab16p [2019-09-08 16:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __swab32p [2019-09-08 16:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __be32_to_cpup [2019-09-08 16:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __be16_to_cpup [2019-09-08 16:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2019-09-08 16:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2019-09-08 16:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2019-09-08 16:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-09-08 16:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2019-09-08 16:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2019-09-08 16:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2019-09-08 16:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2019-09-08 16:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-09-08 16:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-08 16:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-08 16:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-08 16:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-09-08 16:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-09-08 16:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_empty [2019-09-08 16:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_queue_head_init [2019-09-08 16:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head_init [2019-09-08 16:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_is_nonlinear [2019-09-08 16:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2019-09-08 16:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2019-09-08 16:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2019-09-08 16:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-08 16:27:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-08 16:27:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-08 16:27:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-08 16:27:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-08 16:27:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-08 16:27:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-08 16:27:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-08 16:27:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-08 16:27:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure sema_init [2019-09-08 16:27:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_get_baud_rate [2019-09-08 16:27:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2019-09-08 16:27:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2019-09-08 16:27:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2019-09-08 16:27:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be32 [2019-09-08 16:27:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2019-09-08 16:27:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2019-09-08 16:27:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_open [2019-09-08 16:27:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2019-09-08 16:27:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2019-09-08 16:27:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_read [2019-09-08 16:27:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_write [2019-09-08 16:27:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2019-09-08 16:27:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2019-09-08 16:27:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_receive [2019-09-08 16:27:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_wakeup [2019-09-08 16:27:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_init [2019-09-08 16:27:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_ioctl [2019-09-08 16:27:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_process [2019-09-08 16:27:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_encode [2019-09-08 16:27:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_send [2019-09-08 16:27:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2019-09-08 16:27:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_flush_output [2019-09-08 16:27:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure scan_ordinary [2019-09-08 16:27:17,954 INFO L138 BoogieDeclarations]: Found implementation of procedure process_input_packet [2019-09-08 16:27:17,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_input [2019-09-08 16:27:17,954 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2019-09-08 16:27:17,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_cleanup [2019-09-08 16:27:17,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize_ppp_channel_ops_2 [2019-09-08 16:27:17,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_target_type_1 [2019-09-08 16:27:17,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 16:27:17,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_5 [2019-09-08 16:27:17,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_6 [2019-09-08 16:27:17,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_7 [2019-09-08 16:27:17,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_8 [2019-09-08 16:27:17,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_11 [2019-09-08 16:27:17,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_12 [2019-09-08 16:27:17,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_13 [2019-09-08 16:27:17,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_dequeue_14 [2019-09-08 16:27:17,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_15 [2019-09-08 16:27:17,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_16 [2019-09-08 16:27:17,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_17 [2019-09-08 16:27:17,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb_18 [2019-09-08 16:27:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_init [2019-09-08 16:27:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-09-08 16:27:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2019-09-08 16:27:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_contains [2019-09-08 16:27:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_is_empty [2019-09-08 16:27:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-09-08 16:27:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-09-08 16:27:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-09-08 16:27:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-09-08 16:27:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2019-09-08 16:27:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 16:27:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2019-09-08 16:27:17,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2019-09-08 16:27:17,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb [2019-09-08 16:27:17,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_alloc_skb [2019-09-08 16:27:17,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_current [2019-09-08 16:27:17,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 16:27:17,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_from_user_overflow [2019-09-08 16:27:17,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_to_user_overflow [2019-09-08 16:27:17,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-09-08 16:27:17,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __tasklet_schedule [2019-09-08 16:27:17,960 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-09-08 16:27:17,960 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-09-08 16:27:17,960 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_read_lock [2019-09-08 16:27:17,960 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_read_unlock [2019-09-08 16:27:17,960 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_bh [2019-09-08 16:27:17,960 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irq [2019-09-08 16:27:17,961 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-09-08 16:27:17,961 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_bh [2019-09-08 16:27:17,961 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irq [2019-09-08 16:27:17,961 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-09-08 16:27:17,961 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_write_lock_irq [2019-09-08 16:27:17,961 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_write_unlock_irq [2019-09-08 16:27:17,962 INFO L138 BoogieDeclarations]: Found implementation of procedure down [2019-09-08 16:27:17,962 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2019-09-08 16:27:17,962 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-09-08 16:27:17,962 INFO L138 BoogieDeclarations]: Found implementation of procedure n_tty_ioctl_helper [2019-09-08 16:27:17,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_channel_index [2019-09-08 16:27:17,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_input [2019-09-08 16:27:17,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_input_error [2019-09-08 16:27:17,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2019-09-08 16:27:17,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_register_channel [2019-09-08 16:27:17,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_unit_number [2019-09-08 16:27:17,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_unregister_channel [2019-09-08 16:27:17,963 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-08 16:27:17,963 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2019-09-08 16:27:17,964 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2019-09-08 16:27:17,964 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-09-08 16:27:17,964 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_purge [2019-09-08 16:27:17,964 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2019-09-08 16:27:17,964 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2019-09-08 16:27:17,964 INFO L138 BoogieDeclarations]: Found implementation of procedure start_tty [2019-09-08 16:27:17,964 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_tty [2019-09-08 16:27:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2019-09-08 16:27:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_kill [2019-09-08 16:27:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_mode_ioctl [2019-09-08 16:27:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_register_ldisc [2019-09-08 16:27:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_termios_baud_rate [2019-09-08 16:27:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_unregister_ldisc [2019-09-08 16:27:17,966 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_unthrottle [2019-09-08 16:27:17,966 INFO L138 BoogieDeclarations]: Found implementation of procedure up [2019-09-08 16:27:17,966 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-08 16:27:17,966 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-08 16:27:17,966 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-08 16:27:17,966 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-08 16:27:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 16:27:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-08 16:27:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-09-08 16:27:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-09-08 16:27:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-09-08 16:27:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2019-09-08 16:27:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2019-09-08 16:27:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 16:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_swab32 [2019-09-08 16:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2019-09-08 16:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2019-09-08 16:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure __swab16p [2019-09-08 16:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure __swab32p [2019-09-08 16:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure __be32_to_cpup [2019-09-08 16:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure __be16_to_cpup [2019-09-08 16:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-08 16:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-09-08 16:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-08 16:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2019-09-08 16:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 16:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2019-09-08 16:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2019-09-08 16:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2019-09-08 16:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-09-08 16:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_bh [2019-09-08 16:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irq [2019-09-08 16:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-09-08 16:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_bh [2019-09-08 16:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irq [2019-09-08 16:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-09-08 16:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_read_lock [2019-09-08 16:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_write_lock_irq [2019-09-08 16:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_read_unlock [2019-09-08 16:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_write_unlock_irq [2019-09-08 16:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-09-08 16:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2019-09-08 16:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2019-09-08 16:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2019-09-08 16:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2019-09-08 16:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-09-08 16:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-08 16:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-08 16:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-08 16:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-08 16:27:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-08 16:27:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-09-08 16:27:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-09-08 16:27:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_from_user_overflow [2019-09-08 16:27:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_to_user_overflow [2019-09-08 16:27:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-09-08 16:27:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-09-08 16:27:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_6 [2019-09-08 16:27:17,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_7 [2019-09-08 16:27:17,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_8 [2019-09-08 16:27:17,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_11 [2019-09-08 16:27:17,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_12 [2019-09-08 16:27:17,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_13 [2019-09-08 16:27:17,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_16 [2019-09-08 16:27:17,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_17 [2019-09-08 16:27:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_5 [2019-09-08 16:27:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_15 [2019-09-08 16:27:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_empty [2019-09-08 16:27:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 16:27:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_queue_head_init [2019-09-08 16:27:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 16:27:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head_init [2019-09-08 16:27:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 16:27:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 16:27:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2019-09-08 16:27:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_dequeue_14 [2019-09-08 16:27:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure skb_is_nonlinear [2019-09-08 16:27:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-09-08 16:27:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2019-09-08 16:27:17,977 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2019-09-08 16:27:17,977 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2019-09-08 16:27:17,977 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2019-09-08 16:27:17,977 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2019-09-08 16:27:17,977 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2019-09-08 16:27:17,977 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_purge [2019-09-08 16:27:17,977 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb_18 [2019-09-08 16:27:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2019-09-08 16:27:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2019-09-08 16:27:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 16:27:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 16:27:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 16:27:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_size_t [2019-09-08 16:27:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-08 16:27:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-08 16:27:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 16:27:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 16:27:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 16:27:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-08 16:27:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-08 16:27:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-08 16:27:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-08 16:27:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-08 16:27:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-08 16:27:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-08 16:27:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-08 16:27:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize_ppp_channel_ops_2 [2019-09-08 16:27:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_target_type_1 [2019-09-08 16:27:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure sema_init [2019-09-08 16:27:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure down [2019-09-08 16:27:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure up [2019-09-08 16:27:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure stop_tty [2019-09-08 16:27:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure start_tty [2019-09-08 16:27:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure tty_unthrottle [2019-09-08 16:27:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure tty_termios_baud_rate [2019-09-08 16:27:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure tty_get_baud_rate [2019-09-08 16:27:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure tty_mode_ioctl [2019-09-08 16:27:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure tty_register_ldisc [2019-09-08 16:27:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure tty_unregister_ldisc [2019-09-08 16:27:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure n_tty_ioctl_helper [2019-09-08 16:27:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure __tasklet_schedule [2019-09-08 16:27:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2019-09-08 16:27:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_kill [2019-09-08 16:27:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2019-09-08 16:27:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2019-09-08 16:27:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2019-09-08 16:27:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_input [2019-09-08 16:27:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_input_error [2019-09-08 16:27:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_register_channel [2019-09-08 16:27:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unregister_channel [2019-09-08 16:27:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_channel_index [2019-09-08 16:27:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unit_number [2019-09-08 16:27:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2019-09-08 16:27:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be32 [2019-09-08 16:27:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_encode [2019-09-08 16:27:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_send [2019-09-08 16:27:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2019-09-08 16:27:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_flush_output [2019-09-08 16:27:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_input [2019-09-08 16:27:17,985 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_ioctl [2019-09-08 16:27:17,985 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_process [2019-09-08 16:27:17,985 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2019-09-08 16:27:17,985 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2019-09-08 16:27:17,985 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2019-09-08 16:27:17,985 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_open [2019-09-08 16:27:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2019-09-08 16:27:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2019-09-08 16:27:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_read [2019-09-08 16:27:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_write [2019-09-08 16:27:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2019-09-08 16:27:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2019-09-08 16:27:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_receive [2019-09-08 16:27:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_wakeup [2019-09-08 16:27:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_init [2019-09-08 16:27:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-08 16:27:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2019-09-08 16:27:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure scan_ordinary [2019-09-08 16:27:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure process_input_packet [2019-09-08 16:27:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_cleanup [2019-09-08 16:27:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 16:27:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 16:27:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 16:27:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_init [2019-09-08 16:27:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-09-08 16:27:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2019-09-08 16:27:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_contains [2019-09-08 16:27:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_is_empty [2019-09-08 16:27:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-09-08 16:27:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-09-08 16:27:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-09-08 16:27:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-09-08 16:27:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2019-09-08 16:27:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_alloc_skb [2019-09-08 16:27:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb [2019-09-08 16:27:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_current [2019-09-08 16:27:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-08 16:27:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 16:27:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 16:27:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 16:27:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 16:27:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 16:27:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-08 16:27:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-08 16:27:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-08 16:27:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-08 16:27:19,154 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-08 16:27:22,851 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 16:27:22,852 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 16:27:22,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:27:22 BoogieIcfgContainer [2019-09-08 16:27:22,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 16:27:22,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 16:27:22,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 16:27:22,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 16:27:22,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:27:14" (1/3) ... [2019-09-08 16:27:22,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6636cf9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:27:22, skipping insertion in model container [2019-09-08 16:27:22,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:27:17" (2/3) ... [2019-09-08 16:27:22,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6636cf9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:27:22, skipping insertion in model container [2019-09-08 16:27:22,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:27:22" (3/3) ... [2019-09-08 16:27:22,863 INFO L109 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2019-09-08 16:27:22,874 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 16:27:22,895 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 16:27:22,913 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 16:27:22,963 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 16:27:22,964 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 16:27:22,964 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 16:27:22,964 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 16:27:22,964 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 16:27:22,965 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 16:27:22,965 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 16:27:22,965 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 16:27:22,965 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 16:27:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states. [2019-09-08 16:27:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 16:27:23,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:27:23,035 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:23,037 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:27:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:27:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1820998869, now seen corresponding path program 1 times [2019-09-08 16:27:23,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:27:23,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:27:23,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:23,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:27:23,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:27:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-08 16:27:23,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:27:23,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:27:23,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:27:23,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:27:23,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:27:23,638 INFO L87 Difference]: Start difference. First operand 1100 states. Second operand 3 states. [2019-09-08 16:27:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:27:24,019 INFO L93 Difference]: Finished difference Result 3029 states and 4023 transitions. [2019-09-08 16:27:24,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:27:24,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 16:27:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:27:24,064 INFO L225 Difference]: With dead ends: 3029 [2019-09-08 16:27:24,065 INFO L226 Difference]: Without dead ends: 1994 [2019-09-08 16:27:24,077 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:27:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2019-09-08 16:27:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2019-09-08 16:27:24,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-09-08 16:27:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2597 transitions. [2019-09-08 16:27:24,398 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2597 transitions. Word has length 101 [2019-09-08 16:27:24,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:27:24,399 INFO L475 AbstractCegarLoop]: Abstraction has 1994 states and 2597 transitions. [2019-09-08 16:27:24,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:27:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2597 transitions. [2019-09-08 16:27:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 16:27:24,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:27:24,408 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:24,408 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:27:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:27:24,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1355814239, now seen corresponding path program 1 times [2019-09-08 16:27:24,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:27:24,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:27:24,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:24,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:27:24,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:27:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-08 16:27:24,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:27:24,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 16:27:24,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:27:24,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:27:24,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:27:24,682 INFO L87 Difference]: Start difference. First operand 1994 states and 2597 transitions. Second operand 6 states. [2019-09-08 16:27:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:27:25,861 INFO L93 Difference]: Finished difference Result 5919 states and 7771 transitions. [2019-09-08 16:27:25,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 16:27:25,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-08 16:27:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:27:25,888 INFO L225 Difference]: With dead ends: 5919 [2019-09-08 16:27:25,888 INFO L226 Difference]: Without dead ends: 3940 [2019-09-08 16:27:25,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:27:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2019-09-08 16:27:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3940. [2019-09-08 16:27:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3940 states. [2019-09-08 16:27:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 5183 transitions. [2019-09-08 16:27:26,136 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 5183 transitions. Word has length 105 [2019-09-08 16:27:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:27:26,137 INFO L475 AbstractCegarLoop]: Abstraction has 3940 states and 5183 transitions. [2019-09-08 16:27:26,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:27:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 5183 transitions. [2019-09-08 16:27:26,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 16:27:26,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:27:26,151 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2019-09-08 16:27:26,151 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:27:26,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:27:26,151 INFO L82 PathProgramCache]: Analyzing trace with hash -496371555, now seen corresponding path program 1 times [2019-09-08 16:27:26,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:27:26,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:27:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:26,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:27:26,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:27:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-08 16:27:26,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:27:26,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:27:26,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:27:26,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:27:26,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:27:26,354 INFO L87 Difference]: Start difference. First operand 3940 states and 5183 transitions. Second operand 3 states. [2019-09-08 16:27:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:27:26,607 INFO L93 Difference]: Finished difference Result 9560 states and 12636 transitions. [2019-09-08 16:27:26,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:27:26,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-08 16:27:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:27:26,653 INFO L225 Difference]: With dead ends: 9560 [2019-09-08 16:27:26,653 INFO L226 Difference]: Without dead ends: 5654 [2019-09-08 16:27:26,669 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:27:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5654 states. [2019-09-08 16:27:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5654 to 5630. [2019-09-08 16:27:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5630 states. [2019-09-08 16:27:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5630 states to 5630 states and 7469 transitions. [2019-09-08 16:27:26,902 INFO L78 Accepts]: Start accepts. Automaton has 5630 states and 7469 transitions. Word has length 188 [2019-09-08 16:27:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:27:26,903 INFO L475 AbstractCegarLoop]: Abstraction has 5630 states and 7469 transitions. [2019-09-08 16:27:26,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:27:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 5630 states and 7469 transitions. [2019-09-08 16:27:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 16:27:26,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:27:26,918 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 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] [2019-09-08 16:27:26,918 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:27:26,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:27:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1202569559, now seen corresponding path program 1 times [2019-09-08 16:27:26,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:27:26,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:27:26,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:26,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:27:26,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:27:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-08 16:27:27,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:27:27,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:27:27,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:27:27,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:27:27,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:27:27,167 INFO L87 Difference]: Start difference. First operand 5630 states and 7469 transitions. Second operand 3 states. [2019-09-08 16:27:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:27:27,415 INFO L93 Difference]: Finished difference Result 14129 states and 18555 transitions. [2019-09-08 16:27:27,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:27:27,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-09-08 16:27:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:27:27,475 INFO L225 Difference]: With dead ends: 14129 [2019-09-08 16:27:27,476 INFO L226 Difference]: Without dead ends: 8533 [2019-09-08 16:27:27,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:27:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8533 states. [2019-09-08 16:27:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8533 to 8511. [2019-09-08 16:27:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8511 states. [2019-09-08 16:27:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8511 states to 8511 states and 11100 transitions. [2019-09-08 16:27:27,882 INFO L78 Accepts]: Start accepts. Automaton has 8511 states and 11100 transitions. Word has length 213 [2019-09-08 16:27:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:27:27,883 INFO L475 AbstractCegarLoop]: Abstraction has 8511 states and 11100 transitions. [2019-09-08 16:27:27,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:27:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 8511 states and 11100 transitions. [2019-09-08 16:27:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 16:27:27,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:27:27,906 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 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] [2019-09-08 16:27:27,906 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:27:27,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:27:27,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1201387558, now seen corresponding path program 1 times [2019-09-08 16:27:27,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:27:27,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:27:27,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:27,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:27:27,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:27:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-08 16:27:28,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:27:28,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 16:27:28,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:27:28,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:27:28,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:27:28,140 INFO L87 Difference]: Start difference. First operand 8511 states and 11100 transitions. Second operand 6 states. [2019-09-08 16:27:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:27:28,404 INFO L93 Difference]: Finished difference Result 12907 states and 16821 transitions. [2019-09-08 16:27:28,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 16:27:28,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 226 [2019-09-08 16:27:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:27:28,432 INFO L225 Difference]: With dead ends: 12907 [2019-09-08 16:27:28,436 INFO L226 Difference]: Without dead ends: 4415 [2019-09-08 16:27:28,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:27:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2019-09-08 16:27:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 4337. [2019-09-08 16:27:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4337 states. [2019-09-08 16:27:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 5649 transitions. [2019-09-08 16:27:28,627 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 5649 transitions. Word has length 226 [2019-09-08 16:27:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:27:28,628 INFO L475 AbstractCegarLoop]: Abstraction has 4337 states and 5649 transitions. [2019-09-08 16:27:28,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:27:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 5649 transitions. [2019-09-08 16:27:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 16:27:28,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:27:28,642 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 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] [2019-09-08 16:27:28,642 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:27:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:27:28,643 INFO L82 PathProgramCache]: Analyzing trace with hash -934495644, now seen corresponding path program 1 times [2019-09-08 16:27:28,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:27:28,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:27:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:28,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:27:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:27:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-09-08 16:27:28,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:27:28,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:27:28,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:27:28,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:27:28,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:27:28,804 INFO L87 Difference]: Start difference. First operand 4337 states and 5649 transitions. Second operand 3 states. [2019-09-08 16:27:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:27:29,032 INFO L93 Difference]: Finished difference Result 10404 states and 13579 transitions. [2019-09-08 16:27:29,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:27:29,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-09-08 16:27:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:27:29,076 INFO L225 Difference]: With dead ends: 10404 [2019-09-08 16:27:29,076 INFO L226 Difference]: Without dead ends: 6125 [2019-09-08 16:27:29,091 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:27:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2019-09-08 16:27:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 6098. [2019-09-08 16:27:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6098 states. [2019-09-08 16:27:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 7924 transitions. [2019-09-08 16:27:29,321 INFO L78 Accepts]: Start accepts. Automaton has 6098 states and 7924 transitions. Word has length 226 [2019-09-08 16:27:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:27:29,322 INFO L475 AbstractCegarLoop]: Abstraction has 6098 states and 7924 transitions. [2019-09-08 16:27:29,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:27:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 6098 states and 7924 transitions. [2019-09-08 16:27:29,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 16:27:29,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:27:29,347 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 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] [2019-09-08 16:27:29,348 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:27:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:27:29,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1769311907, now seen corresponding path program 1 times [2019-09-08 16:27:29,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:27:29,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:27:29,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:29,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:27:29,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:27:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-09-08 16:27:29,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:27:29,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:27:29,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:27:29,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:27:29,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:27:29,618 INFO L87 Difference]: Start difference. First operand 6098 states and 7924 transitions. Second operand 3 states. [2019-09-08 16:27:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:27:29,740 INFO L93 Difference]: Finished difference Result 9182 states and 12035 transitions. [2019-09-08 16:27:29,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:27:29,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-09-08 16:27:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:27:29,771 INFO L225 Difference]: With dead ends: 9182 [2019-09-08 16:27:29,772 INFO L226 Difference]: Without dead ends: 6118 [2019-09-08 16:27:29,784 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:27:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6118 states. [2019-09-08 16:27:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6118 to 6108. [2019-09-08 16:27:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2019-09-08 16:27:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 7934 transitions. [2019-09-08 16:27:30,005 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 7934 transitions. Word has length 231 [2019-09-08 16:27:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:27:30,006 INFO L475 AbstractCegarLoop]: Abstraction has 6108 states and 7934 transitions. [2019-09-08 16:27:30,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:27:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 7934 transitions. [2019-09-08 16:27:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 16:27:30,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:27:30,028 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:27:30,029 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:27:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:27:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1112900194, now seen corresponding path program 1 times [2019-09-08 16:27:30,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:27:30,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:27:30,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:30,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:27:30,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:27:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:27:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-08 16:27:30,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:27:30,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:27:30,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:27:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:27:31,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 16:27:31,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:27:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-09-08 16:27:31,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:27:31,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-09-08 16:27:31,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 16:27:31,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 16:27:31,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:27:31,543 INFO L87 Difference]: Start difference. First operand 6108 states and 7934 transitions. Second operand 13 states. [2019-09-08 16:28:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:28:02,588 INFO L93 Difference]: Finished difference Result 17249 states and 22876 transitions. [2019-09-08 16:28:02,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 16:28:02,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 233 [2019-09-08 16:28:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:28:02,637 INFO L225 Difference]: With dead ends: 17249 [2019-09-08 16:28:02,637 INFO L226 Difference]: Without dead ends: 11199 [2019-09-08 16:28:02,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-09-08 16:28:02,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11199 states. [2019-09-08 16:28:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11199 to 10991. [2019-09-08 16:28:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10991 states. [2019-09-08 16:28:03,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10991 states to 10991 states and 14452 transitions. [2019-09-08 16:28:03,127 INFO L78 Accepts]: Start accepts. Automaton has 10991 states and 14452 transitions. Word has length 233 [2019-09-08 16:28:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:28:03,130 INFO L475 AbstractCegarLoop]: Abstraction has 10991 states and 14452 transitions. [2019-09-08 16:28:03,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 16:28:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 10991 states and 14452 transitions. [2019-09-08 16:28:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-08 16:28:03,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:28:03,149 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 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] [2019-09-08 16:28:03,149 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:28:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:28:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash 635817065, now seen corresponding path program 1 times [2019-09-08 16:28:03,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:28:03,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:28:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:03,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-08 16:28:03,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:28:03,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:28:03,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:28:03,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:28:03,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:28:03,444 INFO L87 Difference]: Start difference. First operand 10991 states and 14452 transitions. Second operand 5 states. [2019-09-08 16:28:03,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:28:03,728 INFO L93 Difference]: Finished difference Result 21986 states and 28990 transitions. [2019-09-08 16:28:03,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:28:03,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 275 [2019-09-08 16:28:03,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:28:03,791 INFO L225 Difference]: With dead ends: 21986 [2019-09-08 16:28:03,791 INFO L226 Difference]: Without dead ends: 11053 [2019-09-08 16:28:03,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:28:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11053 states. [2019-09-08 16:28:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11053 to 11027. [2019-09-08 16:28:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11027 states. [2019-09-08 16:28:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11027 states to 11027 states and 14491 transitions. [2019-09-08 16:28:04,260 INFO L78 Accepts]: Start accepts. Automaton has 11027 states and 14491 transitions. Word has length 275 [2019-09-08 16:28:04,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:28:04,261 INFO L475 AbstractCegarLoop]: Abstraction has 11027 states and 14491 transitions. [2019-09-08 16:28:04,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:28:04,261 INFO L276 IsEmpty]: Start isEmpty. Operand 11027 states and 14491 transitions. [2019-09-08 16:28:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-08 16:28:04,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:28:04,278 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 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] [2019-09-08 16:28:04,279 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:28:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:28:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2095629470, now seen corresponding path program 1 times [2019-09-08 16:28:04,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:28:04,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:28:04,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:04,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:04,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-08 16:28:04,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:28:04,903 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:28:04,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:05,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 1731 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 16:28:05,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:28:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 268 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:28:05,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:28:05,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 16:28:05,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 16:28:05,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 16:28:05,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:28:05,285 INFO L87 Difference]: Start difference. First operand 11027 states and 14491 transitions. Second operand 13 states. [2019-09-08 16:28:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:28:06,499 INFO L93 Difference]: Finished difference Result 28193 states and 37779 transitions. [2019-09-08 16:28:06,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 16:28:06,500 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 280 [2019-09-08 16:28:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:28:06,591 INFO L225 Difference]: With dead ends: 28193 [2019-09-08 16:28:06,592 INFO L226 Difference]: Without dead ends: 17224 [2019-09-08 16:28:06,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-09-08 16:28:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17224 states. [2019-09-08 16:28:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17224 to 12580. [2019-09-08 16:28:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12580 states. [2019-09-08 16:28:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 17073 transitions. [2019-09-08 16:28:07,546 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 17073 transitions. Word has length 280 [2019-09-08 16:28:07,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:28:07,547 INFO L475 AbstractCegarLoop]: Abstraction has 12580 states and 17073 transitions. [2019-09-08 16:28:07,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 16:28:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 17073 transitions. [2019-09-08 16:28:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 16:28:07,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:28:07,582 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 11, 4, 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] [2019-09-08 16:28:07,583 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:28:07,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:28:07,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1135340385, now seen corresponding path program 1 times [2019-09-08 16:28:07,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:28:07,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:28:07,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:07,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:07,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-09-08 16:28:07,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:28:07,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 16:28:07,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:28:07,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:28:07,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:28:07,893 INFO L87 Difference]: Start difference. First operand 12580 states and 17073 transitions. Second operand 6 states. [2019-09-08 16:28:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:28:08,498 INFO L93 Difference]: Finished difference Result 29152 states and 39304 transitions. [2019-09-08 16:28:08,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 16:28:08,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 308 [2019-09-08 16:28:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:28:08,570 INFO L225 Difference]: With dead ends: 29152 [2019-09-08 16:28:08,570 INFO L226 Difference]: Without dead ends: 16660 [2019-09-08 16:28:08,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:28:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16660 states. [2019-09-08 16:28:09,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16660 to 12586. [2019-09-08 16:28:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12586 states. [2019-09-08 16:28:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12586 states to 12586 states and 17079 transitions. [2019-09-08 16:28:09,116 INFO L78 Accepts]: Start accepts. Automaton has 12586 states and 17079 transitions. Word has length 308 [2019-09-08 16:28:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:28:09,117 INFO L475 AbstractCegarLoop]: Abstraction has 12586 states and 17079 transitions. [2019-09-08 16:28:09,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:28:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 12586 states and 17079 transitions. [2019-09-08 16:28:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-09-08 16:28:09,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:28:09,142 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 11, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:09,143 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:28:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:28:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash -206650320, now seen corresponding path program 1 times [2019-09-08 16:28:09,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:28:09,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:28:09,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:09,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-09-08 16:28:10,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:28:10,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 16:28:10,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 16:28:10,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 16:28:10,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:28:10,258 INFO L87 Difference]: Start difference. First operand 12586 states and 17079 transitions. Second operand 11 states. [2019-09-08 16:28:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:28:10,795 INFO L93 Difference]: Finished difference Result 25180 states and 34150 transitions. [2019-09-08 16:28:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 16:28:10,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 378 [2019-09-08 16:28:10,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:28:10,858 INFO L225 Difference]: With dead ends: 25180 [2019-09-08 16:28:10,858 INFO L226 Difference]: Without dead ends: 12682 [2019-09-08 16:28:10,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:28:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12682 states. [2019-09-08 16:28:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12682 to 12664. [2019-09-08 16:28:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12664 states. [2019-09-08 16:28:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12664 states to 12664 states and 17157 transitions. [2019-09-08 16:28:11,393 INFO L78 Accepts]: Start accepts. Automaton has 12664 states and 17157 transitions. Word has length 378 [2019-09-08 16:28:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:28:11,394 INFO L475 AbstractCegarLoop]: Abstraction has 12664 states and 17157 transitions. [2019-09-08 16:28:11,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 16:28:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 12664 states and 17157 transitions. [2019-09-08 16:28:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 16:28:11,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:28:11,419 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:11,419 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:28:11,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:28:11,419 INFO L82 PathProgramCache]: Analyzing trace with hash -646626660, now seen corresponding path program 1 times [2019-09-08 16:28:11,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:28:11,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:28:11,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:11,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:11,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-09-08 16:28:11,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:28:11,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:28:11,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:12,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 2293 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:28:12,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:28:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:28:12,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:28:12,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-09-08 16:28:12,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:28:12,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:28:12,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:28:12,539 INFO L87 Difference]: Start difference. First operand 12664 states and 17157 transitions. Second operand 5 states. [2019-09-08 16:28:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:28:14,787 INFO L93 Difference]: Finished difference Result 18044 states and 24050 transitions. [2019-09-08 16:28:14,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:28:14,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2019-09-08 16:28:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:28:14,871 INFO L225 Difference]: With dead ends: 18044 [2019-09-08 16:28:14,871 INFO L226 Difference]: Without dead ends: 18022 [2019-09-08 16:28:14,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 373 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:28:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18022 states. [2019-09-08 16:28:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18022 to 15545. [2019-09-08 16:28:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15545 states. [2019-09-08 16:28:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15545 states to 15545 states and 20890 transitions. [2019-09-08 16:28:15,560 INFO L78 Accepts]: Start accepts. Automaton has 15545 states and 20890 transitions. Word has length 373 [2019-09-08 16:28:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:28:15,561 INFO L475 AbstractCegarLoop]: Abstraction has 15545 states and 20890 transitions. [2019-09-08 16:28:15,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:28:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 15545 states and 20890 transitions. [2019-09-08 16:28:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-08 16:28:15,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:28:15,585 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:15,585 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:28:15,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:28:15,585 INFO L82 PathProgramCache]: Analyzing trace with hash 308456, now seen corresponding path program 1 times [2019-09-08 16:28:15,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:28:15,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:28:15,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:15,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:15,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2019-09-08 16:28:16,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:28:16,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:28:16,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:28:16,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:28:16,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:28:16,054 INFO L87 Difference]: Start difference. First operand 15545 states and 20890 transitions. Second operand 3 states. [2019-09-08 16:28:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:28:16,545 INFO L93 Difference]: Finished difference Result 30647 states and 41216 transitions. [2019-09-08 16:28:16,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:28:16,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2019-09-08 16:28:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:28:16,604 INFO L225 Difference]: With dead ends: 30647 [2019-09-08 16:28:16,605 INFO L226 Difference]: Without dead ends: 13493 [2019-09-08 16:28:16,645 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:28:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2019-09-08 16:28:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2019-09-08 16:28:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13493 states. [2019-09-08 16:28:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 18014 transitions. [2019-09-08 16:28:17,251 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 18014 transitions. Word has length 377 [2019-09-08 16:28:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:28:17,252 INFO L475 AbstractCegarLoop]: Abstraction has 13493 states and 18014 transitions. [2019-09-08 16:28:17,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:28:17,253 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 18014 transitions. [2019-09-08 16:28:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-08 16:28:17,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:28:17,275 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 11, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:17,276 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:28:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:28:17,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1488001555, now seen corresponding path program 1 times [2019-09-08 16:28:17,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:28:17,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:28:17,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:17,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:17,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-09-08 16:28:17,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:28:17,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 16:28:17,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:28:17,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:28:17,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:28:17,854 INFO L87 Difference]: Start difference. First operand 13493 states and 18014 transitions. Second operand 6 states. [2019-09-08 16:28:18,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:28:18,575 INFO L93 Difference]: Finished difference Result 26934 states and 36007 transitions. [2019-09-08 16:28:18,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 16:28:18,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 402 [2019-09-08 16:28:18,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:28:18,618 INFO L225 Difference]: With dead ends: 26934 [2019-09-08 16:28:18,619 INFO L226 Difference]: Without dead ends: 13581 [2019-09-08 16:28:18,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:28:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13581 states. [2019-09-08 16:28:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13581 to 13529. [2019-09-08 16:28:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13529 states. [2019-09-08 16:28:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13529 states to 13529 states and 18068 transitions. [2019-09-08 16:28:19,191 INFO L78 Accepts]: Start accepts. Automaton has 13529 states and 18068 transitions. Word has length 402 [2019-09-08 16:28:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:28:19,192 INFO L475 AbstractCegarLoop]: Abstraction has 13529 states and 18068 transitions. [2019-09-08 16:28:19,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:28:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 13529 states and 18068 transitions. [2019-09-08 16:28:19,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-09-08 16:28:19,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:28:19,212 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 11, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:19,212 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:28:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:28:19,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1754564784, now seen corresponding path program 1 times [2019-09-08 16:28:19,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:28:19,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:28:19,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:19,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:19,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2019-09-08 16:28:19,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:28:19,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 16:28:19,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 16:28:19,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 16:28:19,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:28:19,926 INFO L87 Difference]: Start difference. First operand 13529 states and 18068 transitions. Second operand 10 states. [2019-09-08 16:28:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:28:20,467 INFO L93 Difference]: Finished difference Result 27400 states and 36841 transitions. [2019-09-08 16:28:20,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 16:28:20,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 406 [2019-09-08 16:28:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:28:20,523 INFO L225 Difference]: With dead ends: 27400 [2019-09-08 16:28:20,523 INFO L226 Difference]: Without dead ends: 14011 [2019-09-08 16:28:20,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:28:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14011 states. [2019-09-08 16:28:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14011 to 13613. [2019-09-08 16:28:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13613 states. [2019-09-08 16:28:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13613 states to 13613 states and 18160 transitions. [2019-09-08 16:28:21,301 INFO L78 Accepts]: Start accepts. Automaton has 13613 states and 18160 transitions. Word has length 406 [2019-09-08 16:28:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:28:21,302 INFO L475 AbstractCegarLoop]: Abstraction has 13613 states and 18160 transitions. [2019-09-08 16:28:21,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 16:28:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 13613 states and 18160 transitions. [2019-09-08 16:28:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 16:28:21,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:28:21,314 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:21,314 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:28:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:28:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1050630514, now seen corresponding path program 1 times [2019-09-08 16:28:21,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:28:21,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:28:21,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:21,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:28:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 46 proven. 20 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-08 16:28:25,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:28:25,747 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:28:25,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:28:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:28:26,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 2432 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-08 16:28:26,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:28:26,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-08 16:28:26,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:26,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:26,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 16:28:26,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-08 16:28:28,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-08 16:28:28,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:28,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:28,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 16:28:28,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2019-09-08 16:28:28,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-08 16:28:28,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:28,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:28,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 16:28:28,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2019-09-08 16:28:29,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-08 16:28:29,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:29,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:29,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 16:28:29,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2019-09-08 16:28:29,323 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:29,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-09-08 16:28:29,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:29,366 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.7 percent of original size [2019-09-08 16:28:29,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:29,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 16:28:29,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:33 [2019-09-08 16:28:29,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:29,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:29,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:29,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:29,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:30,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:30,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-09-08 16:28:30,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:30,028 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 16:28:30,028 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:30,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:30,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 16:28:30,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:7 [2019-09-08 16:28:30,147 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-09-08 16:28:30,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-09-08 16:28:30,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:30,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:30,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 16:28:30,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:20 [2019-09-08 16:28:30,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:30,534 INFO L341 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-09-08 16:28:30,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 60 [2019-09-08 16:28:30,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:30,661 INFO L341 Elim1Store]: treesize reduction 40, result has 59.2 percent of original size [2019-09-08 16:28:30,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 93 [2019-09-08 16:28:30,663 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:30,834 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 16:28:30,834 INFO L567 ElimStorePlain]: treesize reduction 55, result has 61.0 percent of original size [2019-09-08 16:28:30,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-09-08 16:28:30,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:96, output treesize:86 [2019-09-08 16:28:30,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:31,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:31,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:31,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:31,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:31,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:31,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:31,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:28:31,796 INFO L341 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-09-08 16:28:31,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 72 [2019-09-08 16:28:31,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:31,923 INFO L341 Elim1Store]: treesize reduction 40, result has 59.2 percent of original size [2019-09-08 16:28:31,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 105 [2019-09-08 16:28:31,925 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:32,100 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 16:28:32,101 INFO L567 ElimStorePlain]: treesize reduction 48, result has 70.9 percent of original size [2019-09-08 16:28:32,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 16:28:32,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2019-09-08 16:28:32,117 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:32,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 16:28:32,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2019-09-08 16:28:32,131 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:32,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:32,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 16:28:32,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-09-08 16:28:32,199 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:108, output treesize:99 [2019-09-08 16:28:32,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 16:28:32,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 16:28:32,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 16:28:32,650 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_BEFORE_CALL_5|], 1=[v_prenex_9]} [2019-09-08 16:28:32,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-09-08 16:28:32,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:32,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:32,696 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:32,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2019-09-08 16:28:32,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:32,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:32,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2019-09-08 16:28:32,733 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:32,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:32,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-09-08 16:28:32,771 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:32,792 INFO L567 ElimStorePlain]: treesize reduction 14, result has 41.7 percent of original size [2019-09-08 16:28:32,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 16:28:32,793 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:60, output treesize:10 [2019-09-08 16:28:33,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-09-08 16:28:33,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:33,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:33,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 16:28:33,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-09-08 16:28:33,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2019-09-08 16:28:33,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:33,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:33,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 16:28:33,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2019-09-08 16:28:34,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-09-08 16:28:34,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:34,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:34,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-09-08 16:28:34,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 16:28:34,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:28:34,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 16:28:34,314 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-09-08 16:29:09,468 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 16:29:09,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 16:29:09,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2019-09-08 16:29:09,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-09-08 16:29:09,485 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 16:29:09,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:29:09,488 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 16:29:09,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:29:09,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 16:29:09,499 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:18 [2019-09-08 16:29:15,416 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 16:29:15,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 59 [2019-09-08 16:29:15,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:29:15,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:29:15,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 16:29:15,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:29:15,631 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-08 16:29:15,641 INFO L168 Benchmark]: Toolchain (without parser) took 120864.52 ms. Allocated memory was 135.8 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 78.9 MB in the beginning and 915.7 MB in the end (delta: -836.8 MB). Peak memory consumption was 908.6 MB. Max. memory is 7.1 GB. [2019-09-08 16:29:15,642 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 135.8 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-08 16:29:15,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2815.86 ms. Allocated memory was 135.8 MB in the beginning and 264.8 MB in the end (delta: 129.0 MB). Free memory was 78.7 MB in the beginning and 202.7 MB in the end (delta: -124.0 MB). Peak memory consumption was 110.0 MB. Max. memory is 7.1 GB. [2019-09-08 16:29:15,648 INFO L168 Benchmark]: Boogie Preprocessor took 279.08 ms. Allocated memory is still 264.8 MB. Free memory was 202.7 MB in the beginning and 187.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2019-09-08 16:29:15,652 INFO L168 Benchmark]: RCFGBuilder took 4977.83 ms. Allocated memory was 264.8 MB in the beginning and 353.4 MB in the end (delta: 88.6 MB). Free memory was 187.3 MB in the beginning and 158.7 MB in the end (delta: 28.7 MB). Peak memory consumption was 128.8 MB. Max. memory is 7.1 GB. [2019-09-08 16:29:15,653 INFO L168 Benchmark]: TraceAbstraction took 112782.12 ms. Allocated memory was 353.4 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 158.7 MB in the beginning and 915.7 MB in the end (delta: -757.1 MB). Peak memory consumption was 770.7 MB. Max. memory is 7.1 GB. [2019-09-08 16:29:15,661 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 135.8 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2815.86 ms. Allocated memory was 135.8 MB in the beginning and 264.8 MB in the end (delta: 129.0 MB). Free memory was 78.7 MB in the beginning and 202.7 MB in the end (delta: -124.0 MB). Peak memory consumption was 110.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 279.08 ms. Allocated memory is still 264.8 MB. Free memory was 202.7 MB in the beginning and 187.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4977.83 ms. Allocated memory was 264.8 MB in the beginning and 353.4 MB in the end (delta: 88.6 MB). Free memory was 187.3 MB in the beginning and 158.7 MB in the end (delta: 28.7 MB). Peak memory consumption was 128.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112782.12 ms. Allocated memory was 353.4 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 158.7 MB in the beginning and 915.7 MB in the end (delta: -757.1 MB). Peak memory consumption was 770.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...