java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:10:45,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:10:45,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:10:45,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:10:45,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:10:45,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:10:45,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:10:45,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:10:45,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:10:45,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:10:45,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:10:45,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:10:45,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:10:45,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:10:45,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:10:45,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:10:45,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:10:45,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:10:45,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:10:45,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:10:45,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:10:45,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:10:45,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:10:45,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:10:45,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:10:45,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:10:45,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:10:45,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:10:45,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:10:45,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:10:45,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:10:45,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:10:45,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:10:45,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:10:45,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:10:45,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:10:45,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:10:45,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:10:45,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:10:45,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:10:45,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:10:45,877 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-14 23:10:45,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:10:45,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:10:45,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:10:45,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:10:45,894 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:10:45,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:10:45,894 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:10:45,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:10:45,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:10:45,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:10:45,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:10:45,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:10:45,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:10:45,896 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:10:45,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:10:45,896 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:10:45,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:10:45,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:10:45,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:10:45,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:10:45,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:10:45,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:45,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:10:45,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:10:45,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:10:45,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:10:45,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:10:45,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:10:45,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:10:46,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:10:46,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:10:46,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:10:46,215 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:10:46,216 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:10:46,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2019-10-14 23:10:46,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9213c7f/1ce0f895e9ba4d4ca606242a187fe469/FLAG817a3984c [2019-10-14 23:10:46,863 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:10:46,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2019-10-14 23:10:46,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9213c7f/1ce0f895e9ba4d4ca606242a187fe469/FLAG817a3984c [2019-10-14 23:10:47,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9213c7f/1ce0f895e9ba4d4ca606242a187fe469 [2019-10-14 23:10:47,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:10:47,176 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:10:47,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:47,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:10:47,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:10:47,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:47" (1/1) ... [2019-10-14 23:10:47,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691de8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:47, skipping insertion in model container [2019-10-14 23:10:47,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:47" (1/1) ... [2019-10-14 23:10:47,194 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:10:47,249 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:10:47,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:47,710 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:10:47,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:47,829 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:10:47,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:47 WrapperNode [2019-10-14 23:10:47,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:47,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:10:47,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:10:47,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:10:47,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:47" (1/1) ... [2019-10-14 23:10:47,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:47" (1/1) ... [2019-10-14 23:10:47,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:47" (1/1) ... [2019-10-14 23:10:47,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:47" (1/1) ... [2019-10-14 23:10:47,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:47" (1/1) ... [2019-10-14 23:10:47,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:47" (1/1) ... [2019-10-14 23:10:47,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:47" (1/1) ... [2019-10-14 23:10:47,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:10:47,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:10:47,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:10:47,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:10:47,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:47" (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-14 23:10:47,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:10:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:10:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:10:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:10:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:10:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-10-14 23:10:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:10:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:10:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:10:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:10:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:10:47,962 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:10:47,962 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:10:47,962 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:10:47,963 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:10:47,963 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:10:47,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:10:47,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:10:47,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:10:47,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:10:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:10:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:10:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:10:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:10:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:10:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:10:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:10:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:10:47,967 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:10:47,967 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:10:47,967 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:10:47,967 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:10:47,967 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:10:47,967 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:10:47,968 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:10:47,968 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:10:47,968 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:10:47,968 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:10:47,968 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:10:47,968 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:10:47,969 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:10:47,969 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:10:47,969 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:10:47,969 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:10:47,969 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:10:47,969 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:10:47,969 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:10:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:10:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:10:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:10:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:10:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:10:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:10:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:10:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:10:47,970 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:10:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:10:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:10:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:10:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:10:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:10:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:10:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:10:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:10:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 23:10:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:10:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:10:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:10:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:10:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:10:47,972 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:10:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:10:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:10:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:10:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:10:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:10:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:10:47,973 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:10:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:10:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:10:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:10:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:10:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:10:47,974 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:10:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:10:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:10:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:10:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:10:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:10:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:10:47,975 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:10:47,976 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:10:47,976 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:10:47,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:10:47,976 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:10:47,976 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:10:47,976 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:10:47,976 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:10:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:10:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:10:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:10:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:10:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:10:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:10:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:10:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:10:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:10:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:10:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:10:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:10:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:10:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:10:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:10:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:10:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-10-14 23:10:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:10:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:10:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:10:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:10:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:10:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:10:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:10:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:10:47,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:10:48,472 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:10:48,580 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:10:48,580 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:10:48,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:48 BoogieIcfgContainer [2019-10-14 23:10:48,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:10:48,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:10:48,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:10:48,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:10:48,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:10:47" (1/3) ... [2019-10-14 23:10:48,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f675d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:48, skipping insertion in model container [2019-10-14 23:10:48,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:47" (2/3) ... [2019-10-14 23:10:48,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f675d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:48, skipping insertion in model container [2019-10-14 23:10:48,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:48" (3/3) ... [2019-10-14 23:10:48,591 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2019-10-14 23:10:48,600 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:10:48,607 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:10:48,619 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:10:48,645 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:10:48,645 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:10:48,645 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:10:48,646 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:10:48,647 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:10:48,647 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:10:48,647 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:10:48,647 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:10:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-14 23:10:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:10:48,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:48,671 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:48,674 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash -189611821, now seen corresponding path program 1 times [2019-10-14 23:10:48,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:48,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680595942] [2019-10-14 23:10:48,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:48,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:48,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:48,954 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-14 23:10:48,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680595942] [2019-10-14 23:10:48,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:48,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:10:48,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756740561] [2019-10-14 23:10:48,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:10:48,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:10:48,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:10:48,979 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 4 states. [2019-10-14 23:10:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:49,157 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-10-14 23:10:49,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:10:49,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-14 23:10:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:49,167 INFO L225 Difference]: With dead ends: 53 [2019-10-14 23:10:49,167 INFO L226 Difference]: Without dead ends: 26 [2019-10-14 23:10:49,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:10:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-14 23:10:49,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-14 23:10:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-14 23:10:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-10-14 23:10:49,209 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2019-10-14 23:10:49,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:49,210 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-10-14 23:10:49,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:10:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-10-14 23:10:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:10:49,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:49,211 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:49,211 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash 371500639, now seen corresponding path program 1 times [2019-10-14 23:10:49,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:49,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907836165] [2019-10-14 23:10:49,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:49,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:49,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,432 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-14 23:10:49,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907836165] [2019-10-14 23:10:49,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:49,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:10:49,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384605842] [2019-10-14 23:10:49,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:10:49,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:49,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:10:49,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:10:49,442 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2019-10-14 23:10:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:49,653 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-14 23:10:49,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:10:49,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-10-14 23:10:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:49,654 INFO L225 Difference]: With dead ends: 42 [2019-10-14 23:10:49,655 INFO L226 Difference]: Without dead ends: 29 [2019-10-14 23:10:49,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:10:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-14 23:10:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-10-14 23:10:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 23:10:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-14 23:10:49,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2019-10-14 23:10:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:49,664 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-14 23:10:49,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:10:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-14 23:10:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:10:49,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:49,666 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-14 23:10:49,666 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:49,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:49,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2036002280, now seen corresponding path program 1 times [2019-10-14 23:10:49,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:49,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698908432] [2019-10-14 23:10:49,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:49,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:49,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:49,898 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-14 23:10:49,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698908432] [2019-10-14 23:10:49,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181253867] [2019-10-14 23:10:49,899 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-14 23:10:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:50,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:10:50,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:50,062 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-14 23:10:50,062 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:50,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-10-14 23:10:50,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422874153] [2019-10-14 23:10:50,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:10:50,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:50,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:10:50,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:10:50,065 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 9 states. [2019-10-14 23:10:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:50,275 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-10-14 23:10:50,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:10:50,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-14 23:10:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:50,277 INFO L225 Difference]: With dead ends: 45 [2019-10-14 23:10:50,277 INFO L226 Difference]: Without dead ends: 32 [2019-10-14 23:10:50,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:10:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-14 23:10:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-10-14 23:10:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 23:10:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-14 23:10:50,295 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2019-10-14 23:10:50,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:50,296 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-14 23:10:50,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:10:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-14 23:10:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:10:50,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:50,298 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:50,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:50,503 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1998380991, now seen corresponding path program 2 times [2019-10-14 23:10:50,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:50,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077052534] [2019-10-14 23:10:50,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:50,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:50,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:50,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077052534] [2019-10-14 23:10:50,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410226782] [2019-10-14 23:10:50,703 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-14 23:10:50,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:10:50,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:50,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:10:50,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:50,903 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:50,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-10-14 23:10:50,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295184805] [2019-10-14 23:10:50,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:10:50,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:50,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:10:50,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:10:50,905 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 10 states. [2019-10-14 23:10:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:51,105 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-10-14 23:10:51,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:10:51,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-10-14 23:10:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:51,107 INFO L225 Difference]: With dead ends: 48 [2019-10-14 23:10:51,107 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 23:10:51,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:10:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 23:10:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-10-14 23:10:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:10:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-10-14 23:10:51,116 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 24 [2019-10-14 23:10:51,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:51,116 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-10-14 23:10:51,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:10:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-10-14 23:10:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:10:51,117 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:51,117 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:51,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:51,324 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:51,324 INFO L82 PathProgramCache]: Analyzing trace with hash -54403912, now seen corresponding path program 3 times [2019-10-14 23:10:51,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:51,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58831307] [2019-10-14 23:10:51,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:51,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:51,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:51,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58831307] [2019-10-14 23:10:51,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507330961] [2019-10-14 23:10:51,496 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-14 23:10:51,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 23:10:51,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:51,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 23:10:51,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:51,891 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:51,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-10-14 23:10:51,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422294767] [2019-10-14 23:10:51,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:10:51,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:51,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:10:51,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:10:51,893 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 11 states. [2019-10-14 23:10:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:52,103 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-10-14 23:10:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:10:52,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-10-14 23:10:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:52,105 INFO L225 Difference]: With dead ends: 51 [2019-10-14 23:10:52,106 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 23:10:52,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:10:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 23:10:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-10-14 23:10:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-14 23:10:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-10-14 23:10:52,113 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 27 [2019-10-14 23:10:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:52,113 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-10-14 23:10:52,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:10:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-10-14 23:10:52,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:10:52,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:52,114 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:52,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:52,319 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:52,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:52,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1469878559, now seen corresponding path program 4 times [2019-10-14 23:10:52,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:52,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201319211] [2019-10-14 23:10:52,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:52,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:52,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:10:52,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201319211] [2019-10-14 23:10:52,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446219786] [2019-10-14 23:10:52,877 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-14 23:10:56,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:10:56,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:10:56,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-14 23:10:56,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:56,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:56,470 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 35 treesize of output 7 [2019-10-14 23:10:56,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:14 [2019-10-14 23:10:56,516 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:56,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:56,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:10:56,554 INFO L341 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2019-10-14 23:10:56,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 32 [2019-10-14 23:10:56,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:10:56,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,573 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:11 [2019-10-14 23:10:56,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 23:10:56,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:56,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:56,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-14 23:10:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:10:56,667 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:10:56,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2019-10-14 23:10:56,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120836352] [2019-10-14 23:10:56,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 23:10:56,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:56,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 23:10:56,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:10:56,669 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 21 states. [2019-10-14 23:10:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:57,268 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-10-14 23:10:57,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:10:57,268 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-10-14 23:10:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:57,269 INFO L225 Difference]: With dead ends: 40 [2019-10-14 23:10:57,270 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 23:10:57,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2019-10-14 23:10:57,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 23:10:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-14 23:10:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 23:10:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-10-14 23:10:57,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 30 [2019-10-14 23:10:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:57,277 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-10-14 23:10:57,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 23:10:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-10-14 23:10:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:10:57,278 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:57,278 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:57,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:57,486 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:57,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1961746313, now seen corresponding path program 1 times [2019-10-14 23:10:57,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:57,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798979503] [2019-10-14 23:10:57,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:57,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:57,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:58,473 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2019-10-14 23:10:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:10:58,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798979503] [2019-10-14 23:10:58,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482901326] [2019-10-14 23:10:58,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:10:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:58,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 81 conjunts are in the unsatisfiable core [2019-10-14 23:10:58,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:10:58,859 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-14 23:10:58,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:58,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:10:58,912 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:58,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:10:58,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:58,934 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-10-14 23:10:58,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:58,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2019-10-14 23:10:59,020 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-10-14 23:10:59,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,065 INFO L567 ElimStorePlain]: treesize reduction 28, result has 52.5 percent of original size [2019-10-14 23:10:59,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:59,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2019-10-14 23:10:59,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 99 [2019-10-14 23:10:59,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,275 INFO L567 ElimStorePlain]: treesize reduction 42, result has 54.8 percent of original size [2019-10-14 23:10:59,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:59,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:51 [2019-10-14 23:10:59,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 23:10:59,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:59,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:86, output treesize:58 [2019-10-14 23:10:59,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 48 [2019-10-14 23:10:59,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:29 [2019-10-14 23:10:59,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-10-14 23:10:59,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,689 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:59,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-10-14 23:10:59,764 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,840 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:10:59,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:10:59,889 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2019-10-14 23:10:59,942 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:10:59,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:10:59,967 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:127, output treesize:71 [2019-10-14 23:11:00,044 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_31|], 5=[|v_#memory_int_33|], 8=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_24|]} [2019-10-14 23:11:00,048 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:00,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:00,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2019-10-14 23:11:00,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:00,205 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:00,255 INFO L341 Elim1Store]: treesize reduction 3, result has 94.4 percent of original size [2019-10-14 23:11:00,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 104 [2019-10-14 23:11:00,257 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,352 INFO L567 ElimStorePlain]: treesize reduction 75, result has 62.1 percent of original size [2019-10-14 23:11:00,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:00,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:00,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2019-10-14 23:11:00,363 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,394 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:175, output treesize:117 [2019-10-14 23:11:00,659 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 3=[|v_#memory_int_34|], 9=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|]} [2019-10-14 23:11:00,663 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:00,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,706 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:00,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:00,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-10-14 23:11:00,746 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:00,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:00,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 106 [2019-10-14 23:11:00,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:00,811 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_28, v_arrayElimCell_27], 1=[v_arrayElimCell_29]} [2019-10-14 23:11:01,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:01,023 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-14 23:11:01,030 INFO L168 Benchmark]: Toolchain (without parser) took 13854.41 ms. Allocated memory was 134.7 MB in the beginning and 343.4 MB in the end (delta: 208.7 MB). Free memory was 98.7 MB in the beginning and 171.3 MB in the end (delta: -72.6 MB). Peak memory consumption was 136.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:11:01,037 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 134.7 MB. Free memory was 118.0 MB in the beginning and 117.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-14 23:11:01,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 652.47 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 98.5 MB in the beginning and 164.7 MB in the end (delta: -66.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:11:01,043 INFO L168 Benchmark]: Boogie Preprocessor took 59.86 ms. Allocated memory is still 198.7 MB. Free memory was 164.7 MB in the beginning and 161.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:11:01,044 INFO L168 Benchmark]: RCFGBuilder took 690.62 ms. Allocated memory is still 198.7 MB. Free memory was 161.8 MB in the beginning and 117.0 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:11:01,045 INFO L168 Benchmark]: TraceAbstraction took 12445.21 ms. Allocated memory was 198.7 MB in the beginning and 343.4 MB in the end (delta: 144.7 MB). Free memory was 117.0 MB in the beginning and 171.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 90.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:11:01,049 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 134.7 MB. Free memory was 118.0 MB in the beginning and 117.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 652.47 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 98.5 MB in the beginning and 164.7 MB in the end (delta: -66.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.86 ms. Allocated memory is still 198.7 MB. Free memory was 164.7 MB in the beginning and 161.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 690.62 ms. Allocated memory is still 198.7 MB. Free memory was 161.8 MB in the beginning and 117.0 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12445.21 ms. Allocated memory was 198.7 MB in the beginning and 343.4 MB in the end (delta: 144.7 MB). Free memory was 117.0 MB in the beginning and 171.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 90.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...