/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_FUNCTIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 13:50:25,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 13:50:25,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 13:50:25,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 13:50:25,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 13:50:25,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 13:50:25,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 13:50:25,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 13:50:25,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 13:50:25,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 13:50:25,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 13:50:25,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 13:50:25,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 13:50:25,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 13:50:25,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 13:50:25,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 13:50:25,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 13:50:25,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 13:50:25,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 13:50:25,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 13:50:25,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 13:50:25,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 13:50:25,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 13:50:25,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 13:50:25,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 13:50:25,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 13:50:25,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 13:50:25,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 13:50:25,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 13:50:26,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 13:50:26,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 13:50:26,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 13:50:26,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 13:50:26,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 13:50:26,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 13:50:26,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 13:50:26,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 13:50:26,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 13:50:26,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 13:50:26,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 13:50:26,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 13:50:26,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 [2020-07-20 13:50:26,031 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 13:50:26,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 13:50:26,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 13:50:26,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 13:50:26,034 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 13:50:26,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 13:50:26,034 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 13:50:26,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 13:50:26,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 13:50:26,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 13:50:26,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 13:50:26,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 13:50:26,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 13:50:26,036 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 13:50:26,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 13:50:26,036 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 13:50:26,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 13:50:26,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 13:50:26,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 13:50:26,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 13:50:26,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 13:50:26,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 13:50:26,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 13:50:26,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 13:50:26,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 13:50:26,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 13:50:26,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:50:26,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 13:50:26,040 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 13:50:26,041 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_FUNCTIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-20 13:50:26,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 13:50:26,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 13:50:26,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 13:50:26,355 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 13:50:26,355 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 13:50:26,357 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i [2020-07-20 13:50:26,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d61ffa70/7d1fdc79c1a84c309e981788794e71e8/FLAGebace31d6 [2020-07-20 13:50:27,032 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 13:50:27,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i [2020-07-20 13:50:27,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d61ffa70/7d1fdc79c1a84c309e981788794e71e8/FLAGebace31d6 [2020-07-20 13:50:27,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d61ffa70/7d1fdc79c1a84c309e981788794e71e8 [2020-07-20 13:50:27,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 13:50:27,289 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 13:50:27,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 13:50:27,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 13:50:27,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 13:50:27,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:50:27" (1/1) ... [2020-07-20 13:50:27,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f19b831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:50:27, skipping insertion in model container [2020-07-20 13:50:27,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:50:27" (1/1) ... [2020-07-20 13:50:27,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 13:50:27,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 13:50:27,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 13:50:27,855 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 13:50:27,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 13:50:27,980 INFO L208 MainTranslator]: Completed translation [2020-07-20 13:50:27,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:50:27 WrapperNode [2020-07-20 13:50:27,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 13:50:27,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 13:50:27,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 13:50:27,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 13:50:27,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:50:27" (1/1) ... [2020-07-20 13:50:27,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:50:27" (1/1) ... [2020-07-20 13:50:28,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:50:27" (1/1) ... [2020-07-20 13:50:28,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:50:27" (1/1) ... [2020-07-20 13:50:28,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:50:27" (1/1) ... [2020-07-20 13:50:28,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:50:27" (1/1) ... [2020-07-20 13:50:28,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:50:27" (1/1) ... [2020-07-20 13:50:28,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 13:50:28,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 13:50:28,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 13:50:28,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 13:50:28,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:50:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 13:50:28,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 13:50:28,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 13:50:28,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-07-20 13:50:28,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-20 13:50:28,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-20 13:50:28,146 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2020-07-20 13:50:28,146 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_slave [2020-07-20 13:50:28,146 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_master [2020-07-20 13:50:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_slave [2020-07-20 13:50:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2020-07-20 13:50:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2020-07-20 13:50:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_slave [2020-07-20 13:50:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_nested_lists [2020-07-20 13:50:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_reinit_nested_lists [2020-07-20 13:50:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_master [2020-07-20 13:50:28,149 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2020-07-20 13:50:28,149 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_master [2020-07-20 13:50:28,149 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2020-07-20 13:50:28,150 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_full [2020-07-20 13:50:28,150 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_dangling [2020-07-20 13:50:28,150 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_init [2020-07-20 13:50:28,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 13:50:28,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 13:50:28,150 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-20 13:50:28,151 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-20 13:50:28,152 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-20 13:50:28,152 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-20 13:50:28,152 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-20 13:50:28,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-20 13:50:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-20 13:50:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-20 13:50:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-20 13:50:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-20 13:50:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-20 13:50:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-20 13:50:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-20 13:50:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-20 13:50:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-20 13:50:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-20 13:50:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-20 13:50:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-20 13:50:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-20 13:50:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-20 13:50:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-20 13:50:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-20 13:50:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-20 13:50:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-20 13:50:28,157 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-20 13:50:28,157 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-20 13:50:28,157 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-20 13:50:28,157 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-20 13:50:28,157 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-20 13:50:28,157 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-20 13:50:28,157 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-20 13:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-20 13:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-20 13:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-20 13:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-20 13:50:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-20 13:50:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-20 13:50:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-20 13:50:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-20 13:50:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-20 13:50:28,160 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-20 13:50:28,160 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-20 13:50:28,160 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-20 13:50:28,160 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-20 13:50:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-20 13:50:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-20 13:50:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-20 13:50:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-20 13:50:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-20 13:50:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-20 13:50:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-20 13:50:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-20 13:50:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 13:50:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-20 13:50:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-20 13:50:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-20 13:50:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-20 13:50:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-20 13:50:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-20 13:50:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-20 13:50:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-20 13:50:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-20 13:50:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-20 13:50:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-20 13:50:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-20 13:50:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-20 13:50:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-20 13:50:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-20 13:50:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-20 13:50:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-20 13:50:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-20 13:50:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-20 13:50:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-20 13:50:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-20 13:50:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-20 13:50:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-20 13:50:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-20 13:50:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-20 13:50:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-20 13:50:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-20 13:50:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-20 13:50:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-20 13:50:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-20 13:50:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-20 13:50:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-20 13:50:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-20 13:50:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-20 13:50:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-20 13:50:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-20 13:50:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-20 13:50:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-20 13:50:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-20 13:50:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-20 13:50:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-20 13:50:28,171 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-20 13:50:28,171 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-20 13:50:28,171 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-20 13:50:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-20 13:50:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-20 13:50:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-20 13:50:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-20 13:50:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-20 13:50:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-20 13:50:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-20 13:50:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-20 13:50:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 13:50:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2020-07-20 13:50:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_slave [2020-07-20 13:50:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 13:50:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-20 13:50:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_master [2020-07-20 13:50:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_slave [2020-07-20 13:50:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-20 13:50:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2020-07-20 13:50:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-20 13:50:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-07-20 13:50:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-20 13:50:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 13:50:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2020-07-20 13:50:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_slave [2020-07-20 13:50:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_nested_lists [2020-07-20 13:50:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure dll_reinit_nested_lists [2020-07-20 13:50:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_master [2020-07-20 13:50:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2020-07-20 13:50:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_master [2020-07-20 13:50:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2020-07-20 13:50:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_full [2020-07-20 13:50:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_dangling [2020-07-20 13:50:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_init [2020-07-20 13:50:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 13:50:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 13:50:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 13:50:29,039 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 13:50:29,040 INFO L295 CfgBuilder]: Removed 38 assume(true) statements. [2020-07-20 13:50:29,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:50:29 BoogieIcfgContainer [2020-07-20 13:50:29,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 13:50:29,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 13:50:29,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 13:50:29,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 13:50:29,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 01:50:27" (1/3) ... [2020-07-20 13:50:29,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3755b451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:50:29, skipping insertion in model container [2020-07-20 13:50:29,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:50:27" (2/3) ... [2020-07-20 13:50:29,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3755b451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:50:29, skipping insertion in model container [2020-07-20 13:50:29,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:50:29" (3/3) ... [2020-07-20 13:50:29,054 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2020-07-20 13:50:29,064 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 13:50:29,072 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 13:50:29,087 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 13:50:29,112 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 13:50:29,112 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 13:50:29,112 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 13:50:29,112 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 13:50:29,113 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 13:50:29,113 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 13:50:29,113 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 13:50:29,113 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 13:50:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2020-07-20 13:50:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-20 13:50:29,146 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:50:29,148 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-20 13:50:29,148 INFO L427 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:50:29,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:50:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1405399524, now seen corresponding path program 1 times [2020-07-20 13:50:29,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:50:29,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [138757978] [2020-07-20 13:50:29,162 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:50:29,432 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 13:50:29,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:50:29,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-20 13:50:29,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:50:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-20 13:50:29,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 13:50:29,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [138757978] [2020-07-20 13:50:29,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 13:50:29,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 13:50:29,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597458196] [2020-07-20 13:50:29,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 13:50:29,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:50:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 13:50:29,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 13:50:29,569 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 5 states. [2020-07-20 13:50:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:50:29,726 INFO L93 Difference]: Finished difference Result 342 states and 541 transitions. [2020-07-20 13:50:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 13:50:29,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2020-07-20 13:50:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:50:29,747 INFO L225 Difference]: With dead ends: 342 [2020-07-20 13:50:29,747 INFO L226 Difference]: Without dead ends: 168 [2020-07-20 13:50:29,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 13:50:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-07-20 13:50:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2020-07-20 13:50:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-07-20 13:50:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2020-07-20 13:50:29,858 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 59 [2020-07-20 13:50:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:50:29,858 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2020-07-20 13:50:29,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 13:50:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2020-07-20 13:50:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-07-20 13:50:29,866 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:50:29,866 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:50:30,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:50:30,078 INFO L427 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:50:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:50:30,079 INFO L82 PathProgramCache]: Analyzing trace with hash 586330229, now seen corresponding path program 1 times [2020-07-20 13:50:30,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:50:30,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1264990376] [2020-07-20 13:50:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:50:42,810 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:50:42,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:50:42,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 48 conjunts are in the unsatisfiable core [2020-07-20 13:50:42,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:50:43,023 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:50:43,024 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2020-07-20 13:50:43,025 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:50:43,055 INFO L624 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2020-07-20 13:50:43,057 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:50:43,057 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:8 [2020-07-20 13:50:43,107 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-07-20 13:50:43,108 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:50:43,110 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:50:43,110 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:50:43,110 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-07-20 13:50:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2020-07-20 13:50:43,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:50:44,297 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2020-07-20 13:50:44,299 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-20 13:50:44,353 INFO L624 ElimStorePlain]: treesize reduction 38, result has 47.2 percent of original size [2020-07-20 13:50:44,356 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-20 13:50:44,357 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:7 [2020-07-20 13:50:44,367 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2020-07-20 13:50:44,369 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-20 13:50:44,484 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2020-07-20 13:50:44,485 INFO L624 ElimStorePlain]: treesize reduction 127, result has 21.6 percent of original size [2020-07-20 13:50:44,486 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-07-20 13:50:44,487 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:20 [2020-07-20 13:50:44,642 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-20 13:50:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2020-07-20 13:50:44,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1264990376] [2020-07-20 13:50:44,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:50:44,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2020-07-20 13:50:44,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792794574] [2020-07-20 13:50:44,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 13:50:44,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:50:44,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 13:50:44,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2020-07-20 13:50:44,852 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand 21 states. [2020-07-20 13:50:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:50:45,702 INFO L93 Difference]: Finished difference Result 299 states and 361 transitions. [2020-07-20 13:50:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-20 13:50:45,705 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 154 [2020-07-20 13:50:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:50:45,714 INFO L225 Difference]: With dead ends: 299 [2020-07-20 13:50:45,715 INFO L226 Difference]: Without dead ends: 229 [2020-07-20 13:50:45,719 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2020-07-20 13:50:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-07-20 13:50:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 194. [2020-07-20 13:50:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-07-20 13:50:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2020-07-20 13:50:45,768 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 154 [2020-07-20 13:50:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:50:45,769 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2020-07-20 13:50:45,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 13:50:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2020-07-20 13:50:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-20 13:50:45,775 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:50:45,777 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-20 13:50:45,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:50:45,991 INFO L427 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:50:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:50:45,992 INFO L82 PathProgramCache]: Analyzing trace with hash -547179998, now seen corresponding path program 1 times [2020-07-20 13:50:45,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:50:45,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [758954704] [2020-07-20 13:50:45,993 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:50:59,071 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:50:59,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:50:59,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 68 conjunts are in the unsatisfiable core [2020-07-20 13:50:59,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:50:59,209 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-20 13:50:59,209 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:50:59,212 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:50:59,213 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:50:59,213 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-07-20 13:50:59,267 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2020-07-20 13:50:59,267 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:50:59,272 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:50:59,272 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:50:59,273 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-07-20 13:51:00,866 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (alloc_or_die_slave_~ptr~0.base Int)) (and (<= (+ alloc_or_die_slave_~ptr~0.base 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base) alloc_or_die_slave_~ptr~0.offset 0))))) is different from true [2020-07-20 13:51:08,574 WARN L193 SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-20 13:51:10,419 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (alloc_or_die_slave_~ptr~0.base Int)) (and (<= (+ alloc_or_die_slave_~ptr~0.base 1) |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base) alloc_or_die_slave_~ptr~0.offset 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) c_dll_insert_slave_~next~0.base))) is different from true [2020-07-20 13:51:12,188 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (alloc_or_die_slave_~ptr~0.base Int)) (and (<= (+ alloc_or_die_slave_~ptr~0.base 1) |c_#StackHeapBarrier|) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base) alloc_or_die_slave_~ptr~0.offset 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|)))) is different from true [2020-07-20 13:51:14,200 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (alloc_or_die_slave_~ptr~0.base Int)) (and (<= (+ alloc_or_die_slave_~ptr~0.base 1) |c_#StackHeapBarrier|) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base) alloc_or_die_slave_~ptr~0.offset 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|)))) is different from true [2020-07-20 13:51:14,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 13:51:14,219 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:51:14,220 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:51:14,220 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:51:14,221 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:1 [2020-07-20 13:51:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 114 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 8 not checked. [2020-07-20 13:51:14,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:51:18,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_alloc_or_die_slave_~ptr~0.offset_253 Int) (v_alloc_or_die_slave_~ptr~0.base_259 Int)) (or (< |c_#StackHeapBarrier| (+ v_alloc_or_die_slave_~ptr~0.base_259 1)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| v_alloc_or_die_slave_~ptr~0.base_259 (store (select |c_#memory_$Pointer$.base| v_alloc_or_die_slave_~ptr~0.base_259) v_alloc_or_die_slave_~ptr~0.offset_253 0)) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|))))) is different from false [2020-07-20 13:51:18,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [758954704] [2020-07-20 13:51:18,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-20 13:51:18,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-07-20 13:51:18,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109992996] [2020-07-20 13:51:18,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-20 13:51:18,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:51:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-20 13:51:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=295, Unknown=9, NotChecked=190, Total=552 [2020-07-20 13:51:18,296 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 23 states. [2020-07-20 13:51:21,270 WARN L193 SmtUtils]: Spent 1.82 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-20 13:51:22,991 WARN L193 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 25 [2020-07-20 13:51:30,641 WARN L193 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 27 [2020-07-20 13:51:42,356 WARN L193 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 26 [2020-07-20 13:51:51,876 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 31 [2020-07-20 13:52:04,330 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-20 13:52:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:52:10,375 INFO L93 Difference]: Finished difference Result 390 states and 472 transitions. [2020-07-20 13:52:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-20 13:52:10,376 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 157 [2020-07-20 13:52:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:52:10,379 INFO L225 Difference]: With dead ends: 390 [2020-07-20 13:52:10,379 INFO L226 Difference]: Without dead ends: 207 [2020-07-20 13:52:10,381 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 54.8s TimeCoverageRelationStatistics Valid=132, Invalid=920, Unknown=24, NotChecked=330, Total=1406 [2020-07-20 13:52:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-07-20 13:52:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 202. [2020-07-20 13:52:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-07-20 13:52:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 239 transitions. [2020-07-20 13:52:10,402 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 239 transitions. Word has length 157 [2020-07-20 13:52:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:52:10,403 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 239 transitions. [2020-07-20 13:52:10,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-20 13:52:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 239 transitions. [2020-07-20 13:52:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-20 13:52:10,406 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:52:10,406 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-20 13:52:10,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:52:10,621 INFO L427 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:52:10,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:52:10,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1779393950, now seen corresponding path program 1 times [2020-07-20 13:52:10,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:52:10,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1202569185] [2020-07-20 13:52:10,623 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:52:27,060 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:52:27,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:52:27,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 76 conjunts are in the unsatisfiable core [2020-07-20 13:52:27,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:52:27,152 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-07-20 13:52:27,153 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:52:27,166 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:52:27,171 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-07-20 13:52:27,172 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 13:52:27,182 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:52:27,182 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:52:27,183 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2020-07-20 13:52:29,253 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (let ((.cse0 (+ alloc_or_die_master_~ptr~1.offset 4)) (.cse1 (+ alloc_or_die_master_~ptr~1.offset 8))) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) .cse0 0) .cse1 0))) (= (store |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) .cse0 0) .cse1 0)) |c_#memory_$Pointer$.offset|)))) is different from true [2020-07-20 13:52:33,295 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 36 [2020-07-20 13:52:35,313 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (let ((.cse0 (+ alloc_or_die_master_~ptr~1.offset 4)) (.cse1 (+ alloc_or_die_master_~ptr~1.offset 8))) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) .cse0 0) .cse1 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|) c_dll_insert_master_~next~3.offset) (= (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) .cse0 0) .cse1 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|) c_dll_insert_master_~next~3.base)))) is different from true [2020-07-20 13:52:35,316 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:52:37,342 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|))))) (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|)))))) is different from true [2020-07-20 13:52:37,363 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2020-07-20 13:52:37,365 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:52:37,467 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-07-20 13:52:37,468 INFO L624 ElimStorePlain]: treesize reduction 18, result has 79.5 percent of original size [2020-07-20 13:52:37,474 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2020-07-20 13:52:37,475 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 13:52:37,575 INFO L624 ElimStorePlain]: treesize reduction 20, result has 78.9 percent of original size [2020-07-20 13:52:37,580 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 13:52:37,584 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:52:37,585 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:52:37,587 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:52:37,590 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:52:37,597 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 13:52:37,598 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:52:37,599 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:52:37,603 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:52:37,607 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:52:37,609 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:52:37,610 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:65, output treesize:1 [2020-07-20 13:52:39,688 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|))))) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (<= (+ v_prenex_5 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_5 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_5) v_prenex_6 0) (+ v_prenex_6 4) 0) (+ v_prenex_6 8) 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|)))))) is different from true [2020-07-20 13:52:41,714 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (<= (+ v_prenex_5 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_5 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_5) v_prenex_6 0) (+ v_prenex_6 4) 0) (+ v_prenex_6 8) 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|))))) (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|)))))) is different from true [2020-07-20 13:52:41,721 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:52:41,729 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:52:41,745 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-20 13:52:41,745 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:52:41,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 13:52:41,749 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 13:52:41,750 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:52:41,751 INFO L512 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_BEFORE_CALL_6| vanished before elimination [2020-07-20 13:52:41,751 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:52:41,751 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:99, output treesize:1 [2020-07-20 13:52:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 126 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-07-20 13:52:41,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:52:43,879 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:52:45,900 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_alloc_or_die_master_~ptr~1.offset_110 Int) (v_alloc_or_die_master_~ptr~1.base_110 Int)) (or (< |c_#StackHeapBarrier| (+ v_alloc_or_die_master_~ptr~1.base_110 1)) (= 0 (select (select (store |c_#memory_$Pointer$.offset| v_alloc_or_die_master_~ptr~1.base_110 (store (store (store (select |c_#memory_$Pointer$.offset| v_alloc_or_die_master_~ptr~1.base_110) v_alloc_or_die_master_~ptr~1.offset_110 0) (+ v_alloc_or_die_master_~ptr~1.offset_110 4) 0) (+ v_alloc_or_die_master_~ptr~1.offset_110 8) 0)) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)))) (forall ((v_alloc_or_die_master_~ptr~1.offset_110 Int) (v_alloc_or_die_master_~ptr~1.base_110 Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$.base| v_alloc_or_die_master_~ptr~1.base_110 (store (store (store (select |c_#memory_$Pointer$.base| v_alloc_or_die_master_~ptr~1.base_110) v_alloc_or_die_master_~ptr~1.offset_110 0) (+ v_alloc_or_die_master_~ptr~1.offset_110 4) 0) (+ v_alloc_or_die_master_~ptr~1.offset_110 8) 0)) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) (< |c_#StackHeapBarrier| (+ v_alloc_or_die_master_~ptr~1.base_110 1))))) is different from false [2020-07-20 13:52:45,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1202569185] [2020-07-20 13:52:45,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-20 13:52:45,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-07-20 13:52:45,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023986719] [2020-07-20 13:52:45,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 13:52:45,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:52:45,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 13:52:45,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=133, Unknown=7, NotChecked=162, Total=342 [2020-07-20 13:52:45,908 INFO L87 Difference]: Start difference. First operand 202 states and 239 transitions. Second operand 18 states. [2020-07-20 13:52:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:52:51,057 INFO L93 Difference]: Finished difference Result 403 states and 480 transitions. [2020-07-20 13:52:51,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 13:52:51,058 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 157 [2020-07-20 13:52:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:52:51,061 INFO L225 Difference]: With dead ends: 403 [2020-07-20 13:52:51,061 INFO L226 Difference]: Without dead ends: 212 [2020-07-20 13:52:51,063 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=53, Invalid=204, Unknown=7, NotChecked=198, Total=462 [2020-07-20 13:52:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-07-20 13:52:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2020-07-20 13:52:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-07-20 13:52:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 247 transitions. [2020-07-20 13:52:51,083 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 247 transitions. Word has length 157 [2020-07-20 13:52:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:52:51,084 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 247 transitions. [2020-07-20 13:52:51,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 13:52:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 247 transitions. [2020-07-20 13:52:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-20 13:52:51,087 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:52:51,087 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-20 13:52:51,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:52:51,297 INFO L427 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:52:51,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:52:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1632845278, now seen corresponding path program 1 times [2020-07-20 13:52:51,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:52:51,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [164963657] [2020-07-20 13:52:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:53:18,659 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 13:53:18,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:53:18,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 94 conjunts are in the unsatisfiable core [2020-07-20 13:53:18,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:53:18,872 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:53:18,873 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2020-07-20 13:53:18,874 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:53:18,897 INFO L624 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2020-07-20 13:53:18,898 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:53:18,899 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:8 [2020-07-20 13:53:18,971 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2020-07-20 13:53:18,972 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:53:18,979 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:53:18,980 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:53:18,980 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-07-20 13:53:21,158 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 23 [2020-07-20 13:53:23,246 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 27 [2020-07-20 13:53:23,264 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-07-20 13:53:23,264 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:53:23,274 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:53:23,275 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 13:53:23,275 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2020-07-20 13:53:25,280 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) 0 0) 4 0) 8 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|) c_dll_insert_master_~next~3.base))) is different from true [2020-07-20 13:53:27,288 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) 0 0) 4 0) 8 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|)))) is different from true [2020-07-20 13:53:27,304 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2020-07-20 13:53:27,306 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-20 13:53:27,317 INFO L624 ElimStorePlain]: treesize reduction 53, result has 8.6 percent of original size [2020-07-20 13:53:27,317 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:53:27,318 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:1 [2020-07-20 13:53:29,341 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) 0 0) 4 0) 8 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|)))) is different from true [2020-07-20 13:53:29,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 13:53:29,350 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:53:29,351 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:53:29,351 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:53:29,352 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:1 [2020-07-20 13:53:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 49 proven. 24 refuted. 0 times theorem prover too weak. 100 trivial. 7 not checked. [2020-07-20 13:53:29,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:53:30,965 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2020-07-20 13:53:30,965 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:53:30,972 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:53:30,973 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 13:53:30,973 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2020-07-20 13:53:32,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_alloc_or_die_master_~ptr~1.base_147 Int)) (or (< |c_#StackHeapBarrier| (+ v_alloc_or_die_master_~ptr~1.base_147 1)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| v_alloc_or_die_master_~ptr~1.base_147 (store (store (store (select |c_#memory_$Pointer$.base| v_alloc_or_die_master_~ptr~1.base_147) 0 0) 4 0) 8 0)) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|))))) is different from false [2020-07-20 13:53:32,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [164963657] [2020-07-20 13:53:32,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-20 13:53:32,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-07-20 13:53:32,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002457336] [2020-07-20 13:53:32,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-20 13:53:32,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:53:32,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-20 13:53:32,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=415, Unknown=4, NotChecked=172, Total=650 [2020-07-20 13:53:32,980 INFO L87 Difference]: Start difference. First operand 208 states and 247 transitions. Second operand 25 states. [2020-07-20 13:53:35,214 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-20 13:53:37,292 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-20 13:53:41,389 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-20 13:53:49,497 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-20 13:53:59,721 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2020-07-20 13:54:03,817 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 31 [2020-07-20 13:54:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:54:07,401 INFO L93 Difference]: Finished difference Result 410 states and 488 transitions. [2020-07-20 13:54:07,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-20 13:54:07,401 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 157 [2020-07-20 13:54:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:54:07,405 INFO L225 Difference]: With dead ends: 410 [2020-07-20 13:54:07,405 INFO L226 Difference]: Without dead ends: 214 [2020-07-20 13:54:07,407 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=140, Invalid=1268, Unknown=14, NotChecked=300, Total=1722 [2020-07-20 13:54:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-07-20 13:54:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 209. [2020-07-20 13:54:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-07-20 13:54:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2020-07-20 13:54:07,425 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 157 [2020-07-20 13:54:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:54:07,426 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2020-07-20 13:54:07,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-20 13:54:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2020-07-20 13:54:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-20 13:54:07,429 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:54:07,429 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-20 13:54:07,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:54:07,631 INFO L427 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:54:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:54:07,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1709746076, now seen corresponding path program 1 times [2020-07-20 13:54:07,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:54:07,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1504597877] [2020-07-20 13:54:07,633 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:57:53,185 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 13:57:53,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:57:57,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 286 conjunts are in the unsatisfiable core [2020-07-20 13:57:57,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:57:57,420 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:57:57,420 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-20 13:57:57,421 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:57:57,467 INFO L624 ElimStorePlain]: treesize reduction 16, result has 77.5 percent of original size [2020-07-20 13:57:57,492 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:57:57,492 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-20 13:57:57,493 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 13:57:57,541 INFO L624 ElimStorePlain]: treesize reduction 16, result has 75.8 percent of original size [2020-07-20 13:57:57,542 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:57:57,543 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:17 [2020-07-20 13:57:57,631 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-07-20 13:57:57,631 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:57:57,639 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:57:57,643 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2020-07-20 13:57:57,644 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 13:57:57,653 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:57:57,654 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:57:57,654 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:7 [2020-07-20 13:57:57,745 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-20 13:57:57,746 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:57:57,759 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:57:57,760 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:57:57,760 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2020-07-20 13:57:58,187 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 13:58:24,591 WARN L193 SmtUtils]: Spent 24.19 s on a formula simplification that was a NOOP. DAG size: 59 [2020-07-20 13:58:24,611 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2020-07-20 13:58:24,611 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:58:24,643 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:58:24,649 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2020-07-20 13:58:24,650 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 13:58:24,685 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:58:24,690 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2020-07-20 13:58:24,691 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 13:58:24,779 INFO L624 ElimStorePlain]: treesize reduction 16, result has 77.8 percent of original size [2020-07-20 13:58:24,781 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 13:58:24,782 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:58:24,782 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:58:24,783 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:58:24,783 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:58:24,784 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:58:24,785 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:61, output treesize:7 [2020-07-20 13:58:26,789 WARN L193 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 23 [2020-07-20 13:58:26,807 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-20 13:58:26,808 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:58:26,814 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:58:26,816 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-20 13:58:26,816 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2020-07-20 13:58:27,103 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-20 13:58:27,104 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:58:27,114 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:58:27,120 INFO L384 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 7 treesize of output 3 [2020-07-20 13:58:27,120 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 13:58:27,128 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:58:27,129 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 13:58:27,129 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2020-07-20 13:58:27,750 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 13:58:29,791 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((dll_insert_slave_~item~0.base Int)) (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base) 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (and (not (= .cse0 0)) (<= (+ dll_insert_slave_~item~0.base 1) |c_#StackHeapBarrier|) (= (let ((.cse1 (let ((.cse4 (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base))) (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse4 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse4 0 .cse3)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ .cse0 4) dll_insert_slave_~item~0.base))))))) (store .cse1 |c_dll_insert_slave_#in~dll.base| (store (select .cse1 |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset| dll_insert_slave_~item~0.base))) |c_#memory_$Pointer$.base|)))) (exists ((dll_insert_slave_~item~0.base Int)) (let ((.cse8 (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base))) (let ((.cse5 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse8 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (and (<= (+ dll_insert_slave_~item~0.base 1) |c_#StackHeapBarrier|) (not (= 0 .cse5)) (= (let ((.cse6 (let ((.cse7 (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse8 0 .cse5)))) (store .cse7 .cse5 (store (select .cse7 .cse5) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base) 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) 4) dll_insert_slave_~item~0.base))))) (store .cse6 |c_dll_insert_slave_#in~dll.base| (store (select .cse6 |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset| dll_insert_slave_~item~0.base))) |c_#memory_$Pointer$.base|)))))) is different from true [2020-07-20 13:58:31,819 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_11 Int)) (let ((.cse3 (select |c_old(#memory_$Pointer$.base)| v_prenex_11))) (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_11 (store .cse3 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (and (<= (+ v_prenex_11 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| v_prenex_11 (store .cse3 0 .cse2)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_11 (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_11) 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) 4) v_prenex_11))))) (store .cse0 |c_dll_insert_slave_#in~dll.base| (store (select .cse0 |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset| v_prenex_11)))) (not (= 0 .cse2)))))) (exists ((dll_insert_slave_~item~0.base Int)) (let ((.cse4 (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base) 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (and (not (= .cse4 0)) (<= (+ dll_insert_slave_~item~0.base 1) |c_#StackHeapBarrier|) (= (let ((.cse5 (let ((.cse8 (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base))) (let ((.cse7 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse8 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse8 0 .cse7)))) (store .cse6 .cse7 (store (select .cse6 .cse7) (+ .cse4 4) dll_insert_slave_~item~0.base))))))) (store .cse5 |c_dll_insert_slave_#in~dll.base| (store (select .cse5 |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset| dll_insert_slave_~item~0.base))) |c_#memory_$Pointer$.base|))))) is different from true [2020-07-20 13:58:33,887 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_11 Int)) (let ((.cse3 (select |c_old(#memory_$Pointer$.base)| v_prenex_11))) (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_11 (store .cse3 0 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|))) (and (<= (+ v_prenex_11 1) |c_#StackHeapBarrier|) (not (= .cse0 0)) (= |c_#memory_$Pointer$.base| (let ((.cse1 (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| v_prenex_11 (store .cse3 0 .cse0)))) (store .cse2 .cse0 (store (select .cse2 .cse0) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_11 (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_11) 0 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|) 4) v_prenex_11))))) (store .cse1 |c_##fun~$Pointer$~TO~VOID_#in~9.base| (store (select .cse1 |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset| v_prenex_11)))))))) (exists ((dll_insert_slave_~item~0.base Int)) (let ((.cse7 (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base) 0 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|))) (and (<= (+ dll_insert_slave_~item~0.base 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (let ((.cse4 (let ((.cse8 (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base))) (let ((.cse6 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse8 0 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|))) (let ((.cse5 (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse8 0 .cse6)))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ .cse7 4) dll_insert_slave_~item~0.base))))))) (store .cse4 |c_##fun~$Pointer$~TO~VOID_#in~9.base| (store (select .cse4 |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset| dll_insert_slave_~item~0.base)))) (not (= 0 .cse7)))))) is different from true [2020-07-20 13:58:33,892 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:58:33,897 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:58:33,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 13:58:33,948 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 751 treesize of output 739 [2020-07-20 13:58:33,950 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:58:33,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 13:58:33,960 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 13:58:33,986 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:58:33,989 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-20 13:58:33,989 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:1647, output treesize:812 [2020-07-20 13:58:41,593 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:58:42,031 INFO L244 Elim1Store]: Index analysis took 173 ms [2020-07-20 13:58:42,042 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:58:42,043 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2020-07-20 13:58:42,044 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:58:42,587 INFO L244 Elim1Store]: Index analysis took 189 ms [2020-07-20 13:58:42,599 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:58:42,600 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2020-07-20 13:58:42,601 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 13:58:45,462 WARN L193 SmtUtils]: Spent 2.86 s on a formula simplification that was a NOOP. DAG size: 113 [2020-07-20 13:58:45,462 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:58:45,471 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2020-07-20 13:58:45,472 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:17139, output treesize:17129 [2020-07-20 13:59:15,971 WARN L193 SmtUtils]: Spent 23.47 s on a formula simplification that was a NOOP. DAG size: 128 [2020-07-20 13:59:15,974 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:59:15,999 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 13:59:16,870 INFO L244 Elim1Store]: Index analysis took 332 ms [2020-07-20 13:59:17,774 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:59:17,775 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-20 13:59:17,776 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 13:59:18,199 INFO L244 Elim1Store]: Index analysis took 237 ms [2020-07-20 13:59:18,625 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 13:59:18,626 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-20 13:59:18,627 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 13:59:30,733 WARN L193 SmtUtils]: Spent 12.11 s on a formula simplification. DAG size of input: 145 DAG size of output: 141 [2020-07-20 13:59:30,735 INFO L624 ElimStorePlain]: treesize reduction 32, result has 99.9 percent of original size [2020-07-20 13:59:30,810 INFO L544 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2020-07-20 13:59:30,811 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:54785, output treesize:54745 [2020-07-20 14:00:59,521 WARN L193 SmtUtils]: Spent 1.13 m on a formula simplification that was a NOOP. DAG size: 157 [2020-07-20 14:02:45,749 WARN L193 SmtUtils]: Spent 1.14 m on a formula simplification that was a NOOP. DAG size: 157 [2020-07-20 14:02:45,790 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:02:45,940 INFO L440 ElimStorePlain]: Different costs {8=[|v_#memory_$Pointer$.offset_BEFORE_CALL_18|], 129=[|v_#memory_$Pointer$.base_BEFORE_CALL_40|]} [2020-07-20 14:02:46,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:02:46,072 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21827 treesize of output 20255 [2020-07-20 14:02:46,073 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:46,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:02:46,123 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:46,438 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-20 14:02:46,438 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:02:46,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:02:46,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:02:46,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:02:46,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:02:46,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:02:46,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:02:46,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:02:46,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:02:46,566 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:02:46,567 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 6416 treesize of output 174 [2020-07-20 14:02:46,569 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:46,792 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2020-07-20 14:02:46,794 INFO L624 ElimStorePlain]: treesize reduction 75, result has 64.5 percent of original size [2020-07-20 14:02:46,797 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,797 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,798 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,800 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,800 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,802 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,803 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,804 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,805 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,806 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,807 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,808 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,809 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,810 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,811 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,812 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,813 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,814 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,815 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,816 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,817 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,818 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,819 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,820 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,820 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,822 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:02:46,822 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,823 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,824 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,825 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,826 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,827 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,828 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,829 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,830 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,830 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,831 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,832 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,833 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,834 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,834 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,835 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,836 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,837 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,838 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,838 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,840 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,840 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,841 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,842 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,843 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,844 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,844 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,845 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,846 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,847 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,848 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,849 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,850 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,851 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,852 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,852 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,853 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,854 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,855 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,856 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,856 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,858 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,858 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,859 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,860 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,861 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,862 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,862 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,863 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,864 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,865 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,867 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,867 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,868 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,870 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,870 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,872 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:02:46,873 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,873 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,874 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,876 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,877 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,878 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,879 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,880 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,881 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,881 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,883 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,883 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,884 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,885 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,886 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,887 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,888 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,889 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,890 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,890 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,892 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,892 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,893 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,894 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,895 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,897 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,897 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,898 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,900 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,900 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,902 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,903 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,903 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,905 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,906 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,906 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,908 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,908 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,909 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,911 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,911 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,913 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,914 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:02:46,915 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,916 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:02:46,916 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:02:46,918 INFO L544 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-20 14:02:46,918 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:54789, output treesize:153 [2020-07-20 14:02:46,919 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:02:46,919 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:02:46,920 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:02:46,920 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:02:48,197 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:02:48,199 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:02:48,200 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:02:48,200 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:02:49,296 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:02:49,300 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:02:49,301 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:02:49,301 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:02:50,507 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:02:50,508 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:02:50,508 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:02:50,509 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:02:50,511 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:02:50,512 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:02:50,513 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:02:50,513 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:02:50,536 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 14:02:50,536 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:50,546 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 14:02:50,547 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:50,558 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 14:02:50,558 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:50,601 INFO L384 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 [2020-07-20 14:02:50,601 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:50,612 INFO L384 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 [2020-07-20 14:02:50,612 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:50,625 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 14:02:50,625 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:50,637 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 14:02:50,638 INFO L544 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:50,653 INFO L384 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 [2020-07-20 14:02:50,654 INFO L544 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:50,667 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 14:02:50,668 INFO L544 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:50,683 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 14:02:50,684 INFO L544 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:50,697 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 14:02:50,697 INFO L544 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:50,710 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 14:02:50,711 INFO L544 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-07-20 14:02:51,629 WARN L193 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2020-07-20 14:02:51,630 INFO L624 ElimStorePlain]: treesize reduction 581, result has 63.2 percent of original size [2020-07-20 14:02:51,637 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 17 dim-0 vars, and 9 xjuncts. [2020-07-20 14:02:51,638 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:1710, output treesize:997 [2020-07-20 14:02:53,184 WARN L193 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 161 [2020-07-20 14:02:54,769 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-20 14:02:56,631 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-20 14:02:58,399 WARN L193 SmtUtils]: Spent 733.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-07-20 14:02:59,793 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-07-20 14:03:01,481 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-07-20 14:03:03,754 WARN L193 SmtUtils]: Spent 658.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-07-20 14:03:05,544 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-07-20 14:03:06,749 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-07-20 14:03:06,770 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 1] term [2020-07-20 14:03:06,771 INFO L501 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-07-20 14:03:06,791 INFO L440 ElimStorePlain]: Different costs {2=[v_prenex_40], 4=[v_prenex_33, v_prenex_38], 6=[|#memory_$Pointer$.base|], 7=[v_prenex_35]} [2020-07-20 14:03:06,814 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:03:06,814 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 53 [2020-07-20 14:03:06,815 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:03:06,816 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:03:07,011 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-20 14:03:07,012 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:03:07,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:03:07,043 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:03:07,044 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 64 [2020-07-20 14:03:07,046 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:03:07,046 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:03:07,046 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 14:03:07,218 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-07-20 14:03:07,219 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:03:07,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:03:07,249 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:03:07,249 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 103 treesize of output 65 [2020-07-20 14:03:07,250 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:03:07,251 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:03:07,251 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 14:03:07,362 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-07-20 14:03:07,363 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:03:07,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:03:07,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:03:07,408 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:03:07,408 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 114 treesize of output 92 [2020-07-20 14:03:07,410 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:03:07,410 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:03:07,411 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:03:07,411 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:03:07,619 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 14:03:07,702 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:03:07,747 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:03:07,748 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 145 treesize of output 114 [2020-07-20 14:03:07,751 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-20 14:03:07,752 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:03:07,753 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:03:07,754 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:03:07,755 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:03:07,755 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:03:07,757 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:03:07,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:03:07,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:03:07,761 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-20 14:03:07,762 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:03:07,762 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:03:07,764 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-20 14:03:07,883 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-07-20 14:03:07,884 INFO L624 ElimStorePlain]: treesize reduction 4, result has 95.6 percent of original size [2020-07-20 14:03:07,886 INFO L544 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 14:03:07,886 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 15 variables, input treesize:588, output treesize:4 [2020-07-20 14:03:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 122 proven. 30 refuted. 0 times theorem prover too weak. 20 trivial. 8 not checked. [2020-07-20 14:03:09,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:03:16,115 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-07-20 14:03:16,320 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-07-20 14:03:16,998 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-07-20 14:03:17,864 WARN L193 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2020-07-20 14:03:18,036 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-07-20 14:03:22,718 WARN L193 SmtUtils]: Spent 4.30 s on a formula simplification that was a NOOP. DAG size: 152 [2020-07-20 14:03:24,067 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 113 [2020-07-20 14:03:26,383 WARN L193 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 125 [2020-07-20 14:03:28,360 WARN L193 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 121 [2020-07-20 14:03:30,770 WARN L193 SmtUtils]: Spent 2.41 s on a formula simplification that was a NOOP. DAG size: 125 [2020-07-20 14:03:32,038 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 108 [2020-07-20 14:03:34,551 WARN L193 SmtUtils]: Spent 2.51 s on a formula simplification that was a NOOP. DAG size: 120 [2020-07-20 14:03:36,417 WARN L193 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 116 [2020-07-20 14:03:45,788 WARN L193 SmtUtils]: Spent 9.37 s on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2020-07-20 14:03:48,143 WARN L193 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 131 [2020-07-20 14:03:50,607 WARN L193 SmtUtils]: Spent 2.46 s on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 14:03:53,151 WARN L193 SmtUtils]: Spent 2.54 s on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 14:03:55,797 WARN L193 SmtUtils]: Spent 2.64 s on a formula simplification that was a NOOP. DAG size: 139 [2020-07-20 14:03:58,029 WARN L193 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 131 [2020-07-20 14:04:01,130 WARN L193 SmtUtils]: Spent 3.10 s on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 14:04:03,897 WARN L193 SmtUtils]: Spent 2.77 s on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 14:04:05,844 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-07-20 14:04:06,693 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-07-20 14:04:07,628 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2020-07-20 14:04:07,833 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-07-20 14:04:13,347 WARN L193 SmtUtils]: Spent 5.12 s on a formula simplification that was a NOOP. DAG size: 152 [2020-07-20 14:04:15,153 WARN L193 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 113 [2020-07-20 14:04:18,040 WARN L193 SmtUtils]: Spent 2.88 s on a formula simplification that was a NOOP. DAG size: 125 [2020-07-20 14:04:20,392 WARN L193 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 121 [2020-07-20 14:04:22,984 WARN L193 SmtUtils]: Spent 2.59 s on a formula simplification that was a NOOP. DAG size: 125 [2020-07-20 14:04:24,387 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 108 [2020-07-20 14:04:26,253 WARN L193 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 120 [2020-07-20 14:04:28,136 WARN L193 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 116 [2020-07-20 14:04:36,892 WARN L193 SmtUtils]: Spent 8.75 s on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2020-07-20 14:04:39,264 WARN L193 SmtUtils]: Spent 2.37 s on a formula simplification that was a NOOP. DAG size: 131 [2020-07-20 14:04:41,790 WARN L193 SmtUtils]: Spent 2.52 s on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 14:04:44,560 WARN L193 SmtUtils]: Spent 2.77 s on a formula simplification that was a NOOP. DAG size: 135 [2020-07-20 14:04:46,141 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-07-20 14:04:46,990 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-07-20 14:04:47,963 WARN L193 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2020-07-20 14:04:48,472 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-07-20 14:04:53,539 WARN L193 SmtUtils]: Spent 4.98 s on a formula simplification that was a NOOP. DAG size: 152 [2020-07-20 14:04:55,104 WARN L193 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 113 [2020-07-20 14:04:57,610 WARN L193 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 125