/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/sll-optional-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:23:05,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:23:05,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:23:05,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:23:05,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:23:05,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:23:05,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:23:05,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:23:05,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:23:05,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:23:05,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:23:05,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:23:05,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:23:05,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:23:05,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:23:05,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:23:05,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:23:05,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:23:05,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:23:05,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:23:05,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:23:05,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:23:05,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:23:05,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:23:05,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:23:05,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:23:05,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:23:05,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:23:05,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:23:05,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:23:05,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:23:06,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:23:06,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:23:06,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:23:06,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:23:06,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:23:06,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:23:06,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:23:06,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:23:06,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:23:06,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:23:06,007 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 19:23:06,045 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:23:06,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:23:06,053 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:23:06,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:23:06,054 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:23:06,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:23:06,054 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:23:06,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:23:06,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:23:06,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:23:06,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:23:06,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:23:06,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:23:06,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:23:06,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:23:06,056 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:23:06,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:23:06,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:23:06,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:23:06,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:23:06,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:23:06,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:23:06,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:23:06,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:23:06,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:23:06,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:23:06,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:23:06,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:23:06,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:23:06,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:23:06,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:23:06,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:23:06,380 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:23:06,380 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:23:06,381 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional-1.i [2019-11-06 19:23:06,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec1a73d8/049ad057132846f795aa351a75464b2d/FLAGe7802b4dc [2019-11-06 19:23:07,035 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:23:07,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-optional-1.i [2019-11-06 19:23:07,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec1a73d8/049ad057132846f795aa351a75464b2d/FLAGe7802b4dc [2019-11-06 19:23:07,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec1a73d8/049ad057132846f795aa351a75464b2d [2019-11-06 19:23:07,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:23:07,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:23:07,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:07,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:23:07,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:23:07,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:07" (1/1) ... [2019-11-06 19:23:07,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5fdc85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:07, skipping insertion in model container [2019-11-06 19:23:07,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:07" (1/1) ... [2019-11-06 19:23:07,383 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:23:07,438 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:23:07,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:07,887 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:23:07,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:07,988 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:23:07,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:07 WrapperNode [2019-11-06 19:23:07,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:07,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:23:07,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:23:07,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:23:08,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:07" (1/1) ... [2019-11-06 19:23:08,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:07" (1/1) ... [2019-11-06 19:23:08,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:07" (1/1) ... [2019-11-06 19:23:08,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:07" (1/1) ... [2019-11-06 19:23:08,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:07" (1/1) ... [2019-11-06 19:23:08,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:07" (1/1) ... [2019-11-06 19:23:08,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:07" (1/1) ... [2019-11-06 19:23:08,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:23:08,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:23:08,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:23:08,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:23:08,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:23:08,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:23:08,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:23:08,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:23:08,126 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 19:23:08,126 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 19:23:08,126 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 19:23:08,126 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 19:23:08,126 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 19:23:08,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 19:23:08,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 19:23:08,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 19:23:08,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 19:23:08,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 19:23:08,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 19:23:08,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 19:23:08,128 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 19:23:08,128 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 19:23:08,128 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 19:23:08,128 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 19:23:08,128 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 19:23:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 19:23:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 19:23:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 19:23:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 19:23:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 19:23:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 19:23:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 19:23:08,130 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 19:23:08,130 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 19:23:08,130 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 19:23:08,130 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 19:23:08,130 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 19:23:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 19:23:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 19:23:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 19:23:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 19:23:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 19:23:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 19:23:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 19:23:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 19:23:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 19:23:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 19:23:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 19:23:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 19:23:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 19:23:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 19:23:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 19:23:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 19:23:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 19:23:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 19:23:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 19:23:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 19:23:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 19:23:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 19:23:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 19:23:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 19:23:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 19:23:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 19:23:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 19:23:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 19:23:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 19:23:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 19:23:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 19:23:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 19:23:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 19:23:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 19:23:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 19:23:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 19:23:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 19:23:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 19:23:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 19:23:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 19:23:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 19:23:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 19:23:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 19:23:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 19:23:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 19:23:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 19:23:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 19:23:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 19:23:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 19:23:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 19:23:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 19:23:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 19:23:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 19:23:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 19:23:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 19:23:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 19:23:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 19:23:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 19:23:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 19:23:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 19:23:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 19:23:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 19:23:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 19:23:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 19:23:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 19:23:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 19:23:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 19:23:08,140 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 19:23:08,140 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 19:23:08,140 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 19:23:08,140 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 19:23:08,140 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 19:23:08,140 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 19:23:08,140 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 19:23:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:23:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:23:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:23:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 19:23:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 19:23:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 19:23:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 19:23:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 19:23:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 19:23:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:23:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:23:08,759 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:23:08,759 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-06 19:23:08,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:08 BoogieIcfgContainer [2019-11-06 19:23:08,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:23:08,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:23:08,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:23:08,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:23:08,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:23:07" (1/3) ... [2019-11-06 19:23:08,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de660b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:08, skipping insertion in model container [2019-11-06 19:23:08,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:07" (2/3) ... [2019-11-06 19:23:08,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de660b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:08, skipping insertion in model container [2019-11-06 19:23:08,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:08" (3/3) ... [2019-11-06 19:23:08,768 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2019-11-06 19:23:08,779 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:23:08,787 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 19:23:08,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 19:23:08,837 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:23:08,837 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:23:08,837 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:23:08,837 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:23:08,838 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:23:08,838 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:23:08,838 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:23:08,840 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:23:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-11-06 19:23:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 19:23:08,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:08,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:08,863 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:08,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:08,870 INFO L82 PathProgramCache]: Analyzing trace with hash 905993573, now seen corresponding path program 1 times [2019-11-06 19:23:08,878 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:08,878 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201960398] [2019-11-06 19:23:08,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:09,098 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201960398] [2019-11-06 19:23:09,099 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:09,099 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 19:23:09,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338063305] [2019-11-06 19:23:09,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 19:23:09,106 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:09,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 19:23:09,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 19:23:09,124 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-11-06 19:23:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:09,292 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2019-11-06 19:23:09,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 19:23:09,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 19:23:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:09,303 INFO L225 Difference]: With dead ends: 57 [2019-11-06 19:23:09,303 INFO L226 Difference]: Without dead ends: 26 [2019-11-06 19:23:09,307 INFO L630 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 [2019-11-06 19:23:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-06 19:23:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-06 19:23:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-06 19:23:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-11-06 19:23:09,342 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2019-11-06 19:23:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:09,343 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-06 19:23:09,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 19:23:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-11-06 19:23:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 19:23:09,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:09,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:09,344 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:09,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash 550815853, now seen corresponding path program 1 times [2019-11-06 19:23:09,345 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:09,345 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270776553] [2019-11-06 19:23:09,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:09,440 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270776553] [2019-11-06 19:23:09,440 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:09,440 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:23:09,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635767642] [2019-11-06 19:23:09,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:23:09,442 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:09,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:23:09,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:09,443 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 4 states. [2019-11-06 19:23:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:09,551 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-11-06 19:23:09,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:23:09,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-06 19:23:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:09,553 INFO L225 Difference]: With dead ends: 29 [2019-11-06 19:23:09,553 INFO L226 Difference]: Without dead ends: 27 [2019-11-06 19:23:09,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:09,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-06 19:23:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-06 19:23:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 19:23:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-06 19:23:09,561 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2019-11-06 19:23:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:09,561 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-06 19:23:09,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:23:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-11-06 19:23:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 19:23:09,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:09,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:09,563 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:09,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:09,564 INFO L82 PathProgramCache]: Analyzing trace with hash 550817775, now seen corresponding path program 1 times [2019-11-06 19:23:09,564 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:09,564 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81785628] [2019-11-06 19:23:09,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:09,727 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81785628] [2019-11-06 19:23:09,728 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:09,728 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 19:23:09,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835522921] [2019-11-06 19:23:09,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:23:09,730 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:09,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:23:09,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:23:09,731 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2019-11-06 19:23:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:09,993 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2019-11-06 19:23:09,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 19:23:09,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-06 19:23:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:09,995 INFO L225 Difference]: With dead ends: 44 [2019-11-06 19:23:09,995 INFO L226 Difference]: Without dead ends: 42 [2019-11-06 19:23:09,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:23:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-06 19:23:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2019-11-06 19:23:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 19:23:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-11-06 19:23:10,009 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2019-11-06 19:23:10,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:10,011 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-11-06 19:23:10,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:23:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-11-06 19:23:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 19:23:10,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:10,013 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:10,013 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash 548970733, now seen corresponding path program 1 times [2019-11-06 19:23:10,014 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:10,014 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967883865] [2019-11-06 19:23:10,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:10,355 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967883865] [2019-11-06 19:23:10,355 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:10,355 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 19:23:10,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894140859] [2019-11-06 19:23:10,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 19:23:10,360 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:10,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 19:23:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:23:10,360 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 8 states. [2019-11-06 19:23:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:10,846 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2019-11-06 19:23:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 19:23:10,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-11-06 19:23:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:10,848 INFO L225 Difference]: With dead ends: 90 [2019-11-06 19:23:10,849 INFO L226 Difference]: Without dead ends: 73 [2019-11-06 19:23:10,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-06 19:23:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-06 19:23:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-11-06 19:23:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 19:23:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2019-11-06 19:23:10,865 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 20 [2019-11-06 19:23:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:10,867 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2019-11-06 19:23:10,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 19:23:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2019-11-06 19:23:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 19:23:10,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:10,870 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:10,870 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:10,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1969142159, now seen corresponding path program 1 times [2019-11-06 19:23:10,871 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:10,871 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661042844] [2019-11-06 19:23:10,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:10,995 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661042844] [2019-11-06 19:23:10,995 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:10,995 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 19:23:10,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395670604] [2019-11-06 19:23:10,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:23:10,996 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:10,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:23:10,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:23:11,000 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 7 states. [2019-11-06 19:23:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:11,241 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-11-06 19:23:11,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:23:11,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-06 19:23:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:11,244 INFO L225 Difference]: With dead ends: 85 [2019-11-06 19:23:11,244 INFO L226 Difference]: Without dead ends: 64 [2019-11-06 19:23:11,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:23:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-06 19:23:11,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2019-11-06 19:23:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-06 19:23:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2019-11-06 19:23:11,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 20 [2019-11-06 19:23:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:11,261 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-11-06 19:23:11,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:23:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2019-11-06 19:23:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 19:23:11,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:11,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:11,265 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:11,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:11,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2020944649, now seen corresponding path program 1 times [2019-11-06 19:23:11,266 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:11,266 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057487805] [2019-11-06 19:23:11,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:11,361 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057487805] [2019-11-06 19:23:11,361 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:11,362 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:23:11,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602100471] [2019-11-06 19:23:11,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:23:11,362 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:11,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:23:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:11,363 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 6 states. [2019-11-06 19:23:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:11,614 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2019-11-06 19:23:11,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 19:23:11,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-06 19:23:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:11,615 INFO L225 Difference]: With dead ends: 84 [2019-11-06 19:23:11,615 INFO L226 Difference]: Without dead ends: 82 [2019-11-06 19:23:11,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:23:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-06 19:23:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2019-11-06 19:23:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-06 19:23:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2019-11-06 19:23:11,625 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 21 [2019-11-06 19:23:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:11,625 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2019-11-06 19:23:11,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:23:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2019-11-06 19:23:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 19:23:11,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:11,627 INFO L410 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] [2019-11-06 19:23:11,627 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:11,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:11,627 INFO L82 PathProgramCache]: Analyzing trace with hash 61652601, now seen corresponding path program 1 times [2019-11-06 19:23:11,627 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:11,628 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071599443] [2019-11-06 19:23:11,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:12,083 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071599443] [2019-11-06 19:23:12,083 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119186546] [2019-11-06 19:23:12,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:12,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-06 19:23:12,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:12,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:12,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:12,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:12,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:12,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:23:12,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:12,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 19:23:12,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:12,421 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.1 percent of original size [2019-11-06 19:23:12,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2019-11-06 19:23:12,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:12,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:12,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2019-11-06 19:23:12,458 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:12,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:12,474 INFO L496 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. [2019-11-06 19:23:12,475 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2019-11-06 19:23:12,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:12,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-11-06 19:23:12,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:12,751 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-06 19:23:12,752 INFO L567 ElimStorePlain]: treesize reduction 46, result has 75.4 percent of original size [2019-11-06 19:23:12,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:12,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:12,816 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:12,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 111 [2019-11-06 19:23:12,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:12,938 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-06 19:23:12,938 INFO L567 ElimStorePlain]: treesize reduction 96, result has 57.1 percent of original size [2019-11-06 19:23:12,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:12,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2019-11-06 19:23:12,949 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:12,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:12,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:12,987 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:133, output treesize:108 [2019-11-06 19:23:13,110 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2019-11-06 19:23:13,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,220 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-06 19:23:13,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,224 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 12=[|v_#memory_$Pointer$.offset_43|], 20=[|v_#memory_$Pointer$.base_43|]} [2019-11-06 19:23:13,230 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:13,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,327 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:13,429 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-06 19:23:13,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:13,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:13,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:13,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2019-11-06 19:23:13,449 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:13,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:13,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:13,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:14,063 WARN L191 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 114 [2019-11-06 19:23:14,063 INFO L341 Elim1Store]: treesize reduction 170, result has 67.1 percent of original size [2019-11-06 19:23:14,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 182 treesize of output 418 [2019-11-06 19:23:14,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:23:14,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:23:14,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:23:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:23:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:23:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:23:14,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:23:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:14,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:23:14,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:23:14,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:23:14,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:23:14,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:14,226 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:15,897 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 288 DAG size of output: 67 [2019-11-06 19:23:15,898 INFO L567 ElimStorePlain]: treesize reduction 240062, result has 0.1 percent of original size [2019-11-06 19:23:15,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:15,901 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:285, output treesize:215 [2019-11-06 19:23:16,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:16,328 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:16,328 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2019-11-06 19:23:16,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064298317] [2019-11-06 19:23:16,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 19:23:16,330 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 19:23:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-11-06 19:23:16,330 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand 20 states. [2019-11-06 19:23:21,080 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-11-06 19:23:29,242 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2019-11-06 19:23:29,537 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 71 [2019-11-06 19:23:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:32,163 INFO L93 Difference]: Finished difference Result 232 states and 302 transitions. [2019-11-06 19:23:32,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-11-06 19:23:32,163 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-11-06 19:23:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:32,166 INFO L225 Difference]: With dead ends: 232 [2019-11-06 19:23:32,166 INFO L226 Difference]: Without dead ends: 215 [2019-11-06 19:23:32,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1209, Invalid=4168, Unknown=25, NotChecked=0, Total=5402 [2019-11-06 19:23:32,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-06 19:23:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 65. [2019-11-06 19:23:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-06 19:23:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2019-11-06 19:23:32,183 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 23 [2019-11-06 19:23:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:32,183 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2019-11-06 19:23:32,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 19:23:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2019-11-06 19:23:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 19:23:32,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:32,185 INFO L410 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] [2019-11-06 19:23:32,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:32,391 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1838507005, now seen corresponding path program 1 times [2019-11-06 19:23:32,392 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:32,393 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287984132] [2019-11-06 19:23:32,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:32,625 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287984132] [2019-11-06 19:23:32,625 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589839588] [2019-11-06 19:23:32,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:32,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 19:23:32,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:32,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:32,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:23:32,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 19:23:32,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,862 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-11-06 19:23:32,863 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_int_33|]} [2019-11-06 19:23:32,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:32,873 INFO L375 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 0 case distinctions, treesize of input 24 treesize of output 9 [2019-11-06 19:23:32,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-06 19:23:32,893 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:32,905 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:59, output treesize:27 [2019-11-06 19:23:32,986 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:32,987 INFO L375 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 [2019-11-06 19:23:32,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:33,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:33,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-06 19:23:33,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:33,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-06 19:23:33,040 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:33,054 INFO L496 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. [2019-11-06 19:23:33,054 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:17 [2019-11-06 19:23:33,082 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_35|], 4=[|v_#memory_int_38|]} [2019-11-06 19:23:33,090 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:33,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:33,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:33,156 INFO L341 Elim1Store]: treesize reduction 82, result has 32.2 percent of original size [2019-11-06 19:23:33,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2019-11-06 19:23:33,157 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:33,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:33,188 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:59, output treesize:13 [2019-11-06 19:23:33,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:33,228 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:33,228 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-06 19:23:33,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977264878] [2019-11-06 19:23:33,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 19:23:33,229 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:33,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 19:23:33,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-06 19:23:33,229 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand 15 states. [2019-11-06 19:23:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:33,758 INFO L93 Difference]: Finished difference Result 112 states and 145 transitions. [2019-11-06 19:23:33,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 19:23:33,759 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-11-06 19:23:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:33,760 INFO L225 Difference]: With dead ends: 112 [2019-11-06 19:23:33,760 INFO L226 Difference]: Without dead ends: 93 [2019-11-06 19:23:33,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-11-06 19:23:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-06 19:23:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2019-11-06 19:23:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-06 19:23:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2019-11-06 19:23:33,770 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 23 [2019-11-06 19:23:33,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:33,771 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2019-11-06 19:23:33,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 19:23:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2019-11-06 19:23:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:23:33,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:33,772 INFO L410 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] [2019-11-06 19:23:33,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:33,976 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1799525935, now seen corresponding path program 1 times [2019-11-06 19:23:33,977 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:33,978 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659108268] [2019-11-06 19:23:33,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:34,198 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659108268] [2019-11-06 19:23:34,198 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363949148] [2019-11-06 19:23:34,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:34,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-06 19:23:34,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:34,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:34,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:23:34,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:34,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:34,363 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-06 19:23:34,430 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 19:23:34,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,522 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.5 percent of original size [2019-11-06 19:23:34,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:34,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-11-06 19:23:34,533 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:34,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-11-06 19:23:34,564 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,587 INFO L496 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. [2019-11-06 19:23:34,587 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:57 [2019-11-06 19:23:34,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,669 INFO L375 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 [2019-11-06 19:23:34,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,782 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-06 19:23:34,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,786 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_45|], 6=[|v_#memory_$Pointer$.offset_47|], 12=[|v_#memory_$Pointer$.base_47|]} [2019-11-06 19:23:34,790 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:34,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,861 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:34,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:34,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:34,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:34,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:34,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2019-11-06 19:23:34,957 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:34,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:35,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:35,367 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-11-06 19:23:35,367 INFO L341 Elim1Store]: treesize reduction 111, result has 71.2 percent of original size [2019-11-06 19:23:35,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 131 treesize of output 323 [2019-11-06 19:23:35,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:35,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:35,376 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:35,508 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 51 [2019-11-06 19:23:35,509 INFO L567 ElimStorePlain]: treesize reduction 273, result has 32.8 percent of original size [2019-11-06 19:23:35,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:35,511 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:230, output treesize:151 [2019-11-06 19:23:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:35,635 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:35,635 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-11-06 19:23:35,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390517951] [2019-11-06 19:23:35,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 19:23:35,636 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 19:23:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=167, Unknown=1, NotChecked=0, Total=210 [2019-11-06 19:23:35,637 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 15 states. [2019-11-06 19:23:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:51,903 INFO L93 Difference]: Finished difference Result 201 states and 265 transitions. [2019-11-06 19:23:51,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-06 19:23:51,904 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-11-06 19:23:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:51,906 INFO L225 Difference]: With dead ends: 201 [2019-11-06 19:23:51,906 INFO L226 Difference]: Without dead ends: 182 [2019-11-06 19:23:51,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=316, Invalid=1161, Unknown=5, NotChecked=0, Total=1482 [2019-11-06 19:23:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-06 19:23:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 66. [2019-11-06 19:23:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-06 19:23:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2019-11-06 19:23:51,934 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 24 [2019-11-06 19:23:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:51,937 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2019-11-06 19:23:51,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 19:23:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2019-11-06 19:23:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:23:51,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:51,938 INFO L410 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] [2019-11-06 19:23:52,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:52,145 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:52,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:52,145 INFO L82 PathProgramCache]: Analyzing trace with hash -718586957, now seen corresponding path program 1 times [2019-11-06 19:23:52,146 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:52,146 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728648778] [2019-11-06 19:23:52,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat