/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:27:01,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:27:01,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:27:01,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:27:01,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:27:01,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:27:01,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:27:01,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:27:01,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:27:01,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:27:01,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:27:01,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:27:01,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:27:01,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:27:01,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:27:01,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:27:01,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:27:01,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:27:01,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:27:01,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:27:01,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:27:01,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:27:01,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:27:01,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:27:01,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:27:01,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:27:01,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:27:01,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:27:01,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:27:01,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:27:01,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:27:01,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:27:01,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:27:01,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:27:01,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:27:01,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:27:01,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:27:01,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:27:01,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:27:01,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:27:01,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:27:01,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 16:27:01,909 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:27:01,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:27:01,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:27:01,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:27:01,911 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:27:01,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:27:01,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:27:01,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:27:01,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:27:01,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:27:01,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:27:01,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:27:01,913 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:27:01,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:27:01,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:27:01,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:27:01,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:27:01,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:27:01,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:27:01,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:27:01,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:27:01,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:27:01,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:27:01,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:27:01,915 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:27:01,915 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 16:27:02,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:27:02,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:27:02,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:27:02,307 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:27:02,308 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:27:02,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2021-01-06 16:27:02,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/deb656611/ebc6e3db5ff54b0eae870473cec4165d/FLAGc8ee1d3c0 [2021-01-06 16:27:03,049 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:27:03,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2021-01-06 16:27:03,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/deb656611/ebc6e3db5ff54b0eae870473cec4165d/FLAGc8ee1d3c0 [2021-01-06 16:27:03,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/deb656611/ebc6e3db5ff54b0eae870473cec4165d [2021-01-06 16:27:03,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:27:03,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:27:03,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:27:03,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:27:03,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:27:03,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:27:03" (1/1) ... [2021-01-06 16:27:03,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45851166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03, skipping insertion in model container [2021-01-06 16:27:03,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:27:03" (1/1) ... [2021-01-06 16:27:03,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:27:03,456 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem12,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] [2021-01-06 16:27:03,801 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2021-01-06 16:27:03,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:27:03,814 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem12,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] [2021-01-06 16:27:03,860 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2021-01-06 16:27:03,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:27:03,930 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:27:03,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03 WrapperNode [2021-01-06 16:27:03,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:27:03,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:27:03,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:27:03,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:27:03,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03" (1/1) ... [2021-01-06 16:27:03,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03" (1/1) ... [2021-01-06 16:27:03,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:27:03,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:27:03,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:27:03,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:27:03,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03" (1/1) ... [2021-01-06 16:27:03,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03" (1/1) ... [2021-01-06 16:27:04,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03" (1/1) ... [2021-01-06 16:27:04,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03" (1/1) ... [2021-01-06 16:27:04,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03" (1/1) ... [2021-01-06 16:27:04,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03" (1/1) ... [2021-01-06 16:27:04,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03" (1/1) ... [2021-01-06 16:27:04,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:27:04,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:27:04,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:27:04,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:27:04,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:27:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 16:27:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 16:27:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 16:27:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 16:27:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:27:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 16:27:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 16:27:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-06 16:27:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:27:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:27:04,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:27:04,618 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:27:04,618 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-01-06 16:27:04,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:27:04 BoogieIcfgContainer [2021-01-06 16:27:04,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:27:04,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:27:04,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:27:04,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:27:04,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:27:03" (1/3) ... [2021-01-06 16:27:04,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6f29a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:27:04, skipping insertion in model container [2021-01-06 16:27:04,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:27:03" (2/3) ... [2021-01-06 16:27:04,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6f29a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:27:04, skipping insertion in model container [2021-01-06 16:27:04,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:27:04" (3/3) ... [2021-01-06 16:27:04,629 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2021-01-06 16:27:04,635 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:27:04,640 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 16:27:04,659 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 16:27:04,686 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:27:04,686 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:27:04,686 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:27:04,686 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:27:04,686 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:27:04,686 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:27:04,687 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:27:04,687 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:27:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2021-01-06 16:27:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-06 16:27:04,732 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:27:04,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:27:04,733 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:27:04,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:27:04,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1295164731, now seen corresponding path program 1 times [2021-01-06 16:27:04,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:27:04,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171098103] [2021-01-06 16:27:04,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:27:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:27:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:27:05,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171098103] [2021-01-06 16:27:05,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:27:05,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:27:05,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853702253] [2021-01-06 16:27:05,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:27:05,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:27:05,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:27:05,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:27:05,113 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2021-01-06 16:27:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:27:05,177 INFO L93 Difference]: Finished difference Result 52 states and 74 transitions. [2021-01-06 16:27:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:27:05,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2021-01-06 16:27:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:27:05,198 INFO L225 Difference]: With dead ends: 52 [2021-01-06 16:27:05,198 INFO L226 Difference]: Without dead ends: 25 [2021-01-06 16:27:05,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:27:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-01-06 16:27:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2021-01-06 16:27:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-01-06 16:27:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-01-06 16:27:05,248 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2021-01-06 16:27:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:27:05,250 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-01-06 16:27:05,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:27:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2021-01-06 16:27:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:27:05,252 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:27:05,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:27:05,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:27:05,253 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:27:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:27:05,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1403747897, now seen corresponding path program 1 times [2021-01-06 16:27:05,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:27:05,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735278736] [2021-01-06 16:27:05,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:27:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:27:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:27:05,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735278736] [2021-01-06 16:27:05,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:27:05,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:27:05,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799365555] [2021-01-06 16:27:05,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:27:05,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:27:05,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:27:05,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:27:05,402 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2021-01-06 16:27:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:27:05,431 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2021-01-06 16:27:05,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:27:05,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-01-06 16:27:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:27:05,433 INFO L225 Difference]: With dead ends: 43 [2021-01-06 16:27:05,433 INFO L226 Difference]: Without dead ends: 25 [2021-01-06 16:27:05,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:27:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-01-06 16:27:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-01-06 16:27:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-01-06 16:27:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-01-06 16:27:05,439 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2021-01-06 16:27:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:27:05,440 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-01-06 16:27:05,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:27:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-01-06 16:27:05,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:27:05,441 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:27:05,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:27:05,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:27:05,441 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:27:05,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:27:05,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1880102149, now seen corresponding path program 1 times [2021-01-06 16:27:05,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:27:05,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399026792] [2021-01-06 16:27:05,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:27:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:27:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:27:05,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399026792] [2021-01-06 16:27:05,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828096551] [2021-01-06 16:27:05,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:27:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:27:05,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 16:27:05,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:27:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:27:05,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:27:05,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 16:27:05,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959068168] [2021-01-06 16:27:05,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:27:05,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:27:05,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:27:05,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:27:05,680 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 5 states. [2021-01-06 16:27:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:27:05,701 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2021-01-06 16:27:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:27:05,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2021-01-06 16:27:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:27:05,703 INFO L225 Difference]: With dead ends: 39 [2021-01-06 16:27:05,703 INFO L226 Difference]: Without dead ends: 26 [2021-01-06 16:27:05,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:27:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-01-06 16:27:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-01-06 16:27:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-01-06 16:27:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-01-06 16:27:05,708 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2021-01-06 16:27:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:27:05,709 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-01-06 16:27:05,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:27:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-01-06 16:27:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 16:27:05,710 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:27:05,710 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:27:05,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 16:27:05,924 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:27:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:27:05,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1641464670, now seen corresponding path program 1 times [2021-01-06 16:27:05,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:27:05,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177403562] [2021-01-06 16:27:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:27:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:27:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 16:27:06,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177403562] [2021-01-06 16:27:06,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:27:06,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 16:27:06,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065961394] [2021-01-06 16:27:06,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 16:27:06,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:27:06,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 16:27:06,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 16:27:06,068 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 8 states. [2021-01-06 16:27:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:27:06,232 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-01-06 16:27:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:27:06,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2021-01-06 16:27:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:27:06,234 INFO L225 Difference]: With dead ends: 33 [2021-01-06 16:27:06,234 INFO L226 Difference]: Without dead ends: 30 [2021-01-06 16:27:06,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-01-06 16:27:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-01-06 16:27:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-01-06 16:27:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-01-06 16:27:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-01-06 16:27:06,241 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2021-01-06 16:27:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:27:06,241 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-01-06 16:27:06,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 16:27:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-01-06 16:27:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 16:27:06,242 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:27:06,243 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:27:06,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:27:06,243 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:27:06,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:27:06,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1641466344, now seen corresponding path program 1 times [2021-01-06 16:27:06,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:27:06,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635134210] [2021-01-06 16:27:06,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:27:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:27:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:27:06,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635134210] [2021-01-06 16:27:06,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:27:06,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 16:27:06,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679443591] [2021-01-06 16:27:06,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 16:27:06,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:27:06,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 16:27:06,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-01-06 16:27:06,590 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 13 states. [2021-01-06 16:27:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:27:07,103 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-01-06 16:27:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 16:27:07,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2021-01-06 16:27:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:27:07,104 INFO L225 Difference]: With dead ends: 31 [2021-01-06 16:27:07,105 INFO L226 Difference]: Without dead ends: 29 [2021-01-06 16:27:07,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2021-01-06 16:27:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-01-06 16:27:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-01-06 16:27:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-01-06 16:27:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-01-06 16:27:07,111 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2021-01-06 16:27:07,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:27:07,111 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-01-06 16:27:07,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 16:27:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-01-06 16:27:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 16:27:07,113 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:27:07,113 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:27:07,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 16:27:07,113 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:27:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:27:07,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1196191993, now seen corresponding path program 1 times [2021-01-06 16:27:07,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:27:07,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304954905] [2021-01-06 16:27:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:27:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:27:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:27:07,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304954905] [2021-01-06 16:27:07,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819585283] [2021-01-06 16:27:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:27:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:27:07,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 49 conjunts are in the unsatisfiable core [2021-01-06 16:27:07,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:27:07,628 INFO L382 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 [2021-01-06 16:27:07,629 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:07,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:07,635 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:27:07,636 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-06 16:27:07,682 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:07,683 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-06 16:27:07,688 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:07,702 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-06 16:27:07,704 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:27:07,705 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2021-01-06 16:27:07,797 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:07,798 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-06 16:27:07,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:27:07,807 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:07,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:07,817 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:27:07,817 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:22 [2021-01-06 16:27:07,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:27:07,965 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:07,965 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2021-01-06 16:27:07,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:27:07,970 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:07,980 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:07,981 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:27:07,981 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2021-01-06 16:27:08,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:27:08,063 INFO L348 Elim1Store]: treesize reduction 82, result has 18.8 percent of original size [2021-01-06 16:27:08,064 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 38 [2021-01-06 16:27:08,068 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:08,083 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:08,086 INFO L547 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. [2021-01-06 16:27:08,086 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:54 [2021-01-06 16:27:08,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:27:08,207 INFO L348 Elim1Store]: treesize reduction 12, result has 85.5 percent of original size [2021-01-06 16:27:08,207 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 105 [2021-01-06 16:27:08,212 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:08,264 INFO L625 ElimStorePlain]: treesize reduction 42, result has 66.4 percent of original size [2021-01-06 16:27:08,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:27:08,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:27:08,269 INFO L547 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. [2021-01-06 16:27:08,269 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:83 [2021-01-06 16:27:08,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:27:08,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:27:08,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:27:08,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:27:08,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:27:08,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:27:08,353 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:27:08,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:27:08,369 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_23|], 56=[|v_#memory_$Pointer$.base_25|]} [2021-01-06 16:27:08,376 INFO L382 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 25 treesize of output 21 [2021-01-06 16:27:08,377 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:27:08,385 INFO L382 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 25 treesize of output 21 [2021-01-06 16:27:08,386 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:27:08,394 INFO L382 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 25 treesize of output 21 [2021-01-06 16:27:08,395 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:27:08,506 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-01-06 16:27:08,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:08,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:27:08,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 16:27:08,709 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-01-06 16:27:08,710 INFO L348 Elim1Store]: treesize reduction 12, result has 94.0 percent of original size [2021-01-06 16:27:08,711 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 83 treesize of output 222 [2021-01-06 16:27:08,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[14, 3, 2, 1] term [2021-01-06 16:27:08,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-06 16:27:08,727 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:08,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:27:08,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:27:08,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 16:27:08,804 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:08,805 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 152 [2021-01-06 16:27:08,815 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2021-01-06 16:27:08,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:08,818 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:08,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:27:08,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:27:08,877 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:08,877 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 152 [2021-01-06 16:27:08,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2021-01-06 16:27:08,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:08,887 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:09,024 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2021-01-06 16:27:09,025 INFO L625 ElimStorePlain]: treesize reduction 10, result has 95.9 percent of original size [2021-01-06 16:27:09,028 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2021-01-06 16:27:09,029 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:277, output treesize:231 [2021-01-06 16:27:09,203 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 16:27:09,217 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 16:27:09,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2021-01-06 16:27:09,224 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 16:27:09,283 INFO L443 ElimStorePlain]: Different costs {0=[v_prenex_6, v_prenex_2, |v_#memory_$Pointer$.offset_24|], 20=[v_prenex_4, v_prenex_3], 30=[|v_#memory_$Pointer$.base_26|]} [2021-01-06 16:27:09,300 INFO L382 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 [2021-01-06 16:27:09,301 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:09,450 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-01-06 16:27:09,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:09,477 INFO L382 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 [2021-01-06 16:27:09,479 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:09,602 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-01-06 16:27:09,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:09,615 INFO L382 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 [2021-01-06 16:27:09,617 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:09,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:09,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:27:09,841 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2021-01-06 16:27:09,842 INFO L348 Elim1Store]: treesize reduction 62, result has 67.7 percent of original size [2021-01-06 16:27:09,843 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 113 treesize of output 166 [2021-01-06 16:27:09,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 16:27:09,854 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:27:09,855 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:09,859 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:27:09,933 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:09,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:27:09,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:27:09,984 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:09,985 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 135 [2021-01-06 16:27:09,991 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:10,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:10,258 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2021-01-06 16:27:10,259 INFO L348 Elim1Store]: treesize reduction 114, result has 61.6 percent of original size [2021-01-06 16:27:10,259 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 132 treesize of output 222 [2021-01-06 16:27:10,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-06 16:27:10,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-06 16:27:10,279 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:27:10,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-06 16:27:10,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-06 16:27:10,284 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:27:10,286 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,287 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,289 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,293 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,297 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,299 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,303 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,323 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,325 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,330 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:27:10,332 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,334 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,339 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,340 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,344 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,349 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:27:10,351 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,355 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,360 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,362 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,363 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,367 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,371 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,372 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-06 16:27:10,379 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,380 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,382 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 16:27:10,384 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,388 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:10,393 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,397 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:10,400 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,403 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 16:27:10,409 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,412 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:10,415 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,419 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,420 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:10,423 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,426 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 16:27:10,429 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,433 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,435 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 16:27:10,437 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:10,443 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,447 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,450 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 16:27:10,453 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,457 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-06 16:27:10,462 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,465 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 16:27:10,468 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,472 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,474 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,475 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 16:27:10,477 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,480 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:27:10,483 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:10,486 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,489 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,492 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,494 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:10,496 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,499 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,502 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 16:27:10,505 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,509 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-06 16:27:10,514 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-06 16:27:10,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-06 16:27:10,516 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,517 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,519 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:10,521 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,524 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,527 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 16:27:10,529 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,532 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:27:10,535 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,536 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-06 16:27:10,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 16:27:10,538 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,541 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,544 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:10,547 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,550 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,553 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,554 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,556 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 16:27:10,558 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,561 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:27:10,563 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-06 16:27:10,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:27:10,566 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,569 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,572 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,573 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:27:10,575 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 16:27:10,578 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:27:10,581 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:27:10,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 16:27:10,583 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:27:10,585 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-06 16:27:10,592 INFO L547 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:27:10,643 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:10,662 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2021-01-06 16:27:10,663 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:363, output treesize:317 [2021-01-06 16:27:10,841 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 16:27:10,857 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 16:27:10,897 INFO L382 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 27 treesize of output 19 [2021-01-06 16:27:10,898 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:10,903 INFO L382 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 110 treesize of output 86 [2021-01-06 16:27:10,905 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:10,910 INFO L382 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 110 treesize of output 86 [2021-01-06 16:27:10,912 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:10,970 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:10,982 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2021-01-06 16:27:10,983 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:359, output treesize:294 [2021-01-06 16:27:15,213 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 16:27:15,267 INFO L443 ElimStorePlain]: Different costs {12=[v_prenex_14, v_prenex_12], 30=[|#memory_$Pointer$.base|]} [2021-01-06 16:27:15,327 INFO L348 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2021-01-06 16:27:15,327 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 107 [2021-01-06 16:27:15,332 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:15,333 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:15,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:27:15,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:27:15,338 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,340 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 16:27:15,341 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:15,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:15,449 INFO L348 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2021-01-06 16:27:15,450 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 107 [2021-01-06 16:27:15,455 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:15,456 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:27:15,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:27:15,460 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:15,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:27:15,641 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2021-01-06 16:27:15,642 INFO L348 Elim1Store]: treesize reduction 44, result has 77.7 percent of original size [2021-01-06 16:27:15,642 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 93 treesize of output 183 [2021-01-06 16:27:15,648 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-06 16:27:15,649 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 16:27:15,650 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 16:27:15,651 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:27:15,666 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:15,667 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,669 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:15,670 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,672 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:27:15,673 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:15,673 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,674 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 16:27:15,676 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,678 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,679 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,680 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 16:27:15,682 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:27:15,683 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:15,684 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,685 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:15,686 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,688 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 16:27:15,689 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-06 16:27:15,689 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:27:15,690 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:15,691 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,693 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:27:15,694 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:15,695 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,696 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 16:27:15,697 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,699 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:27:15,700 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:27:15,701 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:27:15,703 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:27:15,738 INFO L625 ElimStorePlain]: treesize reduction 8, result has 83.7 percent of original size [2021-01-06 16:27:15,742 INFO L547 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:27:15,742 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 17 variables, input treesize:312, output treesize:4 [2021-01-06 16:27:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:27:15,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:27:15,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2021-01-06 16:27:15,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789481940] [2021-01-06 16:27:15,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-06 16:27:15,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:27:15,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-06 16:27:15,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=580, Unknown=2, NotChecked=0, Total=650 [2021-01-06 16:27:15,756 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 26 states. [2021-01-06 16:27:25,708 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2021-01-06 16:27:31,989 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 89 [2021-01-06 16:27:38,510 WARN L197 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 116 [2021-01-06 16:28:42,990 WARN L197 SmtUtils]: Spent 1.01 m on a formula simplification. DAG size of input: 122 DAG size of output: 119 [2021-01-06 16:30:15,996 WARN L197 SmtUtils]: Spent 1.48 m on a formula simplification. DAG size of input: 183 DAG size of output: 176 [2021-01-06 16:30:20,176 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71