/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-DerefFreeMemtrack-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 17:14:08,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 17:14:08,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 17:14:08,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 17:14:08,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 17:14:08,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 17:14:08,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 17:14:08,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 17:14:08,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 17:14:08,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 17:14:08,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 17:14:08,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 17:14:08,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 17:14:08,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 17:14:08,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 17:14:08,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 17:14:08,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 17:14:08,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 17:14:08,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 17:14:08,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 17:14:08,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 17:14:08,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 17:14:08,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 17:14:08,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 17:14:08,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 17:14:08,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 17:14:08,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 17:14:08,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 17:14:08,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 17:14:08,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 17:14:08,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 17:14:08,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 17:14:08,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 17:14:08,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 17:14:08,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 17:14:08,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 17:14:08,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 17:14:08,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 17:14:08,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 17:14:08,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 17:14:08,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 17:14:08,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2020-12-23 17:14:08,327 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 17:14:08,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 17:14:08,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 17:14:08,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 17:14:08,331 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 17:14:08,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 17:14:08,331 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-23 17:14:08,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 17:14:08,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 17:14:08,332 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-23 17:14:08,333 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-23 17:14:08,333 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-23 17:14:08,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 17:14:08,334 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-23 17:14:08,334 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 17:14:08,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 17:14:08,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 17:14:08,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 17:14:08,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 17:14:08,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 17:14:08,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 17:14:08,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 17:14:08,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 17:14:08,337 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 17:14:08,339 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 17:14:08,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 17:14:08,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 17:14:08,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 17:14:08,758 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 17:14:08,759 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 17:14:08,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2020-12-23 17:14:08,850 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fcdd7b49c/f54fd1a2ce1042cfb19395957f9717b6/FLAG16dd5c58e [2020-12-23 17:14:09,621 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 17:14:09,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2020-12-23 17:14:09,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fcdd7b49c/f54fd1a2ce1042cfb19395957f9717b6/FLAG16dd5c58e [2020-12-23 17:14:09,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fcdd7b49c/f54fd1a2ce1042cfb19395957f9717b6 [2020-12-23 17:14:09,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 17:14:09,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 17:14:09,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 17:14:09,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 17:14:09,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 17:14:09,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 05:14:09" (1/1) ... [2020-12-23 17:14:09,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4526703d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:09, skipping insertion in model container [2020-12-23 17:14:09,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 05:14:09" (1/1) ... [2020-12-23 17:14:09,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 17:14:09,963 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~null~0,],base],StructAccessExpression[IdentifierExpression[~null~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~null~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~null~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~null~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~null~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],StructAccessExpression[IdentifierExpression[~list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem7,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem11,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] [2020-12-23 17:14:10,352 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/dll-rb-sentinel-2.i[22673,22686] [2020-12-23 17:14:10,360 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/dll-rb-sentinel-2.i[22743,22756] [2020-12-23 17:14:10,361 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/dll-rb-sentinel-2.i[22807,22820] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2020-12-23 17:14:10,363 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/dll-rb-sentinel-2.i[22902,22915] [2020-12-23 17:14:10,365 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/dll-rb-sentinel-2.i[22974,22987] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2020-12-23 17:14:10,367 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/dll-rb-sentinel-2.i[23113,23126] [2020-12-23 17:14:10,371 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/dll-rb-sentinel-2.i[23187,23200] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2020-12-23 17:14:10,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 17:14:10,405 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~null~0,],base],StructAccessExpression[IdentifierExpression[~null~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~null~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~null~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~null~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~null~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],StructAccessExpression[IdentifierExpression[~list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem7,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem11,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] [2020-12-23 17:14:10,450 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/dll-rb-sentinel-2.i[22673,22686] [2020-12-23 17:14:10,452 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/dll-rb-sentinel-2.i[22743,22756] [2020-12-23 17:14:10,453 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/dll-rb-sentinel-2.i[22807,22820] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2020-12-23 17:14:10,454 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/dll-rb-sentinel-2.i[22902,22915] [2020-12-23 17:14:10,455 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/dll-rb-sentinel-2.i[22974,22987] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2020-12-23 17:14:10,457 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/dll-rb-sentinel-2.i[23113,23126] [2020-12-23 17:14:10,458 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/dll-rb-sentinel-2.i[23187,23200] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2020-12-23 17:14:10,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 17:14:10,544 INFO L208 MainTranslator]: Completed translation [2020-12-23 17:14:10,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10 WrapperNode [2020-12-23 17:14:10,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 17:14:10,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 17:14:10,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 17:14:10,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 17:14:10,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10" (1/1) ... [2020-12-23 17:14:10,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10" (1/1) ... [2020-12-23 17:14:10,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 17:14:10,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 17:14:10,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 17:14:10,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 17:14:10,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10" (1/1) ... [2020-12-23 17:14:10,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10" (1/1) ... [2020-12-23 17:14:10,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10" (1/1) ... [2020-12-23 17:14:10,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10" (1/1) ... [2020-12-23 17:14:10,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10" (1/1) ... [2020-12-23 17:14:10,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10" (1/1) ... [2020-12-23 17:14:10,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10" (1/1) ... [2020-12-23 17:14:10,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 17:14:10,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 17:14:10,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 17:14:10,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 17:14:10,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10" (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 17:14:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 17:14:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 17:14:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 17:14:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 17:14:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 17:14:10,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 17:14:10,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 17:14:10,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 17:14:10,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 17:14:10,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 17:14:11,703 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 17:14:11,704 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2020-12-23 17:14:11,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 05:14:11 BoogieIcfgContainer [2020-12-23 17:14:11,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 17:14:11,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 17:14:11,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 17:14:11,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 17:14:11,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 05:14:09" (1/3) ... [2020-12-23 17:14:11,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53af33de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 05:14:11, skipping insertion in model container [2020-12-23 17:14:11,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:14:10" (2/3) ... [2020-12-23 17:14:11,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53af33de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 05:14:11, skipping insertion in model container [2020-12-23 17:14:11,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 05:14:11" (3/3) ... [2020-12-23 17:14:11,716 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2020-12-23 17:14:11,724 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 17:14:11,731 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 80 error locations. [2020-12-23 17:14:11,753 INFO L253 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2020-12-23 17:14:11,777 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 17:14:11,777 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-23 17:14:11,777 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 17:14:11,778 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 17:14:11,778 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 17:14:11,778 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 17:14:11,778 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 17:14:11,778 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 17:14:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2020-12-23 17:14:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 17:14:11,810 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:11,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 17:14:11,812 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:11,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:11,819 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2020-12-23 17:14:11,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:11,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080227765] [2020-12-23 17:14:11,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:12,023 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 17:14:12,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080227765] [2020-12-23 17:14:12,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:12,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:14:12,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207140493] [2020-12-23 17:14:12,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:14:12,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:12,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:14:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:14:12,051 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 3 states. [2020-12-23 17:14:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:12,365 INFO L93 Difference]: Finished difference Result 196 states and 203 transitions. [2020-12-23 17:14:12,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:14:12,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 17:14:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:12,379 INFO L225 Difference]: With dead ends: 196 [2020-12-23 17:14:12,380 INFO L226 Difference]: Without dead ends: 194 [2020-12-23 17:14:12,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:14:12,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-12-23 17:14:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 168. [2020-12-23 17:14:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 17:14:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 176 transitions. [2020-12-23 17:14:12,436 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 176 transitions. Word has length 3 [2020-12-23 17:14:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:12,436 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 176 transitions. [2020-12-23 17:14:12,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:14:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 176 transitions. [2020-12-23 17:14:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 17:14:12,437 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:12,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 17:14:12,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 17:14:12,439 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:12,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:12,440 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-12-23 17:14:12,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:12,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124916526] [2020-12-23 17:14:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:12,497 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 17:14:12,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124916526] [2020-12-23 17:14:12,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:12,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:14:12,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408657967] [2020-12-23 17:14:12,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:14:12,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:12,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:14:12,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:14:12,501 INFO L87 Difference]: Start difference. First operand 168 states and 176 transitions. Second operand 3 states. [2020-12-23 17:14:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:12,702 INFO L93 Difference]: Finished difference Result 164 states and 171 transitions. [2020-12-23 17:14:12,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:14:12,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 17:14:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:12,705 INFO L225 Difference]: With dead ends: 164 [2020-12-23 17:14:12,705 INFO L226 Difference]: Without dead ends: 164 [2020-12-23 17:14:12,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:14:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-23 17:14:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2020-12-23 17:14:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-12-23 17:14:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 171 transitions. [2020-12-23 17:14:12,726 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 171 transitions. Word has length 3 [2020-12-23 17:14:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:12,726 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 171 transitions. [2020-12-23 17:14:12,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:14:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 171 transitions. [2020-12-23 17:14:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-23 17:14:12,730 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:12,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:12,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 17:14:12,731 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:12,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2020-12-23 17:14:12,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:12,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878001936] [2020-12-23 17:14:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:12,794 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 17:14:12,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878001936] [2020-12-23 17:14:12,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:12,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:14:12,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42574986] [2020-12-23 17:14:12,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:14:12,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:14:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:14:12,797 INFO L87 Difference]: Start difference. First operand 164 states and 171 transitions. Second operand 3 states. [2020-12-23 17:14:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:13,040 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2020-12-23 17:14:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:14:13,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-23 17:14:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:13,045 INFO L225 Difference]: With dead ends: 160 [2020-12-23 17:14:13,045 INFO L226 Difference]: Without dead ends: 160 [2020-12-23 17:14:13,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:14:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-23 17:14:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2020-12-23 17:14:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-12-23 17:14:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2020-12-23 17:14:13,072 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 7 [2020-12-23 17:14:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:13,073 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2020-12-23 17:14:13,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:14:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2020-12-23 17:14:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-23 17:14:13,074 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:13,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:13,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 17:14:13,075 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2020-12-23 17:14:13,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:13,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375488554] [2020-12-23 17:14:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:13,202 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 17:14:13,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375488554] [2020-12-23 17:14:13,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:13,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:14:13,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384345863] [2020-12-23 17:14:13,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:14:13,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:13,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:14:13,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:14:13,205 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 3 states. [2020-12-23 17:14:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:13,454 INFO L93 Difference]: Finished difference Result 175 states and 181 transitions. [2020-12-23 17:14:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:14:13,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-23 17:14:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:13,457 INFO L225 Difference]: With dead ends: 175 [2020-12-23 17:14:13,457 INFO L226 Difference]: Without dead ends: 175 [2020-12-23 17:14:13,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:14:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-23 17:14:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 162. [2020-12-23 17:14:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-12-23 17:14:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 170 transitions. [2020-12-23 17:14:13,468 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 170 transitions. Word has length 7 [2020-12-23 17:14:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:13,468 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 170 transitions. [2020-12-23 17:14:13,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:14:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 170 transitions. [2020-12-23 17:14:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 17:14:13,469 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:13,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:13,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 17:14:13,470 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1253214510, now seen corresponding path program 1 times [2020-12-23 17:14:13,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:13,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534995051] [2020-12-23 17:14:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:13,569 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 17:14:13,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534995051] [2020-12-23 17:14:13,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:13,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 17:14:13,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459021161] [2020-12-23 17:14:13,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:14:13,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:13,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:14:13,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:14:13,572 INFO L87 Difference]: Start difference. First operand 162 states and 170 transitions. Second operand 4 states. [2020-12-23 17:14:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:13,931 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2020-12-23 17:14:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:14:13,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-23 17:14:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:13,933 INFO L225 Difference]: With dead ends: 162 [2020-12-23 17:14:13,933 INFO L226 Difference]: Without dead ends: 162 [2020-12-23 17:14:13,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 17:14:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-12-23 17:14:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2020-12-23 17:14:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-12-23 17:14:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2020-12-23 17:14:13,941 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 13 [2020-12-23 17:14:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:13,941 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2020-12-23 17:14:13,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:14:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2020-12-23 17:14:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 17:14:13,942 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:13,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:13,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 17:14:13,943 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:13,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1253214511, now seen corresponding path program 1 times [2020-12-23 17:14:13,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:13,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997551853] [2020-12-23 17:14:13,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:14,037 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 17:14:14,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997551853] [2020-12-23 17:14:14,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:14,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 17:14:14,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659100550] [2020-12-23 17:14:14,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:14:14,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:14:14,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:14:14,041 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand 4 states. [2020-12-23 17:14:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:14,445 INFO L93 Difference]: Finished difference Result 190 states and 200 transitions. [2020-12-23 17:14:14,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:14:14,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-23 17:14:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:14,447 INFO L225 Difference]: With dead ends: 190 [2020-12-23 17:14:14,448 INFO L226 Difference]: Without dead ends: 190 [2020-12-23 17:14:14,449 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 17:14:14,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-12-23 17:14:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 158. [2020-12-23 17:14:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-12-23 17:14:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2020-12-23 17:14:14,455 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 13 [2020-12-23 17:14:14,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:14,456 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2020-12-23 17:14:14,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:14:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2020-12-23 17:14:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 17:14:14,456 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:14,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:14,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 17:14:14,457 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:14,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:14,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1748301425, now seen corresponding path program 1 times [2020-12-23 17:14:14,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:14,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637249048] [2020-12-23 17:14:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:14,529 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 17:14:14,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637249048] [2020-12-23 17:14:14,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:14,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:14:14,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335836317] [2020-12-23 17:14:14,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:14:14,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:14,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:14:14,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:14:14,532 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 5 states. [2020-12-23 17:14:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:14,981 INFO L93 Difference]: Finished difference Result 213 states and 231 transitions. [2020-12-23 17:14:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:14:14,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-23 17:14:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:14,983 INFO L225 Difference]: With dead ends: 213 [2020-12-23 17:14:14,983 INFO L226 Difference]: Without dead ends: 213 [2020-12-23 17:14:14,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 17:14:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-12-23 17:14:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 157. [2020-12-23 17:14:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 17:14:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2020-12-23 17:14:14,990 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 15 [2020-12-23 17:14:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:14,990 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2020-12-23 17:14:14,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:14:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2020-12-23 17:14:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 17:14:14,991 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:14,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:14,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 17:14:14,992 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:14,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1748301426, now seen corresponding path program 1 times [2020-12-23 17:14:14,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:14,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838262287] [2020-12-23 17:14:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:15,110 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 17:14:15,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838262287] [2020-12-23 17:14:15,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:15,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:14:15,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451224098] [2020-12-23 17:14:15,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:14:15,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:15,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:14:15,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:14:15,115 INFO L87 Difference]: Start difference. First operand 157 states and 169 transitions. Second operand 5 states. [2020-12-23 17:14:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:15,606 INFO L93 Difference]: Finished difference Result 242 states and 261 transitions. [2020-12-23 17:14:15,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 17:14:15,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-23 17:14:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:15,609 INFO L225 Difference]: With dead ends: 242 [2020-12-23 17:14:15,609 INFO L226 Difference]: Without dead ends: 242 [2020-12-23 17:14:15,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:14:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-12-23 17:14:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 156. [2020-12-23 17:14:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-12-23 17:14:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2020-12-23 17:14:15,615 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 15 [2020-12-23 17:14:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:15,616 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2020-12-23 17:14:15,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:14:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2020-12-23 17:14:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 17:14:15,617 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:15,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:15,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 17:14:15,617 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:15,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:15,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1748352159, now seen corresponding path program 1 times [2020-12-23 17:14:15,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:15,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642375854] [2020-12-23 17:14:15,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:15,692 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 17:14:15,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642375854] [2020-12-23 17:14:15,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:15,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 17:14:15,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126118310] [2020-12-23 17:14:15,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:14:15,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:14:15,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:14:15,701 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand 5 states. [2020-12-23 17:14:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:16,082 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2020-12-23 17:14:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:14:16,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-23 17:14:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:16,086 INFO L225 Difference]: With dead ends: 195 [2020-12-23 17:14:16,087 INFO L226 Difference]: Without dead ends: 195 [2020-12-23 17:14:16,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 17:14:16,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-12-23 17:14:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2020-12-23 17:14:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 17:14:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2020-12-23 17:14:16,093 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 15 [2020-12-23 17:14:16,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:16,094 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2020-12-23 17:14:16,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:14:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2020-12-23 17:14:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 17:14:16,095 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:16,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:16,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 17:14:16,099 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:16,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:16,099 INFO L82 PathProgramCache]: Analyzing trace with hash 94836804, now seen corresponding path program 1 times [2020-12-23 17:14:16,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:16,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964968600] [2020-12-23 17:14:16,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:16,359 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 17:14:16,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964968600] [2020-12-23 17:14:16,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:16,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 17:14:16,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391222233] [2020-12-23 17:14:16,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 17:14:16,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:16,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 17:14:16,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:14:16,362 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand 8 states. [2020-12-23 17:14:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:17,012 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2020-12-23 17:14:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 17:14:17,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-23 17:14:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:17,015 INFO L225 Difference]: With dead ends: 211 [2020-12-23 17:14:17,015 INFO L226 Difference]: Without dead ends: 211 [2020-12-23 17:14:17,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:14:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-12-23 17:14:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 162. [2020-12-23 17:14:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-12-23 17:14:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2020-12-23 17:14:17,021 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 18 [2020-12-23 17:14:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:17,022 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2020-12-23 17:14:17,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 17:14:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2020-12-23 17:14:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 17:14:17,023 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:17,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:17,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 17:14:17,023 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:17,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:17,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1089995469, now seen corresponding path program 1 times [2020-12-23 17:14:17,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:17,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735466336] [2020-12-23 17:14:17,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:17,153 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 17:14:17,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735466336] [2020-12-23 17:14:17,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:17,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 17:14:17,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445278161] [2020-12-23 17:14:17,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 17:14:17,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:17,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 17:14:17,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 17:14:17,158 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 9 states. [2020-12-23 17:14:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:17,868 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2020-12-23 17:14:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 17:14:17,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-12-23 17:14:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:17,870 INFO L225 Difference]: With dead ends: 161 [2020-12-23 17:14:17,870 INFO L226 Difference]: Without dead ends: 161 [2020-12-23 17:14:17,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2020-12-23 17:14:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-23 17:14:17,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2020-12-23 17:14:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-12-23 17:14:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2020-12-23 17:14:17,876 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 19 [2020-12-23 17:14:17,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:17,876 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2020-12-23 17:14:17,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 17:14:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2020-12-23 17:14:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 17:14:17,877 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:17,877 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:17,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 17:14:17,878 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:17,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:17,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1089995468, now seen corresponding path program 1 times [2020-12-23 17:14:17,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:17,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318923334] [2020-12-23 17:14:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:18,074 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 17:14:18,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318923334] [2020-12-23 17:14:18,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:18,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 17:14:18,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858145174] [2020-12-23 17:14:18,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 17:14:18,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 17:14:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 17:14:18,077 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand 10 states. [2020-12-23 17:14:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:19,465 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2020-12-23 17:14:19,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 17:14:19,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-12-23 17:14:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:19,467 INFO L225 Difference]: With dead ends: 178 [2020-12-23 17:14:19,467 INFO L226 Difference]: Without dead ends: 178 [2020-12-23 17:14:19,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2020-12-23 17:14:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-12-23 17:14:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 165. [2020-12-23 17:14:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 17:14:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 180 transitions. [2020-12-23 17:14:19,473 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 180 transitions. Word has length 19 [2020-12-23 17:14:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:19,473 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 180 transitions. [2020-12-23 17:14:19,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 17:14:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 180 transitions. [2020-12-23 17:14:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 17:14:19,474 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:19,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:19,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 17:14:19,475 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:19,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1403311798, now seen corresponding path program 1 times [2020-12-23 17:14:19,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:19,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710134803] [2020-12-23 17:14:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:19,554 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 17:14:19,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710134803] [2020-12-23 17:14:19,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:19,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:14:19,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226072635] [2020-12-23 17:14:19,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:14:19,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:19,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:14:19,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:14:19,560 INFO L87 Difference]: Start difference. First operand 165 states and 180 transitions. Second operand 4 states. [2020-12-23 17:14:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:19,764 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2020-12-23 17:14:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:14:19,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-12-23 17:14:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:19,766 INFO L225 Difference]: With dead ends: 166 [2020-12-23 17:14:19,766 INFO L226 Difference]: Without dead ends: 166 [2020-12-23 17:14:19,766 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 17:14:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-12-23 17:14:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2020-12-23 17:14:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 17:14:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2020-12-23 17:14:19,776 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 25 [2020-12-23 17:14:19,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:19,777 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2020-12-23 17:14:19,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:14:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2020-12-23 17:14:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 17:14:19,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:19,783 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:19,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 17:14:19,783 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:19,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash 321723501, now seen corresponding path program 1 times [2020-12-23 17:14:19,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:19,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115920054] [2020-12-23 17:14:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:14:19,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115920054] [2020-12-23 17:14:19,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008440651] [2020-12-23 17:14:19,919 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 17:14:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:20,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 17:14:20,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:14:20,206 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 17:14:20,207 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,219 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:20,223 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 17:14:20,226 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,234 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:20,235 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,235 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-12-23 17:14:20,267 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 17:14:20,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,288 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2020-12-23 17:14:20,291 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,299 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:20,300 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,313 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:20,320 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 17:14:20,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,338 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2020-12-23 17:14:20,342 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:20,356 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:20,379 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,379 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2020-12-23 17:14:20,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,433 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-12-23 17:14:20,436 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:20,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,465 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-12-23 17:14:20,468 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,482 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:20,483 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,483 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2020-12-23 17:14:20,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:20,591 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-12-23 17:14:20,599 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:20,640 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-12-23 17:14:20,640 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2020-12-23 17:14:20,645 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,651 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:20,652 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:20,653 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-12-23 17:14:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:14:20,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:14:20,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2020-12-23 17:14:20,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837653826] [2020-12-23 17:14:20,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 17:14:20,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:20,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 17:14:20,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:14:20,666 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand 8 states. [2020-12-23 17:14:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:21,451 INFO L93 Difference]: Finished difference Result 214 states and 232 transitions. [2020-12-23 17:14:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 17:14:21,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-12-23 17:14:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:21,454 INFO L225 Difference]: With dead ends: 214 [2020-12-23 17:14:21,454 INFO L226 Difference]: Without dead ends: 214 [2020-12-23 17:14:21,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:14:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-12-23 17:14:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 170. [2020-12-23 17:14:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 17:14:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 185 transitions. [2020-12-23 17:14:21,466 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 185 transitions. Word has length 25 [2020-12-23 17:14:21,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:21,467 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 185 transitions. [2020-12-23 17:14:21,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 17:14:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 185 transitions. [2020-12-23 17:14:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 17:14:21,472 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:21,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:21,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 17:14:21,686 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:21,686 INFO L82 PathProgramCache]: Analyzing trace with hash 279705248, now seen corresponding path program 1 times [2020-12-23 17:14:21,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:21,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481301144] [2020-12-23 17:14:21,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:21,838 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 17:14:21,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481301144] [2020-12-23 17:14:21,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:21,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 17:14:21,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913951531] [2020-12-23 17:14:21,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:14:21,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:21,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:14:21,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:14:21,840 INFO L87 Difference]: Start difference. First operand 170 states and 185 transitions. Second operand 5 states. [2020-12-23 17:14:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:22,153 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2020-12-23 17:14:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:14:22,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-23 17:14:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:22,155 INFO L225 Difference]: With dead ends: 173 [2020-12-23 17:14:22,155 INFO L226 Difference]: Without dead ends: 173 [2020-12-23 17:14:22,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 17:14:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-12-23 17:14:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2020-12-23 17:14:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-12-23 17:14:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2020-12-23 17:14:22,160 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 182 transitions. Word has length 25 [2020-12-23 17:14:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:22,160 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 182 transitions. [2020-12-23 17:14:22,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:14:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2020-12-23 17:14:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 17:14:22,161 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:22,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:22,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 17:14:22,162 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:22,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:22,162 INFO L82 PathProgramCache]: Analyzing trace with hash 700013510, now seen corresponding path program 1 times [2020-12-23 17:14:22,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:22,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850962336] [2020-12-23 17:14:22,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:22,216 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 17:14:22,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850962336] [2020-12-23 17:14:22,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:22,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:14:22,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184212191] [2020-12-23 17:14:22,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:14:22,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:22,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:14:22,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:14:22,219 INFO L87 Difference]: Start difference. First operand 169 states and 182 transitions. Second operand 5 states. [2020-12-23 17:14:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:22,599 INFO L93 Difference]: Finished difference Result 243 states and 261 transitions. [2020-12-23 17:14:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:14:22,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-12-23 17:14:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:22,603 INFO L225 Difference]: With dead ends: 243 [2020-12-23 17:14:22,603 INFO L226 Difference]: Without dead ends: 243 [2020-12-23 17:14:22,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 17:14:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-12-23 17:14:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 168. [2020-12-23 17:14:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 17:14:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2020-12-23 17:14:22,608 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 26 [2020-12-23 17:14:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:22,609 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2020-12-23 17:14:22,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:14:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2020-12-23 17:14:22,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 17:14:22,609 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:22,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:22,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 17:14:22,610 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:22,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:22,611 INFO L82 PathProgramCache]: Analyzing trace with hash 700013511, now seen corresponding path program 1 times [2020-12-23 17:14:22,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:22,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516883] [2020-12-23 17:14:22,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:22,681 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 17:14:22,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516883] [2020-12-23 17:14:22,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:22,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:14:22,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337716453] [2020-12-23 17:14:22,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:14:22,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:22,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:14:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:14:22,683 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand 5 states. [2020-12-23 17:14:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:23,187 INFO L93 Difference]: Finished difference Result 279 states and 301 transitions. [2020-12-23 17:14:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 17:14:23,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-12-23 17:14:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:23,189 INFO L225 Difference]: With dead ends: 279 [2020-12-23 17:14:23,189 INFO L226 Difference]: Without dead ends: 279 [2020-12-23 17:14:23,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 17:14:23,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-12-23 17:14:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 167. [2020-12-23 17:14:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-12-23 17:14:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2020-12-23 17:14:23,196 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 26 [2020-12-23 17:14:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:23,197 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2020-12-23 17:14:23,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:14:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2020-12-23 17:14:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 17:14:23,198 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:23,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:23,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 17:14:23,198 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:23,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1145877006, now seen corresponding path program 1 times [2020-12-23 17:14:23,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:23,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115945090] [2020-12-23 17:14:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:23,278 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 17:14:23,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115945090] [2020-12-23 17:14:23,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:23,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:14:23,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008219299] [2020-12-23 17:14:23,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:14:23,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:23,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:14:23,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:14:23,287 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 4 states. [2020-12-23 17:14:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:23,501 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2020-12-23 17:14:23,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:14:23,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-12-23 17:14:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:23,503 INFO L225 Difference]: With dead ends: 166 [2020-12-23 17:14:23,503 INFO L226 Difference]: Without dead ends: 166 [2020-12-23 17:14:23,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 17:14:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-12-23 17:14:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2020-12-23 17:14:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 17:14:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 177 transitions. [2020-12-23 17:14:23,508 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 177 transitions. Word has length 28 [2020-12-23 17:14:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:23,508 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 177 transitions. [2020-12-23 17:14:23,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:14:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2020-12-23 17:14:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 17:14:23,509 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:23,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:23,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 17:14:23,509 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:23,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:23,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1676045002, now seen corresponding path program 1 times [2020-12-23 17:14:23,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:23,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612291951] [2020-12-23 17:14:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:23,748 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 17:14:23,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612291951] [2020-12-23 17:14:23,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:23,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 17:14:23,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081033541] [2020-12-23 17:14:23,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 17:14:23,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:23,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 17:14:23,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:14:23,751 INFO L87 Difference]: Start difference. First operand 165 states and 177 transitions. Second operand 12 states. [2020-12-23 17:14:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:24,944 INFO L93 Difference]: Finished difference Result 180 states and 190 transitions. [2020-12-23 17:14:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 17:14:24,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-12-23 17:14:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:24,946 INFO L225 Difference]: With dead ends: 180 [2020-12-23 17:14:24,946 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 17:14:24,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2020-12-23 17:14:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 17:14:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2020-12-23 17:14:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 17:14:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2020-12-23 17:14:24,952 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 30 [2020-12-23 17:14:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:24,953 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2020-12-23 17:14:24,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 17:14:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2020-12-23 17:14:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 17:14:24,953 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:24,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:24,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 17:14:24,954 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:24,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:24,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1299331192, now seen corresponding path program 1 times [2020-12-23 17:14:24,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:24,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317588610] [2020-12-23 17:14:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:25,095 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 17:14:25,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317588610] [2020-12-23 17:14:25,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:25,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 17:14:25,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131685713] [2020-12-23 17:14:25,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 17:14:25,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:25,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 17:14:25,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:14:25,098 INFO L87 Difference]: Start difference. First operand 165 states and 176 transitions. Second operand 8 states. [2020-12-23 17:14:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:25,804 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2020-12-23 17:14:25,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 17:14:25,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-12-23 17:14:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:25,805 INFO L225 Difference]: With dead ends: 165 [2020-12-23 17:14:25,806 INFO L226 Difference]: Without dead ends: 165 [2020-12-23 17:14:25,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:14:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-12-23 17:14:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2020-12-23 17:14:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-12-23 17:14:25,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2020-12-23 17:14:25,810 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 30 [2020-12-23 17:14:25,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:25,811 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2020-12-23 17:14:25,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 17:14:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2020-12-23 17:14:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 17:14:25,811 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:25,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:25,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 17:14:25,812 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:25,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1299331191, now seen corresponding path program 1 times [2020-12-23 17:14:25,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:25,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304562259] [2020-12-23 17:14:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:25,981 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 17:14:25,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304562259] [2020-12-23 17:14:25,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:25,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 17:14:25,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597453819] [2020-12-23 17:14:25,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 17:14:25,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:25,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 17:14:25,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 17:14:25,984 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 9 states. [2020-12-23 17:14:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:26,883 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2020-12-23 17:14:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 17:14:26,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-12-23 17:14:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:26,885 INFO L225 Difference]: With dead ends: 160 [2020-12-23 17:14:26,885 INFO L226 Difference]: Without dead ends: 160 [2020-12-23 17:14:26,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-12-23 17:14:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-23 17:14:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 149. [2020-12-23 17:14:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-12-23 17:14:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2020-12-23 17:14:26,890 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 30 [2020-12-23 17:14:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:26,890 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2020-12-23 17:14:26,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 17:14:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2020-12-23 17:14:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 17:14:26,891 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:26,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:26,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 17:14:26,891 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash 556853368, now seen corresponding path program 1 times [2020-12-23 17:14:26,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:26,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613429507] [2020-12-23 17:14:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:14:26,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613429507] [2020-12-23 17:14:26,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39642564] [2020-12-23 17:14:26,980 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 17:14:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:27,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 17:14:27,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:14:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 17:14:27,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 17:14:27,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2020-12-23 17:14:27,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916983699] [2020-12-23 17:14:27,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:14:27,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:14:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 17:14:27,195 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand 3 states. [2020-12-23 17:14:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:27,281 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2020-12-23 17:14:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:14:27,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-12-23 17:14:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:27,287 INFO L225 Difference]: With dead ends: 150 [2020-12-23 17:14:27,287 INFO L226 Difference]: Without dead ends: 150 [2020-12-23 17:14:27,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 17:14:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-12-23 17:14:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-12-23 17:14:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-12-23 17:14:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2020-12-23 17:14:27,291 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 31 [2020-12-23 17:14:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:27,291 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2020-12-23 17:14:27,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:14:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2020-12-23 17:14:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 17:14:27,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:27,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:27,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:14:27,506 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:27,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1734815685, now seen corresponding path program 1 times [2020-12-23 17:14:27,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:27,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434241340] [2020-12-23 17:14:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:14:27,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434241340] [2020-12-23 17:14:27,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175633484] [2020-12-23 17:14:27,592 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 17:14:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:27,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 17:14:27,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:14:27,727 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 17:14:27,728 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:27,731 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:27,732 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:27,732 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-12-23 17:14:27,776 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-12-23 17:14:27,778 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:27,781 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:27,782 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:27,782 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-12-23 17:14:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 17:14:27,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 17:14:27,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2020-12-23 17:14:27,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251471205] [2020-12-23 17:14:27,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:14:27,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:27,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:14:27,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-23 17:14:27,814 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2020-12-23 17:14:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:27,956 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2020-12-23 17:14:27,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:14:27,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-23 17:14:27,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:27,958 INFO L225 Difference]: With dead ends: 159 [2020-12-23 17:14:27,958 INFO L226 Difference]: Without dead ends: 159 [2020-12-23 17:14:27,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-23 17:14:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-23 17:14:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2020-12-23 17:14:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-12-23 17:14:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2020-12-23 17:14:27,963 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 33 [2020-12-23 17:14:27,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:27,963 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2020-12-23 17:14:27,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:14:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2020-12-23 17:14:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 17:14:27,964 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:27,964 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:28,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 17:14:28,178 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:28,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:28,179 INFO L82 PathProgramCache]: Analyzing trace with hash 443489849, now seen corresponding path program 1 times [2020-12-23 17:14:28,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:28,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184329479] [2020-12-23 17:14:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:14:28,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184329479] [2020-12-23 17:14:28,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121158565] [2020-12-23 17:14:28,410 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 17:14:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:28,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 17:14:28,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:14:28,562 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 17:14:28,563 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:28,577 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 17:14:28,578 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:28,586 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,587 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-12-23 17:14:28,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:28,617 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 21 treesize of output 20 [2020-12-23 17:14:28,620 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:28,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:28,677 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 21 treesize of output 20 [2020-12-23 17:14:28,680 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:28,693 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,693 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2020-12-23 17:14:28,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:28,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:28,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:28,755 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-12-23 17:14:28,760 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,782 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:28,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:28,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:28,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:28,795 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-12-23 17:14:28,797 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,810 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:28,813 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,814 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2020-12-23 17:14:28,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:28,888 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-12-23 17:14:28,890 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:28,913 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-12-23 17:14:28,914 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2020-12-23 17:14:28,916 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,924 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:28,925 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:28,925 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-12-23 17:14:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 17:14:28,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:14:28,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2020-12-23 17:14:28,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213864080] [2020-12-23 17:14:28,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 17:14:28,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:28,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 17:14:28,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-23 17:14:28,951 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 10 states. [2020-12-23 17:14:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:30,232 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2020-12-23 17:14:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 17:14:30,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2020-12-23 17:14:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:30,234 INFO L225 Difference]: With dead ends: 213 [2020-12-23 17:14:30,234 INFO L226 Difference]: Without dead ends: 213 [2020-12-23 17:14:30,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-12-23 17:14:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-12-23 17:14:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 164. [2020-12-23 17:14:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-12-23 17:14:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2020-12-23 17:14:30,238 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 34 [2020-12-23 17:14:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:30,239 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2020-12-23 17:14:30,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 17:14:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2020-12-23 17:14:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 17:14:30,239 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:30,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:30,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:14:30,453 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:30,453 INFO L82 PathProgramCache]: Analyzing trace with hash 863283112, now seen corresponding path program 1 times [2020-12-23 17:14:30,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:30,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514475700] [2020-12-23 17:14:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 17:14:30,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514475700] [2020-12-23 17:14:30,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:30,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:14:30,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137950572] [2020-12-23 17:14:30,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:14:30,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:30,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:14:30,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:14:30,503 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 3 states. [2020-12-23 17:14:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:30,573 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2020-12-23 17:14:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:14:30,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-23 17:14:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:30,575 INFO L225 Difference]: With dead ends: 163 [2020-12-23 17:14:30,575 INFO L226 Difference]: Without dead ends: 163 [2020-12-23 17:14:30,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:14:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-12-23 17:14:30,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-12-23 17:14:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 17:14:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2020-12-23 17:14:30,580 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 35 [2020-12-23 17:14:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:30,580 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2020-12-23 17:14:30,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:14:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2020-12-23 17:14:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 17:14:30,581 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:30,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:30,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 17:14:30,581 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:30,582 INFO L82 PathProgramCache]: Analyzing trace with hash 686393195, now seen corresponding path program 1 times [2020-12-23 17:14:30,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:30,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276921006] [2020-12-23 17:14:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 17:14:30,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276921006] [2020-12-23 17:14:30,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007014564] [2020-12-23 17:14:30,889 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 17:14:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:31,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 17:14:31,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:14:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 17:14:31,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:14:31,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2020-12-23 17:14:31,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739368133] [2020-12-23 17:14:31,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 17:14:31,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:31,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 17:14:31,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-12-23 17:14:31,420 INFO L87 Difference]: Start difference. First operand 163 states and 173 transitions. Second operand 15 states. [2020-12-23 17:14:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:32,378 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2020-12-23 17:14:32,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 17:14:32,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2020-12-23 17:14:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:32,380 INFO L225 Difference]: With dead ends: 173 [2020-12-23 17:14:32,381 INFO L226 Difference]: Without dead ends: 148 [2020-12-23 17:14:32,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2020-12-23 17:14:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-12-23 17:14:32,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2020-12-23 17:14:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-23 17:14:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2020-12-23 17:14:32,386 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 37 [2020-12-23 17:14:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:32,386 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2020-12-23 17:14:32,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 17:14:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2020-12-23 17:14:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:14:32,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:32,387 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:32,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-23 17:14:32,602 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:32,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:32,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1822307794, now seen corresponding path program 1 times [2020-12-23 17:14:32,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:32,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289582500] [2020-12-23 17:14:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:33,430 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 17:14:33,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289582500] [2020-12-23 17:14:33,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405809088] [2020-12-23 17:14:33,431 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 17:14:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:33,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2020-12-23 17:14:33,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:14:33,586 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 17:14:33,588 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:33,590 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:33,591 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:33,591 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 17:14:33,619 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 17:14:33,620 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:33,626 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:33,627 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:33,627 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-23 17:14:33,707 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:33,708 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 17:14:33,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:14:33,715 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:33,728 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:33,729 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:33,729 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-12-23 17:14:33,770 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_47|], 2=[|v_#memory_int_39|]} [2020-12-23 17:14:33,777 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:14:33,778 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:33,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:33,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:33,807 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 25 treesize of output 13 [2020-12-23 17:14:33,808 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:33,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:33,825 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 17:14:33,825 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:24 [2020-12-23 17:14:33,916 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 41 treesize of output 13 [2020-12-23 17:14:33,918 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:33,934 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:33,967 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:33,968 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 52 [2020-12-23 17:14:33,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-23 17:14:33,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:14:33,976 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-23 17:14:34,016 INFO L625 ElimStorePlain]: treesize reduction 28, result has 56.9 percent of original size [2020-12-23 17:14:34,018 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:34,019 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:37 [2020-12-23 17:14:34,125 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:34,125 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2020-12-23 17:14:34,129 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:34,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:34,141 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:34,142 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:14 [2020-12-23 17:14:34,234 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 17:14:34,239 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:34,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:34,248 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:34,248 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2020-12-23 17:14:34,268 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 23 treesize of output 22 [2020-12-23 17:14:34,270 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:34,279 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:34,282 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:34,282 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2020-12-23 17:14:34,501 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-12-23 17:14:34,505 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:34,511 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:34,513 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:34,513 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2020-12-23 17:14:34,525 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 17:14:34,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:14:34,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2020-12-23 17:14:34,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899527299] [2020-12-23 17:14:34,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-23 17:14:34,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:34,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-23 17:14:34,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2020-12-23 17:14:34,528 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand 28 states. [2020-12-23 17:14:35,197 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2020-12-23 17:14:35,368 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2020-12-23 17:14:35,644 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2020-12-23 17:14:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:37,836 INFO L93 Difference]: Finished difference Result 235 states and 251 transitions. [2020-12-23 17:14:37,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 17:14:37,838 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2020-12-23 17:14:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:37,839 INFO L225 Difference]: With dead ends: 235 [2020-12-23 17:14:37,839 INFO L226 Difference]: Without dead ends: 235 [2020-12-23 17:14:37,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2020-12-23 17:14:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-12-23 17:14:37,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 173. [2020-12-23 17:14:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-12-23 17:14:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 184 transitions. [2020-12-23 17:14:37,844 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 184 transitions. Word has length 38 [2020-12-23 17:14:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:37,845 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 184 transitions. [2020-12-23 17:14:37,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-23 17:14:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 184 transitions. [2020-12-23 17:14:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 17:14:37,845 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:37,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:38,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:14:38,060 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:38,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1362106110, now seen corresponding path program 1 times [2020-12-23 17:14:38,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:38,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806572673] [2020-12-23 17:14:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:38,478 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 17:14:38,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806572673] [2020-12-23 17:14:38,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:14:38,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-12-23 17:14:38,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360118588] [2020-12-23 17:14:38,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 17:14:38,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:38,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 17:14:38,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-12-23 17:14:38,480 INFO L87 Difference]: Start difference. First operand 173 states and 184 transitions. Second operand 17 states. [2020-12-23 17:14:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:40,222 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2020-12-23 17:14:40,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 17:14:40,223 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2020-12-23 17:14:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:40,224 INFO L225 Difference]: With dead ends: 182 [2020-12-23 17:14:40,225 INFO L226 Difference]: Without dead ends: 182 [2020-12-23 17:14:40,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2020-12-23 17:14:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-12-23 17:14:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 164. [2020-12-23 17:14:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-12-23 17:14:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2020-12-23 17:14:40,247 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 39 [2020-12-23 17:14:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:40,247 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2020-12-23 17:14:40,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 17:14:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2020-12-23 17:14:40,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 17:14:40,248 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:40,248 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:40,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 17:14:40,249 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:40,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:40,249 INFO L82 PathProgramCache]: Analyzing trace with hash 604786499, now seen corresponding path program 1 times [2020-12-23 17:14:40,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:40,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496797692] [2020-12-23 17:14:40,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:14:40,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496797692] [2020-12-23 17:14:40,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043332449] [2020-12-23 17:14:40,554 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 17:14:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:40,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-23 17:14:40,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:14:40,761 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 17:14:40,762 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:40,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:40,772 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:40,772 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:14:40,903 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:40,903 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 17:14:40,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:14:40,908 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:40,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:40,926 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:40,926 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-23 17:14:40,989 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:14:40,990 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:41,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:41,019 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:41,019 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-23 17:14:41,195 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:41,195 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2020-12-23 17:14:41,200 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-23 17:14:41,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:14:41,202 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:14:41,250 INFO L625 ElimStorePlain]: treesize reduction 33, result has 57.7 percent of original size [2020-12-23 17:14:41,251 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:41,252 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2020-12-23 17:14:41,554 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:41,555 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 110 [2020-12-23 17:14:41,562 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:41,633 INFO L625 ElimStorePlain]: treesize reduction 16, result has 74.6 percent of original size [2020-12-23 17:14:41,637 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:41,637 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:25 [2020-12-23 17:14:41,751 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:41,752 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 69 [2020-12-23 17:14:41,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-23 17:14:41,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:14:41,756 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:41,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:41,770 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:41,770 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:26 [2020-12-23 17:14:41,903 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 17:14:41,905 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:41,913 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:41,915 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:41,915 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2020-12-23 17:14:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:14:42,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:14:42,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2020-12-23 17:14:42,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648988243] [2020-12-23 17:14:42,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-23 17:14:42,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:42,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-23 17:14:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2020-12-23 17:14:42,065 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 28 states. [2020-12-23 17:14:42,770 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2020-12-23 17:14:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:44,783 INFO L93 Difference]: Finished difference Result 267 states and 285 transitions. [2020-12-23 17:14:44,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-23 17:14:44,784 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2020-12-23 17:14:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:44,785 INFO L225 Difference]: With dead ends: 267 [2020-12-23 17:14:44,785 INFO L226 Difference]: Without dead ends: 267 [2020-12-23 17:14:44,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=541, Invalid=1909, Unknown=0, NotChecked=0, Total=2450 [2020-12-23 17:14:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-12-23 17:14:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 172. [2020-12-23 17:14:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-12-23 17:14:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2020-12-23 17:14:44,792 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 45 [2020-12-23 17:14:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:44,793 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2020-12-23 17:14:44,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-23 17:14:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2020-12-23 17:14:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 17:14:44,793 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:44,793 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:45,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-23 17:14:45,007 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash 604786500, now seen corresponding path program 1 times [2020-12-23 17:14:45,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:45,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134655530] [2020-12-23 17:14:45,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:14:45,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134655530] [2020-12-23 17:14:45,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397049683] [2020-12-23 17:14:45,384 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 17:14:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:45,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 51 conjunts are in the unsatisfiable core [2020-12-23 17:14:45,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:14:45,587 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 17:14:45,588 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:45,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:45,611 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 17:14:45,613 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:45,626 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:45,628 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:45,628 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2020-12-23 17:14:45,763 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:45,763 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 17:14:45,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:14:45,769 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:45,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:45,801 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2020-12-23 17:14:45,803 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:45,827 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:45,828 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:45,829 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2020-12-23 17:14:45,899 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:14:45,900 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:45,931 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:45,938 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 17:14:45,939 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:45,970 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:45,972 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 17:14:45,972 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2020-12-23 17:14:46,142 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:46,142 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 70 [2020-12-23 17:14:46,146 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:14:46,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:14:46,157 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:14:46,251 INFO L625 ElimStorePlain]: treesize reduction 46, result has 62.3 percent of original size [2020-12-23 17:14:46,260 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 29 treesize of output 24 [2020-12-23 17:14:46,262 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:46,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:46,304 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:46,305 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2020-12-23 17:14:46,664 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:46,664 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 119 [2020-12-23 17:14:46,668 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:46,762 INFO L625 ElimStorePlain]: treesize reduction 16, result has 82.2 percent of original size [2020-12-23 17:14:46,796 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:46,797 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2020-12-23 17:14:46,801 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:46,908 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-12-23 17:14:46,909 INFO L625 ElimStorePlain]: treesize reduction 22, result has 76.1 percent of original size [2020-12-23 17:14:46,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:14:46,913 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:46,913 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:63 [2020-12-23 17:14:46,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:14:47,044 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_56|], 6=[|v_#memory_$Pointer$.offset_50|]} [2020-12-23 17:14:47,073 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:47,074 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2020-12-23 17:14:47,077 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:14:47,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:14:47,079 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:47,108 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:47,133 INFO L348 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2020-12-23 17:14:47,134 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2020-12-23 17:14:47,136 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:47,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:47,161 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:47,161 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:44 [2020-12-23 17:14:47,399 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2020-12-23 17:14:47,404 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2020-12-23 17:14:47,406 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:47,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:47,444 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-23 17:14:47,446 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:47,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:47,460 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:47,460 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:18 [2020-12-23 17:14:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:14:47,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:14:47,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2020-12-23 17:14:47,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877583475] [2020-12-23 17:14:47,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-23 17:14:47,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:47,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-23 17:14:47,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2020-12-23 17:14:47,609 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand 27 states. [2020-12-23 17:14:48,354 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-12-23 17:14:49,075 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2020-12-23 17:14:49,405 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2020-12-23 17:14:50,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:14:50,747 INFO L93 Difference]: Finished difference Result 235 states and 252 transitions. [2020-12-23 17:14:50,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-23 17:14:50,748 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2020-12-23 17:14:50,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:14:50,749 INFO L225 Difference]: With dead ends: 235 [2020-12-23 17:14:50,750 INFO L226 Difference]: Without dead ends: 235 [2020-12-23 17:14:50,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=365, Invalid=1441, Unknown=0, NotChecked=0, Total=1806 [2020-12-23 17:14:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-12-23 17:14:50,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 175. [2020-12-23 17:14:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-12-23 17:14:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2020-12-23 17:14:50,755 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 45 [2020-12-23 17:14:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:14:50,755 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2020-12-23 17:14:50,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-23 17:14:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2020-12-23 17:14:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-23 17:14:50,756 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:14:50,756 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:14:50,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:14:50,968 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:14:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:14:50,969 INFO L82 PathProgramCache]: Analyzing trace with hash 601752566, now seen corresponding path program 1 times [2020-12-23 17:14:50,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:14:50,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138165800] [2020-12-23 17:14:50,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:14:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:52,362 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 17:14:52,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138165800] [2020-12-23 17:14:52,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382574751] [2020-12-23 17:14:52,363 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:14:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:14:52,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 44 conjunts are in the unsatisfiable core [2020-12-23 17:14:52,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:14:52,566 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 17:14:52,567 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:52,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:52,570 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:52,571 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 17:14:52,608 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 17:14:52,609 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:52,616 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:52,617 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:52,617 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-23 17:14:52,734 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:52,734 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 17:14:52,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:14:52,744 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:52,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:52,762 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:52,762 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2020-12-23 17:14:52,831 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_57|], 2=[|v_#memory_int_44|]} [2020-12-23 17:14:52,838 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:14:52,839 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:52,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:52,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:52,875 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 25 treesize of output 13 [2020-12-23 17:14:52,877 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:52,898 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:52,899 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 17:14:52,900 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:38 [2020-12-23 17:14:53,022 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 41 treesize of output 13 [2020-12-23 17:14:53,024 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,077 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,078 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2020-12-23 17:14:53,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-23 17:14:53,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:14:53,082 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-23 17:14:53,131 INFO L625 ElimStorePlain]: treesize reduction 33, result has 60.7 percent of original size [2020-12-23 17:14:53,132 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:53,132 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:51 [2020-12-23 17:14:53,237 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,238 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2020-12-23 17:14:53,240 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,256 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,257 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,258 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:24 [2020-12-23 17:14:53,371 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 17:14:53,372 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,387 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,388 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,388 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2020-12-23 17:14:53,404 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 23 treesize of output 22 [2020-12-23 17:14:53,406 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,425 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,425 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2020-12-23 17:14:53,510 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,511 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:14:53,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:14:53,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:14:53,517 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,535 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,535 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2020-12-23 17:14:53,593 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_59|], 6=[|v_#memory_int_48|]} [2020-12-23 17:14:53,601 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 11 treesize of output 7 [2020-12-23 17:14:53,602 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,626 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:14:53,634 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 34 treesize of output 25 [2020-12-23 17:14:53,635 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,655 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 17:14:53,656 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:39 [2020-12-23 17:14:53,786 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_60|], 6=[|v_#memory_int_49|]} [2020-12-23 17:14:53,820 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,820 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 75 [2020-12-23 17:14:53,825 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:14:53,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:14:53,826 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,853 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2020-12-23 17:14:53,855 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:53,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,874 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:53,874 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:52 [2020-12-23 17:14:53,996 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:53,997 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2020-12-23 17:14:53,998 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:54,013 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:54,015 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:54,015 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:31 [2020-12-23 17:14:54,190 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-23 17:14:54,192 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:54,207 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:54,209 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:54,210 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:31 [2020-12-23 17:14:54,289 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-12-23 17:14:54,291 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:54,310 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:54,315 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 17:14:54,316 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-12-23 17:14:54,686 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2020-12-23 17:14:54,689 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:14:54,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:14:54,703 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:14:54,703 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-12-23 17:14:54,728 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 17:14:54,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:14:54,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 42 [2020-12-23 17:14:54,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523942720] [2020-12-23 17:14:54,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-12-23 17:14:54,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:14:54,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-12-23 17:14:54,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1504, Unknown=0, NotChecked=0, Total=1722 [2020-12-23 17:14:54,731 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 42 states. [2020-12-23 17:14:55,439 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-12-23 17:14:55,640 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2020-12-23 17:14:55,875 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2020-12-23 17:14:56,054 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2020-12-23 17:14:56,277 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-12-23 17:15:06,776 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-12-23 17:15:10,973 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2020-12-23 17:15:13,248 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2020-12-23 17:15:13,440 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2020-12-23 17:15:17,664 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-12-23 17:15:30,844 WARN L197 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2020-12-23 17:16:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:16:13,783 INFO L93 Difference]: Finished difference Result 307 states and 330 transitions. [2020-12-23 17:16:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-12-23 17:16:13,784 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 47 [2020-12-23 17:16:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:16:13,786 INFO L225 Difference]: With dead ends: 307 [2020-12-23 17:16:13,786 INFO L226 Difference]: Without dead ends: 307 [2020-12-23 17:16:13,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 57.5s TimeCoverageRelationStatistics Valid=771, Invalid=3760, Unknown=25, NotChecked=0, Total=4556 [2020-12-23 17:16:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-12-23 17:16:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 200. [2020-12-23 17:16:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-12-23 17:16:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 214 transitions. [2020-12-23 17:16:13,793 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 214 transitions. Word has length 47 [2020-12-23 17:16:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:16:13,794 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 214 transitions. [2020-12-23 17:16:13,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-12-23 17:16:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 214 transitions. [2020-12-23 17:16:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 17:16:13,795 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:16:13,795 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:16:14,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:16:14,009 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:16:14,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:16:14,010 INFO L82 PathProgramCache]: Analyzing trace with hash -795565005, now seen corresponding path program 2 times [2020-12-23 17:16:14,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:16:14,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132593578] [2020-12-23 17:16:14,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:16:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:14,554 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2020-12-23 17:16:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:14,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132593578] [2020-12-23 17:16:14,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756964861] [2020-12-23 17:16:14,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:16:15,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 17:16:15,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 17:16:15,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 60 conjunts are in the unsatisfiable core [2020-12-23 17:16:15,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:16:15,061 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 17:16:15,062 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:15,070 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:15,071 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:15,071 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-12-23 17:16:15,240 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:15,241 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 17:16:15,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:15,249 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:15,268 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:15,269 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:15,269 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-12-23 17:16:15,341 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 17:16:15,342 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:15,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:15,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:16:15,377 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:15,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:15,405 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:15,405 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:24 [2020-12-23 17:16:15,525 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_52|], 2=[|v_#memory_$Pointer$.base_62|]} [2020-12-23 17:16:15,532 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 21 treesize of output 13 [2020-12-23 17:16:15,533 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:15,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:15,597 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:15,598 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 61 [2020-12-23 17:16:15,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-23 17:16:15,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:16:15,602 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-23 17:16:15,658 INFO L625 ElimStorePlain]: treesize reduction 37, result has 57.5 percent of original size [2020-12-23 17:16:15,660 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:15,660 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:50 [2020-12-23 17:16:15,988 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:15,989 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 114 [2020-12-23 17:16:15,995 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,100 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2020-12-23 17:16:16,101 INFO L625 ElimStorePlain]: treesize reduction 16, result has 81.4 percent of original size [2020-12-23 17:16:16,132 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:16,132 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2020-12-23 17:16:16,134 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,239 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-12-23 17:16:16,240 INFO L625 ElimStorePlain]: treesize reduction 22, result has 75.0 percent of original size [2020-12-23 17:16:16,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:16,243 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:16,243 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:66 [2020-12-23 17:16:16,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:16,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:16:16,398 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-12-23 17:16:16,400 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:16,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:16:16,439 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-12-23 17:16:16,441 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:16,468 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,468 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:42 [2020-12-23 17:16:16,974 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:16,974 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2020-12-23 17:16:16,977 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 17:16:16,979 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 17:16:17,002 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,007 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2020-12-23 17:16:17,009 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,028 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,028 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:10 [2020-12-23 17:16:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:17,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:16:17,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2020-12-23 17:16:17,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120650389] [2020-12-23 17:16:17,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-23 17:16:17,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:16:17,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-23 17:16:17,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2020-12-23 17:16:17,166 INFO L87 Difference]: Start difference. First operand 200 states and 214 transitions. Second operand 35 states. [2020-12-23 17:16:18,333 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2020-12-23 17:16:18,913 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2020-12-23 17:16:19,137 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2020-12-23 17:16:19,627 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2020-12-23 17:16:20,010 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-12-23 17:16:20,602 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-12-23 17:16:21,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:16:21,880 INFO L93 Difference]: Finished difference Result 263 states and 281 transitions. [2020-12-23 17:16:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-23 17:16:21,881 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 50 [2020-12-23 17:16:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:16:21,883 INFO L225 Difference]: With dead ends: 263 [2020-12-23 17:16:21,883 INFO L226 Difference]: Without dead ends: 263 [2020-12-23 17:16:21,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=546, Invalid=2876, Unknown=0, NotChecked=0, Total=3422 [2020-12-23 17:16:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-12-23 17:16:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 202. [2020-12-23 17:16:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-12-23 17:16:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 216 transitions. [2020-12-23 17:16:21,890 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 216 transitions. Word has length 50 [2020-12-23 17:16:21,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:16:21,890 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 216 transitions. [2020-12-23 17:16:21,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-23 17:16:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 216 transitions. [2020-12-23 17:16:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 17:16:21,891 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:16:21,891 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:16:22,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:16:22,107 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:16:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:16:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash -837583258, now seen corresponding path program 1 times [2020-12-23 17:16:22,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:16:22,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371652988] [2020-12-23 17:16:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:16:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:23,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371652988] [2020-12-23 17:16:23,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751886199] [2020-12-23 17:16:23,468 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:16:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:23,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 55 conjunts are in the unsatisfiable core [2020-12-23 17:16:23,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:16:23,624 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 17:16:23,625 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:23,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:23,640 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 17:16:23,641 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:23,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:23,651 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:23,652 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-12-23 17:16:23,769 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:23,769 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 17:16:23,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:23,773 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:23,794 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:23,800 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2020-12-23 17:16:23,801 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:23,821 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:23,822 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:23,823 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2020-12-23 17:16:23,889 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:16:23,890 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:23,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:23,923 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 17:16:23,925 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:23,956 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:23,957 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 17:16:23,958 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2020-12-23 17:16:24,133 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,133 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 70 [2020-12-23 17:16:24,136 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:16:24,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:24,139 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:16:24,217 INFO L625 ElimStorePlain]: treesize reduction 46, result has 61.3 percent of original size [2020-12-23 17:16:24,225 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 29 treesize of output 24 [2020-12-23 17:16:24,227 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,263 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:24,263 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2020-12-23 17:16:24,369 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-12-23 17:16:24,372 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,399 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:24,400 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:49 [2020-12-23 17:16:24,647 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,647 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 102 [2020-12-23 17:16:24,650 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,717 INFO L625 ElimStorePlain]: treesize reduction 16, result has 75.8 percent of original size [2020-12-23 17:16:24,722 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,723 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:28 [2020-12-23 17:16:24,802 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_52|], 2=[|v_#memory_$Pointer$.base_68|]} [2020-12-23 17:16:24,808 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 19 treesize of output 11 [2020-12-23 17:16:24,809 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,836 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2020-12-23 17:16:24,838 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,858 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,859 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,859 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:37 [2020-12-23 17:16:25,054 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2020-12-23 17:16:25,056 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:25,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:25,069 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:25,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2020-12-23 17:16:25,263 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2020-12-23 17:16:25,270 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:25,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:25,303 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:25,304 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2020-12-23 17:16:25,306 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-23 17:16:25,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:25,323 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:25,323 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2020-12-23 17:16:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:25,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:16:25,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 39 [2020-12-23 17:16:25,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327771197] [2020-12-23 17:16:25,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-12-23 17:16:25,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:16:25,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-12-23 17:16:25,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1365, Unknown=0, NotChecked=0, Total=1482 [2020-12-23 17:16:25,504 INFO L87 Difference]: Start difference. First operand 202 states and 216 transitions. Second operand 39 states. [2020-12-23 17:16:26,367 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2020-12-23 17:16:26,577 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2020-12-23 17:16:26,827 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2020-12-23 17:16:27,023 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2020-12-23 17:16:27,281 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-12-23 17:16:28,002 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2020-12-23 17:16:28,735 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2020-12-23 17:16:29,056 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2020-12-23 17:16:29,320 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2020-12-23 17:16:29,821 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2020-12-23 17:16:30,203 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2020-12-23 17:16:30,458 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-12-23 17:16:30,807 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2020-12-23 17:16:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:16:32,561 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2020-12-23 17:16:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-23 17:16:32,563 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 50 [2020-12-23 17:16:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:16:32,564 INFO L225 Difference]: With dead ends: 237 [2020-12-23 17:16:32,564 INFO L226 Difference]: Without dead ends: 236 [2020-12-23 17:16:32,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=464, Invalid=3196, Unknown=0, NotChecked=0, Total=3660 [2020-12-23 17:16:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-12-23 17:16:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 201. [2020-12-23 17:16:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-12-23 17:16:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 214 transitions. [2020-12-23 17:16:32,570 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 214 transitions. Word has length 50 [2020-12-23 17:16:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:16:32,571 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 214 transitions. [2020-12-23 17:16:32,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-12-23 17:16:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 214 transitions. [2020-12-23 17:16:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 17:16:32,571 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:16:32,571 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:16:32,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-12-23 17:16:32,773 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:16:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:16:32,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1453667055, now seen corresponding path program 1 times [2020-12-23 17:16:32,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:16:32,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998069512] [2020-12-23 17:16:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:16:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 17:16:33,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998069512] [2020-12-23 17:16:33,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376137256] [2020-12-23 17:16:33,180 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:16:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:33,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 52 conjunts are in the unsatisfiable core [2020-12-23 17:16:33,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:16:33,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 17:16:33,361 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:33,367 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:33,368 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:33,369 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:16:33,536 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:33,537 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 17:16:33,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:33,542 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:33,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:33,560 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:33,561 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-12-23 17:16:33,620 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 17:16:33,622 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:33,645 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:33,653 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:16:33,654 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:33,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:33,681 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 17:16:33,682 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2020-12-23 17:16:33,869 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:33,870 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 65 [2020-12-23 17:16:33,872 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-23 17:16:33,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:16:33,875 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:16:33,950 INFO L625 ElimStorePlain]: treesize reduction 41, result has 60.2 percent of original size [2020-12-23 17:16:33,958 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 29 treesize of output 24 [2020-12-23 17:16:33,960 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:33,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:33,995 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:33,995 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2020-12-23 17:16:34,114 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-12-23 17:16:34,117 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:34,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:34,141 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:34,141 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:38 [2020-12-23 17:16:34,416 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:34,417 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 105 [2020-12-23 17:16:34,421 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:34,499 INFO L625 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2020-12-23 17:16:34,501 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:34,502 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:28 [2020-12-23 17:16:34,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:16:34,603 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-12-23 17:16:34,605 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:34,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:34,624 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:34,625 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:28 [2020-12-23 17:16:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:35,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:16:35,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 27 [2020-12-23 17:16:35,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676433057] [2020-12-23 17:16:35,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-23 17:16:35,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:16:35,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-23 17:16:35,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2020-12-23 17:16:35,023 INFO L87 Difference]: Start difference. First operand 201 states and 214 transitions. Second operand 27 states. [2020-12-23 17:16:35,741 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2020-12-23 17:16:35,929 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2020-12-23 17:16:36,142 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-12-23 17:16:36,323 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2020-12-23 17:16:36,554 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2020-12-23 17:16:37,282 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2020-12-23 17:16:37,732 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2020-12-23 17:16:37,920 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2020-12-23 17:16:38,242 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2020-12-23 17:16:38,906 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2020-12-23 17:16:39,348 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2020-12-23 17:16:40,328 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2020-12-23 17:16:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:16:41,607 INFO L93 Difference]: Finished difference Result 247 states and 261 transitions. [2020-12-23 17:16:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-12-23 17:16:41,608 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2020-12-23 17:16:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:16:41,610 INFO L225 Difference]: With dead ends: 247 [2020-12-23 17:16:41,610 INFO L226 Difference]: Without dead ends: 247 [2020-12-23 17:16:41,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=676, Invalid=2984, Unknown=0, NotChecked=0, Total=3660 [2020-12-23 17:16:41,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-12-23 17:16:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 210. [2020-12-23 17:16:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-23 17:16:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions. [2020-12-23 17:16:41,617 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 53 [2020-12-23 17:16:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:16:41,617 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions. [2020-12-23 17:16:41,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-23 17:16:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions. [2020-12-23 17:16:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 17:16:41,618 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:16:41,618 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:16:41,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:16:41,833 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:16:41,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:16:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1694956421, now seen corresponding path program 1 times [2020-12-23 17:16:41,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:16:41,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634845485] [2020-12-23 17:16:41,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:16:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:42,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634845485] [2020-12-23 17:16:42,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077440729] [2020-12-23 17:16:42,451 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:16:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:42,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 53 conjunts are in the unsatisfiable core [2020-12-23 17:16:42,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:16:42,683 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 17:16:42,684 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:42,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:42,694 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:42,694 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:16:42,857 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:42,858 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 17:16:42,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:42,868 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:42,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:42,887 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:42,888 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-23 17:16:42,976 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:16:42,979 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:43,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:43,008 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:43,008 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-23 17:16:43,230 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:43,231 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2020-12-23 17:16:43,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-23 17:16:43,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:16:43,239 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:16:43,292 INFO L625 ElimStorePlain]: treesize reduction 33, result has 57.7 percent of original size [2020-12-23 17:16:43,293 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:43,293 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2020-12-23 17:16:43,673 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:43,673 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 110 [2020-12-23 17:16:43,676 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:43,752 INFO L625 ElimStorePlain]: treesize reduction 21, result has 69.1 percent of original size [2020-12-23 17:16:43,754 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:43,755 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:32 [2020-12-23 17:16:43,869 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-12-23 17:16:43,870 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-12-23 17:16:43,871 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:43,893 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:43,894 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:43,895 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:32 [2020-12-23 17:16:43,966 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:43,966 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 17:16:43,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:16:43,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:43,974 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:44,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:44,010 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:44,010 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:45 [2020-12-23 17:16:44,124 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 17:16:44,126 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:44,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:44,155 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:44,155 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:50 [2020-12-23 17:16:44,435 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:44,436 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 99 [2020-12-23 17:16:44,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-23 17:16:44,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:44,441 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:44,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:44,472 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:44,472 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:63 [2020-12-23 17:16:45,024 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-23 17:16:45,024 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:45,025 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 183 [2020-12-23 17:16:45,029 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:16:45,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:45,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:45,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:45,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:16:45,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:45,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:45,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:45,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:45,045 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:45,126 INFO L625 ElimStorePlain]: treesize reduction 16, result has 83.3 percent of original size [2020-12-23 17:16:45,129 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:45,130 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:110, output treesize:54 [2020-12-23 17:16:45,321 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:45,322 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 138 [2020-12-23 17:16:45,326 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 17:16:45,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:45,327 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:16:45,328 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:16:45,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:45,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:45,330 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:16:45,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:45,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:45,337 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2020-12-23 17:16:45,498 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2020-12-23 17:16:45,498 INFO L625 ElimStorePlain]: treesize reduction 638, result has 9.5 percent of original size [2020-12-23 17:16:45,500 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:45,500 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:110, output treesize:67 [2020-12-23 17:16:45,820 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:45,820 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 41 [2020-12-23 17:16:45,823 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 17:16:45,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:45,849 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:45,849 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:28 [2020-12-23 17:16:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:46,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:16:46,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 40 [2020-12-23 17:16:46,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108467748] [2020-12-23 17:16:46,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-12-23 17:16:46,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:16:46,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-12-23 17:16:46,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1404, Unknown=0, NotChecked=0, Total=1640 [2020-12-23 17:16:46,080 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand 41 states. [2020-12-23 17:16:48,220 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2020-12-23 17:16:48,391 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2020-12-23 17:16:48,578 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-12-23 17:16:54,347 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-12-23 17:16:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:16:56,526 INFO L93 Difference]: Finished difference Result 295 states and 315 transitions. [2020-12-23 17:16:56,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-12-23 17:16:56,527 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2020-12-23 17:16:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:16:56,529 INFO L225 Difference]: With dead ends: 295 [2020-12-23 17:16:56,529 INFO L226 Difference]: Without dead ends: 295 [2020-12-23 17:16:56,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=940, Invalid=4760, Unknown=0, NotChecked=0, Total=5700 [2020-12-23 17:16:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-12-23 17:16:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 218. [2020-12-23 17:16:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-12-23 17:16:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 234 transitions. [2020-12-23 17:16:56,536 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 234 transitions. Word has length 54 [2020-12-23 17:16:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:16:56,536 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 234 transitions. [2020-12-23 17:16:56,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-12-23 17:16:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 234 transitions. [2020-12-23 17:16:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 17:16:56,536 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:16:56,537 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:16:56,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-23 17:16:56,752 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:16:56,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:16:56,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1694956420, now seen corresponding path program 1 times [2020-12-23 17:16:56,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:16:56,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720155366] [2020-12-23 17:16:56,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:16:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:57,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720155366] [2020-12-23 17:16:57,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036294958] [2020-12-23 17:16:57,587 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:16:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:57,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 70 conjunts are in the unsatisfiable core [2020-12-23 17:16:57,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:16:57,826 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 17:16:57,828 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:57,840 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:57,841 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:57,841 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-12-23 17:16:58,044 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:58,044 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 17:16:58,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:58,050 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:58,083 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:58,085 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:58,085 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2020-12-23 17:16:58,201 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:16:58,202 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:58,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:58,252 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 17:16:58,253 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:58,292 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:58,294 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 17:16:58,295 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2020-12-23 17:16:58,581 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:58,582 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 70 [2020-12-23 17:16:58,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:16:58,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:58,587 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:16:58,691 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-12-23 17:16:58,692 INFO L625 ElimStorePlain]: treesize reduction 46, result has 62.3 percent of original size [2020-12-23 17:16:58,703 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 29 treesize of output 24 [2020-12-23 17:16:58,704 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:58,751 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:58,753 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:58,753 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2020-12-23 17:16:59,232 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:59,233 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 60 [2020-12-23 17:16:59,235 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:59,383 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2020-12-23 17:16:59,384 INFO L625 ElimStorePlain]: treesize reduction 31, result has 74.4 percent of original size [2020-12-23 17:16:59,492 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:59,493 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 119 [2020-12-23 17:16:59,496 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:59,638 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-12-23 17:16:59,639 INFO L625 ElimStorePlain]: treesize reduction 16, result has 82.6 percent of original size [2020-12-23 17:16:59,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:59,642 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:59,643 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:76 [2020-12-23 17:16:59,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:59,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:16:59,868 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-12-23 17:16:59,870 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:59,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:59,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:16:59,933 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-12-23 17:16:59,935 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:59,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:59,983 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:59,984 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2020-12-23 17:17:00,157 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_79|], 3=[|v_#valid_111|]} [2020-12-23 17:17:00,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:17:00,166 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2020-12-23 17:17:00,168 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:00,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:00,271 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:00,272 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:17:00,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:17:00,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:17:00,280 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:00,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:00,338 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:00,338 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2020-12-23 17:17:00,505 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 17:17:00,508 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:00,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:00,584 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 17:17:00,587 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:00,643 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:00,645 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:00,646 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:60 [2020-12-23 17:17:00,936 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_64|], 6=[|v_#memory_$Pointer$.base_86|]} [2020-12-23 17:17:00,948 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2020-12-23 17:17:00,949 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:01,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:01,095 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:01,096 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 108 [2020-12-23 17:17:01,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-23 17:17:01,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:17:01,102 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:01,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:01,161 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:17:01,161 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:86 [2020-12-23 17:17:01,738 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_65|], 12=[|v_#memory_$Pointer$.base_87|]} [2020-12-23 17:17:01,777 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:01,778 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 68 [2020-12-23 17:17:01,781 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:01,952 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2020-12-23 17:17:01,953 INFO L625 ElimStorePlain]: treesize reduction 24, result has 86.0 percent of original size [2020-12-23 17:17:02,149 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-23 17:17:02,150 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:02,151 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 200 [2020-12-23 17:17:02,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:17:02,158 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 17:17:02,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:17:02,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:17:02,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:17:02,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:17:02,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:17:02,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:17:02,169 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:02,327 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-12-23 17:17:02,328 INFO L625 ElimStorePlain]: treesize reduction 16, result has 87.2 percent of original size [2020-12-23 17:17:02,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:17:02,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:17:02,336 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:17:02,336 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:145, output treesize:68 [2020-12-23 17:17:02,598 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:02,599 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 166 [2020-12-23 17:17:02,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:17:02,605 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:17:02,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:17:02,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:17:02,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:17:02,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:17:02,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:17:02,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:17:02,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-23 17:17:02,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:17:02,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:17:02,613 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:02,663 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:02,691 INFO L348 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2020-12-23 17:17:02,691 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2020-12-23 17:17:02,693 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:02,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:02,741 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:17:02,742 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:175, output treesize:89 [2020-12-23 17:17:03,251 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:03,252 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 50 [2020-12-23 17:17:03,256 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 17:17:03,295 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:03,304 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-23 17:17:03,308 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:03,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:03,339 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:17:03,339 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:100, output treesize:18 [2020-12-23 17:17:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:17:03,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:17:03,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 41 [2020-12-23 17:17:03,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558430328] [2020-12-23 17:17:03,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-12-23 17:17:03,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:17:03,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-12-23 17:17:03,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1566, Unknown=0, NotChecked=0, Total=1722 [2020-12-23 17:17:03,700 INFO L87 Difference]: Start difference. First operand 218 states and 234 transitions. Second operand 42 states. [2020-12-23 17:17:04,581 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-12-23 17:17:04,841 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-12-23 17:17:05,149 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-12-23 17:17:05,392 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-12-23 17:17:05,722 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2020-12-23 17:17:06,346 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-12-23 17:17:06,748 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-12-23 17:17:07,038 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-12-23 17:17:07,365 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2020-12-23 17:17:07,801 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 78 [2020-12-23 17:17:08,118 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2020-12-23 17:17:08,438 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 61 [2020-12-23 17:17:14,938 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2020-12-23 17:17:17,265 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-12-23 17:17:26,159 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2020-12-23 17:17:40,928 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2020-12-23 17:17:41,394 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2020-12-23 17:17:42,026 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2020-12-23 17:17:42,714 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 53 [2020-12-23 17:17:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:17:46,109 INFO L93 Difference]: Finished difference Result 299 states and 320 transitions. [2020-12-23 17:17:46,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-12-23 17:17:46,110 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 54 [2020-12-23 17:17:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:17:46,112 INFO L225 Difference]: With dead ends: 299 [2020-12-23 17:17:46,112 INFO L226 Difference]: Without dead ends: 299 [2020-12-23 17:17:46,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=745, Invalid=4953, Unknown=2, NotChecked=0, Total=5700 [2020-12-23 17:17:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-23 17:17:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 221. [2020-12-23 17:17:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-12-23 17:17:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 237 transitions. [2020-12-23 17:17:46,119 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 237 transitions. Word has length 54 [2020-12-23 17:17:46,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:17:46,119 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 237 transitions. [2020-12-23 17:17:46,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-12-23 17:17:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 237 transitions. [2020-12-23 17:17:46,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 17:17:46,120 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:17:46,120 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:17:46,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:17:46,335 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:17:46,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:17:46,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1168794392, now seen corresponding path program 2 times [2020-12-23 17:17:46,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:17:46,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278469888] [2020-12-23 17:17:46,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:17:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:17:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:17:48,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278469888] [2020-12-23 17:17:48,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130662327] [2020-12-23 17:17:48,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:17:48,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 17:17:48,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 17:17:48,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2020-12-23 17:17:48,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:17:48,313 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 17:17:48,314 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:48,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:48,318 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:48,319 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 17:17:48,353 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 17:17:48,354 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:48,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:48,365 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:48,366 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-23 17:17:48,505 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:48,506 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 17:17:48,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:17:48,511 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:48,540 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:48,541 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:48,542 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2020-12-23 17:17:48,620 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_89|], 2=[|v_#memory_int_54|]} [2020-12-23 17:17:48,631 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:17:48,632 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:48,674 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:48,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:17:48,686 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 25 treesize of output 13 [2020-12-23 17:17:48,687 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:48,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:48,722 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 17:17:48,723 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:38 [2020-12-23 17:17:48,891 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 41 treesize of output 13 [2020-12-23 17:17:48,893 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:48,931 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:48,971 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:48,971 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2020-12-23 17:17:48,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-23 17:17:48,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:17:48,975 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-23 17:17:49,042 INFO L625 ElimStorePlain]: treesize reduction 33, result has 60.7 percent of original size [2020-12-23 17:17:49,044 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:17:49,044 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:51 [2020-12-23 17:17:49,167 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:49,167 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2020-12-23 17:17:49,169 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:49,194 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,195 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:24 [2020-12-23 17:17:49,333 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 17:17:49,334 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,352 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:49,353 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,353 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2020-12-23 17:17:49,375 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 23 treesize of output 22 [2020-12-23 17:17:49,377 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:49,399 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,399 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2020-12-23 17:17:49,525 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:49,526 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:17:49,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:17:49,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:17:49,531 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,553 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:49,554 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,554 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2020-12-23 17:17:49,617 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_91|], 6=[|v_#memory_int_58|]} [2020-12-23 17:17:49,625 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 11 treesize of output 7 [2020-12-23 17:17:49,626 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:49,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:17:49,661 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 34 treesize of output 25 [2020-12-23 17:17:49,662 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,685 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:49,686 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 17:17:49,687 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:39 [2020-12-23 17:17:49,839 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_92|], 6=[|v_#memory_int_59|]} [2020-12-23 17:17:49,883 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:49,883 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 75 [2020-12-23 17:17:49,886 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:17:49,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:17:49,888 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:49,930 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2020-12-23 17:17:49,932 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:49,957 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:49,959 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:17:49,959 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:52 [2020-12-23 17:17:50,091 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:50,091 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2020-12-23 17:17:50,093 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:50,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:50,118 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:17:50,118 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:31 [2020-12-23 17:17:50,319 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-23 17:17:50,323 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:50,341 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:50,343 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:17:50,343 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:31 [2020-12-23 17:17:50,444 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-12-23 17:17:50,446 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:50,474 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:50,478 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 17:17:50,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-12-23 17:17:50,961 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2020-12-23 17:17:50,964 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:50,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:50,979 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:50,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-12-23 17:17:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:17:51,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:17:51,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 42 [2020-12-23 17:17:51,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56803879] [2020-12-23 17:17:51,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-12-23 17:17:51,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:17:51,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-12-23 17:17:51,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1502, Unknown=0, NotChecked=0, Total=1722 [2020-12-23 17:17:51,008 INFO L87 Difference]: Start difference. First operand 221 states and 237 transitions. Second operand 42 states. [2020-12-23 17:17:51,848 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2020-12-23 17:17:52,056 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2020-12-23 17:17:52,301 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-12-23 17:17:52,498 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-12-23 17:17:52,731 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46