/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-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:19:29,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:19:29,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:19:29,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:19:29,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:19:29,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:19:29,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:19:29,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:19:29,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:19:29,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:19:29,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:19:29,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:19:29,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:19:29,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:19:29,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:19:29,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:19:29,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:19:29,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:19:29,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:19:29,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:19:29,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:19:29,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:19:29,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:19:29,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:19:29,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:19:29,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:19:29,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:19:29,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:19:29,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:19:29,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:19:29,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:19:29,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:19:29,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:19:29,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:19:29,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:19:29,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:19:29,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:19:29,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:19:29,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:19:29,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:19:29,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:19:29,772 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:19:29,827 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:19:29,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:19:29,834 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:19:29,834 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:19:29,834 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:19:29,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:19:29,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:19:29,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:19:29,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:19:29,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:19:29,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:19:29,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:19:29,838 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:19:29,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:19:29,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:19:29,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:19:29,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:19:29,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:19:29,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:19:29,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:19:29,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:19:29,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:19:29,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:19:29,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:19:29,840 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:19:29,840 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:19:30,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:19:30,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:19:30,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:19:30,299 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:19:30,300 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:19:30,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2021-01-06 16:19:30,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/888d6b207/ccee3101be0245cf984f2dfc3498e1e9/FLAG189b700c8 [2021-01-06 16:19:31,182 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:19:31,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2021-01-06 16:19:31,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/888d6b207/ccee3101be0245cf984f2dfc3498e1e9/FLAG189b700c8 [2021-01-06 16:19:31,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/888d6b207/ccee3101be0245cf984f2dfc3498e1e9 [2021-01-06 16:19:31,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:19:31,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:19:31,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:19:31,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:19:31,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:19:31,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:19:31" (1/1) ... [2021-01-06 16:19:31,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@131c217b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:19:31, skipping insertion in model container [2021-01-06 16:19:31,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:19:31" (1/1) ... [2021-01-06 16:19:31,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:19:31,301 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~root~0,],base],StructAccessExpression[IdentifierExpression[~root~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~root~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~root~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem18,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem18,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem23,],base],StructAccessExpression[IdentifierExpression[#t~mem23,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem24,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem24,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~pred~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~pred~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pred~0,],base],StructAccessExpression[IdentifierExpression[~pred~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pred~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~pred~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~root~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] [2021-01-06 16:19:31,750 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-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2021-01-06 16:19:31,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:19:31,768 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~root~0,],base],StructAccessExpression[IdentifierExpression[~root~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~root~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~root~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem17,],base],StructAccessExpression[IdentifierExpression[#t~mem17,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem18,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem18,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem23,],base],StructAccessExpression[IdentifierExpression[#t~mem23,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem24,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem24,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~pred~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~pred~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pred~0,],base],StructAccessExpression[IdentifierExpression[~pred~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pred~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~pred~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~root~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~t~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~p~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p~0,],base],StructAccessExpression[IdentifierExpression[~p~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] [2021-01-06 16:19:31,819 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-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2021-01-06 16:19:31,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:19:31,882 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:19:31,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:19:31 WrapperNode [2021-01-06 16:19:31,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:19:31,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:19:31,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:19:31,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:19:31,894 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:19:31" (1/1) ... [2021-01-06 16:19:31,915 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:19:31" (1/1) ... [2021-01-06 16:19:31,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:19:31,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:19:31,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:19:31,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:19:31,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:19:31" (1/1) ... [2021-01-06 16:19:31,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:19:31" (1/1) ... [2021-01-06 16:19:31,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:19:31" (1/1) ... [2021-01-06 16:19:31,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:19:31" (1/1) ... [2021-01-06 16:19:31,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:19:31" (1/1) ... [2021-01-06 16:19:31,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:19:31" (1/1) ... [2021-01-06 16:19:31,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:19:31" (1/1) ... [2021-01-06 16:19:32,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:19:32,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:19:32,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:19:32,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:19:32,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:19:31" (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:19:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 16:19:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 16:19:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 16:19:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 16:19:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:19:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 16:19:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 16:19:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:19:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:19:32,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:19:32,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:19:32,741 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-01-06 16:19:32,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:19:32 BoogieIcfgContainer [2021-01-06 16:19:32,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:19:32,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:19:32,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:19:32,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:19:32,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:19:31" (1/3) ... [2021-01-06 16:19:32,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251585b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:19:32, skipping insertion in model container [2021-01-06 16:19:32,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:19:31" (2/3) ... [2021-01-06 16:19:32,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251585b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:19:32, skipping insertion in model container [2021-01-06 16:19:32,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:19:32" (3/3) ... [2021-01-06 16:19:32,752 INFO L111 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2021-01-06 16:19:32,759 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:19:32,764 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 16:19:32,786 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 16:19:32,816 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:19:32,817 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:19:32,817 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:19:32,817 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:19:32,817 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:19:32,817 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:19:32,818 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:19:32,818 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:19:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2021-01-06 16:19:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:19:32,843 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:32,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:32,845 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:32,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:32,852 INFO L82 PathProgramCache]: Analyzing trace with hash -372423763, now seen corresponding path program 1 times [2021-01-06 16:19:32,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:32,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147456372] [2021-01-06 16:19:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:33,093 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:19:33,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147456372] [2021-01-06 16:19:33,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:19:33,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 16:19:33,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848897393] [2021-01-06 16:19:33,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 16:19:33,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:33,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 16:19:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:19:33,127 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2021-01-06 16:19:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:19:33,158 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2021-01-06 16:19:33,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 16:19:33,159 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2021-01-06 16:19:33,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:19:33,177 INFO L225 Difference]: With dead ends: 98 [2021-01-06 16:19:33,177 INFO L226 Difference]: Without dead ends: 43 [2021-01-06 16:19:33,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:19:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-01-06 16:19:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-01-06 16:19:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2021-01-06 16:19:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2021-01-06 16:19:33,233 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 16 [2021-01-06 16:19:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:19:33,234 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2021-01-06 16:19:33,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 16:19:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2021-01-06 16:19:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 16:19:33,238 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:33,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:33,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:19:33,239 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:33,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1965259271, now seen corresponding path program 1 times [2021-01-06 16:19:33,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:33,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977208531] [2021-01-06 16:19:33,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:33,375 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:19:33,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977208531] [2021-01-06 16:19:33,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:19:33,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:19:33,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514534942] [2021-01-06 16:19:33,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:19:33,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:33,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:19:33,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:19:33,379 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 3 states. [2021-01-06 16:19:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:19:33,399 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2021-01-06 16:19:33,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:19:33,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-01-06 16:19:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:19:33,402 INFO L225 Difference]: With dead ends: 71 [2021-01-06 16:19:33,403 INFO L226 Difference]: Without dead ends: 51 [2021-01-06 16:19:33,404 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:19:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-01-06 16:19:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-01-06 16:19:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-01-06 16:19:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2021-01-06 16:19:33,412 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 21 [2021-01-06 16:19:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:19:33,413 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2021-01-06 16:19:33,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:19:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2021-01-06 16:19:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 16:19:33,414 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:33,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:33,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:19:33,415 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:33,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:33,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1325693868, now seen corresponding path program 1 times [2021-01-06 16:19:33,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:33,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754606687] [2021-01-06 16:19:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:33,501 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:19:33,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754606687] [2021-01-06 16:19:33,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:19:33,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:19:33,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173072660] [2021-01-06 16:19:33,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:19:33,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:33,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:19:33,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:19:33,510 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 3 states. [2021-01-06 16:19:33,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:19:33,544 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2021-01-06 16:19:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:19:33,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-06 16:19:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:19:33,547 INFO L225 Difference]: With dead ends: 89 [2021-01-06 16:19:33,548 INFO L226 Difference]: Without dead ends: 53 [2021-01-06 16:19:33,549 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:19:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-01-06 16:19:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-01-06 16:19:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-01-06 16:19:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2021-01-06 16:19:33,562 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 27 [2021-01-06 16:19:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:19:33,565 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2021-01-06 16:19:33,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:19:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2021-01-06 16:19:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 16:19:33,567 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:33,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:33,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:19:33,569 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:33,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:33,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2143342318, now seen corresponding path program 1 times [2021-01-06 16:19:33,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:33,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000954299] [2021-01-06 16:19:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:33,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000954299] [2021-01-06 16:19:33,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:19:33,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:19:33,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785816974] [2021-01-06 16:19:33,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:19:33,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:33,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:19:33,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:19:33,725 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 5 states. [2021-01-06 16:19:33,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:19:33,907 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2021-01-06 16:19:33,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:19:33,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2021-01-06 16:19:33,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:19:33,909 INFO L225 Difference]: With dead ends: 78 [2021-01-06 16:19:33,909 INFO L226 Difference]: Without dead ends: 74 [2021-01-06 16:19:33,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:19:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-01-06 16:19:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2021-01-06 16:19:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2021-01-06 16:19:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2021-01-06 16:19:33,919 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 27 [2021-01-06 16:19:33,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:19:33,920 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2021-01-06 16:19:33,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:19:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2021-01-06 16:19:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 16:19:33,921 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:33,921 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:33,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:19:33,922 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:33,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:33,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1881014477, now seen corresponding path program 1 times [2021-01-06 16:19:33,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:33,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485823892] [2021-01-06 16:19:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:34,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485823892] [2021-01-06 16:19:34,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:19:34,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:19:34,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694484971] [2021-01-06 16:19:34,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:19:34,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:19:34,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:19:34,019 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand 5 states. [2021-01-06 16:19:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:19:34,160 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2021-01-06 16:19:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:19:34,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2021-01-06 16:19:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:19:34,162 INFO L225 Difference]: With dead ends: 80 [2021-01-06 16:19:34,162 INFO L226 Difference]: Without dead ends: 72 [2021-01-06 16:19:34,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:19:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-01-06 16:19:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2021-01-06 16:19:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-01-06 16:19:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2021-01-06 16:19:34,170 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 29 [2021-01-06 16:19:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:19:34,171 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2021-01-06 16:19:34,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:19:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2021-01-06 16:19:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 16:19:34,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:34,173 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:34,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 16:19:34,173 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:34,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1389249843, now seen corresponding path program 1 times [2021-01-06 16:19:34,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:34,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180251195] [2021-01-06 16:19:34,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:34,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180251195] [2021-01-06 16:19:34,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:19:34,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:19:34,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505546748] [2021-01-06 16:19:34,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:19:34,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:34,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:19:34,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:19:34,232 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand 5 states. [2021-01-06 16:19:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:19:34,335 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2021-01-06 16:19:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:19:34,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2021-01-06 16:19:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:19:34,337 INFO L225 Difference]: With dead ends: 80 [2021-01-06 16:19:34,337 INFO L226 Difference]: Without dead ends: 69 [2021-01-06 16:19:34,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:19:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-01-06 16:19:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2021-01-06 16:19:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-01-06 16:19:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2021-01-06 16:19:34,345 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 29 [2021-01-06 16:19:34,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:19:34,345 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2021-01-06 16:19:34,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:19:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2021-01-06 16:19:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 16:19:34,347 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:34,347 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:34,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 16:19:34,347 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash 115063225, now seen corresponding path program 1 times [2021-01-06 16:19:34,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:34,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976953626] [2021-01-06 16:19:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:34,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976953626] [2021-01-06 16:19:34,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241214380] [2021-01-06 16:19:34,509 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:19:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:34,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-06 16:19:34,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:19:34,733 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:19:34,734 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:34,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:34,746 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:34,747 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-01-06 16:19:34,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:19:34,831 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 0 case distinctions, treesize of input 27 treesize of output 11 [2021-01-06 16:19:34,834 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:34,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:34,842 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:34,842 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2021-01-06 16:19:34,888 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:34,888 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 34 [2021-01-06 16:19:34,892 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:34,909 INFO L625 ElimStorePlain]: treesize reduction 12, result has 64.7 percent of original size [2021-01-06 16:19:34,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:34,915 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:19:34,915 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2021-01-06 16:19:34,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:34,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:35,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2021-01-06 16:19:35,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:35,047 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 15 treesize of output 7 [2021-01-06 16:19:35,048 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:35,050 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:35,051 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:35,051 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-01-06 16:19:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:35,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:19:35,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2021-01-06 16:19:35,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679556020] [2021-01-06 16:19:35,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 16:19:35,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:35,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 16:19:35,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-01-06 16:19:35,092 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 16 states. [2021-01-06 16:19:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:19:35,686 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2021-01-06 16:19:35,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 16:19:35,687 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2021-01-06 16:19:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:19:35,690 INFO L225 Difference]: With dead ends: 82 [2021-01-06 16:19:35,690 INFO L226 Difference]: Without dead ends: 76 [2021-01-06 16:19:35,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2021-01-06 16:19:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-01-06 16:19:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2021-01-06 16:19:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-01-06 16:19:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2021-01-06 16:19:35,702 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 31 [2021-01-06 16:19:35,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:19:35,702 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2021-01-06 16:19:35,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 16:19:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2021-01-06 16:19:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 16:19:35,704 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:35,704 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:35,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-06 16:19:35,918 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:35,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:35,919 INFO L82 PathProgramCache]: Analyzing trace with hash 978464889, now seen corresponding path program 1 times [2021-01-06 16:19:35,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:35,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751431982] [2021-01-06 16:19:35,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:36,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751431982] [2021-01-06 16:19:36,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025711731] [2021-01-06 16:19:36,020 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:19:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:36,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjunts are in the unsatisfiable core [2021-01-06 16:19:36,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:19:36,163 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:19:36,164 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:36,174 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:36,174 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:36,175 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-01-06 16:19:36,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:19:36,209 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 0 case distinctions, treesize of input 27 treesize of output 11 [2021-01-06 16:19:36,210 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:36,216 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:36,217 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:36,218 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2021-01-06 16:19:36,270 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:36,270 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 34 [2021-01-06 16:19:36,272 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:36,312 INFO L625 ElimStorePlain]: treesize reduction 12, result has 64.7 percent of original size [2021-01-06 16:19:36,314 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:36,315 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:19:36,315 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2021-01-06 16:19:36,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:36,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:36,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:36,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:36,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2021-01-06 16:19:36,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:36,498 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 15 treesize of output 7 [2021-01-06 16:19:36,500 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:36,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:36,502 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:36,502 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-01-06 16:19:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:36,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:19:36,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2021-01-06 16:19:36,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506136246] [2021-01-06 16:19:36,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 16:19:36,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:36,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 16:19:36,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-01-06 16:19:36,524 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 16 states. [2021-01-06 16:19:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:19:37,160 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2021-01-06 16:19:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 16:19:37,161 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2021-01-06 16:19:37,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:19:37,162 INFO L225 Difference]: With dead ends: 91 [2021-01-06 16:19:37,163 INFO L226 Difference]: Without dead ends: 87 [2021-01-06 16:19:37,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2021-01-06 16:19:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-01-06 16:19:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2021-01-06 16:19:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2021-01-06 16:19:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2021-01-06 16:19:37,175 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 31 [2021-01-06 16:19:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:19:37,176 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2021-01-06 16:19:37,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 16:19:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2021-01-06 16:19:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 16:19:37,179 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:37,179 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:37,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:19:37,381 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:37,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:37,381 INFO L82 PathProgramCache]: Analyzing trace with hash -20007500, now seen corresponding path program 1 times [2021-01-06 16:19:37,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:37,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376672689] [2021-01-06 16:19:37,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:37,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376672689] [2021-01-06 16:19:37,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963359598] [2021-01-06 16:19:37,589 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:19:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:37,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-06 16:19:37,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:19:37,834 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 13 treesize of output 9 [2021-01-06 16:19:37,835 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:37,846 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:37,850 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 13 treesize of output 9 [2021-01-06 16:19:37,851 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:37,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:37,865 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:37,865 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:31 [2021-01-06 16:19:37,919 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_43|]} [2021-01-06 16:19:37,926 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 29 treesize of output 19 [2021-01-06 16:19:37,927 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:37,941 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:37,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:19:37,947 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 76 [2021-01-06 16:19:37,953 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:37,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:37,987 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:37,988 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 104 [2021-01-06 16:19:37,990 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:38,009 INFO L625 ElimStorePlain]: treesize reduction 52, result has 33.3 percent of original size [2021-01-06 16:19:38,010 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:38,011 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:132, output treesize:26 [2021-01-06 16:19:38,080 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 19 treesize of output 11 [2021-01-06 16:19:38,081 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:38,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:38,092 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 15 treesize of output 7 [2021-01-06 16:19:38,093 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:38,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:38,100 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:19:38,100 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:18 [2021-01-06 16:19:38,176 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:38,177 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-01-06 16:19:38,179 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:38,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:38,186 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:38,188 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2021-01-06 16:19:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:38,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:19:38,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-01-06 16:19:38,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367978107] [2021-01-06 16:19:38,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 16:19:38,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:38,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 16:19:38,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-01-06 16:19:38,195 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 16 states. [2021-01-06 16:19:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:19:38,936 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2021-01-06 16:19:38,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 16:19:38,937 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2021-01-06 16:19:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:19:38,938 INFO L225 Difference]: With dead ends: 99 [2021-01-06 16:19:38,938 INFO L226 Difference]: Without dead ends: 93 [2021-01-06 16:19:38,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2021-01-06 16:19:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-01-06 16:19:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2021-01-06 16:19:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-01-06 16:19:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2021-01-06 16:19:38,946 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 33 [2021-01-06 16:19:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:19:38,947 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2021-01-06 16:19:38,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 16:19:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2021-01-06 16:19:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 16:19:38,949 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:38,949 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:39,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:19:39,163 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:39,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:39,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1998658321, now seen corresponding path program 1 times [2021-01-06 16:19:39,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:39,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015079730] [2021-01-06 16:19:39,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:39,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015079730] [2021-01-06 16:19:39,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791774637] [2021-01-06 16:19:39,371 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:19:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:39,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 39 conjunts are in the unsatisfiable core [2021-01-06 16:19:39,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:19:39,542 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 13 treesize of output 9 [2021-01-06 16:19:39,543 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:39,553 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:39,558 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 13 treesize of output 9 [2021-01-06 16:19:39,559 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:39,572 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:39,575 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:39,575 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:31 [2021-01-06 16:19:39,612 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_45|]} [2021-01-06 16:19:39,617 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 29 treesize of output 19 [2021-01-06 16:19:39,618 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:39,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:39,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:19:39,638 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 76 [2021-01-06 16:19:39,641 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:39,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:39,677 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:39,678 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 104 [2021-01-06 16:19:39,681 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:39,703 INFO L625 ElimStorePlain]: treesize reduction 52, result has 33.3 percent of original size [2021-01-06 16:19:39,704 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:39,705 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:132, output treesize:26 [2021-01-06 16:19:39,767 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 19 treesize of output 11 [2021-01-06 16:19:39,769 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:39,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:39,782 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 15 treesize of output 7 [2021-01-06 16:19:39,783 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:39,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:39,790 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:19:39,791 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:18 [2021-01-06 16:19:39,838 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:39,838 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-01-06 16:19:39,840 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:39,844 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:39,847 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:39,847 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2021-01-06 16:19:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:39,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:19:39,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-01-06 16:19:39,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132383095] [2021-01-06 16:19:39,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 16:19:39,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:39,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 16:19:39,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-01-06 16:19:39,863 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand 16 states. [2021-01-06 16:19:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:19:40,514 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2021-01-06 16:19:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 16:19:40,514 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2021-01-06 16:19:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:19:40,515 INFO L225 Difference]: With dead ends: 99 [2021-01-06 16:19:40,515 INFO L226 Difference]: Without dead ends: 87 [2021-01-06 16:19:40,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2021-01-06 16:19:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-01-06 16:19:40,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2021-01-06 16:19:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-01-06 16:19:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2021-01-06 16:19:40,522 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 35 [2021-01-06 16:19:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:19:40,523 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2021-01-06 16:19:40,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 16:19:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2021-01-06 16:19:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 16:19:40,524 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:40,524 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:40,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:19:40,738 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:40,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash -973955345, now seen corresponding path program 2 times [2021-01-06 16:19:40,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:40,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328961665] [2021-01-06 16:19:40,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:40,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328961665] [2021-01-06 16:19:40,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309149613] [2021-01-06 16:19:40,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:19:40,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:19:40,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:19:40,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 39 conjunts are in the unsatisfiable core [2021-01-06 16:19:40,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:19:41,059 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 13 treesize of output 9 [2021-01-06 16:19:41,060 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:41,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:41,078 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 13 treesize of output 9 [2021-01-06 16:19:41,078 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:41,088 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:41,091 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:41,091 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:31 [2021-01-06 16:19:41,134 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_45|]} [2021-01-06 16:19:41,138 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 29 treesize of output 19 [2021-01-06 16:19:41,139 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:41,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:41,176 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:41,177 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 137 [2021-01-06 16:19:41,182 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:41,206 INFO L625 ElimStorePlain]: treesize reduction 52, result has 53.2 percent of original size [2021-01-06 16:19:41,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:19:41,210 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2021-01-06 16:19:41,212 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:41,219 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:41,219 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:41,220 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:132, output treesize:26 [2021-01-06 16:19:41,286 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 19 treesize of output 11 [2021-01-06 16:19:41,288 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:41,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:41,304 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 15 treesize of output 7 [2021-01-06 16:19:41,307 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:41,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:41,330 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:19:41,331 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:18 [2021-01-06 16:19:41,380 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:41,380 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-01-06 16:19:41,387 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:41,391 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:41,393 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:41,397 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2021-01-06 16:19:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:41,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:19:41,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-01-06 16:19:41,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217494448] [2021-01-06 16:19:41,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 16:19:41,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:41,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 16:19:41,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-01-06 16:19:41,416 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand 16 states. [2021-01-06 16:19:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:19:41,970 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2021-01-06 16:19:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 16:19:41,970 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2021-01-06 16:19:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:19:41,971 INFO L225 Difference]: With dead ends: 90 [2021-01-06 16:19:41,971 INFO L226 Difference]: Without dead ends: 77 [2021-01-06 16:19:41,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2021-01-06 16:19:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-01-06 16:19:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2021-01-06 16:19:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2021-01-06 16:19:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2021-01-06 16:19:41,977 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 35 [2021-01-06 16:19:41,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:19:41,977 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2021-01-06 16:19:41,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 16:19:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2021-01-06 16:19:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 16:19:41,978 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:19:41,978 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:19:42,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-01-06 16:19:42,193 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:19:42,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:19:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1696962272, now seen corresponding path program 2 times [2021-01-06 16:19:42,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:19:42,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440041745] [2021-01-06 16:19:42,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:19:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:19:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:42,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440041745] [2021-01-06 16:19:42,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147378271] [2021-01-06 16:19:42,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:19:42,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:19:42,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:19:42,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 39 conjunts are in the unsatisfiable core [2021-01-06 16:19:42,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:19:42,507 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:19:42,507 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:42,511 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:42,512 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:42,512 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-06 16:19:42,542 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:42,543 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-06 16:19:42,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,549 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:42,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:42,565 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:19:42,565 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:42,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:42,575 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:42,575 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2021-01-06 16:19:42,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:19:42,588 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-01-06 16:19:42,589 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:42,594 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:42,595 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:42,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2021-01-06 16:19:42,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:19:42,625 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 0 case distinctions, treesize of input 19 treesize of output 18 [2021-01-06 16:19:42,628 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:42,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:42,659 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:42,659 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2021-01-06 16:19:42,724 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-06 16:19:42,725 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 21 [2021-01-06 16:19:42,726 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:42,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:42,737 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 16:19:42,737 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2021-01-06 16:19:42,840 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:42,841 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 68 [2021-01-06 16:19:42,844 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:42,889 INFO L625 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2021-01-06 16:19:42,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:19:42,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:19:42,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:19:42,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:19:42,923 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-06 16:19:42,924 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:37 [2021-01-06 16:19:42,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:19:42,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:19:42,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:19:42,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,940 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:42,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:19:44,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:19:44,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:44,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:44,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:19:44,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:44,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:45,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:45,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:19:45,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2021-01-06 16:19:45,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:19:45,211 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-01-06 16:19:45,212 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:19:45,217 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:19:45,218 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:19:45,219 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-01-06 16:19:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:19:45,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:19:45,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2021-01-06 16:19:45,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034668361] [2021-01-06 16:19:45,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 16:19:45,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:19:45,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 16:19:45,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=219, Unknown=1, NotChecked=0, Total=272 [2021-01-06 16:19:45,235 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand 17 states. [2021-01-06 16:20:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:20:12,500 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2021-01-06 16:20:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 16:20:12,500 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2021-01-06 16:20:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:20:12,502 INFO L225 Difference]: With dead ends: 109 [2021-01-06 16:20:12,502 INFO L226 Difference]: Without dead ends: 103 [2021-01-06 16:20:12,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=208, Invalid=777, Unknown=7, NotChecked=0, Total=992 [2021-01-06 16:20:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-01-06 16:20:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2021-01-06 16:20:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2021-01-06 16:20:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2021-01-06 16:20:12,509 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 35 [2021-01-06 16:20:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:20:12,509 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2021-01-06 16:20:12,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 16:20:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2021-01-06 16:20:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 16:20:12,510 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:20:12,510 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:20:12,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:20:12,719 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:20:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:20:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1996664224, now seen corresponding path program 1 times [2021-01-06 16:20:12,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:20:12,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742779340] [2021-01-06 16:20:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:20:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:20:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:20:12,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742779340] [2021-01-06 16:20:12,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992054125] [2021-01-06 16:20:12,974 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:20:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:20:13,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 41 conjunts are in the unsatisfiable core [2021-01-06 16:20:13,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:20:13,087 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:20:13,088 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:13,093 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:13,094 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:13,094 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-06 16:20:13,114 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:13,114 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-06 16:20:13,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,119 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:13,129 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:13,133 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:20:13,134 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:13,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:13,144 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:13,144 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2021-01-06 16:20:13,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:20:13,157 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-01-06 16:20:13,160 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:13,167 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:13,167 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:13,168 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2021-01-06 16:20:13,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:20:13,214 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 0 case distinctions, treesize of input 19 treesize of output 18 [2021-01-06 16:20:13,215 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:13,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:13,225 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:13,225 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2021-01-06 16:20:13,273 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-06 16:20:13,273 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 21 [2021-01-06 16:20:13,275 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:13,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:13,291 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 16:20:13,291 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2021-01-06 16:20:13,373 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:13,373 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 68 [2021-01-06 16:20:13,377 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:13,427 INFO L625 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2021-01-06 16:20:13,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:13,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:13,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:20:13,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:13,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,452 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-06 16:20:13,452 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:37 [2021-01-06 16:20:13,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:13,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:13,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:20:13,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:13,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:13,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:15,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:20:15,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:15,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:15,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:20:15,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:15,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:15,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:20:15,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:15,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2021-01-06 16:20:15,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:15,806 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-01-06 16:20:15,808 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:15,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:15,813 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:15,814 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-01-06 16:20:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:20:15,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:20:15,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2021-01-06 16:20:15,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510527812] [2021-01-06 16:20:15,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 16:20:15,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:20:15,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 16:20:15,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=220, Unknown=1, NotChecked=0, Total=272 [2021-01-06 16:20:15,825 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. Second operand 17 states. [2021-01-06 16:20:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:20:25,318 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2021-01-06 16:20:25,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 16:20:25,319 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2021-01-06 16:20:25,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:20:25,320 INFO L225 Difference]: With dead ends: 124 [2021-01-06 16:20:25,320 INFO L226 Difference]: Without dead ends: 118 [2021-01-06 16:20:25,322 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=221, Invalid=832, Unknown=3, NotChecked=0, Total=1056 [2021-01-06 16:20:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-06 16:20:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2021-01-06 16:20:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-06 16:20:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2021-01-06 16:20:25,328 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 35 [2021-01-06 16:20:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:20:25,328 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2021-01-06 16:20:25,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 16:20:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2021-01-06 16:20:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 16:20:25,329 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:20:25,329 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:20:25,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:20:25,542 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:20:25,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:20:25,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1258149093, now seen corresponding path program 1 times [2021-01-06 16:20:25,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:20:25,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753324678] [2021-01-06 16:20:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:20:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:20:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:20:25,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753324678] [2021-01-06 16:20:25,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707897134] [2021-01-06 16:20:25,785 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:20:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:20:25,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 37 conjunts are in the unsatisfiable core [2021-01-06 16:20:25,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:20:25,916 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:20:25,917 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:25,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:25,923 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:25,923 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-06 16:20:25,959 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:25,960 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-06 16:20:25,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:25,964 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:25,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:25,982 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:20:25,983 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:25,995 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:25,996 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:25,996 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2021-01-06 16:20:26,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:20:26,037 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-01-06 16:20:26,042 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:26,052 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:26,053 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:26,053 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2021-01-06 16:20:26,096 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:26,096 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2021-01-06 16:20:26,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:26,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:26,101 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:26,113 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:26,117 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-01-06 16:20:26,119 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:26,130 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:26,131 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:26,131 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2021-01-06 16:20:26,179 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-06 16:20:26,179 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2021-01-06 16:20:26,180 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:26,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:26,194 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 16:20:26,195 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2021-01-06 16:20:26,256 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-01-06 16:20:26,257 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:26,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:26,274 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-06 16:20:26,274 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2021-01-06 16:20:26,350 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-01-06 16:20:26,352 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:26,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:26,362 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:26,362 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2021-01-06 16:20:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:20:26,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:20:26,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2021-01-06 16:20:26,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580717885] [2021-01-06 16:20:26,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 16:20:26,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:20:26,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 16:20:26,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-01-06 16:20:26,392 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand 18 states. [2021-01-06 16:20:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:20:27,194 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2021-01-06 16:20:27,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 16:20:27,195 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2021-01-06 16:20:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:20:27,196 INFO L225 Difference]: With dead ends: 122 [2021-01-06 16:20:27,196 INFO L226 Difference]: Without dead ends: 112 [2021-01-06 16:20:27,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2021-01-06 16:20:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-01-06 16:20:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2021-01-06 16:20:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-01-06 16:20:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2021-01-06 16:20:27,202 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 37 [2021-01-06 16:20:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:20:27,202 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2021-01-06 16:20:27,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 16:20:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2021-01-06 16:20:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 16:20:27,203 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:20:27,203 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:20:27,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 16:20:27,412 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:20:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:20:27,413 INFO L82 PathProgramCache]: Analyzing trace with hash -233446117, now seen corresponding path program 3 times [2021-01-06 16:20:27,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:20:27,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773486786] [2021-01-06 16:20:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:20:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:20:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:20:27,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773486786] [2021-01-06 16:20:27,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052479879] [2021-01-06 16:20:27,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:20:27,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-06 16:20:27,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:20:27,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 59 conjunts are in the unsatisfiable core [2021-01-06 16:20:27,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:20:27,811 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:20:27,812 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:27,813 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:27,813 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:27,814 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-06 16:20:27,888 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:27,888 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-06 16:20:27,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:27,892 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:27,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:27,904 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:27,904 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2021-01-06 16:20:27,946 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 13 treesize of output 9 [2021-01-06 16:20:27,947 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:27,961 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:27,967 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 13 treesize of output 9 [2021-01-06 16:20:27,968 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:27,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:27,983 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:27,984 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2021-01-06 16:20:28,039 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,040 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2021-01-06 16:20:28,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:20:28,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:20:28,045 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,073 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_59|], 2=[|v_#memory_$Pointer$.offset_51|, |v_#memory_$Pointer$.base_51|]} [2021-01-06 16:20:28,079 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:20:28,080 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:20:28,118 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2021-01-06 16:20:28,119 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,140 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,172 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-01-06 16:20:28,172 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 1 case distinctions, treesize of input 45 treesize of output 31 [2021-01-06 16:20:28,174 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,195 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,195 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:50 [2021-01-06 16:20:28,282 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,282 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 175 [2021-01-06 16:20:28,285 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2021-01-06 16:20:28,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:20:28,290 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,326 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 126 [2021-01-06 16:20:28,329 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:20:28,363 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2021-01-06 16:20:28,364 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,387 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,388 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,388 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:206, output treesize:152 [2021-01-06 16:20:28,454 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_61|], 6=[|v_#memory_$Pointer$.base_53|, |v_#memory_$Pointer$.offset_53|]} [2021-01-06 16:20:28,460 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 66 [2021-01-06 16:20:28,461 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,545 INFO L625 ElimStorePlain]: treesize reduction 28, result has 92.3 percent of original size [2021-01-06 16:20:28,600 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,600 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 326 treesize of output 295 [2021-01-06 16:20:28,605 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-06 16:20:28,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 16:20:28,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:20:28,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-06 16:20:28,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 16:20:28,609 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-06 16:20:28,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:20:28,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:20:28,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 16:20:28,617 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2021-01-06 16:20:28,688 INFO L625 ElimStorePlain]: treesize reduction 792, result has 22.5 percent of original size [2021-01-06 16:20:28,730 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,730 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 220 treesize of output 227 [2021-01-06 16:20:28,733 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,748 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,749 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:385, output treesize:77 [2021-01-06 16:20:28,811 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,811 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 50 [2021-01-06 16:20:28,813 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 16:20:28,815 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:20:28,828 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,833 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-01-06 16:20:28,834 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:20:28,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:20:28,846 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:20:28,847 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:18 [2021-01-06 16:20:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:20:28,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:20:28,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-01-06 16:20:28,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165134851] [2021-01-06 16:20:28,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-06 16:20:28,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:20:28,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-06 16:20:28,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-01-06 16:20:28,941 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 21 states. [2021-01-06 16:20:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:20:30,235 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2021-01-06 16:20:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 16:20:30,236 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2021-01-06 16:20:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:20:30,237 INFO L225 Difference]: With dead ends: 125 [2021-01-06 16:20:30,237 INFO L226 Difference]: Without dead ends: 119 [2021-01-06 16:20:30,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2021-01-06 16:20:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-01-06 16:20:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2021-01-06 16:20:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2021-01-06 16:20:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2021-01-06 16:20:30,247 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 37 [2021-01-06 16:20:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:20:30,247 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2021-01-06 16:20:30,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-06 16:20:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2021-01-06 16:20:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 16:20:30,248 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:20:30,248 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:20:30,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 16:20:30,464 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:20:30,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:20:30,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1007382053, now seen corresponding path program 1 times [2021-01-06 16:20:30,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:20:30,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302104696] [2021-01-06 16:20:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:20:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 16:20:30,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 16:20:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 16:20:30,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 16:20:30,538 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 16:20:30,539 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 16:20:30,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 16:20:30,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:20:30 BoogieIcfgContainer [2021-01-06 16:20:30,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:20:30,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:20:30,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:20:30,597 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:20:30,597 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:19:32" (3/4) ... [2021-01-06 16:20:30,600 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 16:20:30,656 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-ext2-properties/list_and_tree_cnstr-1.i-witness.graphml [2021-01-06 16:20:30,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:20:30,658 INFO L168 Benchmark]: Toolchain (without parser) took 59421.22 ms. Allocated memory was 174.1 MB in the beginning and 307.2 MB in the end (delta: 133.2 MB). Free memory was 148.2 MB in the beginning and 237.6 MB in the end (delta: -89.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 8.0 GB. [2021-01-06 16:20:30,658 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 174.1 MB. Free memory is still 146.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:20:30,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.76 ms. Allocated memory is still 174.1 MB. Free memory was 147.9 MB in the beginning and 125.3 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:20:30,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.51 ms. Allocated memory is still 174.1 MB. Free memory was 125.3 MB in the beginning and 122.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:20:30,659 INFO L168 Benchmark]: Boogie Preprocessor took 68.27 ms. Allocated memory is still 174.1 MB. Free memory was 122.9 MB in the beginning and 156.2 MB in the end (delta: -33.3 MB). Peak memory consumption was 5.7 MB. Max. memory is 8.0 GB. [2021-01-06 16:20:30,659 INFO L168 Benchmark]: RCFGBuilder took 723.30 ms. Allocated memory is still 174.1 MB. Free memory was 156.2 MB in the beginning and 123.6 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. [2021-01-06 16:20:30,660 INFO L168 Benchmark]: TraceAbstraction took 57850.77 ms. Allocated memory was 174.1 MB in the beginning and 307.2 MB in the end (delta: 133.2 MB). Free memory was 123.6 MB in the beginning and 241.8 MB in the end (delta: -118.2 MB). Peak memory consumption was 15.5 MB. Max. memory is 8.0 GB. [2021-01-06 16:20:30,660 INFO L168 Benchmark]: Witness Printer took 60.32 ms. Allocated memory is still 307.2 MB. Free memory was 241.8 MB in the beginning and 237.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 16:20:30,663 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 174.1 MB. Free memory is still 146.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 643.76 ms. Allocated memory is still 174.1 MB. Free memory was 147.9 MB in the beginning and 125.3 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.51 ms. Allocated memory is still 174.1 MB. Free memory was 125.3 MB in the beginning and 122.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.27 ms. Allocated memory is still 174.1 MB. Free memory was 122.9 MB in the beginning and 156.2 MB in the end (delta: -33.3 MB). Peak memory consumption was 5.7 MB. Max. memory is 8.0 GB. * RCFGBuilder took 723.30 ms. Allocated memory is still 174.1 MB. Free memory was 156.2 MB in the beginning and 123.6 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 57850.77 ms. Allocated memory was 174.1 MB in the beginning and 307.2 MB in the end (delta: 133.2 MB). Free memory was 123.6 MB in the beginning and 241.8 MB in the end (delta: -118.2 MB). Peak memory consumption was 15.5 MB. Max. memory is 8.0 GB. * Witness Printer took 60.32 ms. Allocated memory is still 307.2 MB. Free memory was 241.8 MB in the beginning and 237.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 620]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) [L555] COND FALSE !(__VERIFIER_nondet_int()) [L574] n = ((void *)0) [L575] struct TreeNode* pred; [L576] COND TRUE \read(*root) [L577] pred = ((void *)0) [L578] n = root [L579] EXPR n->left [L579] n->left || n->right [L579] EXPR n->right [L579] n->left || n->right [L579] COND FALSE !(n->left || n->right) [L586] COND FALSE !(\read(*pred)) [L592] root = ((void *)0) [L576] COND FALSE !(\read(*root)) [L595] List a = (List) malloc(sizeof(struct node)); [L596] COND FALSE !(a == 0) [L597] List t; [L598] List p = a; [L599] COND TRUE __VERIFIER_nondet_int() [L600] p->h = 1 [L601] t = (List) malloc(sizeof(struct node)) [L602] COND FALSE !(t == 0) [L603] p->n = t [L604] EXPR p->n [L604] p = p->n [L599] COND FALSE !(__VERIFIER_nondet_int()) [L606] COND TRUE __VERIFIER_nondet_int() [L607] p->h = 2 [L608] t = (List) malloc(sizeof(struct node)) [L609] COND FALSE !(t == 0) [L610] p->n = t [L611] EXPR p->n [L611] p = p->n [L606] COND FALSE !(__VERIFIER_nondet_int()) [L613] p->h = 3 [L614] p = a [L615] EXPR p->h [L615] COND FALSE !(p->h == 2) [L617] EXPR p->h [L617] COND TRUE p->h == 1 [L618] EXPR p->n [L618] p = p->n [L617] EXPR p->h [L617] COND FALSE !(p->h == 1) [L619] EXPR p->h [L619] COND TRUE p->h != 3 [L620] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 57.7s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 42.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 823 SDtfs, 839 SDslu, 4413 SDs, 0 SdLazy, 2774 SolverSat, 347 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 21.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 512 GetRequests, 255 SyntacticMatches, 14 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 27.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 201 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 743 ConstructedInterpolants, 39 QuantifiedInterpolants, 229413 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1519 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 42/134 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...