/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/forester-heap/sll-optional-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 06:23:29,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 06:23:29,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 06:23:29,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 06:23:29,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 06:23:29,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 06:23:29,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 06:23:29,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 06:23:29,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 06:23:29,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 06:23:29,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 06:23:29,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 06:23:29,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 06:23:29,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 06:23:29,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 06:23:29,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 06:23:29,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 06:23:29,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 06:23:29,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 06:23:29,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 06:23:29,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 06:23:29,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 06:23:29,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 06:23:29,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 06:23:29,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 06:23:29,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 06:23:29,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 06:23:29,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 06:23:29,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 06:23:29,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 06:23:29,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 06:23:29,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 06:23:29,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 06:23:29,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 06:23:29,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 06:23:29,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 06:23:29,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 06:23:29,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 06:23:29,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 06:23:29,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 06:23:29,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 06:23:29,124 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 06:23:29,151 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 06:23:29,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 06:23:29,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 06:23:29,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 06:23:29,153 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 06:23:29,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 06:23:29,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 06:23:29,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 06:23:29,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 06:23:29,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 06:23:29,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 06:23:29,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 06:23:29,155 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 06:23:29,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 06:23:29,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 06:23:29,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 06:23:29,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 06:23:29,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 06:23:29,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 06:23:29,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 06:23:29,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 06:23:29,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 06:23:29,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 06:23:29,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 06:23:29,157 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 06:23:29,158 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 [2020-12-23 06:23:29,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 06:23:29,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 06:23:29,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 06:23:29,546 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 06:23:29,547 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 06:23:29,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i [2020-12-23 06:23:29,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d77409bee/c5fc725b38134b7faeeaa76ddf0cdc48/FLAG667e3f6c8 [2020-12-23 06:23:30,281 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 06:23:30,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2020-12-23 06:23:30,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d77409bee/c5fc725b38134b7faeeaa76ddf0cdc48/FLAG667e3f6c8 [2020-12-23 06:23:30,532 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d77409bee/c5fc725b38134b7faeeaa76ddf0cdc48 [2020-12-23 06:23:30,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 06:23:30,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 06:23:30,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 06:23:30,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 06:23:30,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 06:23:30,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:23:30" (1/1) ... [2020-12-23 06:23:30,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291291eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:30, skipping insertion in model container [2020-12-23 06:23:30,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:23:30" (1/1) ... [2020-12-23 06:23:30,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 06:23:30,627 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],StructAccessExpression[IdentifierExpression[~head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem13,],base],StructAccessExpression[IdentifierExpression[#t~mem13,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 06:23:30,941 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/forester-heap/sll-optional-1.i[22688,22701] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 06:23:30,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:23:30,959 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],StructAccessExpression[IdentifierExpression[~head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem13,],base],StructAccessExpression[IdentifierExpression[#t~mem13,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 06:23:31,018 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/forester-heap/sll-optional-1.i[22688,22701] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 06:23:31,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:23:31,094 INFO L208 MainTranslator]: Completed translation [2020-12-23 06:23:31,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:31 WrapperNode [2020-12-23 06:23:31,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 06:23:31,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 06:23:31,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 06:23:31,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 06:23:31,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:31" (1/1) ... [2020-12-23 06:23:31,149 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:31" (1/1) ... [2020-12-23 06:23:31,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 06:23:31,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 06:23:31,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 06:23:31,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 06:23:31,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:31" (1/1) ... [2020-12-23 06:23:31,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:31" (1/1) ... [2020-12-23 06:23:31,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:31" (1/1) ... [2020-12-23 06:23:31,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:31" (1/1) ... [2020-12-23 06:23:31,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:31" (1/1) ... [2020-12-23 06:23:31,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:31" (1/1) ... [2020-12-23 06:23:31,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:31" (1/1) ... [2020-12-23 06:23:31,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 06:23:31,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 06:23:31,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 06:23:31,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 06:23:31,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23: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 [2020-12-23 06:23:31,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 06:23:31,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 06:23:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 06:23:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 06:23:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 06:23:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 06:23:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 06:23:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 06:23:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 06:23:31,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 06:23:31,862 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 06:23:31,863 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-23 06:23:31,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:23:31 BoogieIcfgContainer [2020-12-23 06:23:31,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 06:23:31,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 06:23:31,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 06:23:31,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 06:23:31,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 06:23:30" (1/3) ... [2020-12-23 06:23:31,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2257101e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:23:31, skipping insertion in model container [2020-12-23 06:23:31,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:23:31" (2/3) ... [2020-12-23 06:23:31,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2257101e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:23:31, skipping insertion in model container [2020-12-23 06:23:31,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:23:31" (3/3) ... [2020-12-23 06:23:31,874 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2020-12-23 06:23:31,880 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 06:23:31,885 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 06:23:31,905 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 06:23:31,932 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 06:23:31,932 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 06:23:31,953 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 06:23:31,956 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 06:23:31,957 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 06:23:31,957 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 06:23:31,957 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 06:23:31,957 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 06:23:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-12-23 06:23:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 06:23:31,975 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:23:31,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:23:31,976 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:23:31,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:23:31,982 INFO L82 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2020-12-23 06:23:31,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:23:31,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219297368] [2020-12-23 06:23:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:23:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:23:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:23:32,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219297368] [2020-12-23 06:23:32,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:23:32,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 06:23:32,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859744484] [2020-12-23 06:23:32,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 06:23:32,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:23:32,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 06:23:32,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 06:23:32,246 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-12-23 06:23:32,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:23:32,270 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2020-12-23 06:23:32,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 06:23:32,271 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-12-23 06:23:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:23:32,297 INFO L225 Difference]: With dead ends: 51 [2020-12-23 06:23:32,298 INFO L226 Difference]: Without dead ends: 22 [2020-12-23 06:23:32,304 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 [2020-12-23 06:23:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-12-23 06:23:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-12-23 06:23:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-12-23 06:23:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-12-23 06:23:32,351 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2020-12-23 06:23:32,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:23:32,352 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-12-23 06:23:32,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 06:23:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-12-23 06:23:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:23:32,354 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:23:32,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:23:32,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 06:23:32,355 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:23:32,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:23:32,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2020-12-23 06:23:32,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:23:32,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705510139] [2020-12-23 06:23:32,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:23:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:23:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:23:32,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705510139] [2020-12-23 06:23:32,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:23:32,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 06:23:32,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502778485] [2020-12-23 06:23:32,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 06:23:32,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:23:32,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 06:23:32,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 06:23:32,540 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 4 states. [2020-12-23 06:23:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:23:32,598 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-12-23 06:23:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 06:23:32,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-23 06:23:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:23:32,600 INFO L225 Difference]: With dead ends: 37 [2020-12-23 06:23:32,600 INFO L226 Difference]: Without dead ends: 25 [2020-12-23 06:23:32,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:23:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-23 06:23:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-12-23 06:23:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-23 06:23:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2020-12-23 06:23:32,614 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2020-12-23 06:23:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:23:32,615 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-12-23 06:23:32,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 06:23:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2020-12-23 06:23:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:23:32,617 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:23:32,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:23:32,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 06:23:32,618 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:23:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:23:32,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2020-12-23 06:23:32,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:23:32,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445527661] [2020-12-23 06:23:32,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:23:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:23:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:23:32,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445527661] [2020-12-23 06:23:32,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:23:32,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 06:23:32,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956424182] [2020-12-23 06:23:32,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 06:23:32,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:23:32,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 06:23:32,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 06:23:32,830 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 6 states. [2020-12-23 06:23:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:23:33,035 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-12-23 06:23:33,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 06:23:33,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-23 06:23:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:23:33,037 INFO L225 Difference]: With dead ends: 41 [2020-12-23 06:23:33,037 INFO L226 Difference]: Without dead ends: 39 [2020-12-23 06:23:33,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-23 06:23:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-12-23 06:23:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2020-12-23 06:23:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-23 06:23:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-12-23 06:23:33,043 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2020-12-23 06:23:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:23:33,043 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-12-23 06:23:33,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 06:23:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-12-23 06:23:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:23:33,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:23:33,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:23:33,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 06:23:33,045 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:23:33,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:23:33,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2020-12-23 06:23:33,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:23:33,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787004088] [2020-12-23 06:23:33,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:23:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:23:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:23:33,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787004088] [2020-12-23 06:23:33,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:23:33,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 06:23:33,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057072941] [2020-12-23 06:23:33,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 06:23:33,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:23:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 06:23:33,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 06:23:33,177 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 7 states. [2020-12-23 06:23:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:23:33,529 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2020-12-23 06:23:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 06:23:33,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-23 06:23:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:23:33,531 INFO L225 Difference]: With dead ends: 93 [2020-12-23 06:23:33,531 INFO L226 Difference]: Without dead ends: 74 [2020-12-23 06:23:33,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-12-23 06:23:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-23 06:23:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2020-12-23 06:23:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-23 06:23:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-12-23 06:23:33,540 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2020-12-23 06:23:33,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:23:33,541 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-12-23 06:23:33,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 06:23:33,541 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-12-23 06:23:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:23:33,542 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:23:33,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:23:33,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 06:23:33,543 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:23:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:23:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2020-12-23 06:23:33,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:23:33,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562843251] [2020-12-23 06:23:33,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:23:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:23:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:23:33,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562843251] [2020-12-23 06:23:33,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:23:33,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 06:23:33,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337912088] [2020-12-23 06:23:33,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 06:23:33,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:23:33,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 06:23:33,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 06:23:33,613 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 6 states. [2020-12-23 06:23:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:23:33,792 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2020-12-23 06:23:33,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 06:23:33,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-23 06:23:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:23:33,794 INFO L225 Difference]: With dead ends: 87 [2020-12-23 06:23:33,794 INFO L226 Difference]: Without dead ends: 64 [2020-12-23 06:23:33,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 06:23:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-23 06:23:33,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2020-12-23 06:23:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-23 06:23:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2020-12-23 06:23:33,801 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2020-12-23 06:23:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:23:33,802 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2020-12-23 06:23:33,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 06:23:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-12-23 06:23:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-23 06:23:33,803 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:23:33,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:23:33,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 06:23:33,803 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:23:33,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:23:33,804 INFO L82 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2020-12-23 06:23:33,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:23:33,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96455743] [2020-12-23 06:23:33,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:23:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:23:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:23:33,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96455743] [2020-12-23 06:23:33,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:23:33,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 06:23:33,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685653655] [2020-12-23 06:23:33,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:23:33,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:23:33,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:23:33,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:23:33,871 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 5 states. [2020-12-23 06:23:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:23:34,034 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2020-12-23 06:23:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 06:23:34,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-23 06:23:34,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:23:34,036 INFO L225 Difference]: With dead ends: 86 [2020-12-23 06:23:34,036 INFO L226 Difference]: Without dead ends: 84 [2020-12-23 06:23:34,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 06:23:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-12-23 06:23:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 50. [2020-12-23 06:23:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-12-23 06:23:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2020-12-23 06:23:34,046 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 17 [2020-12-23 06:23:34,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:23:34,046 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2020-12-23 06:23:34,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:23:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2020-12-23 06:23:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 06:23:34,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:23:34,047 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:23:34,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 06:23:34,048 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:23:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:23:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2020-12-23 06:23:34,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:23:34,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706827964] [2020-12-23 06:23:34,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:23:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:23:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:23:34,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706827964] [2020-12-23 06:23:34,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929433898] [2020-12-23 06:23:34,425 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 [2020-12-23 06:23:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:23:34,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 42 conjunts are in the unsatisfiable core [2020-12-23 06:23:34,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:23:34,606 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 [2020-12-23 06:23:34,610 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:23:34,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:34,613 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:23:34,614 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 06:23:34,680 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:34,681 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 [2020-12-23 06:23:34,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:23:34,695 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:23:34,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:34,722 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 31 treesize of output 17 [2020-12-23 06:23:34,724 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:23:34,739 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:34,746 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 31 treesize of output 17 [2020-12-23 06:23:34,748 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:23:34,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:34,773 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:23:34,774 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:65 [2020-12-23 06:23:34,964 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:34,969 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2020-12-23 06:23:34,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:23:34,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:23:34,987 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:23:35,034 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:35,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:23:35,056 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2020-12-23 06:23:35,059 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:23:35,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:35,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:23:35,168 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:35,169 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 185 [2020-12-23 06:23:35,176 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:23:35,206 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:35,210 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:23:35,210 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:133, output treesize:108 [2020-12-23 06:23:35,353 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:35,354 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2020-12-23 06:23:35,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:23:35,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:23:35,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:23:35,363 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:23:35,447 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:35,450 INFO L443 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|], 12=[|v_#memory_$Pointer$.offset_41|], 20=[|v_#memory_$Pointer$.base_41|]} [2020-12-23 06:23:35,458 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:23:35,539 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:35,544 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:23:35,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:35,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:23:35,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:23:35,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:23:35,612 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 89 [2020-12-23 06:23:35,615 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 06:23:35,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:35,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:23:36,302 WARN L197 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 119 [2020-12-23 06:23:36,305 INFO L348 Elim1Store]: treesize reduction 212, result has 66.2 percent of original size [2020-12-23 06:23:36,305 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 194 treesize of output 492 [2020-12-23 06:23:36,328 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 06:23:36,330 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 9 disjuncts [2020-12-23 06:23:36,332 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:23:36,334 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:23:36,336 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 06:23:36,337 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 06:23:36,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[22, 4, 2, 1] term [2020-12-23 06:23:36,346 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 22 disjuncts [2020-12-23 06:23:36,349 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 06:23:36,351 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:23:36,353 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 8 disjuncts [2020-12-23 06:23:36,354 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:23:36,356 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 06:23:36,358 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 06:23:36,369 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:23:36,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:36,419 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:23:36,420 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:282, output treesize:202 [2020-12-23 06:23:38,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:23:38,788 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 46 [2020-12-23 06:23:38,793 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:23:38,820 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:23:38,828 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 06:23:38,829 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:203, output treesize:130 [2020-12-23 06:23:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:23:38,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:23:38,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-12-23 06:23:38,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014897238] [2020-12-23 06:23:38,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-23 06:23:38,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:23:38,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-23 06:23:38,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=247, Unknown=1, NotChecked=0, Total=306 [2020-12-23 06:23:38,968 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand 18 states. [2020-12-23 06:23:46,007 WARN L197 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2020-12-23 06:23:54,220 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-12-23 06:24:00,714 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 106 [2020-12-23 06:24:19,168 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 107 [2020-12-23 06:24:20,673 WARN L197 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2020-12-23 06:24:25,673 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-12-23 06:24:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:24:25,680 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2020-12-23 06:24:25,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 06:24:25,681 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2020-12-23 06:24:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:24:25,682 INFO L225 Difference]: With dead ends: 163 [2020-12-23 06:24:25,682 INFO L226 Difference]: Without dead ends: 144 [2020-12-23 06:24:25,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=232, Invalid=752, Unknown=8, NotChecked=0, Total=992 [2020-12-23 06:24:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-23 06:24:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 60. [2020-12-23 06:24:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-23 06:24:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2020-12-23 06:24:25,700 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 19 [2020-12-23 06:24:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:24:25,701 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2020-12-23 06:24:25,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-23 06:24:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-12-23 06:24:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 06:24:25,702 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:24:25,702 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:24:25,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 06:24:25,921 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:24:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:24:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash 86338246, now seen corresponding path program 1 times [2020-12-23 06:24:25,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:24:25,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156922809] [2020-12-23 06:24:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:24:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:24:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:24:26,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156922809] [2020-12-23 06:24:26,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496054050] [2020-12-23 06:24:26,095 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 [2020-12-23 06:24:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:24:26,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-23 06:24:26,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:24:26,192 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 [2020-12-23 06:24:26,193 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:26,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,199 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:24:26,199 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 06:24:26,249 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,250 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 [2020-12-23 06:24:26,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:24:26,258 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:26,276 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,277 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 2=[|v_#memory_int_32|]} [2020-12-23 06:24:26,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:24:26,287 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2020-12-23 06:24:26,288 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:26,301 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,306 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 25 treesize of output 13 [2020-12-23 06:24:26,308 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:26,321 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,323 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:24:26,324 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:59, output treesize:27 [2020-12-23 06:24:26,468 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,469 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2020-12-23 06:24:26,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:24:26,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:24:26,479 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:26,511 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,517 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:24:26,548 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:24:26,555 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2020-12-23 06:24:26,556 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:26,578 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,582 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:24:26,582 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:71, output treesize:40 [2020-12-23 06:24:26,665 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,666 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2020-12-23 06:24:26,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:24:26,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:24:26,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:24:26,678 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:26,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,721 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_34|], 4=[|v_#memory_int_37|]} [2020-12-23 06:24:26,724 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:24:26,759 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,778 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-12-23 06:24:26,779 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2020-12-23 06:24:26,781 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:26,810 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:26,822 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:24:26,823 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:87, output treesize:26 [2020-12-23 06:24:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:24:26,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:24:26,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-12-23 06:24:26,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538690980] [2020-12-23 06:24:26,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 06:24:26,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:24:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 06:24:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-12-23 06:24:26,926 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 15 states. [2020-12-23 06:24:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:24:27,985 INFO L93 Difference]: Finished difference Result 141 states and 178 transitions. [2020-12-23 06:24:27,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 06:24:27,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2020-12-23 06:24:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:24:27,991 INFO L225 Difference]: With dead ends: 141 [2020-12-23 06:24:27,991 INFO L226 Difference]: Without dead ends: 118 [2020-12-23 06:24:27,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2020-12-23 06:24:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-12-23 06:24:28,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 52. [2020-12-23 06:24:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-23 06:24:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2020-12-23 06:24:28,002 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 19 [2020-12-23 06:24:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:24:28,003 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2020-12-23 06:24:28,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 06:24:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2020-12-23 06:24:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-23 06:24:28,004 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:24:28,004 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:24:28,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:24:28,220 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:24:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:24:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash -978098042, now seen corresponding path program 1 times [2020-12-23 06:24:28,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:24:28,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646500304] [2020-12-23 06:24:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:24:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:24:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:24:28,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646500304] [2020-12-23 06:24:28,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145592266] [2020-12-23 06:24:28,389 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 [2020-12-23 06:24:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:24:28,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 06:24:28,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:24:28,481 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 [2020-12-23 06:24:28,482 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:28,486 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:28,487 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:24:28,487 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 06:24:28,497 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 [2020-12-23 06:24:28,500 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:28,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:28,512 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 [2020-12-23 06:24:28,512 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:28,521 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:28,522 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:24:28,522 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2020-12-23 06:24:28,638 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:28,641 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 [2020-12-23 06:24:28,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:24:28,647 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:28,677 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:28,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:24:28,691 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 37 treesize of output 27 [2020-12-23 06:24:28,693 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:28,725 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:28,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:24:28,732 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 37 treesize of output 27 [2020-12-23 06:24:28,733 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:28,763 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:28,765 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:24:28,765 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:95, output treesize:60 [2020-12-23 06:24:28,927 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:28,928 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 20 treesize of output 30 [2020-12-23 06:24:28,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:24:28,931 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:24:28,933 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:29,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:29,015 INFO L443 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_43|], 6=[|v_#memory_$Pointer$.offset_45|], 12=[|v_#memory_$Pointer$.base_45|]} [2020-12-23 06:24:29,024 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:24:29,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:29,087 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:24:29,132 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:29,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:24:29,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:24:29,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:24:29,150 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2020-12-23 06:24:29,152 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:29,199 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:29,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:24:29,627 WARN L197 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2020-12-23 06:24:29,628 INFO L348 Elim1Store]: treesize reduction 111, result has 71.2 percent of original size [2020-12-23 06:24:29,628 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 131 treesize of output 323 [2020-12-23 06:24:29,644 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[19, 3, 2, 1] term [2020-12-23 06:24:29,644 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 19 disjuncts [2020-12-23 06:24:29,649 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 06:24:29,686 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:24:29,697 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:24:29,701 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:230, output treesize:141 [2020-12-23 06:24:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:24:31,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:24:31,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-12-23 06:24:31,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451385216] [2020-12-23 06:24:31,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 06:24:31,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:24:31,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 06:24:31,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=173, Unknown=1, NotChecked=0, Total=210 [2020-12-23 06:24:31,940 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 15 states. [2020-12-23 06:24:46,638 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 60 [2020-12-23 06:25:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:25:54,836 INFO L93 Difference]: Finished difference Result 304 states and 395 transitions. [2020-12-23 06:25:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-12-23 06:25:54,837 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2020-12-23 06:25:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:25:54,839 INFO L225 Difference]: With dead ends: 304 [2020-12-23 06:25:54,839 INFO L226 Difference]: Without dead ends: 281 [2020-12-23 06:25:54,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=517, Invalid=2225, Unknown=14, NotChecked=0, Total=2756 [2020-12-23 06:25:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-12-23 06:25:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 73. [2020-12-23 06:25:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-23 06:25:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2020-12-23 06:25:54,868 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 20 [2020-12-23 06:25:54,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:25:54,868 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2020-12-23 06:25:54,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 06:25:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2020-12-23 06:25:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-23 06:25:54,871 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:25:54,872 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] [2020-12-23 06:25:55,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:25:55,086 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:25:55,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:25:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1216610380, now seen corresponding path program 1 times [2020-12-23 06:25:55,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:25:55,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282645354] [2020-12-23 06:25:55,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:25:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:25:55,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282645354] [2020-12-23 06:25:55,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687783127] [2020-12-23 06:25:55,248 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 [2020-12-23 06:25:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:25:55,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-23 06:25:55,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:25:55,360 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 [2020-12-23 06:25:55,361 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:55,366 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:55,367 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:55,367 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 06:25:55,376 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 [2020-12-23 06:25:55,379 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:55,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:55,394 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 [2020-12-23 06:25:55,395 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:55,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:55,404 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:25:55,404 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2020-12-23 06:25:55,459 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:55,459 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 [2020-12-23 06:25:55,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:25:55,463 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:55,488 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:55,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:55,497 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 37 treesize of output 27 [2020-12-23 06:25:55,498 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:55,522 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:55,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:55,529 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 37 treesize of output 27 [2020-12-23 06:25:55,531 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:55,553 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:55,556 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:55,556 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:89, output treesize:50 [2020-12-23 06:25:55,620 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_47|], 6=[|v_#memory_$Pointer$.offset_49|], 12=[|v_#memory_$Pointer$.base_49|]} [2020-12-23 06:25:55,625 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:55,664 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:55,669 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:55,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:55,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:55,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:55,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:55,710 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2020-12-23 06:25:55,714 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:25:55,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:25:55,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:25:55,899 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-12-23 06:25:55,900 INFO L348 Elim1Store]: treesize reduction 183, result has 32.5 percent of original size [2020-12-23 06:25:55,900 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 135 [2020-12-23 06:25:55,906 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 06:25:55,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 06:25:55,907 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 06:25:55,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 06:25:55,911 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:25:55,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 06:25:55,913 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 06:25:55,916 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 06:25:55,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 06:25:55,918 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 06:25:55,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 06:25:55,922 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:25:55,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 06:25:55,925 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 06:25:55,926 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:56,017 INFO L625 ElimStorePlain]: treesize reduction 51, result has 69.5 percent of original size [2020-12-23 06:25:56,022 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 06:25:56,022 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:163, output treesize:92 [2020-12-23 06:25:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:25:56,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:25:56,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-12-23 06:25:56,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578592886] [2020-12-23 06:25:56,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 06:25:56,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:25:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 06:25:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-12-23 06:25:56,229 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand 13 states. [2020-12-23 06:26:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:26:03,530 INFO L93 Difference]: Finished difference Result 172 states and 221 transitions. [2020-12-23 06:26:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 06:26:03,531 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-12-23 06:26:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:26:03,532 INFO L225 Difference]: With dead ends: 172 [2020-12-23 06:26:03,532 INFO L226 Difference]: Without dead ends: 170 [2020-12-23 06:26:03,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2020-12-23 06:26:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-23 06:26:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 58. [2020-12-23 06:26:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-23 06:26:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2020-12-23 06:26:03,555 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 21 [2020-12-23 06:26:03,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:26:03,555 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2020-12-23 06:26:03,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 06:26:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2020-12-23 06:26:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 06:26:03,556 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:26:03,557 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:26:03,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:26:03,767 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:26:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:26:03,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1984947091, now seen corresponding path program 1 times [2020-12-23 06:26:03,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:26:03,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368762943] [2020-12-23 06:26:03,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:26:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:26:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:26:03,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368762943] [2020-12-23 06:26:03,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767614364] [2020-12-23 06:26:03,850 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 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 [2020-12-23 06:26:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:26:03,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-23 06:26:03,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:26:03,937 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 [2020-12-23 06:26:03,938 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:03,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:03,945 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:03,946 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 06:26:03,976 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:03,978 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 [2020-12-23 06:26:03,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:03,982 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:03,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:03,998 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 31 treesize of output 17 [2020-12-23 06:26:03,999 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:04,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:04,012 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:04,013 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2020-12-23 06:26:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 06:26:04,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 06:26:04,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2020-12-23 06:26:04,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382946115] [2020-12-23 06:26:04,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 06:26:04,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:26:04,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 06:26:04,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-12-23 06:26:04,138 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand 7 states. [2020-12-23 06:26:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:26:04,535 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2020-12-23 06:26:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 06:26:04,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-12-23 06:26:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:26:04,536 INFO L225 Difference]: With dead ends: 109 [2020-12-23 06:26:04,537 INFO L226 Difference]: Without dead ends: 90 [2020-12-23 06:26:04,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-12-23 06:26:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-12-23 06:26:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2020-12-23 06:26:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-12-23 06:26:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2020-12-23 06:26:04,550 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 26 [2020-12-23 06:26:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:26:04,551 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2020-12-23 06:26:04,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 06:26:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2020-12-23 06:26:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 06:26:04,552 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:26:04,552 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:26:04,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-23 06:26:04,767 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:26:04,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:26:04,768 INFO L82 PathProgramCache]: Analyzing trace with hash -118277399, now seen corresponding path program 1 times [2020-12-23 06:26:04,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:26:04,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71008831] [2020-12-23 06:26:04,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:26:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:26:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:26:04,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71008831] [2020-12-23 06:26:04,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670481406] [2020-12-23 06:26:04,848 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 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 [2020-12-23 06:26:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:26:04,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-23 06:26:04,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:26:04,942 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 [2020-12-23 06:26:04,943 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:04,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:04,960 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 [2020-12-23 06:26:04,961 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:04,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:04,978 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 [2020-12-23 06:26:04,980 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:04,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:04,991 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:04,991 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2020-12-23 06:26:05,046 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:05,047 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 [2020-12-23 06:26:05,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:05,050 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:05,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:05,100 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_53|, |v_#memory_$Pointer$.offset_52|], 4=[|v_#memory_$Pointer$.offset_50|, |v_#memory_$Pointer$.base_51|]} [2020-12-23 06:26:05,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:26:05,111 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 [2020-12-23 06:26:05,113 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:05,148 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:05,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:26:05,158 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 [2020-12-23 06:26:05,159 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:05,182 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:05,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:26:05,193 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 39 treesize of output 27 [2020-12-23 06:26:05,194 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:05,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:05,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:26:05,226 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 39 treesize of output 27 [2020-12-23 06:26:05,228 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:05,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:05,251 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:05,251 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:128, output treesize:66 [2020-12-23 06:26:05,371 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:05,371 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 60 [2020-12-23 06:26:05,374 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 06:26:05,377 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:05,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:05,392 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2020-12-23 06:26:05,394 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:05,402 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:05,403 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:05,403 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:7 [2020-12-23 06:26:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:26:05,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:26:05,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-12-23 06:26:05,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353458298] [2020-12-23 06:26:05,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 06:26:05,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:26:05,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 06:26:05,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-23 06:26:05,419 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand 9 states. [2020-12-23 06:26:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:26:05,821 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2020-12-23 06:26:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 06:26:05,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-12-23 06:26:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:26:05,822 INFO L225 Difference]: With dead ends: 113 [2020-12-23 06:26:05,822 INFO L226 Difference]: Without dead ends: 64 [2020-12-23 06:26:05,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-23 06:26:05,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-23 06:26:05,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-12-23 06:26:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-23 06:26:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2020-12-23 06:26:05,833 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 26 [2020-12-23 06:26:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:26:05,833 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2020-12-23 06:26:05,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 06:26:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2020-12-23 06:26:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 06:26:05,834 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:26:05,834 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:26:06,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:26:06,049 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:26:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:26:06,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1426250389, now seen corresponding path program 1 times [2020-12-23 06:26:06,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:26:06,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377151926] [2020-12-23 06:26:06,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:26:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:26:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:26:06,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377151926] [2020-12-23 06:26:06,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467645175] [2020-12-23 06:26:06,540 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 [2020-12-23 06:26:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:26:06,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 54 conjunts are in the unsatisfiable core [2020-12-23 06:26:06,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:26:06,646 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 [2020-12-23 06:26:06,647 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:06,652 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:06,653 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:06,653 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 06:26:06,678 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:06,679 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 [2020-12-23 06:26:06,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:06,683 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:06,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:06,694 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:06,694 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2020-12-23 06:26:06,845 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:06,846 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2020-12-23 06:26:06,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:26:06,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:06,862 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:06,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:06,916 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-12-23 06:26:06,917 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:06,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:06,961 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-12-23 06:26:06,962 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:06,996 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:06,998 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:06,998 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:62 [2020-12-23 06:26:07,136 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:07,136 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 41 [2020-12-23 06:26:07,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:26:07,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:26:07,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:07,143 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:07,233 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:07,237 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_53|, |v_#memory_$Pointer$.base_54|], 4=[|v_#memory_$Pointer$.offset_55|, |v_#memory_$Pointer$.base_56|]} [2020-12-23 06:26:07,242 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:07,311 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:07,316 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:07,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:07,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, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2020-12-23 06:26:07,375 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:07,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:07,509 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:07,510 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 155 [2020-12-23 06:26:07,515 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:07,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:07,578 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:07,578 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:217, output treesize:115 [2020-12-23 06:26:07,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:26:07,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:26:07,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 06:26:07,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 06:26:07,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 06:26:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:26:07,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:26:07,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2020-12-23 06:26:07,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444866134] [2020-12-23 06:26:07,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-23 06:26:07,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:26:07,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-23 06:26:07,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2020-12-23 06:26:07,955 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 20 states. [2020-12-23 06:26:08,700 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 74 [2020-12-23 06:26:10,963 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-12-23 06:26:15,197 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2020-12-23 06:26:15,397 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2020-12-23 06:26:15,681 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2020-12-23 06:26:16,281 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2020-12-23 06:26:16,695 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2020-12-23 06:26:16,896 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2020-12-23 06:26:17,074 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2020-12-23 06:26:17,464 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2020-12-23 06:26:17,675 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2020-12-23 06:26:17,817 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2020-12-23 06:26:17,981 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2020-12-23 06:26:18,270 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2020-12-23 06:26:18,462 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2020-12-23 06:26:18,681 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2020-12-23 06:26:18,885 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2020-12-23 06:26:19,164 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2020-12-23 06:26:19,322 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2020-12-23 06:26:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:26:19,323 INFO L93 Difference]: Finished difference Result 252 states and 314 transitions. [2020-12-23 06:26:19,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-23 06:26:19,323 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2020-12-23 06:26:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:26:19,325 INFO L225 Difference]: With dead ends: 252 [2020-12-23 06:26:19,325 INFO L226 Difference]: Without dead ends: 233 [2020-12-23 06:26:19,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=492, Invalid=1958, Unknown=0, NotChecked=0, Total=2450 [2020-12-23 06:26:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-12-23 06:26:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 127. [2020-12-23 06:26:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-23 06:26:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 164 transitions. [2020-12-23 06:26:19,352 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 164 transitions. Word has length 29 [2020-12-23 06:26:19,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:26:19,353 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 164 transitions. [2020-12-23 06:26:19,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-23 06:26:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 164 transitions. [2020-12-23 06:26:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 06:26:19,354 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:26:19,355 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:26:19,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:26:19,568 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:26:19,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:26:19,569 INFO L82 PathProgramCache]: Analyzing trace with hash 350604015, now seen corresponding path program 1 times [2020-12-23 06:26:19,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:26:19,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541593084] [2020-12-23 06:26:19,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:26:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:26:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:26:19,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541593084] [2020-12-23 06:26:19,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011523603] [2020-12-23 06:26:19,898 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 [2020-12-23 06:26:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:26:19,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-23 06:26:19,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:26:19,998 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 [2020-12-23 06:26:19,999 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:20,004 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:20,005 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:20,006 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 06:26:20,037 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:20,038 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 [2020-12-23 06:26:20,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:20,042 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:20,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:20,062 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 31 treesize of output 17 [2020-12-23 06:26:20,063 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:20,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:20,080 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:20,080 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:43 [2020-12-23 06:26:20,233 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:20,234 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2020-12-23 06:26:20,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:26:20,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:20,239 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:20,275 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:20,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:26:20,342 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:20,342 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 118 [2020-12-23 06:26:20,347 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:20,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:20,379 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:20,380 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:79 [2020-12-23 06:26:20,498 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:20,498 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2020-12-23 06:26:20,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 06:26:20,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:26:20,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:26:20,503 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:26:20,556 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:20,557 INFO L443 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_58|], 20=[|v_#memory_$Pointer$.base_60|]} [2020-12-23 06:26:20,561 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:20,603 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:20,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:26:21,349 WARN L197 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 117 [2020-12-23 06:26:21,350 INFO L348 Elim1Store]: treesize reduction 170, result has 68.0 percent of original size [2020-12-23 06:26:21,350 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 132 treesize of output 400 [2020-12-23 06:26:21,360 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:26:21,361 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:26:21,362 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 06:26:21,363 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 06:26:21,364 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 06:26:21,365 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-23 06:26:21,366 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 06:26:21,367 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 06:26:21,368 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-23 06:26:21,371 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[19, 4, 2, 1] term [2020-12-23 06:26:21,371 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 19 disjuncts [2020-12-23 06:26:21,373 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 06:26:21,374 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 06:26:21,375 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 06:26:21,375 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-23 06:26:21,376 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 06:26:21,377 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 06:26:21,384 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 06:26:21,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:26:21,429 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 06:26:21,430 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:171, output treesize:132 [2020-12-23 06:26:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 06:26:27,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:26:27,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-12-23 06:26:27,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37824526] [2020-12-23 06:26:27,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 06:26:27,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:26:27,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 06:26:27,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=230, Unknown=3, NotChecked=0, Total=272 [2020-12-23 06:26:27,679 INFO L87 Difference]: Start difference. First operand 127 states and 164 transitions. Second operand 17 states. [2020-12-23 06:26:48,333 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2020-12-23 06:26:54,570 WARN L197 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2020-12-23 06:27:05,069 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2020-12-23 06:27:09,310 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 70 [2020-12-23 06:27:32,153 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 71 [2020-12-23 06:27:36,351 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 72