/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:31:52,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:31:52,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:31:52,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:31:52,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:31:52,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:31:52,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:31:52,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:31:52,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:31:52,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:31:52,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:31:52,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:31:52,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:31:52,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:31:52,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:31:52,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:31:52,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:31:53,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:31:53,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:31:53,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:31:53,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:31:53,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:31:53,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:31:53,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:31:53,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:31:53,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:31:53,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:31:53,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:31:53,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:31:53,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:31:53,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:31:53,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:31:53,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:31:53,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:31:53,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:31:53,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:31:53,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:31:53,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:31:53,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:31:53,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:31:53,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:31:53,035 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-07 00:31:53,054 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:31:53,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:31:53,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:31:53,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:31:53,057 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:31:53,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:31:53,058 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:31:53,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:31:53,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:31:53,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:31:53,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:31:53,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:31:53,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:31:53,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:31:53,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:31:53,061 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:31:53,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:31:53,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:31:53,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:31:53,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:31:53,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:31:53,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:31:53,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:31:53,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:31:53,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:31:53,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:31:53,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:31:53,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:31:53,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:31:53,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:31:53,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:31:53,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:31:53,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:31:53,379 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:31:53,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2019-11-07 00:31:53,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29960a21/0f8c30d1e81c42f4bc08a01db419d336/FLAG4fae39dc9 [2019-11-07 00:31:54,000 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:31:54,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2019-11-07 00:31:54,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29960a21/0f8c30d1e81c42f4bc08a01db419d336/FLAG4fae39dc9 [2019-11-07 00:31:54,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29960a21/0f8c30d1e81c42f4bc08a01db419d336 [2019-11-07 00:31:54,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:31:54,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:31:54,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:31:54,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:31:54,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:31:54,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:31:54" (1/1) ... [2019-11-07 00:31:54,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6395d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:31:54, skipping insertion in model container [2019-11-07 00:31:54,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:31:54" (1/1) ... [2019-11-07 00:31:54,354 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:31:54,454 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:31:54,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:31:54,886 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:31:54,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:31:54,989 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:31:54,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:31:54 WrapperNode [2019-11-07 00:31:54,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:31:54,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:31:54,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:31:54,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:31:55,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:31:54" (1/1) ... [2019-11-07 00:31:55,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:31:54" (1/1) ... [2019-11-07 00:31:55,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:31:54" (1/1) ... [2019-11-07 00:31:55,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:31:54" (1/1) ... [2019-11-07 00:31:55,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:31:54" (1/1) ... [2019-11-07 00:31:55,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:31:54" (1/1) ... [2019-11-07 00:31:55,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:31:54" (1/1) ... [2019-11-07 00:31:55,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:31:55,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:31:55,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:31:55,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:31:55,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:31:54" (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-07 00:31:55,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:31:55,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:31:55,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-07 00:31:55,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-07 00:31:55,150 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-07 00:31:55,151 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-07 00:31:55,151 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-07 00:31:55,151 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-07 00:31:55,151 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_insert [2019-11-07 00:31:55,151 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:31:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:31:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-07 00:31:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-07 00:31:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-07 00:31:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-07 00:31:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-07 00:31:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-07 00:31:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-07 00:31:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-07 00:31:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-07 00:31:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-07 00:31:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-07 00:31:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-07 00:31:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-07 00:31:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-07 00:31:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-07 00:31:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-07 00:31:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-07 00:31:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-07 00:31:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-07 00:31:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-07 00:31:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-07 00:31:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-07 00:31:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-07 00:31:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-07 00:31:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-07 00:31:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-07 00:31:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-07 00:31:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-07 00:31:55,156 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-07 00:31:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-07 00:31:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-07 00:31:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-07 00:31:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-07 00:31:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-07 00:31:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-07 00:31:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-07 00:31:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-07 00:31:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-07 00:31:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-07 00:31:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-07 00:31:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-07 00:31:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-07 00:31:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-07 00:31:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-07 00:31:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-07 00:31:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-07 00:31:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-07 00:31:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-07 00:31:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-07 00:31:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-07 00:31:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-07 00:31:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-07 00:31:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 00:31:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-07 00:31:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-07 00:31:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 00:31:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-07 00:31:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-07 00:31:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-07 00:31:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-07 00:31:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-07 00:31:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-07 00:31:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-07 00:31:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-07 00:31:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-07 00:31:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 00:31:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-07 00:31:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-07 00:31:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-07 00:31:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-07 00:31:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-07 00:31:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-07 00:31:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-07 00:31:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-07 00:31:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-07 00:31:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-07 00:31:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-07 00:31:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-07 00:31:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-07 00:31:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-07 00:31:55,165 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-07 00:31:55,165 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-07 00:31:55,165 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-07 00:31:55,165 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-07 00:31:55,165 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-07 00:31:55,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-07 00:31:55,165 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-07 00:31:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-07 00:31:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-07 00:31:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-07 00:31:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-07 00:31:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-07 00:31:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-07 00:31:55,166 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-07 00:31:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-07 00:31:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-07 00:31:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-07 00:31:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-07 00:31:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-07 00:31:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-07 00:31:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-07 00:31:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-07 00:31:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-07 00:31:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-07 00:31:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-07 00:31:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-07 00:31:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-07 00:31:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-07 00:31:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 00:31:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 00:31:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-07 00:31:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-07 00:31:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 00:31:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 00:31:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_insert [2019-11-07 00:31:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:31:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 00:31:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-07 00:31:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 00:31:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:31:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:31:55,521 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-07 00:31:55,774 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:31:55,774 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-07 00:31:55,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:31:55 BoogieIcfgContainer [2019-11-07 00:31:55,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:31:55,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:31:55,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:31:55,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:31:55,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:31:54" (1/3) ... [2019-11-07 00:31:55,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c93534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:31:55, skipping insertion in model container [2019-11-07 00:31:55,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:31:54" (2/3) ... [2019-11-07 00:31:55,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c93534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:31:55, skipping insertion in model container [2019-11-07 00:31:55,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:31:55" (3/3) ... [2019-11-07 00:31:55,785 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2019-11-07 00:31:55,796 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:31:55,805 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:31:55,818 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:31:55,844 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:31:55,845 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:31:55,845 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:31:55,845 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:31:55,846 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:31:55,846 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:31:55,846 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:31:55,846 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:31:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2019-11-07 00:31:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 00:31:55,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:31:55,877 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:31:55,879 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:31:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:31:55,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1328667979, now seen corresponding path program 1 times [2019-11-07 00:31:55,896 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:31:55,897 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405003027] [2019-11-07 00:31:55,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:31:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:31:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 00:31:56,284 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405003027] [2019-11-07 00:31:56,285 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:31:56,285 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 00:31:56,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035534873] [2019-11-07 00:31:56,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:31:56,296 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:31:56,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 00:31:56,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:31:56,315 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2019-11-07 00:31:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:31:56,359 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2019-11-07 00:31:56,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:31:56,360 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2019-11-07 00:31:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:31:56,373 INFO L225 Difference]: With dead ends: 97 [2019-11-07 00:31:56,373 INFO L226 Difference]: Without dead ends: 40 [2019-11-07 00:31:56,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:31:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-07 00:31:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-07 00:31:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-07 00:31:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2019-11-07 00:31:56,440 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 37 [2019-11-07 00:31:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:31:56,442 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-11-07 00:31:56,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:31:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2019-11-07 00:31:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 00:31:56,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:31:56,448 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:31:56,448 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:31:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:31:56,448 INFO L82 PathProgramCache]: Analyzing trace with hash 290011354, now seen corresponding path program 1 times [2019-11-07 00:31:56,449 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:31:56,449 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532943721] [2019-11-07 00:31:56,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:31:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:31:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 00:31:56,634 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532943721] [2019-11-07 00:31:56,640 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:31:56,640 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:31:56,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76254801] [2019-11-07 00:31:56,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:31:56,643 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:31:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:31:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:31:56,644 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 3 states. [2019-11-07 00:31:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:31:56,667 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-11-07 00:31:56,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:31:56,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-07 00:31:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:31:56,671 INFO L225 Difference]: With dead ends: 54 [2019-11-07 00:31:56,671 INFO L226 Difference]: Without dead ends: 44 [2019-11-07 00:31:56,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:31:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-07 00:31:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-07 00:31:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-07 00:31:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-11-07 00:31:56,687 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 37 [2019-11-07 00:31:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:31:56,689 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-11-07 00:31:56,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:31:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-11-07 00:31:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 00:31:56,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:31:56,691 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:31:56,692 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:31:56,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:31:56,693 INFO L82 PathProgramCache]: Analyzing trace with hash 329318240, now seen corresponding path program 1 times [2019-11-07 00:31:56,693 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:31:56,693 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311515753] [2019-11-07 00:31:56,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:31:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:31:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 00:31:56,827 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311515753] [2019-11-07 00:31:56,828 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:31:56,828 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:31:56,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887861813] [2019-11-07 00:31:56,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:31:56,829 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:31:56,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:31:56,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:31:56,830 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 5 states. [2019-11-07 00:31:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:31:56,899 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2019-11-07 00:31:56,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:31:56,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-07 00:31:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:31:56,903 INFO L225 Difference]: With dead ends: 74 [2019-11-07 00:31:56,903 INFO L226 Difference]: Without dead ends: 45 [2019-11-07 00:31:56,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:31:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-07 00:31:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-11-07 00:31:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-07 00:31:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-07 00:31:56,917 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 38 [2019-11-07 00:31:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:31:56,917 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-07 00:31:56,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:31:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-11-07 00:31:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 00:31:56,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:31:56,919 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:31:56,919 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:31:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:31:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash 297259480, now seen corresponding path program 1 times [2019-11-07 00:31:56,920 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:31:56,920 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938343683] [2019-11-07 00:31:56,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:31:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:31:58,623 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-07 00:31:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:31:59,055 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938343683] [2019-11-07 00:31:59,055 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952248368] [2019-11-07 00:31:59,055 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-07 00:31:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:31:59,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 125 conjunts are in the unsatisfiable core [2019-11-07 00:31:59,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:31:59,397 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-07 00:31:59,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:31:59,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:31:59,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:31:59,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-07 00:31:59,489 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-07 00:31:59,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:31:59,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:31:59,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:31:59,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-07 00:31:59,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:31:59,597 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-07 00:31:59,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:31:59,630 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.6 percent of original size [2019-11-07 00:31:59,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:31:59,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2019-11-07 00:31:59,714 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 30 treesize of output 14 [2019-11-07 00:31:59,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:31:59,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:31:59,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:31:59,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2019-11-07 00:31:59,827 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 30 treesize of output 14 [2019-11-07 00:31:59,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:31:59,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:31:59,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 00:31:59,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2019-11-07 00:32:00,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-07 00:32:00,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:32:00,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:00,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-07 00:32:00,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 00:32:00,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:00,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-11-07 00:32:00,252 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-07 00:32:00,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:00,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2019-11-07 00:32:00,279 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-07 00:32:00,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:00,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:32:00,295 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:74, output treesize:13 [2019-11-07 00:32:00,394 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-07 00:32:00,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:00,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-07 00:32:00,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:71 [2019-11-07 00:32:08,557 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-07 00:32:12,709 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 48 [2019-11-07 00:32:12,960 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_36|], 10=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]} [2019-11-07 00:32:12,967 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-07 00:32:13,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:13,070 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-07 00:32:13,172 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-07 00:32:13,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:13,176 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-07 00:32:13,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:13,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-07 00:32:13,259 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:233, output treesize:558 [2019-11-07 00:32:38,017 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-07 00:32:38,090 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:38,091 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-07 00:32:38,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:32:38,327 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-07 00:32:38,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:38,332 INFO L392 ElimStorePlain]: Different costs {8=[|v_#memory_int_BEFORE_CALL_4|], 20=[|v_#memory_$Pointer$.offset_BEFORE_CALL_4|, |v_old(#memory_$Pointer$.base)_AFTER_CALL_5|]} [2019-11-07 00:32:38,354 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 00:32:38,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 00:32:38,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 00:32:38,406 INFO L341 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2019-11-07 00:32:38,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 85 [2019-11-07 00:32:38,408 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 00:32:38,588 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-07 00:32:38,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:38,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 00:32:38,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 00:32:38,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 00:32:38,867 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-11-07 00:32:38,868 INFO L341 Elim1Store]: treesize reduction 78, result has 77.5 percent of original size [2019-11-07 00:32:38,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 346 treesize of output 453 [2019-11-07 00:32:38,871 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-07 00:32:39,181 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2019-11-07 00:32:39,182 INFO L567 ElimStorePlain]: treesize reduction 211, result has 60.6 percent of original size [2019-11-07 00:32:39,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 00:32:39,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 00:32:39,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 00:32:39,362 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-07 00:32:39,363 INFO L341 Elim1Store]: treesize reduction 44, result has 74.0 percent of original size [2019-11-07 00:32:39,364 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 165 treesize of output 176 [2019-11-07 00:32:39,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 00:32:39,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 00:32:39,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,373 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-07 00:32:39,768 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-11-07 00:32:39,769 INFO L567 ElimStorePlain]: treesize reduction 520, result has 39.7 percent of original size [2019-11-07 00:32:39,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 00:32:39,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 00:32:39,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 00:32:39,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 00:32:39,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 00:32:39,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:39,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 00:32:39,803 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 15 variables, input treesize:624, output treesize:1038 [2019-11-07 00:32:40,064 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 1=[|#memory_$Pointer$.base|]} [2019-11-07 00:32:40,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-07 00:32:40,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:32:40,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:40,115 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:40,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 43 [2019-11-07 00:32:40,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:32:40,118 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 00:32:40,137 INFO L567 ElimStorePlain]: treesize reduction 4, result has 86.7 percent of original size [2019-11-07 00:32:40,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:32:40,138 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:21 [2019-11-07 00:32:40,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-07 00:32:40,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:32:40,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:40,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:32:40,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-07 00:32:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:40,240 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:32:40,932 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-07 00:32:41,102 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-07 00:32:41,441 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-07 00:32:41,723 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-07 00:32:41,739 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_61|, |v_#memory_int_59|], 4=[|v_#memory_int_60|], 8=[|v_#memory_$Pointer$.offset_54|, |v_#memory_$Pointer$.base_54|]} [2019-11-07 00:32:41,745 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-07 00:32:41,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:41,848 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-07 00:32:41,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:41,918 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-07 00:32:41,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:41,969 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 00:32:42,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:42,052 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 00:32:42,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:32:42,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 5 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-11-07 00:32:42,082 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 11 variables, input treesize:258, output treesize:562