/usr/bin/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/forester-heap/dll-rb-sentinel-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 11:20:21,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:20:21,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:20:21,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:20:21,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:20:21,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:20:21,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:20:21,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:20:21,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:20:21,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:20:21,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:20:21,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:20:21,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:20:21,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:20:21,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:20:21,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:20:21,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:20:21,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:20:21,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:20:21,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:20:21,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:20:21,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:20:21,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:20:21,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:20:21,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:20:21,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:20:21,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:20:21,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:20:21,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:20:21,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:20:21,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:20:21,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:20:21,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:20:21,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:20:21,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:20:21,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:20:21,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:20:21,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:20:21,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:20:21,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:20:21,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:20:21,884 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 [2020-07-07 11:20:21,920 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:20:21,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:20:21,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:20:21,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:20:21,922 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:20:21,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:20:21,922 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:20:21,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:20:21,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:20:21,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:20:21,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:20:21,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:20:21,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:20:21,925 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:20:21,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:20:21,926 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:20:21,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:20:21,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:20:21,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:20:21,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:20:21,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:20:21,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:20:21,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:20:21,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:20:21,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:20:21,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:20:21,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:20:21,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:20:21,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:20:21,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:20:22,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:20:22,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:20:22,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:20:22,246 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:20:22,247 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:20:22,248 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i [2020-07-07 11:20:22,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3d9143b/fa1f8ce081ae4b83b5baf5d81cd1c5ff/FLAG5ab46d0dd [2020-07-07 11:20:22,875 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:20:22,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i [2020-07-07 11:20:22,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3d9143b/fa1f8ce081ae4b83b5baf5d81cd1c5ff/FLAG5ab46d0dd [2020-07-07 11:20:23,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3d9143b/fa1f8ce081ae4b83b5baf5d81cd1c5ff [2020-07-07 11:20:23,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:20:23,188 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:20:23,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:20:23,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:20:23,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:20:23,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:20:23" (1/1) ... [2020-07-07 11:20:23,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d3e829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:23, skipping insertion in model container [2020-07-07 11:20:23,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:20:23" (1/1) ... [2020-07-07 11:20:23,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:20:23,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:20:23,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:20:23,714 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:20:23,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:20:23,824 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:20:23,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:23 WrapperNode [2020-07-07 11:20:23,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:20:23,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:20:23,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:20:23,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:20:23,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:23" (1/1) ... [2020-07-07 11:20:23,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:23" (1/1) ... [2020-07-07 11:20:23,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:23" (1/1) ... [2020-07-07 11:20:23,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:23" (1/1) ... [2020-07-07 11:20:23,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:23" (1/1) ... [2020-07-07 11:20:23,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:23" (1/1) ... [2020-07-07 11:20:23,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:23" (1/1) ... [2020-07-07 11:20:23,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:20:23,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:20:23,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:20:23,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:20:23,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:23" (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 [2020-07-07 11:20:23,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:20:23,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:20:23,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:20:23,991 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-07 11:20:23,991 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-07 11:20:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-07 11:20:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-07 11:20:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-07 11:20:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-07 11:20:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-07 11:20:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-07 11:20:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-07 11:20:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-07 11:20:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-07 11:20:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-07 11:20:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-07 11:20:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-07 11:20:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-07 11:20:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-07 11:20:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-07 11:20:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-07 11:20:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-07 11:20:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-07 11:20:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-07 11:20:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-07 11:20:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-07 11:20:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-07 11:20:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-07 11:20:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-07 11:20:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-07 11:20:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-07 11:20:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-07 11:20:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-07 11:20:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-07 11:20:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-07 11:20:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-07 11:20:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-07 11:20:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-07 11:20:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-07 11:20:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-07 11:20:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-07 11:20:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-07 11:20:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-07 11:20:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-07 11:20:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-07 11:20:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-07 11:20:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-07 11:20:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-07 11:20:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-07 11:20:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-07 11:20:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-07 11:20:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-07 11:20:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-07 11:20:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-07 11:20:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-07 11:20:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-07 11:20:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-07 11:20:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-07 11:20:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-07 11:20:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-07 11:20:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-07 11:20:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-07 11:20:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-07 11:20:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-07 11:20:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-07 11:20:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-07 11:20:24,001 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-07 11:20:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-07 11:20:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-07 11:20:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-07 11:20:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-07 11:20:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-07 11:20:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-07 11:20:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-07 11:20:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-07 11:20:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-07 11:20:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-07 11:20:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-07 11:20:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-07 11:20:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-07 11:20:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-07 11:20:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-07 11:20:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-07 11:20:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-07 11:20:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-07 11:20:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-07 11:20:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-07 11:20:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-07 11:20:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-07 11:20:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-07 11:20:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-07 11:20:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-07 11:20:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-07 11:20:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-07 11:20:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-07 11:20:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-07 11:20:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-07 11:20:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-07 11:20:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-07 11:20:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-07 11:20:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-07 11:20:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-07 11:20:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-07 11:20:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-07 11:20:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-07 11:20:24,007 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-07 11:20:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:20:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:20:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:20:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-07 11:20:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-07 11:20:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-07 11:20:24,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-07 11:20:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-07 11:20:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-07 11:20:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:20:24,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:20:24,645 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:20:24,646 INFO L295 CfgBuilder]: Removed 17 assume(true) statements. [2020-07-07 11:20:24,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:20:24 BoogieIcfgContainer [2020-07-07 11:20:24,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:20:24,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:20:24,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:20:24,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:20:24,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:20:23" (1/3) ... [2020-07-07 11:20:24,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4f5239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:20:24, skipping insertion in model container [2020-07-07 11:20:24,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:23" (2/3) ... [2020-07-07 11:20:24,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4f5239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:20:24, skipping insertion in model container [2020-07-07 11:20:24,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:20:24" (3/3) ... [2020-07-07 11:20:24,665 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2020-07-07 11:20:24,676 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:20:24,685 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-07-07 11:20:24,698 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-07-07 11:20:24,719 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:20:24,719 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:20:24,719 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:20:24,719 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:20:24,720 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:20:24,720 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:20:24,720 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:20:24,720 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:20:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-07 11:20:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-07 11:20:24,747 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:24,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:24,748 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:24,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1255802584, now seen corresponding path program 1 times [2020-07-07 11:20:24,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:24,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775239285] [2020-07-07 11:20:24,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:24,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775239285] [2020-07-07 11:20:24,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:24,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 11:20:24,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687167873] [2020-07-07 11:20:25,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:20:25,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:25,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:20:25,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 11:20:25,018 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2020-07-07 11:20:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:25,279 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2020-07-07 11:20:25,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:20:25,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-07 11:20:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:25,292 INFO L225 Difference]: With dead ends: 98 [2020-07-07 11:20:25,292 INFO L226 Difference]: Without dead ends: 45 [2020-07-07 11:20:25,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 11:20:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-07 11:20:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-07 11:20:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-07 11:20:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-07 11:20:25,333 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 10 [2020-07-07 11:20:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:25,334 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-07 11:20:25,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:20:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-07 11:20:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-07 11:20:25,335 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:25,335 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:25,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:20:25,336 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:25,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash -338068956, now seen corresponding path program 1 times [2020-07-07 11:20:25,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:25,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682593615] [2020-07-07 11:20:25,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:25,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682593615] [2020-07-07 11:20:25,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:25,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:20:25,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753373404] [2020-07-07 11:20:25,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:20:25,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:25,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:20:25,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:25,469 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2020-07-07 11:20:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:25,674 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2020-07-07 11:20:25,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:20:25,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-07 11:20:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:25,677 INFO L225 Difference]: With dead ends: 51 [2020-07-07 11:20:25,677 INFO L226 Difference]: Without dead ends: 49 [2020-07-07 11:20:25,678 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-07 11:20:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2020-07-07 11:20:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-07 11:20:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2020-07-07 11:20:25,686 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 11 [2020-07-07 11:20:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:25,687 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2020-07-07 11:20:25,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:20:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-07 11:20:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-07 11:20:25,688 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:25,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:25,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:20:25,689 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:25,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1890143313, now seen corresponding path program 1 times [2020-07-07 11:20:25,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:25,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973672980] [2020-07-07 11:20:25,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:25,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973672980] [2020-07-07 11:20:25,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:25,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:20:25,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86985566] [2020-07-07 11:20:25,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:20:25,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:25,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:20:25,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:25,786 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 5 states. [2020-07-07 11:20:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:25,932 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-07 11:20:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:20:25,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-07 11:20:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:25,934 INFO L225 Difference]: With dead ends: 43 [2020-07-07 11:20:25,934 INFO L226 Difference]: Without dead ends: 41 [2020-07-07 11:20:25,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-07 11:20:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-07 11:20:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-07 11:20:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-07-07 11:20:25,941 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 12 [2020-07-07 11:20:25,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:25,941 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-07-07 11:20:25,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:20:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-07-07 11:20:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-07 11:20:25,942 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:25,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:25,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 11:20:25,943 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash 290038970, now seen corresponding path program 1 times [2020-07-07 11:20:25,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:25,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344097196] [2020-07-07 11:20:25,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:26,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344097196] [2020-07-07 11:20:26,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:26,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 11:20:26,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760210328] [2020-07-07 11:20:26,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 11:20:26,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:26,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 11:20:26,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 11:20:26,092 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 7 states. [2020-07-07 11:20:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:26,449 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2020-07-07 11:20:26,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 11:20:26,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-07 11:20:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:26,451 INFO L225 Difference]: With dead ends: 82 [2020-07-07 11:20:26,452 INFO L226 Difference]: Without dead ends: 80 [2020-07-07 11:20:26,452 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:20:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-07 11:20:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2020-07-07 11:20:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-07 11:20:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2020-07-07 11:20:26,462 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 14 [2020-07-07 11:20:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:26,463 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2020-07-07 11:20:26,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 11:20:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-07 11:20:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-07 11:20:26,464 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:26,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:26,464 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 11:20:26,465 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:26,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:26,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2060721718, now seen corresponding path program 1 times [2020-07-07 11:20:26,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:26,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737500112] [2020-07-07 11:20:26,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:26,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737500112] [2020-07-07 11:20:26,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:26,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:20:26,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302672398] [2020-07-07 11:20:26,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:20:26,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:26,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:20:26,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:26,576 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 5 states. [2020-07-07 11:20:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:26,758 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-07 11:20:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:20:26,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-07 11:20:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:26,760 INFO L225 Difference]: With dead ends: 59 [2020-07-07 11:20:26,760 INFO L226 Difference]: Without dead ends: 57 [2020-07-07 11:20:26,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-07 11:20:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-07 11:20:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-07 11:20:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2020-07-07 11:20:26,768 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 15 [2020-07-07 11:20:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:26,768 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2020-07-07 11:20:26,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:20:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-07 11:20:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-07 11:20:26,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:26,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:26,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 11:20:26,770 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:26,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:26,770 INFO L82 PathProgramCache]: Analyzing trace with hash 373775322, now seen corresponding path program 1 times [2020-07-07 11:20:26,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:26,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53871073] [2020-07-07 11:20:26,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:26,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53871073] [2020-07-07 11:20:26,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:26,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:20:26,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662127985] [2020-07-07 11:20:26,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:20:26,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:26,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:20:26,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:26,864 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2020-07-07 11:20:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:27,034 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-07-07 11:20:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:20:27,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-07 11:20:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:27,036 INFO L225 Difference]: With dead ends: 57 [2020-07-07 11:20:27,036 INFO L226 Difference]: Without dead ends: 55 [2020-07-07 11:20:27,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-07 11:20:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-07 11:20:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-07 11:20:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2020-07-07 11:20:27,048 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 17 [2020-07-07 11:20:27,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:27,048 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2020-07-07 11:20:27,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:20:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-07 11:20:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-07 11:20:27,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:27,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:27,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 11:20:27,053 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:27,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1568846049, now seen corresponding path program 1 times [2020-07-07 11:20:27,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:27,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441463732] [2020-07-07 11:20:27,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:27,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441463732] [2020-07-07 11:20:27,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:27,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 11:20:27,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570761264] [2020-07-07 11:20:27,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:20:27,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:27,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:20:27,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:27,194 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 6 states. [2020-07-07 11:20:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:27,480 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2020-07-07 11:20:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 11:20:27,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-07 11:20:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:27,487 INFO L225 Difference]: With dead ends: 70 [2020-07-07 11:20:27,487 INFO L226 Difference]: Without dead ends: 58 [2020-07-07 11:20:27,488 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-07 11:20:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-07 11:20:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-07-07 11:20:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-07 11:20:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2020-07-07 11:20:27,494 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 18 [2020-07-07 11:20:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:27,494 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2020-07-07 11:20:27,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:20:27,494 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2020-07-07 11:20:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-07 11:20:27,495 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:27,496 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:27,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 11:20:27,496 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:27,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:27,496 INFO L82 PathProgramCache]: Analyzing trace with hash 777661568, now seen corresponding path program 1 times [2020-07-07 11:20:27,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:27,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241077888] [2020-07-07 11:20:27,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:27,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241077888] [2020-07-07 11:20:27,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753928216] [2020-07-07 11:20:27,586 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 [2020-07-07 11:20:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:27,702 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-07 11:20:27,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:20:27,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:27,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:27,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:27,789 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2020-07-07 11:20:27,790 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:27,800 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:27,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:27,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:27,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:27,830 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2020-07-07 11:20:27,831 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:27,857 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:27,857 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:27,858 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2020-07-07 11:20:27,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:27,940 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-07-07 11:20:27,941 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:27,951 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:27,957 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-07 11:20:27,957 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2020-07-07 11:20:27,958 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:27,963 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:27,964 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:27,964 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-07-07 11:20:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:27,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:20:27,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-07-07 11:20:27,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308267459] [2020-07-07 11:20:27,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:20:27,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:27,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:20:27,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:20:27,989 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 9 states. [2020-07-07 11:20:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:28,490 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-07-07 11:20:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 11:20:28,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-07 11:20:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:28,492 INFO L225 Difference]: With dead ends: 79 [2020-07-07 11:20:28,492 INFO L226 Difference]: Without dead ends: 57 [2020-07-07 11:20:28,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:20:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-07 11:20:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-07 11:20:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-07 11:20:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2020-07-07 11:20:28,500 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 21 [2020-07-07 11:20:28,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:28,500 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2020-07-07 11:20:28,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:20:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2020-07-07 11:20:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-07 11:20:28,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:28,502 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:28,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-07 11:20:28,715 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:28,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1056872398, now seen corresponding path program 1 times [2020-07-07 11:20:28,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:28,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812235514] [2020-07-07 11:20:28,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:29,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812235514] [2020-07-07 11:20:29,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541998425] [2020-07-07 11:20:29,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:20:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:29,172 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 44 conjunts are in the unsatisfiable core [2020-07-07 11:20:29,176 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:20:29,203 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-07 11:20:29,204 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-07 11:20:29,205 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:29,218 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:29,225 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-07 11:20:29,225 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:29,237 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:29,238 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:29,238 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:29 [2020-07-07 11:20:29,337 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:29,337 INFO L384 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 [2020-07-07 11:20:29,338 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:29,445 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-07-07 11:20:29,446 INFO L624 ElimStorePlain]: treesize reduction 14, result has 88.9 percent of original size [2020-07-07 11:20:29,455 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:29,489 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:29,495 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:29,533 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:29,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:29,541 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:29,570 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:29,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:29,598 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:29,599 INFO L384 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 77 treesize of output 55 [2020-07-07 11:20:29,600 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:29,655 INFO L624 ElimStorePlain]: treesize reduction 20, result has 73.3 percent of original size [2020-07-07 11:20:29,657 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:29,658 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:114, output treesize:27 [2020-07-07 11:20:29,763 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:29,763 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-07 11:20:29,765 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:29,863 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:29,872 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_39|, |v_#memory_int_40|, |v_#memory_$Pointer$.base_30|, |v_#memory_int_41|, |v_#memory_$Pointer$.offset_30|], 4=[|v_#memory_int_43|]} [2020-07-07 11:20:29,876 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:29,936 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:29,940 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:30,006 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:30,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:30,009 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:30,039 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:30,048 INFO L544 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:30,085 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:30,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:30,089 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:30,111 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:30,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:30,132 INFO L350 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2020-07-07 11:20:30,133 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2020-07-07 11:20:30,134 INFO L544 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:30,160 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:30,163 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:30,163 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:319, output treesize:41 [2020-07-07 11:20:30,300 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2020-07-07 11:20:30,300 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:30,307 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:30,308 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:30,308 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2020-07-07 11:20:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:30,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:20:30,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-07-07 11:20:30,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585424749] [2020-07-07 11:20:30,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 11:20:30,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:30,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 11:20:30,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:20:30,318 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 13 states. [2020-07-07 11:20:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:35,247 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2020-07-07 11:20:35,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:20:35,249 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-07-07 11:20:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:35,251 INFO L225 Difference]: With dead ends: 89 [2020-07-07 11:20:35,251 INFO L226 Difference]: Without dead ends: 87 [2020-07-07 11:20:35,252 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2020-07-07 11:20:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-07 11:20:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 39. [2020-07-07 11:20:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-07 11:20:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-07 11:20:35,265 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 25 [2020-07-07 11:20:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:35,266 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-07 11:20:35,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 11:20:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-07 11:20:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-07 11:20:35,269 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:35,269 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:35,482 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:20:35,483 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash -377613816, now seen corresponding path program 1 times [2020-07-07 11:20:35,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:35,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980334304] [2020-07-07 11:20:35,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:35,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980334304] [2020-07-07 11:20:35,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454470065] [2020-07-07 11:20:35,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:20:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:35,895 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 62 conjunts are in the unsatisfiable core [2020-07-07 11:20:35,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:20:35,924 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-07 11:20:35,925 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-07 11:20:35,925 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:35,935 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:35,937 INFO L544 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. [2020-07-07 11:20:35,938 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-07-07 11:20:36,012 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:36,013 INFO L384 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 [2020-07-07 11:20:36,014 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:36,102 INFO L624 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2020-07-07 11:20:36,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:36,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:36,122 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-07 11:20:36,135 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:36,136 INFO L384 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 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-07 11:20:36,136 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:36,204 INFO L624 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2020-07-07 11:20:36,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:36,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:36,243 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:36,244 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-07 11:20:36,244 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:36,313 INFO L624 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2020-07-07 11:20:36,314 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:36,315 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2020-07-07 11:20:36,437 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:36,438 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-07-07 11:20:36,438 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:36,616 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-07-07 11:20:36,617 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:36,623 INFO L440 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_33|], 11=[|v_#memory_$Pointer$.offset_31|, |v_#memory_$Pointer$.base_32|]} [2020-07-07 11:20:36,632 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:36,632 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 433 treesize of output 289 [2020-07-07 11:20:36,633 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:36,875 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2020-07-07 11:20:36,878 INFO L624 ElimStorePlain]: treesize reduction 16, result has 96.4 percent of original size [2020-07-07 11:20:36,900 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2020-07-07 11:20:36,901 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,045 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-07-07 11:20:37,045 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:37,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:37,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:37,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:37,072 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-07 11:20:37,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:37,122 INFO L350 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2020-07-07 11:20:37,122 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 97 [2020-07-07 11:20:37,124 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,242 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-07 11:20:37,243 INFO L624 ElimStorePlain]: treesize reduction 41, result has 86.4 percent of original size [2020-07-07 11:20:37,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:37,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:37,306 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:37,307 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 174 treesize of output 144 [2020-07-07 11:20:37,310 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,454 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2020-07-07 11:20:37,456 INFO L624 ElimStorePlain]: treesize reduction 134, result has 42.7 percent of original size [2020-07-07 11:20:37,457 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,457 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:457, output treesize:97 [2020-07-07 11:20:37,603 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:37,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:37,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:37,764 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 19 [2020-07-07 11:20:37,765 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,787 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:37,788 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:37,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:138, output treesize:75 [2020-07-07 11:20:37,946 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:37,946 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 85 treesize of output 86 [2020-07-07 11:20:37,949 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-07 11:20:37,950 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-07 11:20:37,950 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-07 11:20:37,951 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-07 11:20:37,952 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-07 11:20:37,953 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-07 11:20:37,954 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-07 11:20:37,954 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-07 11:20:37,955 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-07 11:20:37,956 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-07 11:20:37,957 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-07 11:20:37,957 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-07 11:20:37,958 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-07 11:20:37,959 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-07 11:20:37,959 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,966 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:37,966 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,966 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:4 [2020-07-07 11:20:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:37,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:20:37,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2020-07-07 11:20:37,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258095227] [2020-07-07 11:20:37,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-07 11:20:37,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-07 11:20:37,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2020-07-07 11:20:37,981 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 18 states. [2020-07-07 11:20:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:39,911 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2020-07-07 11:20:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 11:20:39,912 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2020-07-07 11:20:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:39,914 INFO L225 Difference]: With dead ends: 109 [2020-07-07 11:20:39,914 INFO L226 Difference]: Without dead ends: 107 [2020-07-07 11:20:39,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2020-07-07 11:20:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-07-07 11:20:39,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2020-07-07 11:20:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-07 11:20:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2020-07-07 11:20:39,924 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 32 [2020-07-07 11:20:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:39,925 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2020-07-07 11:20:39,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-07 11:20:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2020-07-07 11:20:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-07 11:20:39,926 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:39,926 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:40,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-07 11:20:40,151 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash -243600310, now seen corresponding path program 1 times [2020-07-07 11:20:40,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:40,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787319224] [2020-07-07 11:20:40,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:40,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787319224] [2020-07-07 11:20:40,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230946944] [2020-07-07 11:20:40,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:20:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:40,835 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 37 conjunts are in the unsatisfiable core [2020-07-07 11:20:40,838 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:20:40,857 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-07 11:20:40,858 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-07 11:20:40,858 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:40,871 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:40,871 INFO L544 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. [2020-07-07 11:20:40,872 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-07-07 11:20:40,932 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:40,933 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-07 11:20:40,934 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-07 11:20:40,935 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:40,961 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:40,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:40,972 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-07 11:20:40,983 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:40,983 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-07 11:20:40,984 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,050 INFO L624 ElimStorePlain]: treesize reduction 16, result has 88.4 percent of original size [2020-07-07 11:20:41,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:41,071 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:41,072 INFO L384 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 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-07 11:20:41,073 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,121 INFO L624 ElimStorePlain]: treesize reduction 16, result has 77.8 percent of original size [2020-07-07 11:20:41,122 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,122 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:194, output treesize:58 [2020-07-07 11:20:41,176 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 4=[|v_#memory_$Pointer$.base_36|], 6=[|v_#memory_$Pointer$.offset_35|]} [2020-07-07 11:20:41,181 INFO L384 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 19 treesize of output 11 [2020-07-07 11:20:41,181 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,208 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:41,221 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:41,221 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 72 [2020-07-07 11:20:41,225 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,249 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:41,256 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2020-07-07 11:20:41,256 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,270 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:41,270 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,271 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:63 [2020-07-07 11:20:41,360 INFO L440 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 1=[|#memory_$Pointer$.offset|]} [2020-07-07 11:20:41,365 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:41,366 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 35 [2020-07-07 11:20:41,367 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,379 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:41,389 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-07-07 11:20:41,390 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,395 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:41,396 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,396 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:11 [2020-07-07 11:20:41,431 INFO L384 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 [2020-07-07 11:20:41,432 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,433 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:41,433 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:41,433 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-07-07 11:20:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:41,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:20:41,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2020-07-07 11:20:41,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830902239] [2020-07-07 11:20:41,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 11:20:41,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:41,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 11:20:41,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2020-07-07 11:20:41,490 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 20 states. [2020-07-07 11:20:42,938 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2020-07-07 11:20:43,127 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2020-07-07 11:20:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:43,581 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2020-07-07 11:20:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 11:20:43,582 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2020-07-07 11:20:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:43,587 INFO L225 Difference]: With dead ends: 120 [2020-07-07 11:20:43,587 INFO L226 Difference]: Without dead ends: 108 [2020-07-07 11:20:43,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2020-07-07 11:20:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-07 11:20:43,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 82. [2020-07-07 11:20:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-07 11:20:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2020-07-07 11:20:43,598 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 32 [2020-07-07 11:20:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:43,598 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2020-07-07 11:20:43,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 11:20:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2020-07-07 11:20:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-07 11:20:43,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:43,600 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:43,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:20:43,814 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:43,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:43,815 INFO L82 PathProgramCache]: Analyzing trace with hash 145286649, now seen corresponding path program 2 times [2020-07-07 11:20:43,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:43,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733289886] [2020-07-07 11:20:43,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:44,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733289886] [2020-07-07 11:20:44,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348645151] [2020-07-07 11:20:44,377 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 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 [2020-07-07 11:20:44,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-07 11:20:44,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:20:44,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 53 conjunts are in the unsatisfiable core [2020-07-07 11:20:44,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:20:44,539 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-07 11:20:44,539 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-07 11:20:44,540 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:44,550 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:44,551 INFO L544 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. [2020-07-07 11:20:44,552 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-07-07 11:20:44,630 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:44,630 INFO L384 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 [2020-07-07 11:20:44,631 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-07 11:20:44,632 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:44,720 INFO L624 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2020-07-07 11:20:44,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:44,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:44,735 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-07 11:20:44,748 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:44,749 INFO L384 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 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-07 11:20:44,750 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:44,819 INFO L624 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2020-07-07 11:20:44,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:44,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:44,839 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:44,840 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-07 11:20:44,840 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:44,915 INFO L624 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2020-07-07 11:20:44,916 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:44,917 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2020-07-07 11:20:45,100 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:45,100 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-07-07 11:20:45,101 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-07 11:20:45,102 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-07 11:20:45,102 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:45,450 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-07-07 11:20:45,450 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:45,454 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_48|, |v_#memory_int_47|], 2=[|v_#memory_int_45|, |v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_38|], 11=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_36|]} [2020-07-07 11:20:45,506 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2020-07-07 11:20:45,506 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:45,783 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-07-07 11:20:45,783 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:45,814 INFO L384 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 27 treesize of output 15 [2020-07-07 11:20:45,815 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:46,046 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-07-07 11:20:46,046 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:46,055 INFO L544 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:46,235 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-07-07 11:20:46,235 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:46,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:46,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:46,259 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2020-07-07 11:20:46,260 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:46,586 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-07-07 11:20:46,587 INFO L624 ElimStorePlain]: treesize reduction 8, result has 98.3 percent of original size [2020-07-07 11:20:46,606 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:46,607 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 433 treesize of output 289 [2020-07-07 11:20:46,608 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:47,027 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-07-07 11:20:47,028 INFO L624 ElimStorePlain]: treesize reduction 24, result has 94.8 percent of original size [2020-07-07 11:20:47,052 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2020-07-07 11:20:47,053 INFO L544 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:47,202 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-07-07 11:20:47,203 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:47,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:47,496 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2020-07-07 11:20:47,497 INFO L350 Elim1Store]: treesize reduction 160, result has 55.9 percent of original size [2020-07-07 11:20:47,497 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 327 treesize of output 345 [2020-07-07 11:20:47,500 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-07 11:20:47,502 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 13 disjuncts [2020-07-07 11:20:47,503 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 12 disjuncts [2020-07-07 11:20:47,504 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 11 disjuncts [2020-07-07 11:20:47,504 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,505 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,506 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-07 11:20:47,507 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-07 11:20:47,508 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,510 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,511 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,512 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,514 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,515 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,516 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,518 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,519 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,522 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 11 disjuncts [2020-07-07 11:20:47,524 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,525 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,526 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,527 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,528 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,530 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,531 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-07 11:20:47,532 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-07 11:20:47,533 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,535 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,536 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,537 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,539 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,542 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-07 11:20:47,544 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 13 disjuncts [2020-07-07 11:20:47,545 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 12 disjuncts [2020-07-07 11:20:47,545 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 11 disjuncts [2020-07-07 11:20:47,546 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,547 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,548 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-07 11:20:47,549 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-07 11:20:47,550 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,551 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,553 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,553 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,555 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,556 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,557 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,558 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,560 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,562 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 11 disjuncts [2020-07-07 11:20:47,564 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,565 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,566 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,567 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,568 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,570 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,571 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-07 11:20:47,572 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-07 11:20:47,573 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,575 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,576 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-07 11:20:47,577 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:20:47,578 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:20:47,582 INFO L544 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:47,861 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2020-07-07 11:20:47,862 INFO L624 ElimStorePlain]: treesize reduction 198, result has 48.6 percent of original size [2020-07-07 11:20:47,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:47,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:47,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:47,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:47,920 INFO L350 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2020-07-07 11:20:47,921 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 89 [2020-07-07 11:20:47,922 INFO L544 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:48,012 INFO L624 ElimStorePlain]: treesize reduction 41, result has 71.5 percent of original size [2020-07-07 11:20:48,013 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:48,013 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:527, output treesize:110 [2020-07-07 11:20:48,387 INFO L440 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2020-07-07 11:20:48,402 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:48,403 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 71 [2020-07-07 11:20:48,404 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-07 11:20:48,405 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-07 11:20:48,406 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-07 11:20:48,408 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-07 11:20:48,408 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-07 11:20:48,409 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-07 11:20:48,410 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:48,462 INFO L624 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2020-07-07 11:20:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:48,467 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2020-07-07 11:20:48,468 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:48,476 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:48,477 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:48,477 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:18 [2020-07-07 11:20:48,529 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:48,529 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2020-07-07 11:20:48,530 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:48,539 INFO L624 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2020-07-07 11:20:48,540 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:48,540 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2020-07-07 11:20:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:48,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:20:48,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2020-07-07 11:20:48,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557483999] [2020-07-07 11:20:48,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-07 11:20:48,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:48,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-07 11:20:48,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2020-07-07 11:20:48,589 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 23 states. [2020-07-07 11:20:50,691 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2020-07-07 11:20:50,881 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2020-07-07 11:20:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:51,589 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2020-07-07 11:20:51,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 11:20:51,593 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2020-07-07 11:20:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:51,595 INFO L225 Difference]: With dead ends: 138 [2020-07-07 11:20:51,595 INFO L226 Difference]: Without dead ends: 126 [2020-07-07 11:20:51,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2020-07-07 11:20:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-07 11:20:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2020-07-07 11:20:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-07 11:20:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2020-07-07 11:20:51,614 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 35 [2020-07-07 11:20:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:51,614 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2020-07-07 11:20:51,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-07 11:20:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2020-07-07 11:20:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-07 11:20:51,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:51,616 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:51,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-07 11:20:51,831 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash -969799515, now seen corresponding path program 1 times [2020-07-07 11:20:51,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:51,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470772667] [2020-07-07 11:20:51,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:20:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:20:51,955 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-07 11:20:51,955 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 11:20:51,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 11:20:52,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:20:52 BoogieIcfgContainer [2020-07-07 11:20:52,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:20:52,033 INFO L168 Benchmark]: Toolchain (without parser) took 28846.09 ms. Allocated memory was 146.8 MB in the beginning and 370.1 MB in the end (delta: 223.3 MB). Free memory was 102.0 MB in the beginning and 214.0 MB in the end (delta: -112.0 MB). Peak memory consumption was 111.3 MB. Max. memory is 7.1 GB. [2020-07-07 11:20:52,034 INFO L168 Benchmark]: CDTParser took 1.52 ms. Allocated memory is still 146.8 MB. Free memory is still 121.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-07 11:20:52,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.43 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 170.5 MB in the end (delta: -69.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2020-07-07 11:20:52,034 INFO L168 Benchmark]: Boogie Preprocessor took 91.29 ms. Allocated memory is still 203.9 MB. Free memory was 170.5 MB in the beginning and 167.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-07 11:20:52,035 INFO L168 Benchmark]: RCFGBuilder took 733.14 ms. Allocated memory is still 203.9 MB. Free memory was 167.6 MB in the beginning and 115.8 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 7.1 GB. [2020-07-07 11:20:52,035 INFO L168 Benchmark]: TraceAbstraction took 27380.29 ms. Allocated memory was 203.9 MB in the beginning and 370.1 MB in the end (delta: 166.2 MB). Free memory was 114.8 MB in the beginning and 214.0 MB in the end (delta: -99.2 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. [2020-07-07 11:20:52,037 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.52 ms. Allocated memory is still 146.8 MB. Free memory is still 121.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 635.43 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 170.5 MB in the end (delta: -69.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.29 ms. Allocated memory is still 203.9 MB. Free memory was 170.5 MB in the beginning and 167.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 733.14 ms. Allocated memory is still 203.9 MB. Free memory was 167.6 MB in the beginning and 115.8 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27380.29 ms. Allocated memory was 203.9 MB in the beginning and 370.1 MB in the end (delta: 166.2 MB). Free memory was 114.8 MB in the beginning and 214.0 MB in the end (delta: -99.2 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, null={-2:0}] [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] [L1021] EXPR end->colour VAL [end={-4:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next VAL [end={-4:0}, end->next={-2:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] [L1031] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={-3:0}, end->colour=0, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] [L1038] EXPR end->colour VAL [end={-4:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-4:0}, null={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.2s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 395 SDtfs, 736 SDslu, 1834 SDs, 0 SdLazy, 2413 SolverSat, 191 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 145 SyntacticMatches, 7 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 159 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 370 ConstructedInterpolants, 44 QuantifiedInterpolants, 309558 SizeOfPredicates, 79 NumberOfNonLiveVariables, 727 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 7/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...