java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 08:57:40,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 08:57:40,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 08:57:40,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 08:57:40,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 08:57:40,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 08:57:40,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 08:57:40,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 08:57:40,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 08:57:40,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 08:57:40,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 08:57:40,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 08:57:40,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 08:57:40,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 08:57:40,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 08:57:40,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 08:57:40,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 08:57:40,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 08:57:40,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 08:57:40,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 08:57:40,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 08:57:40,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 08:57:40,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 08:57:40,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 08:57:40,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 08:57:40,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 08:57:40,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 08:57:40,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 08:57:40,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 08:57:40,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 08:57:40,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 08:57:40,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 08:57:40,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 08:57:40,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 08:57:40,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 08:57:40,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 08:57:40,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 08:57:40,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 08:57:40,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 08:57:40,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 08:57:40,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 08:57:40,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 08:57:40,765 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 08:57:40,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 08:57:40,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 08:57:40,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 08:57:40,768 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 08:57:40,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 08:57:40,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 08:57:40,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 08:57:40,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 08:57:40,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 08:57:40,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 08:57:40,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 08:57:40,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 08:57:40,771 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 08:57:40,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 08:57:40,772 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 08:57:40,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 08:57:40,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 08:57:40,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 08:57:40,773 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 08:57:40,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 08:57:40,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 08:57:40,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 08:57:40,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 08:57:40,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 08:57:40,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 08:57:40,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 08:57:40,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 08:57:40,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 08:57:41,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 08:57:41,146 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 08:57:41,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 08:57:41,153 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 08:57:41,154 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 08:57:41,155 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--arcnet--rfc1201.ko-entry_point.cil.out.i [2019-10-07 08:57:41,226 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f237a808a/bd26ab40695047f4b43f3d29665330fc/FLAG9adc699ad [2019-10-07 08:57:42,096 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 08:57:42,099 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--arcnet--rfc1201.ko-entry_point.cil.out.i [2019-10-07 08:57:42,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f237a808a/bd26ab40695047f4b43f3d29665330fc/FLAG9adc699ad [2019-10-07 08:57:42,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f237a808a/bd26ab40695047f4b43f3d29665330fc [2019-10-07 08:57:42,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 08:57:42,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 08:57:42,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 08:57:42,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 08:57:42,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 08:57:42,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 08:57:42" (1/1) ... [2019-10-07 08:57:42,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56206268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 08:57:42, skipping insertion in model container [2019-10-07 08:57:42,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 08:57:42" (1/1) ... [2019-10-07 08:57:42,628 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 08:57:42,748 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 08:57:44,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 08:57:44,236 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 08:57:44,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 08:57:44,710 INFO L192 MainTranslator]: Completed translation [2019-10-07 08:57:44,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 08:57:44 WrapperNode [2019-10-07 08:57:44,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 08:57:44,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 08:57:44,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 08:57:44,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 08:57:44,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 08:57:44" (1/1) ... [2019-10-07 08:57:44,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 08:57:44" (1/1) ... [2019-10-07 08:57:44,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 08:57:44" (1/1) ... [2019-10-07 08:57:44,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 08:57:44" (1/1) ... [2019-10-07 08:57:44,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 08:57:44" (1/1) ... [2019-10-07 08:57:44,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 08:57:44" (1/1) ... [2019-10-07 08:57:44,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 08:57:44" (1/1) ... [2019-10-07 08:57:44,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 08:57:44,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 08:57:44,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 08:57:44,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 08:57:44,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 08:57:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 08:57:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 08:57:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 08:57:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2019-10-07 08:57:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2019-10-07 08:57:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2019-10-07 08:57:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-07 08:57:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-07 08:57:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-07 08:57:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-07 08:57:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-07 08:57:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-07 08:57:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-07 08:57:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-07 08:57:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-07 08:57:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-10-07 08:57:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2019-10-07 08:57:44,995 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_rfc1201_init [2019-10-07 08:57:44,995 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_rfc1201_exit [2019-10-07 08:57:44,995 INFO L138 BoogieDeclarations]: Found implementation of procedure type_trans [2019-10-07 08:57:44,995 INFO L138 BoogieDeclarations]: Found implementation of procedure rx [2019-10-07 08:57:44,996 INFO L138 BoogieDeclarations]: Found implementation of procedure build_header [2019-10-07 08:57:44,996 INFO L138 BoogieDeclarations]: Found implementation of procedure load_pkt [2019-10-07 08:57:44,996 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_tx [2019-10-07 08:57:44,996 INFO L138 BoogieDeclarations]: Found implementation of procedure continue_tx [2019-10-07 08:57:44,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize_ArcProto_1 [2019-10-07 08:57:44,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 08:57:44,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_5 [2019-10-07 08:57:44,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_6 [2019-10-07 08:57:44,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_7 [2019-10-07 08:57:44,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_8 [2019-10-07 08:57:44,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_11 [2019-10-07 08:57:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2019-10-07 08:57:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netif_rx_13 [2019-10-07 08:57:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netif_rx_15 [2019-10-07 08:57:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_init [2019-10-07 08:57:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-10-07 08:57:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2019-10-07 08:57:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_contains [2019-10-07 08:57:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_is_empty [2019-10-07 08:57:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-07 08:57:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-07 08:57:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-07 08:57:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-07 08:57:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2019-10-07 08:57:45,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-07 08:57:45,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2019-10-07 08:57:45,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2019-10-07 08:57:45,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb [2019-10-07 08:57:45,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_alloc_skb [2019-10-07 08:57:45,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_current [2019-10-07 08:57:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-07 08:57:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __dev_kfree_skb_irq [2019-10-07 08:57:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_unregister_proto [2019-10-07 08:57:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-07 08:57:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2019-10-07 08:57:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2019-10-07 08:57:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-10-07 08:57:45,002 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-07 08:57:45,002 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-07 08:57:45,002 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-07 08:57:45,002 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-07 08:57:45,002 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-07 08:57:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 08:57:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-07 08:57:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2019-10-07 08:57:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-07 08:57:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-07 08:57:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-07 08:57:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_6 [2019-10-07 08:57:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_7 [2019-10-07 08:57:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_8 [2019-10-07 08:57:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_11 [2019-10-07 08:57:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_5 [2019-10-07 08:57:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2019-10-07 08:57:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-10-07 08:57:45,005 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2019-10-07 08:57:45,005 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2019-10-07 08:57:45,005 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2019-10-07 08:57:45,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 08:57:45,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 08:57:45,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2019-10-07 08:57:45,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2019-10-07 08:57:45,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2019-10-07 08:57:45,006 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 08:57:45,006 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 08:57:45,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 08:57:45,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2019-10-07 08:57:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-07 08:57:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 08:57:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 08:57:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-07 08:57:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 08:57:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-07 08:57:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-07 08:57:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-07 08:57:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-07 08:57:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-07 08:57:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-07 08:57:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-07 08:57:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-07 08:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize_ArcProto_1 [2019-10-07 08:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-10-07 08:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure __dev_kfree_skb_irq [2019-10-07 08:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2019-10-07 08:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netif_rx_13 [2019-10-07 08:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netif_rx_15 [2019-10-07 08:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_unregister_proto [2019-10-07 08:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure type_trans [2019-10-07 08:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure rx [2019-10-07 08:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure build_header [2019-10-07 08:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_tx [2019-10-07 08:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure continue_tx [2019-10-07 08:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_rfc1201_init [2019-10-07 08:57:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 08:57:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 08:57:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_rfc1201_exit [2019-10-07 08:57:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 08:57:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2019-10-07 08:57:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-07 08:57:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure load_pkt [2019-10-07 08:57:45,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 08:57:45,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-07 08:57:45,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-07 08:57:45,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 08:57:45,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-07 08:57:45,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_init [2019-10-07 08:57:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-10-07 08:57:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2019-10-07 08:57:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_contains [2019-10-07 08:57:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_is_empty [2019-10-07 08:57:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-07 08:57:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-07 08:57:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-07 08:57:45,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-07 08:57:45,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_alloc_skb [2019-10-07 08:57:45,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb [2019-10-07 08:57:45,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_current [2019-10-07 08:57:45,014 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-07 08:57:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 08:57:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-07 08:57:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 08:57:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 08:57:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-07 08:57:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 08:57:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-07 08:57:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-07 08:57:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-07 08:57:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-07 08:57:45,905 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-07 08:58:22,904 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 08:58:22,905 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 08:58:22,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 08:58:22 BoogieIcfgContainer [2019-10-07 08:58:22,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 08:58:22,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 08:58:22,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 08:58:22,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 08:58:22,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 08:57:42" (1/3) ... [2019-10-07 08:58:22,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31553756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 08:58:22, skipping insertion in model container [2019-10-07 08:58:22,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 08:57:44" (2/3) ... [2019-10-07 08:58:22,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31553756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 08:58:22, skipping insertion in model container [2019-10-07 08:58:22,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 08:58:22" (3/3) ... [2019-10-07 08:58:22,916 INFO L109 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2019-10-07 08:58:22,927 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 08:58:22,937 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 08:58:22,949 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 08:58:22,977 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 08:58:22,978 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 08:58:22,978 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 08:58:22,978 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 08:58:22,978 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 08:58:22,978 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 08:58:22,978 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 08:58:22,979 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 08:58:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states. [2019-10-07 08:58:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 08:58:23,016 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:58:23,018 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 08:58:23,020 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:58:23,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:58:23,026 INFO L82 PathProgramCache]: Analyzing trace with hash -339648814, now seen corresponding path program 1 times [2019-10-07 08:58:23,035 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:58:23,036 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:23,036 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:23,036 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:58:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:58:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 08:58:23,670 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:23,670 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:58:23,671 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 08:58:23,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 08:58:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 08:58:23,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 08:58:23,695 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 3 states. [2019-10-07 08:58:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:58:23,910 INFO L93 Difference]: Finished difference Result 791 states and 1070 transitions. [2019-10-07 08:58:23,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 08:58:23,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-07 08:58:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:58:23,937 INFO L225 Difference]: With dead ends: 791 [2019-10-07 08:58:23,937 INFO L226 Difference]: Without dead ends: 507 [2019-10-07 08:58:23,945 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 08:58:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-10-07 08:58:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-10-07 08:58:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-10-07 08:58:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 662 transitions. [2019-10-07 08:58:24,082 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 662 transitions. Word has length 44 [2019-10-07 08:58:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:58:24,083 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 662 transitions. [2019-10-07 08:58:24,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 08:58:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 662 transitions. [2019-10-07 08:58:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 08:58:24,087 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:58:24,088 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 08:58:24,088 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:58:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:58:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash 866175995, now seen corresponding path program 1 times [2019-10-07 08:58:24,089 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:58:24,089 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:24,089 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:24,089 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:58:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:58:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 08:58:24,277 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:24,277 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:58:24,277 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 08:58:24,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 08:58:24,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 08:58:24,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 08:58:24,282 INFO L87 Difference]: Start difference. First operand 507 states and 662 transitions. Second operand 5 states. [2019-10-07 08:58:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:58:24,403 INFO L93 Difference]: Finished difference Result 995 states and 1302 transitions. [2019-10-07 08:58:24,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 08:58:24,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-07 08:58:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:58:24,409 INFO L225 Difference]: With dead ends: 995 [2019-10-07 08:58:24,410 INFO L226 Difference]: Without dead ends: 506 [2019-10-07 08:58:24,413 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 08:58:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-07 08:58:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2019-10-07 08:58:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-07 08:58:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 658 transitions. [2019-10-07 08:58:24,466 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 658 transitions. Word has length 44 [2019-10-07 08:58:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:58:24,467 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 658 transitions. [2019-10-07 08:58:24,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 08:58:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 658 transitions. [2019-10-07 08:58:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 08:58:24,478 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:58:24,479 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 08:58:24,479 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:58:24,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:58:24,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1598167988, now seen corresponding path program 1 times [2019-10-07 08:58:24,479 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:58:24,480 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:24,480 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:24,480 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:58:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:58:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-07 08:58:24,694 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:24,694 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:58:24,695 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 08:58:24,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 08:58:24,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 08:58:24,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 08:58:24,699 INFO L87 Difference]: Start difference. First operand 506 states and 658 transitions. Second operand 6 states. [2019-10-07 08:58:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:58:25,277 INFO L93 Difference]: Finished difference Result 1002 states and 1320 transitions. [2019-10-07 08:58:25,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 08:58:25,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-10-07 08:58:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:58:25,287 INFO L225 Difference]: With dead ends: 1002 [2019-10-07 08:58:25,288 INFO L226 Difference]: Without dead ends: 985 [2019-10-07 08:58:25,289 INFO L606 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-07 08:58:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-10-07 08:58:25,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2019-10-07 08:58:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-10-07 08:58:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1303 transitions. [2019-10-07 08:58:25,340 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1303 transitions. Word has length 72 [2019-10-07 08:58:25,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:58:25,341 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 1303 transitions. [2019-10-07 08:58:25,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 08:58:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1303 transitions. [2019-10-07 08:58:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-07 08:58:25,348 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:58:25,348 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 08:58:25,349 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:58:25,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:58:25,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1579573307, now seen corresponding path program 1 times [2019-10-07 08:58:25,349 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:58:25,349 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:25,349 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:25,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:25,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:58:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:58:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 08:58:25,678 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:25,678 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:58:25,678 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 08:58:25,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 08:58:25,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 08:58:25,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 08:58:25,681 INFO L87 Difference]: Start difference. First operand 985 states and 1303 transitions. Second operand 5 states. [2019-10-07 08:58:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:58:25,743 INFO L93 Difference]: Finished difference Result 1976 states and 2643 transitions. [2019-10-07 08:58:25,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 08:58:25,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-10-07 08:58:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:58:25,751 INFO L225 Difference]: With dead ends: 1976 [2019-10-07 08:58:25,752 INFO L226 Difference]: Without dead ends: 1009 [2019-10-07 08:58:25,756 INFO L606 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-07 08:58:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2019-10-07 08:58:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1005. [2019-10-07 08:58:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-10-07 08:58:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1328 transitions. [2019-10-07 08:58:25,819 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1328 transitions. Word has length 119 [2019-10-07 08:58:25,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:58:25,820 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 1328 transitions. [2019-10-07 08:58:25,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 08:58:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1328 transitions. [2019-10-07 08:58:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-07 08:58:25,824 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:58:25,825 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-10-07 08:58:25,825 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:58:25,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:58:25,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1770335988, now seen corresponding path program 1 times [2019-10-07 08:58:25,825 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:58:25,826 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:25,826 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:25,826 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:58:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:58:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 08:58:26,130 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:26,132 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:58:26,132 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 08:58:26,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 08:58:26,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 08:58:26,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 08:58:26,134 INFO L87 Difference]: Start difference. First operand 1005 states and 1328 transitions. Second operand 4 states. [2019-10-07 08:58:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:58:26,212 INFO L93 Difference]: Finished difference Result 1995 states and 2639 transitions. [2019-10-07 08:58:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 08:58:26,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-07 08:58:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:58:26,222 INFO L225 Difference]: With dead ends: 1995 [2019-10-07 08:58:26,222 INFO L226 Difference]: Without dead ends: 1006 [2019-10-07 08:58:26,227 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 08:58:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-10-07 08:58:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2019-10-07 08:58:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2019-10-07 08:58:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1329 transitions. [2019-10-07 08:58:26,303 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1329 transitions. Word has length 123 [2019-10-07 08:58:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:58:26,304 INFO L462 AbstractCegarLoop]: Abstraction has 1006 states and 1329 transitions. [2019-10-07 08:58:26,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 08:58:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1329 transitions. [2019-10-07 08:58:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-07 08:58:26,311 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:58:26,312 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 08:58:26,312 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:58:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:58:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash 328289628, now seen corresponding path program 1 times [2019-10-07 08:58:26,313 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:58:26,313 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:26,313 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:26,314 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:58:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:58:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 08:58:26,923 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:26,923 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:58:26,923 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 08:58:26,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 08:58:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 08:58:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 08:58:26,926 INFO L87 Difference]: Start difference. First operand 1006 states and 1329 transitions. Second operand 10 states. [2019-10-07 08:58:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:58:34,016 INFO L93 Difference]: Finished difference Result 2025 states and 2696 transitions. [2019-10-07 08:58:34,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 08:58:34,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-10-07 08:58:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:58:34,026 INFO L225 Difference]: With dead ends: 2025 [2019-10-07 08:58:34,026 INFO L226 Difference]: Without dead ends: 1038 [2019-10-07 08:58:34,031 INFO L606 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-07 08:58:34,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2019-10-07 08:58:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1026. [2019-10-07 08:58:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-10-07 08:58:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1349 transitions. [2019-10-07 08:58:34,088 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1349 transitions. Word has length 124 [2019-10-07 08:58:34,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:58:34,089 INFO L462 AbstractCegarLoop]: Abstraction has 1026 states and 1349 transitions. [2019-10-07 08:58:34,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 08:58:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1349 transitions. [2019-10-07 08:58:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-07 08:58:34,095 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:58:34,095 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-10-07 08:58:34,096 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:58:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:58:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash 433811840, now seen corresponding path program 1 times [2019-10-07 08:58:34,096 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:58:34,096 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:34,097 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:34,097 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:34,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:58:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:58:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 08:58:34,836 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:34,836 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:58:34,837 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 08:58:34,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 08:58:34,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 08:58:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 08:58:34,838 INFO L87 Difference]: Start difference. First operand 1026 states and 1349 transitions. Second operand 11 states. [2019-10-07 08:58:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:58:46,154 INFO L93 Difference]: Finished difference Result 2045 states and 2698 transitions. [2019-10-07 08:58:46,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 08:58:46,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 128 [2019-10-07 08:58:46,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:58:46,162 INFO L225 Difference]: With dead ends: 2045 [2019-10-07 08:58:46,162 INFO L226 Difference]: Without dead ends: 1038 [2019-10-07 08:58:46,168 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 08:58:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2019-10-07 08:58:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1034. [2019-10-07 08:58:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-10-07 08:58:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1357 transitions. [2019-10-07 08:58:46,235 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1357 transitions. Word has length 128 [2019-10-07 08:58:46,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:58:46,237 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1357 transitions. [2019-10-07 08:58:46,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 08:58:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1357 transitions. [2019-10-07 08:58:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-07 08:58:46,246 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:58:46,246 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2019-10-07 08:58:46,247 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:58:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:58:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash -451675848, now seen corresponding path program 1 times [2019-10-07 08:58:46,247 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:58:46,248 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:46,248 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:46,248 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:46,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:58:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:58:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-07 08:58:46,508 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:46,509 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:58:46,509 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 08:58:46,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 08:58:46,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 08:58:46,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 08:58:46,510 INFO L87 Difference]: Start difference. First operand 1034 states and 1357 transitions. Second operand 3 states. [2019-10-07 08:58:46,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:58:46,548 INFO L93 Difference]: Finished difference Result 1564 states and 2067 transitions. [2019-10-07 08:58:46,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 08:58:46,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-07 08:58:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:58:46,555 INFO L225 Difference]: With dead ends: 1564 [2019-10-07 08:58:46,556 INFO L226 Difference]: Without dead ends: 1042 [2019-10-07 08:58:46,559 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 08:58:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-10-07 08:58:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1038. [2019-10-07 08:58:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2019-10-07 08:58:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1361 transitions. [2019-10-07 08:58:46,617 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1361 transitions. Word has length 163 [2019-10-07 08:58:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:58:46,618 INFO L462 AbstractCegarLoop]: Abstraction has 1038 states and 1361 transitions. [2019-10-07 08:58:46,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 08:58:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1361 transitions. [2019-10-07 08:58:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-07 08:58:46,623 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:58:46,624 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2019-10-07 08:58:46,624 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:58:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:58:46,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1913680113, now seen corresponding path program 1 times [2019-10-07 08:58:46,625 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:58:46,625 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:46,625 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:46,625 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:58:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:58:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-07 08:58:46,920 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:46,921 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:58:46,921 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 08:58:46,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 08:58:46,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 08:58:46,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 08:58:46,922 INFO L87 Difference]: Start difference. First operand 1038 states and 1361 transitions. Second operand 7 states. [2019-10-07 08:58:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:58:48,941 INFO L93 Difference]: Finished difference Result 2065 states and 2714 transitions. [2019-10-07 08:58:48,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 08:58:48,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-10-07 08:58:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:58:48,952 INFO L225 Difference]: With dead ends: 2065 [2019-10-07 08:58:48,952 INFO L226 Difference]: Without dead ends: 1046 [2019-10-07 08:58:48,958 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 08:58:48,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-10-07 08:58:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1042. [2019-10-07 08:58:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-10-07 08:58:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1361 transitions. [2019-10-07 08:58:49,018 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1361 transitions. Word has length 164 [2019-10-07 08:58:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:58:49,018 INFO L462 AbstractCegarLoop]: Abstraction has 1042 states and 1361 transitions. [2019-10-07 08:58:49,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 08:58:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1361 transitions. [2019-10-07 08:58:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-07 08:58:49,028 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:58:49,028 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 08:58:49,028 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:58:49,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:58:49,029 INFO L82 PathProgramCache]: Analyzing trace with hash 531546608, now seen corresponding path program 1 times [2019-10-07 08:58:49,029 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:58:49,029 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:49,029 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:49,029 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:58:49,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:58:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:58:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-07 08:58:49,410 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:58:49,411 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:58:49,411 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 08:58:49,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 08:58:49,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 08:58:49,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-07 08:58:49,413 INFO L87 Difference]: Start difference. First operand 1042 states and 1361 transitions. Second operand 9 states. [2019-10-07 08:59:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:59:08,701 INFO L93 Difference]: Finished difference Result 2203 states and 2902 transitions. [2019-10-07 08:59:08,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 08:59:08,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2019-10-07 08:59:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:59:08,713 INFO L225 Difference]: With dead ends: 2203 [2019-10-07 08:59:08,713 INFO L226 Difference]: Without dead ends: 1180 [2019-10-07 08:59:08,717 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-10-07 08:59:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-10-07 08:59:08,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1114. [2019-10-07 08:59:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-10-07 08:59:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1453 transitions. [2019-10-07 08:59:08,769 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1453 transitions. Word has length 147 [2019-10-07 08:59:08,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:59:08,770 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 1453 transitions. [2019-10-07 08:59:08,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 08:59:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1453 transitions. [2019-10-07 08:59:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 08:59:08,775 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:59:08,775 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 08:59:08,776 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:59:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:59:08,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2028182794, now seen corresponding path program 1 times [2019-10-07 08:59:08,776 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:59:08,776 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:59:08,777 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:59:08,777 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:59:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:59:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:59:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 08:59:08,984 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:59:08,985 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:59:08,985 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 08:59:08,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 08:59:08,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 08:59:08,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 08:59:08,991 INFO L87 Difference]: Start difference. First operand 1114 states and 1453 transitions. Second operand 3 states. [2019-10-07 08:59:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:59:09,029 INFO L93 Difference]: Finished difference Result 2249 states and 2948 transitions. [2019-10-07 08:59:09,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 08:59:09,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-07 08:59:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:59:09,038 INFO L225 Difference]: With dead ends: 2249 [2019-10-07 08:59:09,038 INFO L226 Difference]: Without dead ends: 1154 [2019-10-07 08:59:09,043 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 08:59:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-10-07 08:59:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1102. [2019-10-07 08:59:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-10-07 08:59:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1429 transitions. [2019-10-07 08:59:09,100 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1429 transitions. Word has length 157 [2019-10-07 08:59:09,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:59:09,103 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 1429 transitions. [2019-10-07 08:59:09,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 08:59:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1429 transitions. [2019-10-07 08:59:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 08:59:09,109 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:59:09,110 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 08:59:09,110 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:59:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:59:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash -503007738, now seen corresponding path program 1 times [2019-10-07 08:59:09,111 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:59:09,111 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:59:09,111 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:59:09,111 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:59:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:59:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:59:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 08:59:09,738 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:59:09,739 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 08:59:09,739 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 08:59:09,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 08:59:09,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 08:59:09,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-07 08:59:09,740 INFO L87 Difference]: Start difference. First operand 1102 states and 1429 transitions. Second operand 6 states. [2019-10-07 08:59:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 08:59:09,952 INFO L93 Difference]: Finished difference Result 2249 states and 2952 transitions. [2019-10-07 08:59:09,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 08:59:09,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2019-10-07 08:59:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 08:59:09,960 INFO L225 Difference]: With dead ends: 2249 [2019-10-07 08:59:09,960 INFO L226 Difference]: Without dead ends: 1166 [2019-10-07 08:59:09,965 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 08:59:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-10-07 08:59:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1114. [2019-10-07 08:59:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-10-07 08:59:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1457 transitions. [2019-10-07 08:59:10,030 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1457 transitions. Word has length 157 [2019-10-07 08:59:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 08:59:10,031 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 1457 transitions. [2019-10-07 08:59:10,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 08:59:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1457 transitions. [2019-10-07 08:59:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 08:59:10,040 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 08:59:10,041 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-10-07 08:59:10,041 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 08:59:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 08:59:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash -92772175, now seen corresponding path program 1 times [2019-10-07 08:59:10,041 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 08:59:10,042 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:59:10,042 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:59:10,042 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 08:59:10,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 08:59:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:59:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 08:59:10,369 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 08:59:10,370 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 08:59:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 08:59:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 08:59:10,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 1572 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 08:59:10,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 08:59:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 08:59:10,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 08:59:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-07 08:59:11,190 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 08:59:11,222 INFO L162 IcfgInterpreter]: Started Sifa with 132 locations of interest [2019-10-07 08:59:11,222 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 08:59:11,229 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 08:59:11,238 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 08:59:11,239 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 08:59:33,345 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 513 [2019-10-07 08:59:37,089 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 296 DAG size of output: 239 [2019-10-07 08:59:37,289 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 571 [2019-10-07 08:59:37,661 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 570 [2019-10-07 08:59:37,927 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 569 [2019-10-07 08:59:38,102 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 569 [2019-10-07 08:59:38,259 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 569 [2019-10-07 08:59:38,487 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 655 [2019-10-07 08:59:38,753 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 655 [2019-10-07 08:59:38,943 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 655 [2019-10-07 08:59:39,213 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 655 [2019-10-07 08:59:39,566 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 657 DAG size of output: 655 [2019-10-07 08:59:39,804 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 655 [2019-10-07 08:59:39,995 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 655 [2019-10-07 08:59:40,186 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 655 [2019-10-07 08:59:40,368 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 655 [2019-10-07 08:59:40,619 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 655 [2019-10-07 08:59:40,634 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 229 for LOIs [2019-10-07 08:59:40,884 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 486 [2019-10-07 08:59:41,133 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 572 [2019-10-07 08:59:41,135 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 673 for LOIs [2019-10-07 08:59:41,429 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 673 [2019-10-07 08:59:41,656 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 673 [2019-10-07 08:59:41,895 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 707 [2019-10-07 08:59:42,266 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 691 [2019-10-07 08:59:42,450 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 691 [2019-10-07 08:59:42,697 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 730 [2019-10-07 08:59:52,615 WARN L191 SmtUtils]: Spent 8.07 s on a formula simplification that was a NOOP. DAG size: 1307 [2019-10-07 08:59:53,681 WARN L191 SmtUtils]: Spent 978.00 ms on a formula simplification that was a NOOP. DAG size: 1777 [2019-10-07 09:00:04,263 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 1774 [2019-10-07 09:00:04,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 09:00:04,553 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ~tmp~1.base, ~tmp~1.offset := #t~malloc20.base, #t~malloc20.offset;~p~1.base, ~p~1.offset := ~tmp~1.base, ~tmp~1.offset;assume 0 != (if 0 != (~p~1.base + ~p~1.offset) % 4294967296 then 1 else 0);#res.base, #res.offset := ~p~1.base, ~p~1.offset; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ~tmp~1.base, ~tmp~1.offset := #t~malloc20.base, #t~malloc20.offset;~p~1.base, ~p~1.offset := ~tmp~1.base, ~tmp~1.offset;assume 0 != (if 0 != (~p~1.base + ~p~1.offset) % 4294967296 then 1 else 0);#res.base, #res.offset := ~p~1.base, ~p~1.offset; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 09:00:04,566 INFO L168 Benchmark]: Toolchain (without parser) took 141946.77 ms. Allocated memory was 142.1 MB in the beginning and 961.0 MB in the end (delta: 818.9 MB). Free memory was 99.1 MB in the beginning and 326.3 MB in the end (delta: -227.2 MB). Peak memory consumption was 591.7 MB. Max. memory is 7.1 GB. [2019-10-07 09:00:04,568 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 142.1 MB. Free memory was 125.3 MB in the beginning and 125.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-07 09:00:04,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2096.78 ms. Allocated memory was 142.1 MB in the beginning and 239.6 MB in the end (delta: 97.5 MB). Free memory was 98.6 MB in the beginning and 191.0 MB in the end (delta: -92.3 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. [2019-10-07 09:00:04,573 INFO L168 Benchmark]: Boogie Preprocessor took 202.28 ms. Allocated memory is still 239.6 MB. Free memory was 191.0 MB in the beginning and 178.3 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-10-07 09:00:04,573 INFO L168 Benchmark]: RCFGBuilder took 37992.53 ms. Allocated memory was 239.6 MB in the beginning and 547.4 MB in the end (delta: 307.8 MB). Free memory was 178.3 MB in the beginning and 318.8 MB in the end (delta: -140.6 MB). Peak memory consumption was 412.7 MB. Max. memory is 7.1 GB. [2019-10-07 09:00:04,577 INFO L168 Benchmark]: TraceAbstraction took 101650.78 ms. Allocated memory was 547.4 MB in the beginning and 961.0 MB in the end (delta: 413.7 MB). Free memory was 318.8 MB in the beginning and 326.3 MB in the end (delta: -7.4 MB). Peak memory consumption was 406.2 MB. Max. memory is 7.1 GB. [2019-10-07 09:00:04,585 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.24 ms. Allocated memory is still 142.1 MB. Free memory was 125.3 MB in the beginning and 125.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2096.78 ms. Allocated memory was 142.1 MB in the beginning and 239.6 MB in the end (delta: 97.5 MB). Free memory was 98.6 MB in the beginning and 191.0 MB in the end (delta: -92.3 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 202.28 ms. Allocated memory is still 239.6 MB. Free memory was 191.0 MB in the beginning and 178.3 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 37992.53 ms. Allocated memory was 239.6 MB in the beginning and 547.4 MB in the end (delta: 307.8 MB). Free memory was 178.3 MB in the beginning and 318.8 MB in the end (delta: -140.6 MB). Peak memory consumption was 412.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101650.78 ms. Allocated memory was 547.4 MB in the beginning and 961.0 MB in the end (delta: 413.7 MB). Free memory was 318.8 MB in the beginning and 326.3 MB in the end (delta: -7.4 MB). Peak memory consumption was 406.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ~tmp~1.base, ~tmp~1.offset := #t~malloc20.base, #t~malloc20.offset;~p~1.base, ~p~1.offset := ~tmp~1.base, ~tmp~1.offset;assume 0 != (if 0 != (~p~1.base + ~p~1.offset) % 4294967296 then 1 else 0);#res.base, #res.offset := ~p~1.base, ~p~1.offset; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ~tmp~1.base, ~tmp~1.offset := #t~malloc20.base, #t~malloc20.offset;~p~1.base, ~p~1.offset := ~tmp~1.base, ~tmp~1.offset;assume 0 != (if 0 != (~p~1.base + ~p~1.offset) % 4294967296 then 1 else 0);#res.base, #res.offset := ~p~1.base, ~p~1.offset;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...