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-673a906-m [2019-10-02 07:04:30,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 07:04:30,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 07:04:30,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 07:04:30,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 07:04:30,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 07:04:30,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 07:04:30,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 07:04:30,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 07:04:30,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 07:04:30,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 07:04:30,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 07:04:30,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 07:04:30,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 07:04:30,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 07:04:30,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 07:04:30,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 07:04:30,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 07:04:30,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 07:04:30,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 07:04:30,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 07:04:30,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 07:04:30,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 07:04:30,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 07:04:30,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 07:04:30,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 07:04:30,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 07:04:30,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 07:04:30,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 07:04:30,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 07:04:30,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 07:04:30,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 07:04:30,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 07:04:30,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 07:04:30,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 07:04:30,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 07:04:30,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 07:04:30,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 07:04:30,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 07:04:30,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 07:04:30,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 07:04:30,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 07:04:30,927 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 07:04:30,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 07:04:30,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 07:04:30,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 07:04:30,931 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 07:04:30,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 07:04:30,932 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 07:04:30,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 07:04:30,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 07:04:30,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 07:04:30,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 07:04:30,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 07:04:30,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 07:04:30,933 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 07:04:30,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 07:04:30,934 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 07:04:30,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 07:04:30,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 07:04:30,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 07:04:30,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 07:04:30,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 07:04:30,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 07:04:30,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 07:04:30,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 07:04:30,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 07:04:30,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 07:04:30,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 07:04:30,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 07:04:30,938 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 07:04:30,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 07:04:30,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 07:04:31,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 07:04:31,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 07:04:31,003 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 07:04:31,003 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-10-02 07:04:31,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a8fd7a6/a83b421be2a741cbb64a49dc0fbbe85d/FLAG290ee8069 [2019-10-02 07:04:31,843 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 07:04:31,844 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-10-02 07:04:31,888 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a8fd7a6/a83b421be2a741cbb64a49dc0fbbe85d/FLAG290ee8069 [2019-10-02 07:04:32,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a8fd7a6/a83b421be2a741cbb64a49dc0fbbe85d [2019-10-02 07:04:32,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 07:04:32,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 07:04:32,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 07:04:32,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 07:04:32,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 07:04:32,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 07:04:32" (1/1) ... [2019-10-02 07:04:32,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e42ed26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:04:32, skipping insertion in model container [2019-10-02 07:04:32,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 07:04:32" (1/1) ... [2019-10-02 07:04:32,429 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 07:04:32,567 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 07:04:34,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 07:04:34,585 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 07:04:34,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 07:04:35,198 INFO L192 MainTranslator]: Completed translation [2019-10-02 07:04:35,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:04:35 WrapperNode [2019-10-02 07:04:35,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 07:04:35,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 07:04:35,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 07:04:35,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 07:04:35,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:04:35" (1/1) ... [2019-10-02 07:04:35,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:04:35" (1/1) ... [2019-10-02 07:04:35,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:04:35" (1/1) ... [2019-10-02 07:04:35,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:04:35" (1/1) ... [2019-10-02 07:04:35,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:04:35" (1/1) ... [2019-10-02 07:04:35,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:04:35" (1/1) ... [2019-10-02 07:04:35,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:04:35" (1/1) ... [2019-10-02 07:04:35,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 07:04:35,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 07:04:35,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 07:04:35,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 07:04:35,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:04:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 07:04:35,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 07:04:35,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 07:04:35,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2019-10-02 07:04:35,534 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-10-02 07:04:35,535 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-10-02 07:04:35,535 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-10-02 07:04:35,535 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2019-10-02 07:04:35,536 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2019-10-02 07:04:35,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_swab32 [2019-10-02 07:04:35,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2019-10-02 07:04:35,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2019-10-02 07:04:35,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __swab16p [2019-10-02 07:04:35,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __swab32p [2019-10-02 07:04:35,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __be32_to_cpup [2019-10-02 07:04:35,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __be16_to_cpup [2019-10-02 07:04:35,538 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2019-10-02 07:04:35,540 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2019-10-02 07:04:35,540 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2019-10-02 07:04:35,540 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-10-02 07:04:35,541 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2019-10-02 07:04:35,541 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2019-10-02 07:04:35,541 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2019-10-02 07:04:35,541 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2019-10-02 07:04:35,541 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-10-02 07:04:35,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-02 07:04:35,542 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-02 07:04:35,542 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-02 07:04:35,542 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-10-02 07:04:35,542 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-10-02 07:04:35,542 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_empty [2019-10-02 07:04:35,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __skb_queue_head_init [2019-10-02 07:04:35,543 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head_init [2019-10-02 07:04:35,543 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_is_nonlinear [2019-10-02 07:04:35,543 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2019-10-02 07:04:35,543 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2019-10-02 07:04:35,543 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2019-10-02 07:04:35,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 07:04:35,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-02 07:04:35,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-02 07:04:35,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-02 07:04:35,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-02 07:04:35,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-02 07:04:35,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-02 07:04:35,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-02 07:04:35,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-02 07:04:35,545 INFO L138 BoogieDeclarations]: Found implementation of procedure sema_init [2019-10-02 07:04:35,545 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_get_baud_rate [2019-10-02 07:04:35,545 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2019-10-02 07:04:35,545 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2019-10-02 07:04:35,545 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2019-10-02 07:04:35,546 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be32 [2019-10-02 07:04:35,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2019-10-02 07:04:35,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2019-10-02 07:04:35,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_open [2019-10-02 07:04:35,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2019-10-02 07:04:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2019-10-02 07:04:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_read [2019-10-02 07:04:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_write [2019-10-02 07:04:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2019-10-02 07:04:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2019-10-02 07:04:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_receive [2019-10-02 07:04:35,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_wakeup [2019-10-02 07:04:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_init [2019-10-02 07:04:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_ioctl [2019-10-02 07:04:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_process [2019-10-02 07:04:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_encode [2019-10-02 07:04:35,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_send [2019-10-02 07:04:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2019-10-02 07:04:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_flush_output [2019-10-02 07:04:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure scan_ordinary [2019-10-02 07:04:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure process_input_packet [2019-10-02 07:04:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_input [2019-10-02 07:04:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2019-10-02 07:04:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_cleanup [2019-10-02 07:04:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize_ppp_channel_ops_2 [2019-10-02 07:04:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_target_type_1 [2019-10-02 07:04:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 07:04:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_5 [2019-10-02 07:04:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_6 [2019-10-02 07:04:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_7 [2019-10-02 07:04:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_8 [2019-10-02 07:04:35,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_11 [2019-10-02 07:04:35,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_12 [2019-10-02 07:04:35,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_13 [2019-10-02 07:04:35,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_dequeue_14 [2019-10-02 07:04:35,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_15 [2019-10-02 07:04:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_16 [2019-10-02 07:04:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_17 [2019-10-02 07:04:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb_18 [2019-10-02 07:04:35,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_init [2019-10-02 07:04:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-10-02 07:04:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2019-10-02 07:04:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_contains [2019-10-02 07:04:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_is_empty [2019-10-02 07:04:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-02 07:04:35,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-02 07:04:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-02 07:04:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-02 07:04:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2019-10-02 07:04:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 07:04:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2019-10-02 07:04:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2019-10-02 07:04:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb [2019-10-02 07:04:35,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_alloc_skb [2019-10-02 07:04:35,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_current [2019-10-02 07:04:35,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 07:04:35,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_from_user_overflow [2019-10-02 07:04:35,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_to_user_overflow [2019-10-02 07:04:35,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-10-02 07:04:35,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __tasklet_schedule [2019-10-02 07:04:35,558 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-10-02 07:04:35,558 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-10-02 07:04:35,558 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_read_lock [2019-10-02 07:04:35,558 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_read_unlock [2019-10-02 07:04:35,558 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_bh [2019-10-02 07:04:35,559 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irq [2019-10-02 07:04:35,559 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-10-02 07:04:35,559 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_bh [2019-10-02 07:04:35,559 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irq [2019-10-02 07:04:35,559 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-10-02 07:04:35,560 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_write_lock_irq [2019-10-02 07:04:35,560 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_write_unlock_irq [2019-10-02 07:04:35,560 INFO L138 BoogieDeclarations]: Found implementation of procedure down [2019-10-02 07:04:35,560 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2019-10-02 07:04:35,561 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-10-02 07:04:35,561 INFO L138 BoogieDeclarations]: Found implementation of procedure n_tty_ioctl_helper [2019-10-02 07:04:35,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_channel_index [2019-10-02 07:04:35,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_input [2019-10-02 07:04:35,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_input_error [2019-10-02 07:04:35,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2019-10-02 07:04:35,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_register_channel [2019-10-02 07:04:35,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_unit_number [2019-10-02 07:04:35,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_unregister_channel [2019-10-02 07:04:35,562 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 07:04:35,563 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2019-10-02 07:04:35,563 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2019-10-02 07:04:35,563 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-10-02 07:04:35,563 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_purge [2019-10-02 07:04:35,563 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2019-10-02 07:04:35,564 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2019-10-02 07:04:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure start_tty [2019-10-02 07:04:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_tty [2019-10-02 07:04:35,568 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2019-10-02 07:04:35,568 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_kill [2019-10-02 07:04:35,574 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_mode_ioctl [2019-10-02 07:04:35,574 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_register_ldisc [2019-10-02 07:04:35,574 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_termios_baud_rate [2019-10-02 07:04:35,574 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_unregister_ldisc [2019-10-02 07:04:35,574 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_unthrottle [2019-10-02 07:04:35,575 INFO L138 BoogieDeclarations]: Found implementation of procedure up [2019-10-02 07:04:35,575 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 07:04:35,575 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 07:04:35,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-02 07:04:35,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-02 07:04:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 07:04:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-02 07:04:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-10-02 07:04:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-10-02 07:04:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-10-02 07:04:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2019-10-02 07:04:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2019-10-02 07:04:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 07:04:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_swab32 [2019-10-02 07:04:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2019-10-02 07:04:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2019-10-02 07:04:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure __swab16p [2019-10-02 07:04:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure __swab32p [2019-10-02 07:04:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure __be32_to_cpup [2019-10-02 07:04:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure __be16_to_cpup [2019-10-02 07:04:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 07:04:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-10-02 07:04:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-02 07:04:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2019-10-02 07:04:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 07:04:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2019-10-02 07:04:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2019-10-02 07:04:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2019-10-02 07:04:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-10-02 07:04:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_bh [2019-10-02 07:04:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irq [2019-10-02 07:04:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-10-02 07:04:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_bh [2019-10-02 07:04:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irq [2019-10-02 07:04:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-10-02 07:04:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_read_lock [2019-10-02 07:04:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_write_lock_irq [2019-10-02 07:04:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_read_unlock [2019-10-02 07:04:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_write_unlock_irq [2019-10-02 07:04:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-10-02 07:04:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2019-10-02 07:04:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2019-10-02 07:04:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2019-10-02 07:04:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2019-10-02 07:04:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-10-02 07:04:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 07:04:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 07:04:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-02 07:04:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-02 07:04:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-02 07:04:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-10-02 07:04:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-10-02 07:04:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_from_user_overflow [2019-10-02 07:04:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_to_user_overflow [2019-10-02 07:04:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-10-02 07:04:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-10-02 07:04:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_6 [2019-10-02 07:04:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_7 [2019-10-02 07:04:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_8 [2019-10-02 07:04:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_11 [2019-10-02 07:04:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_12 [2019-10-02 07:04:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_13 [2019-10-02 07:04:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_16 [2019-10-02 07:04:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_17 [2019-10-02 07:04:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_5 [2019-10-02 07:04:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_15 [2019-10-02 07:04:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_empty [2019-10-02 07:04:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 07:04:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure __skb_queue_head_init [2019-10-02 07:04:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 07:04:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head_init [2019-10-02 07:04:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 07:04:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 07:04:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2019-10-02 07:04:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_dequeue_14 [2019-10-02 07:04:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure skb_is_nonlinear [2019-10-02 07:04:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-10-02 07:04:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2019-10-02 07:04:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2019-10-02 07:04:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2019-10-02 07:04:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2019-10-02 07:04:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2019-10-02 07:04:35,588 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2019-10-02 07:04:35,588 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_purge [2019-10-02 07:04:35,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb_18 [2019-10-02 07:04:35,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2019-10-02 07:04:35,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2019-10-02 07:04:35,588 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 07:04:35,588 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 07:04:35,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 07:04:35,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_size_t [2019-10-02 07:04:35,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 07:04:35,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 07:04:35,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 07:04:35,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 07:04:35,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 07:04:35,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-02 07:04:35,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-02 07:04:35,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-02 07:04:35,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-02 07:04:35,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-02 07:04:35,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-02 07:04:35,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-02 07:04:35,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-02 07:04:35,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize_ppp_channel_ops_2 [2019-10-02 07:04:35,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_target_type_1 [2019-10-02 07:04:35,591 INFO L130 BoogieDeclarations]: Found specification of procedure sema_init [2019-10-02 07:04:35,591 INFO L130 BoogieDeclarations]: Found specification of procedure down [2019-10-02 07:04:35,591 INFO L130 BoogieDeclarations]: Found specification of procedure up [2019-10-02 07:04:35,591 INFO L130 BoogieDeclarations]: Found specification of procedure stop_tty [2019-10-02 07:04:35,591 INFO L130 BoogieDeclarations]: Found specification of procedure start_tty [2019-10-02 07:04:35,591 INFO L130 BoogieDeclarations]: Found specification of procedure tty_unthrottle [2019-10-02 07:04:35,591 INFO L130 BoogieDeclarations]: Found specification of procedure tty_termios_baud_rate [2019-10-02 07:04:35,592 INFO L130 BoogieDeclarations]: Found specification of procedure tty_get_baud_rate [2019-10-02 07:04:35,592 INFO L130 BoogieDeclarations]: Found specification of procedure tty_mode_ioctl [2019-10-02 07:04:35,592 INFO L130 BoogieDeclarations]: Found specification of procedure tty_register_ldisc [2019-10-02 07:04:35,592 INFO L130 BoogieDeclarations]: Found specification of procedure tty_unregister_ldisc [2019-10-02 07:04:35,593 INFO L130 BoogieDeclarations]: Found specification of procedure n_tty_ioctl_helper [2019-10-02 07:04:35,596 INFO L130 BoogieDeclarations]: Found specification of procedure __tasklet_schedule [2019-10-02 07:04:35,597 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2019-10-02 07:04:35,597 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_kill [2019-10-02 07:04:35,597 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2019-10-02 07:04:35,597 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2019-10-02 07:04:35,599 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2019-10-02 07:04:35,599 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_input [2019-10-02 07:04:35,599 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_input_error [2019-10-02 07:04:35,599 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_register_channel [2019-10-02 07:04:35,600 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unregister_channel [2019-10-02 07:04:35,600 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_channel_index [2019-10-02 07:04:35,600 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unit_number [2019-10-02 07:04:35,600 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2019-10-02 07:04:35,600 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be32 [2019-10-02 07:04:35,600 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_encode [2019-10-02 07:04:35,600 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_send [2019-10-02 07:04:35,600 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2019-10-02 07:04:35,600 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_flush_output [2019-10-02 07:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_input [2019-10-02 07:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_ioctl [2019-10-02 07:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_process [2019-10-02 07:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2019-10-02 07:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2019-10-02 07:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2019-10-02 07:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_open [2019-10-02 07:04:35,601 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2019-10-02 07:04:35,602 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2019-10-02 07:04:35,602 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_read [2019-10-02 07:04:35,602 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_write [2019-10-02 07:04:35,602 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2019-10-02 07:04:35,602 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2019-10-02 07:04:35,602 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_receive [2019-10-02 07:04:35,602 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_wakeup [2019-10-02 07:04:35,602 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_init [2019-10-02 07:04:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-02 07:04:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2019-10-02 07:04:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure scan_ordinary [2019-10-02 07:04:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure process_input_packet [2019-10-02 07:04:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_cleanup [2019-10-02 07:04:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 07:04:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 07:04:35,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 07:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_init [2019-10-02 07:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-10-02 07:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2019-10-02 07:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_contains [2019-10-02 07:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_is_empty [2019-10-02 07:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-02 07:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-02 07:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-02 07:04:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-02 07:04:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2019-10-02 07:04:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_alloc_skb [2019-10-02 07:04:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb [2019-10-02 07:04:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_current [2019-10-02 07:04:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 07:04:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 07:04:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 07:04:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 07:04:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 07:04:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 07:04:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-02 07:04:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-02 07:04:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-02 07:04:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-02 07:04:36,786 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-02 07:04:40,536 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 07:04:40,537 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 07:04:40,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 07:04:40 BoogieIcfgContainer [2019-10-02 07:04:40,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 07:04:40,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 07:04:40,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 07:04:40,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 07:04:40,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 07:04:32" (1/3) ... [2019-10-02 07:04:40,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d744cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 07:04:40, skipping insertion in model container [2019-10-02 07:04:40,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:04:35" (2/3) ... [2019-10-02 07:04:40,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d744cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 07:04:40, skipping insertion in model container [2019-10-02 07:04:40,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 07:04:40" (3/3) ... [2019-10-02 07:04:40,547 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-10-02 07:04:40,558 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 07:04:40,569 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 07:04:40,588 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 07:04:40,627 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 07:04:40,628 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 07:04:40,628 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 07:04:40,628 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 07:04:40,628 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 07:04:40,628 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 07:04:40,628 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 07:04:40,628 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 07:04:40,628 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 07:04:40,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states. [2019-10-02 07:04:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 07:04:40,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:04:40,688 INFO L411 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-10-02 07:04:40,690 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:04:40,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:04:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1820998869, now seen corresponding path program 1 times [2019-10-02 07:04:40,699 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:04:40,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:04:40,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:40,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:04:40,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:04:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 07:04:41,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:04:41,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 07:04:41,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 07:04:41,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 07:04:41,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:04:41,251 INFO L87 Difference]: Start difference. First operand 1100 states. Second operand 3 states. [2019-10-02 07:04:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:04:41,488 INFO L93 Difference]: Finished difference Result 3029 states and 4023 transitions. [2019-10-02 07:04:41,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 07:04:41,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-02 07:04:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:04:41,535 INFO L225 Difference]: With dead ends: 3029 [2019-10-02 07:04:41,535 INFO L226 Difference]: Without dead ends: 1994 [2019-10-02 07:04:41,549 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:04:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2019-10-02 07:04:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2019-10-02 07:04:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-10-02 07:04:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2597 transitions. [2019-10-02 07:04:41,833 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2597 transitions. Word has length 101 [2019-10-02 07:04:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:04:41,834 INFO L475 AbstractCegarLoop]: Abstraction has 1994 states and 2597 transitions. [2019-10-02 07:04:41,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 07:04:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2597 transitions. [2019-10-02 07:04:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 07:04:41,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:04:41,848 INFO L411 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-10-02 07:04:41,848 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:04:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:04:41,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1355814239, now seen corresponding path program 1 times [2019-10-02 07:04:41,849 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:04:41,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:04:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:41,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:04:41,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:04:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 07:04:42,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:04:42,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 07:04:42,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 07:04:42,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 07:04:42,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 07:04:42,173 INFO L87 Difference]: Start difference. First operand 1994 states and 2597 transitions. Second operand 6 states. [2019-10-02 07:04:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:04:43,471 INFO L93 Difference]: Finished difference Result 5919 states and 7771 transitions. [2019-10-02 07:04:43,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 07:04:43,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-02 07:04:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:04:43,497 INFO L225 Difference]: With dead ends: 5919 [2019-10-02 07:04:43,497 INFO L226 Difference]: Without dead ends: 3940 [2019-10-02 07:04:43,506 INFO L640 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-10-02 07:04:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2019-10-02 07:04:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3940. [2019-10-02 07:04:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3940 states. [2019-10-02 07:04:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 5183 transitions. [2019-10-02 07:04:43,746 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 5183 transitions. Word has length 105 [2019-10-02 07:04:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:04:43,747 INFO L475 AbstractCegarLoop]: Abstraction has 3940 states and 5183 transitions. [2019-10-02 07:04:43,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 07:04:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 5183 transitions. [2019-10-02 07:04:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 07:04:43,759 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:04:43,759 INFO L411 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-10-02 07:04:43,759 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:04:43,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:04:43,760 INFO L82 PathProgramCache]: Analyzing trace with hash -496371555, now seen corresponding path program 1 times [2019-10-02 07:04:43,760 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:04:43,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:04:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:43,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:04:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:04:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-02 07:04:43,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:04:43,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 07:04:43,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 07:04:43,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 07:04:43,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:04:43,912 INFO L87 Difference]: Start difference. First operand 3940 states and 5183 transitions. Second operand 3 states. [2019-10-02 07:04:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:04:44,158 INFO L93 Difference]: Finished difference Result 9560 states and 12636 transitions. [2019-10-02 07:04:44,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 07:04:44,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-02 07:04:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:04:44,205 INFO L225 Difference]: With dead ends: 9560 [2019-10-02 07:04:44,205 INFO L226 Difference]: Without dead ends: 5654 [2019-10-02 07:04:44,222 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:04:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5654 states. [2019-10-02 07:04:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5654 to 5630. [2019-10-02 07:04:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5630 states. [2019-10-02 07:04:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5630 states to 5630 states and 7469 transitions. [2019-10-02 07:04:44,467 INFO L78 Accepts]: Start accepts. Automaton has 5630 states and 7469 transitions. Word has length 188 [2019-10-02 07:04:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:04:44,469 INFO L475 AbstractCegarLoop]: Abstraction has 5630 states and 7469 transitions. [2019-10-02 07:04:44,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 07:04:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5630 states and 7469 transitions. [2019-10-02 07:04:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 07:04:44,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:04:44,489 INFO L411 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-10-02 07:04:44,490 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:04:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:04:44,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1202569559, now seen corresponding path program 1 times [2019-10-02 07:04:44,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:04:44,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:04:44,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:44,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:04:44,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:04:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-10-02 07:04:44,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:04:44,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 07:04:44,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 07:04:44,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 07:04:44,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:04:44,734 INFO L87 Difference]: Start difference. First operand 5630 states and 7469 transitions. Second operand 3 states. [2019-10-02 07:04:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:04:45,064 INFO L93 Difference]: Finished difference Result 14129 states and 18555 transitions. [2019-10-02 07:04:45,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 07:04:45,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-10-02 07:04:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:04:45,116 INFO L225 Difference]: With dead ends: 14129 [2019-10-02 07:04:45,116 INFO L226 Difference]: Without dead ends: 8533 [2019-10-02 07:04:45,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:04:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8533 states. [2019-10-02 07:04:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8533 to 8511. [2019-10-02 07:04:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8511 states. [2019-10-02 07:04:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8511 states to 8511 states and 11100 transitions. [2019-10-02 07:04:45,504 INFO L78 Accepts]: Start accepts. Automaton has 8511 states and 11100 transitions. Word has length 213 [2019-10-02 07:04:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:04:45,504 INFO L475 AbstractCegarLoop]: Abstraction has 8511 states and 11100 transitions. [2019-10-02 07:04:45,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 07:04:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8511 states and 11100 transitions. [2019-10-02 07:04:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 07:04:45,534 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:04:45,534 INFO L411 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-10-02 07:04:45,534 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:04:45,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:04:45,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1201387558, now seen corresponding path program 1 times [2019-10-02 07:04:45,535 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:04:45,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:04:45,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:45,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:04:45,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:04:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-02 07:04:45,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:04:45,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 07:04:45,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 07:04:45,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 07:04:45,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 07:04:45,749 INFO L87 Difference]: Start difference. First operand 8511 states and 11100 transitions. Second operand 6 states. [2019-10-02 07:04:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:04:46,074 INFO L93 Difference]: Finished difference Result 12907 states and 16821 transitions. [2019-10-02 07:04:46,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 07:04:46,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 226 [2019-10-02 07:04:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:04:46,101 INFO L225 Difference]: With dead ends: 12907 [2019-10-02 07:04:46,101 INFO L226 Difference]: Without dead ends: 4415 [2019-10-02 07:04:46,124 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 07:04:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2019-10-02 07:04:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 4337. [2019-10-02 07:04:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4337 states. [2019-10-02 07:04:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 5649 transitions. [2019-10-02 07:04:46,283 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 5649 transitions. Word has length 226 [2019-10-02 07:04:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:04:46,285 INFO L475 AbstractCegarLoop]: Abstraction has 4337 states and 5649 transitions. [2019-10-02 07:04:46,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 07:04:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 5649 transitions. [2019-10-02 07:04:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 07:04:46,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:04:46,299 INFO L411 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-10-02 07:04:46,299 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:04:46,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:04:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash -934495644, now seen corresponding path program 1 times [2019-10-02 07:04:46,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:04:46,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:04:46,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:46,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:04:46,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:04:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-10-02 07:04:46,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:04:46,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 07:04:46,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 07:04:46,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 07:04:46,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:04:46,449 INFO L87 Difference]: Start difference. First operand 4337 states and 5649 transitions. Second operand 3 states. [2019-10-02 07:04:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:04:46,680 INFO L93 Difference]: Finished difference Result 10404 states and 13579 transitions. [2019-10-02 07:04:46,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 07:04:46,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-10-02 07:04:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:04:46,723 INFO L225 Difference]: With dead ends: 10404 [2019-10-02 07:04:46,723 INFO L226 Difference]: Without dead ends: 6125 [2019-10-02 07:04:46,738 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:04:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2019-10-02 07:04:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 6098. [2019-10-02 07:04:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6098 states. [2019-10-02 07:04:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 7924 transitions. [2019-10-02 07:04:46,936 INFO L78 Accepts]: Start accepts. Automaton has 6098 states and 7924 transitions. Word has length 226 [2019-10-02 07:04:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:04:46,937 INFO L475 AbstractCegarLoop]: Abstraction has 6098 states and 7924 transitions. [2019-10-02 07:04:46,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 07:04:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 6098 states and 7924 transitions. [2019-10-02 07:04:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 07:04:46,953 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:04:46,953 INFO L411 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-10-02 07:04:46,953 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:04:46,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:04:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1769311907, now seen corresponding path program 1 times [2019-10-02 07:04:46,954 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:04:46,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:04:46,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:46,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:04:46,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:04:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-10-02 07:04:47,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:04:47,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 07:04:47,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 07:04:47,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 07:04:47,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:04:47,193 INFO L87 Difference]: Start difference. First operand 6098 states and 7924 transitions. Second operand 3 states. [2019-10-02 07:04:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:04:47,306 INFO L93 Difference]: Finished difference Result 9182 states and 12035 transitions. [2019-10-02 07:04:47,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 07:04:47,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-02 07:04:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:04:47,334 INFO L225 Difference]: With dead ends: 9182 [2019-10-02 07:04:47,334 INFO L226 Difference]: Without dead ends: 6118 [2019-10-02 07:04:47,346 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:04:47,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6118 states. [2019-10-02 07:04:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6118 to 6108. [2019-10-02 07:04:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2019-10-02 07:04:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 7934 transitions. [2019-10-02 07:04:47,535 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 7934 transitions. Word has length 231 [2019-10-02 07:04:47,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:04:47,535 INFO L475 AbstractCegarLoop]: Abstraction has 6108 states and 7934 transitions. [2019-10-02 07:04:47,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 07:04:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 7934 transitions. [2019-10-02 07:04:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 07:04:47,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:04:47,551 INFO L411 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-10-02 07:04:47,551 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:04:47,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:04:47,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1112900194, now seen corresponding path program 1 times [2019-10-02 07:04:47,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:04:47,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:04:47,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:47,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:04:47,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:04:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-02 07:04:47,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 07:04:47,890 INFO L224 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-10-02 07:04:48,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:04:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:04:48,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 07:04:48,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 07:04:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 07:04:49,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 07:04:49,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-02 07:04:49,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 07:04:49,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 07:04:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-02 07:04:49,064 INFO L87 Difference]: Start difference. First operand 6108 states and 7934 transitions. Second operand 13 states. [2019-10-02 07:05:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:05:21,254 INFO L93 Difference]: Finished difference Result 17249 states and 22876 transitions. [2019-10-02 07:05:21,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 07:05:21,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 233 [2019-10-02 07:05:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:05:21,318 INFO L225 Difference]: With dead ends: 17249 [2019-10-02 07:05:21,318 INFO L226 Difference]: Without dead ends: 11199 [2019-10-02 07:05:21,339 INFO L640 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-10-02 07:05:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11199 states. [2019-10-02 07:05:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11199 to 10991. [2019-10-02 07:05:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10991 states. [2019-10-02 07:05:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10991 states to 10991 states and 14452 transitions. [2019-10-02 07:05:21,857 INFO L78 Accepts]: Start accepts. Automaton has 10991 states and 14452 transitions. Word has length 233 [2019-10-02 07:05:21,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:05:21,860 INFO L475 AbstractCegarLoop]: Abstraction has 10991 states and 14452 transitions. [2019-10-02 07:05:21,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 07:05:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 10991 states and 14452 transitions. [2019-10-02 07:05:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-10-02 07:05:21,876 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:05:21,876 INFO L411 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-10-02 07:05:21,877 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:05:21,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:05:21,877 INFO L82 PathProgramCache]: Analyzing trace with hash 635817065, now seen corresponding path program 1 times [2019-10-02 07:05:21,877 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:05:21,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:05:21,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:21,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:05:21,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-10-02 07:05:22,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:05:22,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 07:05:22,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 07:05:22,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 07:05:22,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 07:05:22,176 INFO L87 Difference]: Start difference. First operand 10991 states and 14452 transitions. Second operand 5 states. [2019-10-02 07:05:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:05:22,421 INFO L93 Difference]: Finished difference Result 21986 states and 28990 transitions. [2019-10-02 07:05:22,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 07:05:22,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 275 [2019-10-02 07:05:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:05:22,470 INFO L225 Difference]: With dead ends: 21986 [2019-10-02 07:05:22,470 INFO L226 Difference]: Without dead ends: 11053 [2019-10-02 07:05:22,503 INFO L640 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-10-02 07:05:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11053 states. [2019-10-02 07:05:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11053 to 11027. [2019-10-02 07:05:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11027 states. [2019-10-02 07:05:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11027 states to 11027 states and 14491 transitions. [2019-10-02 07:05:22,871 INFO L78 Accepts]: Start accepts. Automaton has 11027 states and 14491 transitions. Word has length 275 [2019-10-02 07:05:22,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:05:22,872 INFO L475 AbstractCegarLoop]: Abstraction has 11027 states and 14491 transitions. [2019-10-02 07:05:22,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 07:05:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 11027 states and 14491 transitions. [2019-10-02 07:05:22,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 07:05:22,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:05:22,888 INFO L411 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-10-02 07:05:22,888 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:05:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:05:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2095629470, now seen corresponding path program 1 times [2019-10-02 07:05:22,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:05:22,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:05:22,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:22,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:05:22,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-10-02 07:05:23,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:05:23,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 07:05:23,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 07:05:23,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 07:05:23,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 07:05:23,320 INFO L87 Difference]: Start difference. First operand 11027 states and 14491 transitions. Second operand 5 states. [2019-10-02 07:05:23,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:05:23,699 INFO L93 Difference]: Finished difference Result 25695 states and 33622 transitions. [2019-10-02 07:05:23,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 07:05:23,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 280 [2019-10-02 07:05:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:05:23,765 INFO L225 Difference]: With dead ends: 25695 [2019-10-02 07:05:23,766 INFO L226 Difference]: Without dead ends: 14726 [2019-10-02 07:05:23,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 07:05:23,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14726 states. [2019-10-02 07:05:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14726 to 11051. [2019-10-02 07:05:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11051 states. [2019-10-02 07:05:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11051 states to 11051 states and 14515 transitions. [2019-10-02 07:05:24,220 INFO L78 Accepts]: Start accepts. Automaton has 11051 states and 14515 transitions. Word has length 280 [2019-10-02 07:05:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:05:24,221 INFO L475 AbstractCegarLoop]: Abstraction has 11051 states and 14515 transitions. [2019-10-02 07:05:24,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 07:05:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 11051 states and 14515 transitions. [2019-10-02 07:05:24,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 07:05:24,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:05:24,240 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 07:05:24,240 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:05:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:05:24,241 INFO L82 PathProgramCache]: Analyzing trace with hash -922595472, now seen corresponding path program 1 times [2019-10-02 07:05:24,241 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:05:24,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:05:24,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:24,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:05:24,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-10-02 07:05:24,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:05:24,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 07:05:24,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 07:05:24,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 07:05:24,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 07:05:24,577 INFO L87 Difference]: Start difference. First operand 11051 states and 14515 transitions. Second operand 6 states. [2019-10-02 07:05:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:05:25,167 INFO L93 Difference]: Finished difference Result 25773 states and 33700 transitions. [2019-10-02 07:05:25,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 07:05:25,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 303 [2019-10-02 07:05:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:05:25,238 INFO L225 Difference]: With dead ends: 25773 [2019-10-02 07:05:25,239 INFO L226 Difference]: Without dead ends: 14780 [2019-10-02 07:05:25,269 INFO L640 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-10-02 07:05:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14780 states. [2019-10-02 07:05:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14780 to 11057. [2019-10-02 07:05:25,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11057 states. [2019-10-02 07:05:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11057 states to 11057 states and 14521 transitions. [2019-10-02 07:05:25,863 INFO L78 Accepts]: Start accepts. Automaton has 11057 states and 14521 transitions. Word has length 303 [2019-10-02 07:05:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:05:25,864 INFO L475 AbstractCegarLoop]: Abstraction has 11057 states and 14521 transitions. [2019-10-02 07:05:25,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 07:05:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 11057 states and 14521 transitions. [2019-10-02 07:05:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-10-02 07:05:25,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:05:25,886 INFO L411 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-10-02 07:05:25,887 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:05:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:05:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1377413375, now seen corresponding path program 1 times [2019-10-02 07:05:25,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:05:25,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:05:25,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:25,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:05:25,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-10-02 07:05:26,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:05:26,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 07:05:26,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 07:05:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 07:05:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 07:05:26,520 INFO L87 Difference]: Start difference. First operand 11057 states and 14521 transitions. Second operand 11 states. [2019-10-02 07:05:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:05:27,044 INFO L93 Difference]: Finished difference Result 22152 states and 29077 transitions. [2019-10-02 07:05:27,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 07:05:27,045 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 373 [2019-10-02 07:05:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:05:27,086 INFO L225 Difference]: With dead ends: 22152 [2019-10-02 07:05:27,086 INFO L226 Difference]: Without dead ends: 11153 [2019-10-02 07:05:27,111 INFO L640 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-10-02 07:05:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11153 states. [2019-10-02 07:05:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11153 to 11135. [2019-10-02 07:05:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11135 states. [2019-10-02 07:05:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11135 states to 11135 states and 14599 transitions. [2019-10-02 07:05:27,492 INFO L78 Accepts]: Start accepts. Automaton has 11135 states and 14599 transitions. Word has length 373 [2019-10-02 07:05:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:05:27,495 INFO L475 AbstractCegarLoop]: Abstraction has 11135 states and 14599 transitions. [2019-10-02 07:05:27,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 07:05:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 11135 states and 14599 transitions. [2019-10-02 07:05:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-10-02 07:05:27,514 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:05:27,515 INFO L411 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-10-02 07:05:27,515 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:05:27,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:05:27,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1259776606, now seen corresponding path program 1 times [2019-10-02 07:05:27,516 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:05:27,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:05:27,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:27,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:05:27,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-10-02 07:05:28,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 07:05:28,964 INFO L224 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-10-02 07:05:29,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:05:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:29,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 2296 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 07:05:29,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 07:05:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-02 07:05:29,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 07:05:29,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-10-02 07:05:29,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 07:05:29,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 07:05:29,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-02 07:05:29,868 INFO L87 Difference]: Start difference. First operand 11135 states and 14599 transitions. Second operand 12 states. [2019-10-02 07:05:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:05:32,748 INFO L93 Difference]: Finished difference Result 28514 states and 38101 transitions. [2019-10-02 07:05:32,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 07:05:32,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 373 [2019-10-02 07:05:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:05:32,834 INFO L225 Difference]: With dead ends: 28514 [2019-10-02 07:05:32,834 INFO L226 Difference]: Without dead ends: 17437 [2019-10-02 07:05:32,871 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-10-02 07:05:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17437 states. [2019-10-02 07:05:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17437 to 15545. [2019-10-02 07:05:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15545 states. [2019-10-02 07:05:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15545 states to 15545 states and 20890 transitions. [2019-10-02 07:05:33,677 INFO L78 Accepts]: Start accepts. Automaton has 15545 states and 20890 transitions. Word has length 373 [2019-10-02 07:05:33,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:05:33,679 INFO L475 AbstractCegarLoop]: Abstraction has 15545 states and 20890 transitions. [2019-10-02 07:05:33,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 07:05:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 15545 states and 20890 transitions. [2019-10-02 07:05:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-02 07:05:33,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:05:33,711 INFO L411 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-10-02 07:05:33,712 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:05:33,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:05:33,712 INFO L82 PathProgramCache]: Analyzing trace with hash 308456, now seen corresponding path program 1 times [2019-10-02 07:05:33,712 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:05:33,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:05:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:33,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:05:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2019-10-02 07:05:34,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:05:34,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 07:05:34,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 07:05:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 07:05:34,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:05:34,022 INFO L87 Difference]: Start difference. First operand 15545 states and 20890 transitions. Second operand 3 states. [2019-10-02 07:05:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:05:34,702 INFO L93 Difference]: Finished difference Result 30647 states and 41216 transitions. [2019-10-02 07:05:34,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 07:05:34,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2019-10-02 07:05:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:05:34,757 INFO L225 Difference]: With dead ends: 30647 [2019-10-02 07:05:34,757 INFO L226 Difference]: Without dead ends: 13493 [2019-10-02 07:05:34,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 07:05:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2019-10-02 07:05:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2019-10-02 07:05:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13493 states. [2019-10-02 07:05:35,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 18014 transitions. [2019-10-02 07:05:35,498 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 18014 transitions. Word has length 377 [2019-10-02 07:05:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:05:35,499 INFO L475 AbstractCegarLoop]: Abstraction has 13493 states and 18014 transitions. [2019-10-02 07:05:35,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 07:05:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 18014 transitions. [2019-10-02 07:05:35,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-10-02 07:05:35,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:05:35,524 INFO L411 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-10-02 07:05:35,524 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:05:35,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:05:35,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1488001555, now seen corresponding path program 1 times [2019-10-02 07:05:35,525 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:05:35,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:05:35,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:35,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:05:35,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-10-02 07:05:36,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:05:36,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 07:05:36,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 07:05:36,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 07:05:36,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 07:05:36,397 INFO L87 Difference]: Start difference. First operand 13493 states and 18014 transitions. Second operand 6 states. [2019-10-02 07:05:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:05:37,079 INFO L93 Difference]: Finished difference Result 26934 states and 36007 transitions. [2019-10-02 07:05:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 07:05:37,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 402 [2019-10-02 07:05:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:05:37,142 INFO L225 Difference]: With dead ends: 26934 [2019-10-02 07:05:37,143 INFO L226 Difference]: Without dead ends: 13581 [2019-10-02 07:05:37,175 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 07:05:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13581 states. [2019-10-02 07:05:38,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13581 to 13529. [2019-10-02 07:05:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13529 states. [2019-10-02 07:05:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13529 states to 13529 states and 18068 transitions. [2019-10-02 07:05:38,094 INFO L78 Accepts]: Start accepts. Automaton has 13529 states and 18068 transitions. Word has length 402 [2019-10-02 07:05:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:05:38,095 INFO L475 AbstractCegarLoop]: Abstraction has 13529 states and 18068 transitions. [2019-10-02 07:05:38,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 07:05:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 13529 states and 18068 transitions. [2019-10-02 07:05:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-10-02 07:05:38,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:05:38,120 INFO L411 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] [2019-10-02 07:05:38,121 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:05:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:05:38,121 INFO L82 PathProgramCache]: Analyzing trace with hash 569515935, now seen corresponding path program 1 times [2019-10-02 07:05:38,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:05:38,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:05:38,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:38,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:05:38,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-10-02 07:05:38,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 07:05:38,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 07:05:38,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 07:05:38,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 07:05:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 07:05:38,732 INFO L87 Difference]: Start difference. First operand 13529 states and 18068 transitions. Second operand 10 states. [2019-10-02 07:05:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:05:39,334 INFO L93 Difference]: Finished difference Result 27400 states and 36841 transitions. [2019-10-02 07:05:39,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 07:05:39,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 401 [2019-10-02 07:05:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:05:39,405 INFO L225 Difference]: With dead ends: 27400 [2019-10-02 07:05:39,405 INFO L226 Difference]: Without dead ends: 14011 [2019-10-02 07:05:39,444 INFO L640 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-10-02 07:05:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14011 states. [2019-10-02 07:05:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14011 to 13613. [2019-10-02 07:05:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13613 states. [2019-10-02 07:05:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13613 states to 13613 states and 18160 transitions. [2019-10-02 07:05:40,061 INFO L78 Accepts]: Start accepts. Automaton has 13613 states and 18160 transitions. Word has length 401 [2019-10-02 07:05:40,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:05:40,062 INFO L475 AbstractCegarLoop]: Abstraction has 13613 states and 18160 transitions. [2019-10-02 07:05:40,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 07:05:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 13613 states and 18160 transitions. [2019-10-02 07:05:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-10-02 07:05:40,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:05:40,084 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 07:05:40,084 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:05:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:05:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1944007777, now seen corresponding path program 1 times [2019-10-02 07:05:40,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:05:40,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:05:40,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:40,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:05:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 46 proven. 20 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-10-02 07:05:44,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 07:05:44,261 INFO L224 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-10-02 07:05:44,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:05:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:44,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 2468 conjuncts, 144 conjunts are in the unsatisfiable core [2019-10-02 07:05:44,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 07:05:45,164 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-10-02 07:05:45,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:45,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:45,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 07:05:45,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 07:05:46,574 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-10-02 07:05:46,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:46,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:46,588 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-10-02 07:05:46,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2019-10-02 07:05:46,785 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-10-02 07:05:46,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:46,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:46,806 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-10-02 07:05:46,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2019-10-02 07:05:46,974 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-10-02 07:05:46,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:46,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:46,983 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-10-02 07:05:46,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2019-10-02 07:05:47,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:47,275 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-10-02 07:05:47,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:47,328 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.7 percent of original size [2019-10-02 07:05:47,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:47,333 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-10-02 07:05:47,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:33 [2019-10-02 07:05:47,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:47,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:47,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:47,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:47,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:48,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:48,097 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-10-02 07:05:48,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:48,105 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 07:05:48,105 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:48,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:48,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 07:05:48,114 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:7 [2019-10-02 07:05:48,229 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-02 07:05:48,230 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-10-02 07:05:48,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:48,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:48,247 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-10-02 07:05:48,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:20 [2019-10-02 07:05:48,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:48,623 INFO L341 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-10-02 07:05:48,624 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-10-02 07:05:48,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:48,748 INFO L341 Elim1Store]: treesize reduction 40, result has 59.2 percent of original size [2019-10-02 07:05:48,749 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-10-02 07:05:48,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:48,947 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-10-02 07:05:48,948 INFO L567 ElimStorePlain]: treesize reduction 55, result has 61.0 percent of original size [2019-10-02 07:05:48,950 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-10-02 07:05:48,950 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:96, output treesize:86 [2019-10-02 07:05:49,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:49,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:49,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:49,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:49,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:49,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:49,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:49,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:05:50,057 INFO L341 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-10-02 07:05:50,058 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-10-02 07:05:50,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:50,875 INFO L341 Elim1Store]: treesize reduction 40, result has 59.2 percent of original size [2019-10-02 07:05:50,876 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-10-02 07:05:50,877 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:51,071 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-10-02 07:05:51,071 INFO L567 ElimStorePlain]: treesize reduction 48, result has 70.9 percent of original size [2019-10-02 07:05:51,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 07:05:51,090 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-10-02 07:05:51,091 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:51,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 07:05:51,105 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-10-02 07:05:51,105 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:51,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:51,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 07:05:51,173 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-10-02 07:05:51,174 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:108, output treesize:99 [2019-10-02 07:05:51,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 07:05:51,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 07:05:51,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 07:05:51,687 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_BEFORE_CALL_5|], 1=[v_prenex_9]} [2019-10-02 07:05:51,693 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-10-02 07:05:51,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:51,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:51,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:51,738 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-10-02 07:05:51,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:51,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:51,773 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-10-02 07:05:51,773 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:51,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:51,803 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-10-02 07:05:51,803 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:51,823 INFO L567 ElimStorePlain]: treesize reduction 14, result has 41.7 percent of original size [2019-10-02 07:05:51,824 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-10-02 07:05:51,824 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:60, output treesize:10 [2019-10-02 07:05:52,558 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-10-02 07:05:52,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:52,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:52,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 07:05:52,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-10-02 07:05:52,581 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-10-02 07:05:52,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:52,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:52,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 07:05:52,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2019-10-02 07:05:53,128 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-10-02 07:05:53,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:53,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:53,149 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-10-02 07:05:53,149 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 07:05:53,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:05:53,157 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-10-02 07:05:53,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-10-02 07:06:32,163 WARN L191 SmtUtils]: Spent 920.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-10-02 07:06:32,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 07:06:32,171 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-10-02 07:06:32,177 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-10-02 07:06:32,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 07:06:32,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:06:32,180 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 07:06:32,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:06:32,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 07:06:32,190 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:18 [2019-10-02 07:06:38,567 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 07:06:38,568 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-10-02 07:06:38,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:06:38,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:06:38,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 07:06:38,780 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 07:06:38,781 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:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) 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:465) 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-10-02 07:06:38,792 INFO L168 Benchmark]: Toolchain (without parser) took 126372.62 ms. Allocated memory was 138.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 76.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 517.8 MB. Max. memory is 7.1 GB. [2019-10-02 07:06:38,792 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 105.1 MB in the beginning and 104.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-02 07:06:38,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2783.84 ms. Allocated memory was 138.9 MB in the beginning and 266.9 MB in the end (delta: 127.9 MB). Free memory was 76.4 MB in the beginning and 205.3 MB in the end (delta: -128.9 MB). Peak memory consumption was 107.5 MB. Max. memory is 7.1 GB. [2019-10-02 07:06:38,793 INFO L168 Benchmark]: Boogie Preprocessor took 244.86 ms. Allocated memory is still 266.9 MB. Free memory was 205.3 MB in the beginning and 189.1 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-10-02 07:06:38,794 INFO L168 Benchmark]: RCFGBuilder took 5094.59 ms. Allocated memory was 266.9 MB in the beginning and 364.4 MB in the end (delta: 97.5 MB). Free memory was 189.1 MB in the beginning and 177.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2019-10-02 07:06:38,795 INFO L168 Benchmark]: TraceAbstraction took 118244.35 ms. Allocated memory was 364.4 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 177.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 393.3 MB. Max. memory is 7.1 GB. [2019-10-02 07:06:38,798 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.23 ms. Allocated memory is still 138.9 MB. Free memory was 105.1 MB in the beginning and 104.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2783.84 ms. Allocated memory was 138.9 MB in the beginning and 266.9 MB in the end (delta: 127.9 MB). Free memory was 76.4 MB in the beginning and 205.3 MB in the end (delta: -128.9 MB). Peak memory consumption was 107.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 244.86 ms. Allocated memory is still 266.9 MB. Free memory was 205.3 MB in the beginning and 189.1 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5094.59 ms. Allocated memory was 266.9 MB in the beginning and 364.4 MB in the end (delta: 97.5 MB). Free memory was 189.1 MB in the beginning and 177.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118244.35 ms. Allocated memory was 364.4 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 177.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 393.3 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...