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/forester-heap/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:58:15,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:58:15,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:58:15,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:58:15,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:58:15,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:58:15,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:58:15,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:58:15,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:58:15,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:58:15,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:58:15,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:58:15,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:58:15,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:58:15,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:58:15,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:58:15,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:58:15,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:58:15,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:58:15,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:58:15,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:58:15,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:58:15,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:58:15,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:58:15,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:58:15,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:58:15,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:58:15,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:58:15,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:58:15,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:58:15,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:58:15,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:58:15,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:58:15,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:58:15,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:58:15,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:58:15,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:58:15,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:58:15,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:58:15,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:58:15,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:58:15,912 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-15 01:58:15,927 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:58:15,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:58:15,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:58:15,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:58:15,929 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:58:15,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:58:15,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:58:15,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:58:15,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:58:15,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:58:15,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:58:15,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:58:15,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:58:15,931 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:58:15,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:58:15,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:58:15,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:58:15,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:58:15,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:58:15,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:58:15,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:58:15,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:58:15,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:58:15,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:58:15,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:58:15,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:58:15,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:58:15,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:58:15,934 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-15 01:58:16,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:58:16,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:58:16,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:58:16,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:58:16,258 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:58:16,259 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-10-15 01:58:16,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363ed06f3/fb7f48d9c609460d99584340e27efca9/FLAGbabe66213 [2019-10-15 01:58:16,865 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:58:16,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-10-15 01:58:16,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363ed06f3/fb7f48d9c609460d99584340e27efca9/FLAGbabe66213 [2019-10-15 01:58:17,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363ed06f3/fb7f48d9c609460d99584340e27efca9 [2019-10-15 01:58:17,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:58:17,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:58:17,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:58:17,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:58:17,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:58:17,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:58:17" (1/1) ... [2019-10-15 01:58:17,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af155ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:17, skipping insertion in model container [2019-10-15 01:58:17,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:58:17" (1/1) ... [2019-10-15 01:58:17,213 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:58:17,279 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:58:17,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:58:17,717 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:58:17,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:58:17,847 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:58:17,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:17 WrapperNode [2019-10-15 01:58:17,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:58:17,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:58:17,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:58:17,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:58:17,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:17" (1/1) ... [2019-10-15 01:58:17,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:17" (1/1) ... [2019-10-15 01:58:17,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:17" (1/1) ... [2019-10-15 01:58:17,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:17" (1/1) ... [2019-10-15 01:58:17,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:17" (1/1) ... [2019-10-15 01:58:17,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:17" (1/1) ... [2019-10-15 01:58:17,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:17" (1/1) ... [2019-10-15 01:58:17,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:58:17,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:58:17,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:58:17,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:58:17,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:58:17,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:58:17,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:58:17,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:58:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 01:58:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 01:58:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 01:58:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 01:58:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 01:58:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 01:58:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 01:58:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 01:58:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 01:58:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 01:58:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 01:58:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 01:58:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 01:58:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 01:58:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 01:58:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 01:58:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 01:58:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 01:58:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 01:58:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 01:58:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 01:58:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 01:58:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 01:58:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 01:58:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 01:58:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 01:58:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 01:58:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 01:58:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 01:58:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 01:58:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 01:58:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 01:58:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 01:58:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 01:58:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 01:58:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 01:58:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 01:58:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 01:58:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 01:58:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 01:58:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 01:58:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 01:58:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 01:58:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 01:58:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 01:58:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 01:58:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 01:58:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 01:58:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 01:58:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 01:58:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:58:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 01:58:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 01:58:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:58:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 01:58:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 01:58:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 01:58:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 01:58:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 01:58:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 01:58:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 01:58:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 01:58:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 01:58:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:58:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 01:58:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 01:58:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 01:58:18,001 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 01:58:18,001 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 01:58:18,001 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 01:58:18,001 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 01:58:18,001 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 01:58:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 01:58:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 01:58:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 01:58:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 01:58:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 01:58:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 01:58:18,003 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 01:58:18,003 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 01:58:18,003 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 01:58:18,003 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 01:58:18,003 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 01:58:18,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 01:58:18,004 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 01:58:18,004 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 01:58:18,004 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 01:58:18,004 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 01:58:18,004 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 01:58:18,004 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 01:58:18,005 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 01:58:18,005 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 01:58:18,005 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 01:58:18,005 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 01:58:18,005 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 01:58:18,005 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 01:58:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 01:58:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 01:58:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 01:58:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 01:58:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 01:58:18,006 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 01:58:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 01:58:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:58:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:58:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:58:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:58:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:58:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:58:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:58:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:58:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:58:18,898 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:58:18,899 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-15 01:58:18,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:58:18 BoogieIcfgContainer [2019-10-15 01:58:18,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:58:18,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:58:18,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:58:18,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:58:18,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:58:17" (1/3) ... [2019-10-15 01:58:18,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fffd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:58:18, skipping insertion in model container [2019-10-15 01:58:18,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:58:17" (2/3) ... [2019-10-15 01:58:18,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fffd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:58:18, skipping insertion in model container [2019-10-15 01:58:18,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:58:18" (3/3) ... [2019-10-15 01:58:18,912 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-10-15 01:58:18,923 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:58:18,933 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-15 01:58:18,947 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-15 01:58:18,983 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:58:18,984 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:58:18,984 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:58:18,984 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:58:18,986 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:58:18,986 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:58:18,986 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:58:18,986 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:58:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-10-15 01:58:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-15 01:58:19,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:19,016 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:58:19,018 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:19,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:19,025 INFO L82 PathProgramCache]: Analyzing trace with hash -445938275, now seen corresponding path program 1 times [2019-10-15 01:58:19,034 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:19,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391858165] [2019-10-15 01:58:19,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:19,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:19,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:19,262 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-15 01:58:19,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391858165] [2019-10-15 01:58:19,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:58:19,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:58:19,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119831613] [2019-10-15 01:58:19,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:58:19,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:19,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:58:19,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:58:19,298 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-10-15 01:58:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:19,403 INFO L93 Difference]: Finished difference Result 171 states and 270 transitions. [2019-10-15 01:58:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:58:19,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-10-15 01:58:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:19,422 INFO L225 Difference]: With dead ends: 171 [2019-10-15 01:58:19,422 INFO L226 Difference]: Without dead ends: 93 [2019-10-15 01:58:19,429 INFO L600 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-15 01:58:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-15 01:58:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2019-10-15 01:58:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-15 01:58:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-15 01:58:19,494 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 7 [2019-10-15 01:58:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:19,494 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-15 01:58:19,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:58:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-15 01:58:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 01:58:19,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:19,496 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:58:19,496 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:19,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1701000262, now seen corresponding path program 1 times [2019-10-15 01:58:19,498 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:19,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810629167] [2019-10-15 01:58:19,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:19,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:19,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:19,597 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-15 01:58:19,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810629167] [2019-10-15 01:58:19,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:58:19,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:58:19,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747396830] [2019-10-15 01:58:19,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:58:19,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:19,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:58:19,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:58:19,606 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 3 states. [2019-10-15 01:58:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:19,621 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-10-15 01:58:19,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:58:19,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-15 01:58:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:19,626 INFO L225 Difference]: With dead ends: 75 [2019-10-15 01:58:19,626 INFO L226 Difference]: Without dead ends: 73 [2019-10-15 01:58:19,627 INFO L600 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-15 01:58:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-15 01:58:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-15 01:58:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-15 01:58:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-15 01:58:19,642 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 11 [2019-10-15 01:58:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:19,643 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-15 01:58:19,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:58:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-15 01:58:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:58:19,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:19,645 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:58:19,646 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:19,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:19,646 INFO L82 PathProgramCache]: Analyzing trace with hash 781316733, now seen corresponding path program 1 times [2019-10-15 01:58:19,647 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:19,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257593615] [2019-10-15 01:58:19,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:19,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:19,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:19,801 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-15 01:58:19,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257593615] [2019-10-15 01:58:19,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:58:19,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:58:19,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754919448] [2019-10-15 01:58:19,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:58:19,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:19,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:58:19,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:58:19,804 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 6 states. [2019-10-15 01:58:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:19,932 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-10-15 01:58:19,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:58:19,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-15 01:58:19,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:19,934 INFO L225 Difference]: With dead ends: 131 [2019-10-15 01:58:19,934 INFO L226 Difference]: Without dead ends: 107 [2019-10-15 01:58:19,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:58:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-15 01:58:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 68. [2019-10-15 01:58:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-15 01:58:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-15 01:58:19,943 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 16 [2019-10-15 01:58:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:19,943 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-15 01:58:19,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:58:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-15 01:58:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:58:19,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:19,945 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:58:19,945 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:19,946 INFO L82 PathProgramCache]: Analyzing trace with hash -52979580, now seen corresponding path program 1 times [2019-10-15 01:58:19,946 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:19,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459737785] [2019-10-15 01:58:19,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:19,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:19,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:19,988 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-15 01:58:19,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459737785] [2019-10-15 01:58:19,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:58:19,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:58:19,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746507299] [2019-10-15 01:58:19,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:58:19,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:19,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:58:19,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:58:19,991 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 3 states. [2019-10-15 01:58:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:20,007 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-10-15 01:58:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:58:20,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:58:20,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:20,009 INFO L225 Difference]: With dead ends: 68 [2019-10-15 01:58:20,009 INFO L226 Difference]: Without dead ends: 66 [2019-10-15 01:58:20,010 INFO L600 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-15 01:58:20,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-15 01:58:20,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-15 01:58:20,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-15 01:58:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-15 01:58:20,016 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 21 [2019-10-15 01:58:20,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:20,016 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-15 01:58:20,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:58:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-15 01:58:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:58:20,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:20,018 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:58:20,018 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:20,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:20,019 INFO L82 PathProgramCache]: Analyzing trace with hash -52970068, now seen corresponding path program 1 times [2019-10-15 01:58:20,019 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:20,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327745654] [2019-10-15 01:58:20,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:20,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:20,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:20,060 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-15 01:58:20,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327745654] [2019-10-15 01:58:20,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:58:20,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:58:20,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510297414] [2019-10-15 01:58:20,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:58:20,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:58:20,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:58:20,062 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 3 states. [2019-10-15 01:58:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:20,080 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-10-15 01:58:20,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:58:20,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:58:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:20,083 INFO L225 Difference]: With dead ends: 91 [2019-10-15 01:58:20,084 INFO L226 Difference]: Without dead ends: 89 [2019-10-15 01:58:20,086 INFO L600 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-15 01:58:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-15 01:58:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-10-15 01:58:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-15 01:58:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-10-15 01:58:20,097 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 21 [2019-10-15 01:58:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:20,097 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-10-15 01:58:20,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:58:20,097 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-10-15 01:58:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:58:20,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:20,098 INFO L380 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] [2019-10-15 01:58:20,099 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:20,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:20,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1706116094, now seen corresponding path program 1 times [2019-10-15 01:58:20,099 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:20,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248283544] [2019-10-15 01:58:20,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:20,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:20,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:20,202 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-15 01:58:20,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248283544] [2019-10-15 01:58:20,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:58:20,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:58:20,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771788236] [2019-10-15 01:58:20,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:58:20,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:58:20,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:58:20,206 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 3 states. [2019-10-15 01:58:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:20,214 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-10-15 01:58:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:58:20,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:58:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:20,217 INFO L225 Difference]: With dead ends: 68 [2019-10-15 01:58:20,217 INFO L226 Difference]: Without dead ends: 66 [2019-10-15 01:58:20,217 INFO L600 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-15 01:58:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-15 01:58:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-15 01:58:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-15 01:58:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-10-15 01:58:20,229 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 22 [2019-10-15 01:58:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:20,230 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-10-15 01:58:20,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:58:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-10-15 01:58:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:58:20,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:20,231 INFO L380 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] [2019-10-15 01:58:20,232 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:20,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:20,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2057575781, now seen corresponding path program 1 times [2019-10-15 01:58:20,232 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:20,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366272807] [2019-10-15 01:58:20,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:20,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:20,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:20,664 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-15 01:58:20,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366272807] [2019-10-15 01:58:20,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:58:20,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:58:20,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455926373] [2019-10-15 01:58:20,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:58:20,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:20,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:58:20,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:58:20,670 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 9 states. [2019-10-15 01:58:21,057 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-10-15 01:58:21,183 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-15 01:58:21,365 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-15 01:58:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:21,678 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2019-10-15 01:58:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:58:21,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-10-15 01:58:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:21,682 INFO L225 Difference]: With dead ends: 152 [2019-10-15 01:58:21,682 INFO L226 Difference]: Without dead ends: 150 [2019-10-15 01:58:21,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:58:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-15 01:58:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2019-10-15 01:58:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-15 01:58:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-10-15 01:58:21,691 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 24 [2019-10-15 01:58:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:21,692 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-10-15 01:58:21,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:58:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-10-15 01:58:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:58:21,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:21,693 INFO L380 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] [2019-10-15 01:58:21,694 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:21,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:21,694 INFO L82 PathProgramCache]: Analyzing trace with hash 537268982, now seen corresponding path program 1 times [2019-10-15 01:58:21,694 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:21,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743536221] [2019-10-15 01:58:21,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:21,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:21,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:22,002 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-15 01:58:22,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743536221] [2019-10-15 01:58:22,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:58:22,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:58:22,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302133038] [2019-10-15 01:58:22,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:58:22,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:58:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:58:22,004 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 9 states. [2019-10-15 01:58:22,384 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-15 01:58:22,510 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-15 01:58:22,841 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-15 01:58:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:23,073 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2019-10-15 01:58:23,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:58:23,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-10-15 01:58:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:23,075 INFO L225 Difference]: With dead ends: 161 [2019-10-15 01:58:23,075 INFO L226 Difference]: Without dead ends: 159 [2019-10-15 01:58:23,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:58:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-15 01:58:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 90. [2019-10-15 01:58:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-15 01:58:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-10-15 01:58:23,094 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 27 [2019-10-15 01:58:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:23,094 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-10-15 01:58:23,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:58:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-10-15 01:58:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:58:23,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:23,099 INFO L380 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] [2019-10-15 01:58:23,099 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:23,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:23,101 INFO L82 PathProgramCache]: Analyzing trace with hash 272164207, now seen corresponding path program 1 times [2019-10-15 01:58:23,102 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:23,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403432743] [2019-10-15 01:58:23,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:23,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:23,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:58:23,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403432743] [2019-10-15 01:58:23,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:58:23,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:58:23,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587606337] [2019-10-15 01:58:23,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:58:23,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:23,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:58:23,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:58:23,142 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 3 states. [2019-10-15 01:58:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:23,181 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-10-15 01:58:23,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:58:23,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:58:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:23,183 INFO L225 Difference]: With dead ends: 91 [2019-10-15 01:58:23,183 INFO L226 Difference]: Without dead ends: 89 [2019-10-15 01:58:23,183 INFO L600 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-15 01:58:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-15 01:58:23,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-10-15 01:58:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-15 01:58:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-10-15 01:58:23,190 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 27 [2019-10-15 01:58:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:23,191 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-10-15 01:58:23,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:58:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-10-15 01:58:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:58:23,192 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:23,192 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:58:23,193 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:23,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:23,193 INFO L82 PathProgramCache]: Analyzing trace with hash -841141344, now seen corresponding path program 1 times [2019-10-15 01:58:23,194 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:23,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853977151] [2019-10-15 01:58:23,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:23,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:23,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:58:23,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853977151] [2019-10-15 01:58:23,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415891062] [2019-10-15 01:58:23,297 INFO L94 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-15 01:58:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:23,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-15 01:58:23,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:58:23,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-15 01:58:23,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:58:23,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:58:23,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:23,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-15 01:58:23,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:58:23,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:58:23,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:23,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-15 01:58:23,521 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 01:58:23,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:58:23,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:58:23,536 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2019-10-15 01:58:23,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:58:23,600 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_32|], 1=[v_prenex_1]} [2019-10-15 01:58:23,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 65 [2019-10-15 01:58:23,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:58:23,862 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-10-15 01:58:23,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:58:23,887 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:58:23,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 392 treesize of output 396 [2019-10-15 01:58:23,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:58:24,061 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-15 01:58:24,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:58:24,067 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_50|], 26=[v_prenex_2, v_prenex_3]} [2019-10-15 01:58:24,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2019-10-15 01:58:24,102 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 01:58:24,246 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-15 01:58:24,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:58:24,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2019-10-15 01:58:24,276 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 01:58:24,565 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-15 01:58:24,566 INFO L567 ElimStorePlain]: treesize reduction 8, result has 98.2 percent of original size [2019-10-15 01:58:24,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,743 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-15 01:58:24,744 INFO L341 Elim1Store]: treesize reduction 226, result has 52.8 percent of original size [2019-10-15 01:58:24,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 176 treesize of output 391 [2019-10-15 01:58:24,746 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-15 01:58:24,910 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-10-15 01:58:24,910 INFO L567 ElimStorePlain]: treesize reduction 220, result has 50.0 percent of original size [2019-10-15 01:58:24,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:58:24,928 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 01:58:24,967 INFO L341 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-10-15 01:58:24,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 104 [2019-10-15 01:58:24,970 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-15 01:58:25,108 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-15 01:58:25,108 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.5 percent of original size [2019-10-15 01:58:25,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-15 01:58:25,109 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:460, output treesize:152 [2019-10-15 01:58:25,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-15 01:58:25,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:58:25,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:58:25,425 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:58:25,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-10-15 01:58:25,426 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:58:25,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:58:25,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:58:25,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-10-15 01:58:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:58:25,440 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:58:25,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:58:25,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:58:25,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:58:27,544 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_main_~list~0.offset 8))) (and (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse1 (+ c_main_~list~0.offset 8))) (let ((.cse0 (select (let ((.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse1 |v_main_#t~malloc2.base_7|)))) (store .cse5 |v_main_#t~malloc2.base_7| (store (select .cse5 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse3 (select (select .cse2 c_main_~list~0.base) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse1 0)))) (store .cse4 |v_main_#t~malloc2.base_7| (store (select .cse4 |v_main_#t~malloc2.base_7|) 0 0))) c_main_~list~0.base) .cse1) 8) 0)))) c_main_~list~0.base))) (or (= 0 (select .cse0 c_main_~list~0.offset)) (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (not (= 0 (select .cse0 .cse1))) (= |v_main_#t~malloc2.base_7| 0))))) (= (select (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse6 0) c_main_~list~0.offset) 0) (= (select (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse6 0) c_main_~list~0.offset) 0) (forall ((v_prenex_4 Int)) (let ((.cse10 (+ c_main_~list~0.offset 8))) (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse10 0)))) (store .cse13 v_prenex_4 (store (select .cse13 v_prenex_4) 0 0)))) (.cse7 (let ((.cse12 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse10 v_prenex_4)))) (store .cse12 v_prenex_4 (store (select .cse12 v_prenex_4) 0 0))))) (let ((.cse8 (select (select .cse7 c_main_~list~0.base) .cse10)) (.cse9 (+ (select (select .cse11 c_main_~list~0.base) .cse10) 8))) (or (= v_prenex_4 0) (not (= (select |c_#valid| v_prenex_4) 0)) (not (= 0 (select (select (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 0)) c_main_~list~0.base) .cse10))) (= (select (select (store .cse11 .cse8 (store (select .cse11 .cse8) .cse9 0)) c_main_~list~0.base) c_main_~list~0.offset) 0)))))))) is different from false [2019-10-15 01:58:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:58:27,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1537670385] [2019-10-15 01:58:27,606 INFO L162 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-10-15 01:58:27,606 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:58:27,615 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:58:27,624 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:58:27,624 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:58:27,719 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-15 01:58:28,252 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:58:28,256 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:58:28,634 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-15 01:58:29,196 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:58:29,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8, 12] total 26 [2019-10-15 01:58:29,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740206788] [2019-10-15 01:58:29,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 01:58:29,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:29,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 01:58:29,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=520, Unknown=1, NotChecked=46, Total=650 [2019-10-15 01:58:29,199 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 26 states. [2019-10-15 01:58:36,529 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-10-15 01:58:36,895 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-10-15 01:58:37,272 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-10-15 01:58:37,850 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-10-15 01:58:38,201 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-10-15 01:58:38,542 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-10-15 01:58:38,894 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-15 01:58:39,190 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-15 01:58:39,798 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-10-15 01:58:40,500 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-10-15 01:58:40,811 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-15 01:58:41,004 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-15 01:58:41,695 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-15 01:58:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:41,731 INFO L93 Difference]: Finished difference Result 290 states and 318 transitions. [2019-10-15 01:58:41,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-15 01:58:41,732 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-10-15 01:58:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:41,734 INFO L225 Difference]: With dead ends: 290 [2019-10-15 01:58:41,735 INFO L226 Difference]: Without dead ends: 252 [2019-10-15 01:58:41,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=481, Invalid=2384, Unknown=1, NotChecked=104, Total=2970 [2019-10-15 01:58:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-15 01:58:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 106. [2019-10-15 01:58:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-15 01:58:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-10-15 01:58:41,747 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 29 [2019-10-15 01:58:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:41,747 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-10-15 01:58:41,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 01:58:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-10-15 01:58:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:58:41,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:41,749 INFO L380 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] [2019-10-15 01:58:41,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:58:41,954 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:41,954 INFO L82 PathProgramCache]: Analyzing trace with hash -850180374, now seen corresponding path program 1 times [2019-10-15 01:58:41,955 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:41,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454814778] [2019-10-15 01:58:41,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:41,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:41,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:58:42,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454814778] [2019-10-15 01:58:42,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614727778] [2019-10-15 01:58:42,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:58:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:42,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-15 01:58:42,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:58:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:58:42,476 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:58:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:58:42,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:58:42,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 13 [2019-10-15 01:58:42,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111631282] [2019-10-15 01:58:42,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:58:42,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:42,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:58:42,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:58:42,552 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 6 states. [2019-10-15 01:58:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:42,800 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2019-10-15 01:58:42,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:58:42,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-15 01:58:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:42,807 INFO L225 Difference]: With dead ends: 194 [2019-10-15 01:58:42,807 INFO L226 Difference]: Without dead ends: 178 [2019-10-15 01:58:42,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:58:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-15 01:58:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 139. [2019-10-15 01:58:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-15 01:58:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2019-10-15 01:58:42,819 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 30 [2019-10-15 01:58:42,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:42,820 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2019-10-15 01:58:42,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:58:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2019-10-15 01:58:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:58:42,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:42,821 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:58:43,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:58:43,026 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:43,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:43,027 INFO L82 PathProgramCache]: Analyzing trace with hash 729412443, now seen corresponding path program 1 times [2019-10-15 01:58:43,027 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:43,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379980790] [2019-10-15 01:58:43,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:43,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:43,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:58:43,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379980790] [2019-10-15 01:58:43,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211623546] [2019-10-15 01:58:43,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:58:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:43,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-15 01:58:43,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:58:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:58:43,340 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:58:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:58:43,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1836729876] [2019-10-15 01:58:43,424 INFO L162 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-10-15 01:58:43,424 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:58:43,425 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:58:43,425 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:58:43,425 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:58:43,467 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-15 01:58:43,848 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:58:43,851 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:58:44,146 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-15 01:58:44,860 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:58:44,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 14] total 21 [2019-10-15 01:58:44,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658981942] [2019-10-15 01:58:44,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-15 01:58:44,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:58:44,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-15 01:58:44,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:58:44,862 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand 21 states. [2019-10-15 01:58:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:58:48,476 INFO L93 Difference]: Finished difference Result 303 states and 347 transitions. [2019-10-15 01:58:48,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-15 01:58:48,477 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-10-15 01:58:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:58:48,478 INFO L225 Difference]: With dead ends: 303 [2019-10-15 01:58:48,478 INFO L226 Difference]: Without dead ends: 274 [2019-10-15 01:58:48,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=450, Invalid=2412, Unknown=0, NotChecked=0, Total=2862 [2019-10-15 01:58:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-15 01:58:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 173. [2019-10-15 01:58:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-15 01:58:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2019-10-15 01:58:48,491 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 33 [2019-10-15 01:58:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:58:48,492 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2019-10-15 01:58:48,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-15 01:58:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2019-10-15 01:58:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:58:48,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:58:48,493 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:58:48,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:58:48,705 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:58:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:58:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1665686661, now seen corresponding path program 1 times [2019-10-15 01:58:48,706 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:58:48,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118089653] [2019-10-15 01:58:48,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:48,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:58:48,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:58:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:49,174 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-10-15 01:58:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:58:49,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118089653] [2019-10-15 01:58:49,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742398023] [2019-10-15 01:58:49,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:58:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:58:49,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-15 01:58:49,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:58:50,057 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-15 01:58:50,176 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-15 01:58:50,387 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-15 01:58:50,599 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-10-15 01:58:51,574 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-10-15 01:58:52,218 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-10-15 01:58:52,461 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-15 01:58:52,759 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-10-15 01:58:53,116 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83